01-20-2010
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi there I have a file that I recieve that looks like the folowing, As these details are being manually entered by the customer, we sometimes get a few typos on 4th column (the 14 digit number starting with 42....) As you can see the first one has a space as the first character and then a 13 number... (3 Replies)
Discussion started by: hcclnoodles
3 Replies
2. Shell Programming and Scripting
Hi All,
My file looks like :
hsdhj dsajhf jshdfajkh jksdhfj jkdhsfj
shfjhd shdf hdsfjkh jsdfhj hdshf
sdjh dhs foot dsjhfj jdshf
dasfh jdsh dsjfh jdfshj david
Now, I want to search entire column by a string... (10 Replies)
Discussion started by: naw_deepak
10 Replies
3. UNIX for Advanced & Expert Users
Hi,
I want to replace string in column,Example i have file caleed a1.txt ,want to replace string "A12" with "A23" only in column2 ,not from file itself.Using sed command replace string in file itself.
Thanks,
Mohan (3 Replies)
Discussion started by: mohan705
3 Replies
4. AIX
I have few AIX 5.3 boxes where following is the issue.
I have a variable whose value is a very huge string ...(5000+ characters)
CMD_ARGS="/global/site/vendor/WAS/WebSphere6/AppServer/java/bin/java... (7 Replies)
Discussion started by: ak835
7 Replies
5. Shell Programming and Scripting
How to search a string which has occured numerous times in a single row. I tried many options, I am facing issue with the file size. Anything I go for, it says it is huge.. File is 82MB.
Assume, the file contains the string 'Name' in many places.. Something Like below.
... (5 Replies)
Discussion started by: Muthuraj K
5 Replies
6. Shell Programming and Scripting
I have huge xml file in server and i want to convert it to .csv with specific column ...
i have search in blog but i didn't get any usefully command.
Thanks in advance (1 Reply)
Discussion started by: pareshkp
1 Replies
7. Shell Programming and Scripting
Hello
Here is my input:
SU3902 SU3902A NS29C (10) (00) Q1J1 0
SU3902 SU3902B VLR05 (20) (02) Q2H1 4
SU3902 SU3902C NBR22 (30) (06) Q3R5 8
SU3904 SU39047 NSV19 (11) (09) Q4k6 2
SU3904 SU39048 LB231 (12) (05) Q5k1 6
SU3904 SU39049 11VLT (13) (08) Q10C1 10
SU3904 SU3904A 25R05 (15) (06)... (3 Replies)
Discussion started by: pareshkp
3 Replies
8. Shell Programming and Scripting
I need to parse a huge file... with some strings like this:
<li class="website-feature"><a href="http://some.changingurl.com" ..(some changing classes)..>
I need to change the above to:
<li class="website-feature">http://some.changingurl.com<a href="http://some.changingurl.com" ..(some... (2 Replies)
Discussion started by: dtdt
2 Replies
9. Shell Programming and Scripting
I have data that looks like this:
chr1 mm9_knownGene exon 155747075 155747189 0.000000 + . gene_id "Glul"; transcript_id "uc007daq.1";
chr1 mm9_knownGene exon 155750064 155750076 0.000000 + . gene_id "Glul";... (3 Replies)
Discussion started by: pbluescript
3 Replies
10. Shell Programming and Scripting
My I/p is
Col1|Col2|Col3
2116209997932|POSIX INC|POSIX
2116209997933|POSIX INC|POSIX
2116210089479|POSIX INC|POSIX
2116210180502|POSIX INC|POSIX
2116210512279|POSIX INC|Aero
2116210516838|POSIX INC|POSIX
2116210534342|POSIX INC|postal
2116210534345|POSIX INC|postal ... (6 Replies)
Discussion started by: nikhil jain
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)