09-19-2012
Dear Vidya,
thats the problem..all files are not in the same format. i have mentioned it in the previous post:
ericsson_msc_live_bln_western1_20120809.jar
ericsson_msc_live_bln_western_20120711.jar
10 More Discussions You Might Find Interesting
1. Programming
i think grep can only find char in files matching a pattern without any wildcards like ? correct? It works with * but not ?.
how can i write a small c program to find words in a file, like a list, that matches a pattern like ma?y, b??con, etc if grep doesn't understand ? in a pattern search. if... (1 Reply)
Discussion started by: giannicello
1 Replies
2. Filesystems, Disks and Memory
How to search a given pattern in the files which are present in my current working directory and its subdirectories recursively (1 Reply)
Discussion started by: gandhevinod
1 Replies
3. Shell Programming and Scripting
Hi Guys,
Can you help with the shell script:
I would like to search a fixed width pattern from a file
say for each line from a fixed position and lenght it has to return all rows from the file.
Example:
To search the third column for "def" it has to return 1 and 4th rows only
... (2 Replies)
Discussion started by: sbasetty
2 Replies
4. Shell Programming and Scripting
I have a problem in searching a specific pattern in c files.
My requirement:
I have to find all the division operator in all cfiles.
The problem is, the multi line comments and single line comments will also have forward slash in it.
Even after avoiding these comments also, if both... (6 Replies)
Discussion started by: murthybptl
6 Replies
5. Shell Programming and Scripting
can anybode tell me ? I want to search for a pattern present in a whole directory and subdirectories's files containg " crat"
I tried
grep -r "crat" */* ;
is it right ? (3 Replies)
Discussion started by: pranabrana
3 Replies
6. Shell Programming and Scripting
Hi All,
Please can someone assist in the script I have made that searches a pattern in a file and delete the whole line containing the pattern.
#!bin/sh
# The pattern that user want to add to the files
echo "Enter the pattern of the redirect"
read value
# check if the user has... (1 Reply)
Discussion started by: Shazin
1 Replies
7. Shell Programming and Scripting
How do I search for a pattern - N/A in a particular column using awk? (11 Replies)
Discussion started by: rabiu
11 Replies
8. UNIX for Dummies Questions & Answers
Hi,
I need small help from you people.
In a directory there are around 150 odd files and few them contain the word "TRACK" and few are not.
How can I find out the the list of those files which doesn't contain the word "TRACK"?
Thanks,
Siba (4 Replies)
Discussion started by: siba.s.nayak
4 Replies
9. UNIX for Dummies Questions & Answers
in my file i have somthing likre
kpk_12
kpk_1
kpk_1.tcl
kpk_3.tcl
kpk
kpk
kpk
i want search only kpk i am using this cmd /kpk ...results it is showing all . any cmd is ther other then this to search exactword in this example kpk it shoulsnot show kpk_* etc
Thanks in Advance
... (2 Replies)
Discussion started by: prakumar
2 Replies
10. Shell Programming and Scripting
Hi there,
Looking forward to your advice for the below:
I have a file which contains 2 paragraphs related to a particular pattern. I have to search for those paragraphs from a log file and then print a particular line from those paragraphs.
Sample:
I have one file with the fixed... (3 Replies)
Discussion started by: danish0909
3 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)