02-03-2012
Thank you both, Birei, balajesuri.
Last edited by calinlicj; 02-03-2012 at 11:34 AM..
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
i want to count the number of character contained in afile using perl cript help me out (1 Reply)
Discussion started by: trupti_rinku
1 Replies
2. Shell Programming and Scripting
i have a file like this
aaaa bbbb cccc
aaa aaaa
aa cccccccccccccccc
aaaaaaa aaaa aaaa
i want to enclose this lines with double quotation:
"aaaa bbbb cccc"
"aaa aaaa"
"aa cccccccccccccccc"
"aaaaaaa aaaa aaaa"
any idea? (preferably without using sed)
thanks in advance... (3 Replies)
Discussion started by: gfhgfnhhn
3 Replies
3. Shell Programming and Scripting
I want to count the number of occurence of perticular word from one text file.
Please tell me "less" command is work in ksh or not. If it is not working then instead of that which command will work. :confused: (40 Replies)
Discussion started by: rinku
40 Replies
4. UNIX for Advanced & Expert Users
Suppose i have data like :-
1,2,3,4,5
a,b,c
x,y,z,t
I want to count the occurence of , (comma) in every line.
Waiting for a solution.:) (1 Reply)
Discussion started by: sumit207
1 Replies
5. UNIX for Dummies Questions & Answers
Suppose i have data like :-
1,2,3,4,5
a,b,c
x,y,z,t
I want to count the occurence of , (comma) in every line.
Waiting for a solution. (5 Replies)
Discussion started by: sumit207
5 Replies
6. Shell Programming and Scripting
Hello,
I have a text file with n lines in the following format (9 column fields):
Example:
contig00012 149606 G C 49 68 60 18 c$cccccacccccccccc^c
I need to count the number of lower-case and upper-case occurences in column 9, respectively, of the... (3 Replies)
Discussion started by: s052866
3 Replies
7. Shell Programming and Scripting
I'm working on AIX 6, ksh shell. The parameters are some strings quotated by double quotation marks which from a file. They are quotated because there may be spaces in them.
Example:
"015607" "10" " " "A"I want to pass these parameters to a shell function by writing the following command:
... (4 Replies)
Discussion started by: Shimmey
4 Replies
8. Shell Programming and Scripting
I have a csv file with 3 columns. Fields are comma delimited and strings are enclosed with quotation marks "". About 40% of the time, the line of values will start a new line thanks to carriage return characters within a string.
Example:
"apple","banana","orange"
"pineapple","grape","straw... (6 Replies)
Discussion started by: koeji
6 Replies
9. Shell Programming and Scripting
There is a closed thread called "carriage returns within quotation marks causing new lines in csv" that I am unable to post to, so I am starting a new thread.
The awk solution worked perfectly in most cases. We have some cases where there are multiple carriage returns within a single quoted... (9 Replies)
Discussion started by: Mary Roberts
9 Replies
10. Programming
Hello,
I have a programming assignment to count number of occurrences of hours in particular file. Below is the code:
fname = raw_input("Enter file name: ")
if len(fname) < 1 : fname = "mbox-short.txt"
largest = None
fh = open(fname)
counts = dict()
test = list()
for line in fh:
... (2 Replies)
Discussion started by: infinitydon
2 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)