01-19-2009
Yes.. Thanx. It is working perfectly ..
But can you please tell me how its done ?
especially ?
what is the use of ^ ?
how its done without [0-9] ?
Raj.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hello,
after 9 months of archiving 1000 files,
now, i need to change the order of fields in the header record.
some very large, space padded files.
HEADERCAS05212008D0210DOMEST01(spacepadded to record length 210)
must now be
05212008HEADERCASD0210DOMEST01(spacepadded to record length 210)
... (1 Reply)
Discussion started by: JohnMario
1 Replies
2. AIX
I have an AIX system configured as NIS client.
I have an local user on the system called "batman" and i have a user by the same name in NIS as well.
Now when i try to login with Batman user, the local batman gets in.
How do I tell the AIX machine to authenticate Batman as NIS user?
... (2 Replies)
Discussion started by: balaji_prk
2 Replies
3. Shell Programming and Scripting
Hi everyone,
Please some help over here. (I´m using cygwing)
I have files with 40 columns and 2000 lines in average. I´m trying to change the order position as follow.
Original columns position:... (3 Replies)
Discussion started by: cgkmal
3 Replies
4. Shell Programming and Scripting
Good evening
I have a file as below and want to change the order, as in the second column, sed awk Pearl
Thanks
aaaaaaaaaa
bbbbbbbbb
cccccccc
aaaaaaaaaa
bbbbbbbbb
cccccccc
aaaaaaaaaa
cccccccc
bbbbbbbbb
aaaaaaaaaa
cccccccc
bbbbbbbbb (8 Replies)
Discussion started by: Novice-
8 Replies
5. Shell Programming and Scripting
Hello,
I'm quite new to perl so my question is rather basic and I know there is probably a simple way around it but I can't seem to find it.
I have a medium-length code and there is a part that works with a nested for loop:
foreach my $j(@primpiddelta){
for (my $k=1;... (0 Replies)
Discussion started by: acsg
0 Replies
6. Shell Programming and Scripting
I have inside a file
22
25
80
111
631
694
861
875
I need this in the form using awk or sed
22,25,80,111,631,694,861,875 (4 Replies)
Discussion started by: anil510
4 Replies
7. UNIX for Dummies Questions & Answers
hi guys
I have a service that depends on some shares (NFS shares ) that need to be mounted before before the service start so the service-app finds the NFS shares and starts correctly...
I am confused here this is what I found but I am not sure what to do in order to change it
BTW is Suse... (2 Replies)
Discussion started by: karlochacon
2 Replies
8. Shell Programming and Scripting
I have this END section in an awk script:
END {
for (j in littlebin)
{
print (j, int(log(j)/log(2)) , littlebin)
lbsum+=littlebin
}
for (i in bins)
... (6 Replies)
Discussion started by: treesloth
6 Replies
9. Shell Programming and Scripting
Hi everyone,
What is the best solution to check every line in the xml file and change order of found field along with its value without touching value. Pattern will be given i.e. one line can look like this one:
<widget position="value,value" size="value,value" name="value"... (5 Replies)
Discussion started by: TiedCone
5 Replies
10. Shell Programming and Scripting
Hello,
I have a file with thousands of rows and I need to change sequence of lines.
Sample file:
#NAME
#SERVICE 112233
#DESCRIPTION AABBCCDD
#SERVICE 738292
#DESCRIPTION FFYYRRTT
...
...
...
Desired output:
#NAME (5 Replies)
Discussion started by: baris35
5 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)