04-19-2011
Don't know much about csh, but can't you write a function instead of an alias?
And you can use -w along with -E option of grep to force it to match on words only.
Hope that helps.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I have a string which contains following information:
<SZ.T><P ALIGN="CENTER"><FONT FACE="Arial, Helvetica, sans-serif" SIZE="+3">Bundesregierung nimmt sich dicke Deutsche vor</FONT></P></SZ.T>
<SZ.UT><P ALIGN="CENTER"><FONT SIZE="+1"><I> Seehofer und Schmidt planen Kampagne gegen... (3 Replies)
Discussion started by: trek
3 Replies
2. Shell Programming and Scripting
I have some files in unix
ls -1
TMH.backend.tar.421E-03.Z
TMH.backend.tar.421E-04.Z
TMH.backend.tar.421E-05.Z
TMH.backend.tar.421E-06.Z
TMH.backend.tar.421E-07.Z
TMH.backend.tar.421E-08.Z
TMH.backend.tar.421E-08.Z.bak20081223164844
TMH.backend.tar.421E-09.Z... (1 Reply)
Discussion started by: on9west
1 Replies
3. UNIX for Dummies Questions & Answers
Hi,
I need to find out the files whcih contains date in YYYYMMDD in their name.
I don't know if I can use regex in side find.
Now I am using commad for the same purpose which is not full proof.
find . -name "**" -print
But I want then It should contain at lease 8 digit in their... (3 Replies)
Discussion started by: siba.s.nayak
3 Replies
4. Shell Programming and Scripting
Hi There,
Can anybody help me out for searching this regular expression?
xxxxx.yyy.zzzz.From-ABCD.To-XYZ.xxxxxx
I would like the ID1 and ID2 (knowing which one is Id1 and id2)
.From-<ID1>.
and
.To-<ID2>.
Thanks in advance!!
Regards,
Bhaskar (4 Replies)
Discussion started by: bhaskar_m
4 Replies
5. Shell Programming and Scripting
hi ,
how do i remove # from a line where i found regex..
don't need to remove all the line.. only remove comment.. (3 Replies)
Discussion started by: Poki
3 Replies
6. Shell Programming and Scripting
Hello,
I want to check if directories exist with a regex expression
dir1=/temp/local/*/home (exists on file system)
dir2=/temp/server/*/logs (does not exist on file system)
I want to check if there are any directories with the above regex
Code:
if ];then
echo "Directory... (4 Replies)
Discussion started by: gogineni
4 Replies
7. Shell Programming and Scripting
How to do alternation using regular expressions in the 'find' command? Like say you want to find all files that do not match the names specifically "this" or "that" within a directory using regular expressions? (10 Replies)
Discussion started by: stevensw
10 Replies
8. Shell Programming and Scripting
#ls json-*
json-lexer.c json-lexer.h json-parser.c json-parser.h json-streamer.c json-streamer.h
#find . -regex '^(json-)+.'
return nothing (3 Replies)
Discussion started by: yanglei_fage
3 Replies
9. UNIX for Dummies Questions & Answers
Hi All,
We have to copy some files from a source directory to a destination directory. We only have to copy the file if the filename is in a list of values.
We can use find command:
find . -type f -name '*_111.txt' -o -name '*_115.txt' ... -exec cp {} /tmp \;
But the list contains... (3 Replies)
Discussion started by: bartleby
3 Replies
10. Shell Programming and Scripting
I'm trying to get some exclusions into our sendmail regular expression for the K command. The following configuration & regex works:
LOCAL_CONFIG
#
Kcheckaddress regex -a@MATCH
+<@+?\.++?\.(us|info|to|br|bid|cn|ru)
LOCAL_RULESETS
SLocal_check_mail
# check address against various regex... (0 Replies)
Discussion started by: RobbieTheK
0 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)