11-27-2013
Thanks for your reply. It works fine.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
file format is
word filename no.of occurances
------------------------------
wish f3.txt 2
wish f2.txt 1
cold f1.txt 5
cold f2.txt 3
cold f1.txt 3
cold e.txt 3
gold f1.txt 7
gold f3.txt 3
rush e.txt 2
itz abt building a search index for every word in the files given as input
the... (1 Reply)
Discussion started by: vishnu_vaka
1 Replies
2. Shell Programming and Scripting
Hi,
I have the following 'sorting' problem.
Given the input file:
a:b:c:12:x:k
s:m:d:8:z:m
a:b:c:1:x:k
p:q:r:23:y:m
a:b:c:3:x:k
p:q:r:1:y:m
the output I expect is:
a:b:c:1:x:k
p:q:r:1:y:m
s:m:d:8:z:m
What happened here is I grouped together lines having the same values for... (7 Replies)
Discussion started by: Abhishek Ghose
7 Replies
3. HP-UX
hey mate. ive got a sorting problem that i would like to share...
i made a script that sorts the bdf command and redirected the output to a file. the output of the file is:
691416 34% /
851552 7% /stand
7203048 31% /var
23637584 26% /var/adm/crash
2968864 ... (4 Replies)
Discussion started by: jarod004
4 Replies
4. UNIX for Dummies Questions & Answers
Hai ,
In unix we are going to sort it out all the directories and files based on size of the file. For that we have to use this command ls -al | sort
+4nr. If we are giving this command means it will show all the records in a descending order....when I am checking one file bytes its... (4 Replies)
Discussion started by: cool4naren
4 Replies
5. Shell Programming and Scripting
First: me == noob. Whats a good resource for shell script info cause I'm having trouble finding good info.
I'm writing a shell script to automate the setup of a flash 'page flip'.
My current code is below.
the page flip takes an xml file of format
<content>
<pages... (1 Reply)
Discussion started by: secoif
1 Replies
6. Shell Programming and Scripting
hi,,
i have perl scipt with line :
system('./try.sh $t $d $m');
in shell scipt try.sh i have the line:
echo $1
its not printing value of $t that i hav passed..y is it so..i am running it from apache web server (2 Replies)
Discussion started by: raksha.s
2 Replies
7. UNIX for Dummies Questions & Answers
1) I need to reverse sort the text from lit.csv (bellow) by the second column, then save the last five lines in a text file text.txt but I'm doing something wrong so any help would be much appreciated.
I've been trying to use this: sort --field-separator=; -b -k2g,2 lit.csv -o text.txt
2)... (4 Replies)
Discussion started by: Kova
4 Replies
8. Shell Programming and Scripting
Hi all,
Not sure if this should be in the programming forum, but I believe it will get more response under the Shell Programming and Scripting FORUM.
Am trying to write a customized df script in Perl and need some help with regards to using arrays and file handlers.
At the moment am... (3 Replies)
Discussion started by: newbie_01
3 Replies
9. UNIX for Advanced & Expert Users
I have data like this in file
Now I have to sort using second column(usage) and i should get first column against it post sorting
please provide input (2 Replies)
Discussion started by: mirwasim
2 Replies
10. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
You will write a script that will read a tab-separated file that contains the names of all 50 states &... (7 Replies)
Discussion started by: tburns517
7 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)