10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
I have below query related to multiple file comparing
I have four files i want to compare it and contents of one file will not be presence in 3other files and if any content found then it will print the execution.
Can you please help me how to achieve it. (2 Replies)
Discussion started by: soumyamihp
2 Replies
2. Shell Programming and Scripting
I have requirement to compare two files in unix. Below are the sample files.
File1:
cn=test123,cn=bobgroup,dc=ind,dc=com
cn=bob123,cn=bobgroup,dc=ind,dc=com
cn=test13,cn=bobgroup,dc=ind,dc=com
cn=est12,cn=bobgroup,dc=ind,dc=com
cn=st123,cn=bobgroup,dc=ind,dc=com
File2... (1 Reply)
Discussion started by: babu92
1 Replies
3. Shell Programming and Scripting
I have a file containing the below data obtained after running a diff command
> abc 10
< abc 15
> xyz 02
<xyz 05
.....
Does anyone know how i can obtain output like :
previous value of abc is 10 and present value is 15
similarly for all the comparisons in the text file (10 Replies)
Discussion started by: amithpatrick1
10 Replies
4. UNIX for Dummies Questions & Answers
Hello,
I have a dat file nctilllist.dat which will be present in the directory path
"/usr/lpp/web-data/mfg/nct/file-data/nctilllist.dat"
nctillist.dat will have reference to files like DP100001.jpg,DP10002.PDF,DP100003.doc
on the path /usr/lpp/web-data/mfg/nct/file-data will have... (12 Replies)
Discussion started by: gayathrivm
12 Replies
5. Shell Programming and Scripting
Hi,
I have two files
File1 Contents:
abc
dcf
sdc
File2 Contents:
dcf
sdc
erg
Now my program should return the contents existing in File1 but not in File2. In this case output shoud be "abc" as abc is not available in File 2. It should not return "erg" by saying it is... (4 Replies)
Discussion started by: forums123456
4 Replies
6. UNIX for Advanced & Expert Users
I have two files which have primary key(s) for each row.
I need to compare both the files and produce the output in the following format.
Primary key(s),file1 value,file2 value.
Both the input files will be comma separated files.
I have accomplished this using perl, but it is... (6 Replies)
Discussion started by: gpsridhar
6 Replies
7. UNIX for Dummies Questions & Answers
how can i unix compare two files??
var1 = 6499 7328 6351 7583 7573
var2 = 6499 7328 6351 7583 7777
i did:
diff $var1 $var2
and i got the output:
1c1
< 6499 7328 6351 7583 7573
---
> 6499 7328 6351 7583 7777
what can i do with it? and what does it tell me?? how can i knoe that... (2 Replies)
Discussion started by: nirnir26
2 Replies
8. Shell Programming and Scripting
Hi Friends,
I have a requirement like i have two files in diffrent locations. i want to compare these two files, if both the files are same i want to return "0" else return 1.
Please help me on this.
Thanks
sreenu. (3 Replies)
Discussion started by: sreenu80
3 Replies
9. UNIX for Dummies Questions & Answers
Hi,
I need to compare 2 files based on the first field in each file and output the differences to a new file.
example File 1 and File 2 both have first field as Number ie:
File 1
1252652355
1859553322
1778899562
File 2
1252652355
1859553322
So I would expect File 3 to... (2 Replies)
Discussion started by: Lagre1
2 Replies
10. UNIX for Advanced & Expert Users
Hi Guys,
Requirement: Want to compare two files, if the the content of both files is same then show "Good result" else Show "Bad Result"
I am using the following logic
if( cmp -s a b = 0 )
then
echo "Good result"
else echo "Bad result"
exit 0
fi
But this is... (1 Reply)
Discussion started by: abhishek3598
1 Replies
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)