05-20-2010
Also, In regular expression terms, it is called as quantifiers.
"?" and "+" are the other two.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi,
Please help me.
Suppose I have a file which contains files like:
My file :/tmp/rooh_20020518.lst
it consists:
ASI00320225041925URD01
ASI00320225041925KER02
ASI00390228095244KER08 ... (1 Reply)
Discussion started by: rooh
1 Replies
2. UNIX for Dummies Questions & Answers
I am trying to cp files that have F0 as prefix in their name in path p1/p2 to path p3/p4
this command does not work - Why? (I am using HP/UX)
cp p1/p2/F0* p3/p4
thanks. (2 Replies)
Discussion started by: GNMIKE
2 Replies
3. UNIX for Dummies Questions & Answers
Hi,
I would like to pass a wild card as part of an argument. But when I do it the script views the wild card as text.
Example:
sFile=MG1A*
sort $sFile > $sFile.sorted
What I get is MG1A*.sorted
The problem is I am passed a series of files where the first few characters like "MG1A"... (2 Replies)
Discussion started by: eja
2 Replies
4. Shell Programming and Scripting
Hi,
Is there a way to use find command to list the directories for certain permissions. I know we can use find . -type d -perm nnn, where nnn is the permission number . However I wold like to know if I wanna search for wild card permissions i.e 75* / 7* / 55* , as i do not know the actual... (1 Reply)
Discussion started by: braindrain
1 Replies
5. AIX
Hi,
I want to monitor my filesystem capacity and I want to df with grep wildcard for all 9*%.
Is this possible? I want to replaced all the existing complicated scripts I have in the system.
Thanks,
Itik (2 Replies)
Discussion started by: itik
2 Replies
6. Shell Programming and Scripting
Hi,
I am using RHEL5.
I have following if condition.
if
In the above condition, if the value of a contains word WARNING, it should match. i.e., WARNING_MESSAGE, CRITICAL WARNING, WARNING ALERT etc. it should match.
For b, alert error, ALERT ERROR, ERROR IMMEDIATE ACTION REQUIRED, etc... (2 Replies)
Discussion started by: user7509
2 Replies
7. Shell Programming and Scripting
Hey All,
I am trying to send a string as an input parameter to a function which contains a wild card character - *
However the function is taking it as:
PS: The directory - '/path/to/my/dir/' has 3 files:
file1.out,
file2.out,
file3.out
However I want to disable this wild... (2 Replies)
Discussion started by: paragkalra
2 Replies
8. Shell Programming and Scripting
HI All,
I have a script that needs to find out a list of files in a directory, i pass the search parameter as an argument.
opendir ( DIR, $dir ) || die "Error in opening dir $dirname\n";
@filename1 = (grep {/$File_pattern/ } readdir(DIR));
The problem is my file patterns are like... (1 Reply)
Discussion started by: amit1_x
1 Replies
9. Shell Programming and Scripting
Can somebody help me with the following syntax? I want to find all
files that end with *.arc
SUFFIX=".arc"
find /tmp -name "\*$SUFFIX" -print 2>/dev/null
---------- Post updated at 03:45 PM ---------- Previous update was at 03:41 PM ----------
got it thanks
-name... (0 Replies)
Discussion started by: BeefStu
0 Replies
10. Shell Programming and Scripting
I have dir structure like this :
/opt/oracle/product/abc/sqlplus/admin/
/opt/oracle/product/def/sqlplus/admin
/opt/oracle/product/ghi/sqlplus/admin
I am trying to use wildcard ( for dirs abc,def,ghi) ..something like this :
cp xyz.txt ... (1 Reply)
Discussion started by: talashil
1 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)