05-14-2012
For the new format of file2 change last line above to print $0 OFS c }' FS="[ \t]*" file2 file1
Note: that none of the values in your test file2 (approx 250 million) fall within the ranges in file1 (approx 87-167 million) so all counts were zero in the output.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Greetings,
I need to search and count all the occurences of a word in all the files in a directory.
Any suggestions greatly appreciated.
Thanks (1 Reply)
Discussion started by: skoppana
1 Replies
2. Shell Programming and Scripting
i want to search a word in a file and find the count of occurences even if pattern occures twice in a same line.
for example file has the following content.
yes no no nooo yees
no yes
if I search for "no" it should give count as 4
Pls help.
Thanks (9 Replies)
Discussion started by: RahulJoshi
9 Replies
3. UNIX for Advanced & Expert Users
Hi,
I would like to seek help regarding searching a pattern on a particular input.
Example input:
"1|trunc(sysdate-1)|substring(pcol)"
I would like to search for "|" and count it.
any help will be much appreciated.
Thanks! :)
Newbie (2 Replies)
Discussion started by: janzper
2 Replies
4. UNIX for Dummies Questions & Answers
I need to search and count the occurrences of a pattern in a file. The catch here is it's a pattern and not a word ( not necessarily delimited by spaces). For eg. if ABCD is the pattern I need to search and count, it can come in all flavors like (ABCD, ABCD), XYZ.ABCD=100, XYZ.ABCD>=500,... (6 Replies)
Discussion started by: tektips
6 Replies
5. Shell Programming and Scripting
hi All,
need help. have a file like below
A, error in 123
B, log files are present
A, error in 23444
B, log files are present
A, move to next line
C, matching messages
-- expected output--
A , count =2 , error in *
A , count =1 , move to next line
B , count =2 , log files are present... (2 Replies)
Discussion started by: arun1401
2 Replies
6. Shell Programming and Scripting
Hi all,
I need to search the database log find out the most frequently used tables for a certain period of time.
The search pattern is : the database.table
so, i need to look for ABCD.* in the entire log and then need the top ten tables.
I thought of using awk, search for the pattern ... (7 Replies)
Discussion started by: ysvsr1
7 Replies
7. Shell Programming and Scripting
Hi,
I have a text file the contents are like this
now i want to search patterns Z , Z etc and count the occurrence of such patterns, after Z value can be any random digits, please help me it is urgent...
output like this
Z .............>5
Z ............>8 (9 Replies)
Discussion started by: sreejithalokkan
9 Replies
8. UNIX for Dummies Questions & Answers
Hi,
Is there a command to do a sensitive/in-sensitive search for a string on a line and print how many times that string appears?
For example, if I have a line of text below:
dog cat rat apple banana dog lion tiger dog
Is there a command to search for dog that will print out 3 as a... (7 Replies)
Discussion started by: newbie_01
7 Replies
9. UNIX for Dummies Questions & Answers
Hi Guys,
I have a file as follows. Here is my story:
For each field, the string in the 5th column needs to be searched in other fields of the same column and counted if the 1st column of the field is different from that of the primary field. BTW, the unique strings of 1st column need to be... (6 Replies)
Discussion started by: a_bahreini
6 Replies
10. Shell Programming and Scripting
Input:
|Running the Rsync|Sun Oct 16 22:48:01 BST 2016
|End of the Rsync|Sun Oct 16 22:49:54 BST 2016
|Running the Rsync|Sun Oct 16 22:54:01 BST 2016
|End of the Rsync|Sun Oct 16 22:55:45 BST 2016
|Running the Rsync|Sun Oct 16 23:00:02 BST 2016
|End of the Rsync|Sun Oct 16 23:01:44 BST 2016... (4 Replies)
Discussion started by: busyboy
4 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)