01-22-2013
posted the
same again!!!
Don't do like this.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi Gurus!
I wonder if anyone can help me, I'm sure you guys can.
I have a text file which contains a lot of data on the one line as follows:
$
What I need to do is pull all of those id values out (eg 2549425) and write them to a list in a text file.
Any help would be greatly... (3 Replies)
Discussion started by: th3g0bl1n
3 Replies
2. Shell Programming and Scripting
Any ideas?
1)loop through text file
2)extract everything between SOL and EOL
3)output files, for example: 123.txt and 124.txt for the file below
So far I have: sed -n "/SOL/,/EOL/{p;/EOL/q;}" file
Here is an example of my text file.
SOL-123.go
something goes here
something goes... (0 Replies)
Discussion started by: ndnkyd
0 Replies
3. Shell Programming and Scripting
Hello,
Im very new to PERL and as a project to work on developing my skills at PERL Im trying to parse poker hands.
Ive tried many methods however I cant get the last step.
$yourfile= 'FILENAME';#poker hands to parse
open (FILE, "$yourfile") or die $!;
@lines = <FILE>;
for (@lines) ... (1 Reply)
Discussion started by: Ek0
1 Replies
4. 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
5. Programming
I was trying to parse the text file, which will looks like this
###XYZABC####
############
int = 4
char = 1
float = 1
.
.
############
like this my text file will contains lots of entries and I need to store these entries in the map eg. map.first = int and map.second = 4 same way I... (5 Replies)
Discussion started by: agupta2
5 Replies
6. UNIX for Dummies Questions & Answers
So, the beginning of my script will cat & grep a file with the output directed to a new file. The data I have in this file needs to be parsed, read and evaluated.
Basically, I need to identify the latest date/time stamp and then calculate whether or not it is within 15 minutes of the current... (1 Reply)
Discussion started by: hynesward
1 Replies
7. Shell Programming and Scripting
I have a log file that contains several reports with following format.
<Start of delimiter> Report1 header
Report1 header continue
Report1 header continue
Record1 header
Record1 header continue
Record1 header continue
field1 field2 field3 field4
------... (1 Reply)
Discussion started by: yoda9691
1 Replies
8. 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
9. Shell Programming and Scripting
I do have a flat text file that are divided into blocks. Each block is demimited by '='. I would like to parse certain numbers and letters.
This is the format of the file I have. It has thousands of such blocks
>A B 1, 100
TTTT 100 95
>C D 1, 95
GHJKL
=
>A B 1, 72
GHUJKLO 72 84
>C D... (3 Replies)
Discussion started by: Kanja
3 Replies
10. Shell Programming and Scripting
Hi All!
Is it possible to convert text file:
to:
? (6 Replies)
Discussion started by: y77
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)