09-27-2010
Thanks every one, I will get back with feedback and more questions soon
csn
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
How would I split a file based on the location of a string, basically I want all entries above the string unix in this example
1
2
3
4
unix
5
6
7
Thanks,
Chuck (3 Replies)
Discussion started by: 98_1LE
3 Replies
2. Shell Programming and Scripting
$ A=/t1/bin/f410pdb oIFS=$IFS IFS=/
$ set -- $A
$ IFS=$oIFS
$ echo $2
t1
$ echo $3
bin
$ echo $4
f410pdb
can any one please explain me what is done with IFS and how it is working internally ...i am interested to know in depth (2 Replies)
Discussion started by: mobydick
2 Replies
3. Shell Programming and Scripting
Hello all,
I have some text formatted as follows
Name: John doe
Company:
Address 1: 7 times the headache
Address 2:
City: my city
State/Province: confusion
Zip/Postalcode: 12345
and I'm trying to figure out how I could extract the data after the colon so that the result would be ... (6 Replies)
Discussion started by: mcgrailm
6 Replies
4. Shell Programming and Scripting
Hi,
I have a file po8282.fmt998.fbi.mopac.x.macs.btt.txt . I want to parse the first field which is separated by "." and then find the number and add 1 to it.
here is what I am doing to get the first field, but not sure how to only pick the number and add 1 to it... (5 Replies)
Discussion started by: rudoraj
5 Replies
5. Shell Programming and Scripting
I have a big file with many brackets () in it from which I need to parse number characters and numbers. Below is an example of my file
14 (((A__0:0.02,B__1:0.3)0:0.04,C__0:0.025)2:0.01),(D__0:0.00978,E__2:0.01031)1:0.00362;
15... (1 Reply)
Discussion started by: Lucky Ali
1 Replies
6. Shell Programming and Scripting
I'm totally stumped with how to handle this huge text file I'm trying to deal with. I really need some help!
Here is what is looks like:
ab1ba67c331a3d731396322fad8dd71a3b627f89359827697645c806091c40b9
0.2
812a3c3684310045f1cb3157bf5eebc4379804e98c82b56f3944564e7bf5dab5
0.6
0.6... (3 Replies)
Discussion started by: comp8765
3 Replies
7. Shell Programming and Scripting
Hi Friends,
I am back for the second round today - :D
My input text file is this way
Home
friends
friendship meter
Tools
Mirrors
Downloads
My Data
About Us
Help
My own results
BLAT Search Results
ACTIONS QUERY SCORE START END QSIZE IDENTITY CHRO STRAND ... (7 Replies)
Discussion started by: jacobs.smith
7 Replies
8. Shell Programming and Scripting
Hello All,
I have an awk script which parses my log file and prints number grepping from a specific line/pattern, now i have to come with a shell script to continue reading the log untill the job is completed, which i would know while reading session log untill process encounters a final... (1 Reply)
Discussion started by: Ariean
1 Replies
9. Shell Programming and Scripting
Hi All!
Is it possible to convert text file:
to:
? (6 Replies)
Discussion started by: y77
6 Replies
10. Shell Programming and Scripting
I am trying to use awk skip each line with a ## or # and check each line after for STB= and if that value in greater than or = to 0.8, then at the end of line the text "STRAND BIAS" is written in else "GOOD".
So in the file of 4 entries attached.
awk tried:
awk NR > "##"' "#" -F"STB="... (6 Replies)
Discussion started by: cmccabe
6 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)