11-05-2013
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
hello
I need to compare 2 text files. File 1 has 2 columns and file 2 has 1 to many.
Sample:
File 1:
111 555
222 666
333 777
444 755
File 2:
000 110 113 114
844 111 555 999
202 777 865 098 023
222 313 499
065 655 333 011 890 777
433 (15 Replies)
Discussion started by: stevesmith
15 Replies
2. Shell Programming and Scripting
I need help in file comparision.
I have two files in below format:
FILE_A:
-------
COL1 COL2 COL3 COL4 COL5
FILE_B:
-------
COL1A COL1B COL1C COL1D COL1E
i want to compare for a for each row in FILE_A and FILE_B
COL1 of FILE_A with COL1B of FILE_B
COL3 of FILE_A with COL1E of... (1 Reply)
Discussion started by: learnoutmore99
1 Replies
3. UNIX for Dummies Questions & Answers
Hi All,
i have a excel sheet with two columns as below.
column1 column2
100 100
200 300
300 400
400 400
500 600
i need to compare the values these two columns and the output should be printed in the third column...if these values are equal the output should be green and if these... (2 Replies)
Discussion started by: arunmanas
2 Replies
4. Shell Programming and Scripting
Dear everyone,
I need any sort of shell script or perl script would do the following. I have a txt file as follows:
;Stretnumber Resident Resdient (not in file)
16 John Mary
16 Mary Parker
16 Nancy Smith
16 Mary John
18 Trey ... (5 Replies)
Discussion started by: sasharma
5 Replies
5. Shell Programming and Scripting
Hi,
Input
7488 7389 chr1.fa chr1.fa
3546 9887 chr5.fa chr9.fa
7387 7898 chrX.fa chr3.fa
7488 7389 chr21.fa chr3.fa
7488 7389 chr1.fa chr1.fa
3546 9887 chr9.fa chr5.fa
7898 7387 chrX.fa chr3.fa
Desired Output
7488 7389 chr1.fa chr1.fa 2
3546 9887 chr5.fa chr9.fa 2... (2 Replies)
Discussion started by: jacobs.smith
2 Replies
6. Shell Programming and Scripting
Hi,
input file1
abcd 123 198 xyz1:0909090-0909091
ghij 234 999 xyz2:987654:987655
kilo 7890 7990 xyz3:12345-12357
prem 9 112 xyz5:97-1134
input file2
abcd 123 198 xyz1:0909090-0909091 -9.122 0
abed 88 98 xyz1:98989-090808 -1.234 1.345
ghij 234 999 xyz2:987654:987655 -10.87090909 5... (5 Replies)
Discussion started by: jacobs.smith
5 Replies
7. Shell Programming and Scripting
Hi,
I need to compare multiple columns from 2 files.
I can, for example, have these 2 files:
file1:
col1, col2, col3,col4
a,1,4,7
b,2,5,8
c,3,6,9file2:
col1, col2, col3,col4
a,2,3,2
b,5,7,5
c,1,9,8As a result, I need for example the difference between the columns 2 and 4:
col2,... (3 Replies)
Discussion started by: Subbeh
3 Replies
8. Shell Programming and Scripting
Hi,
I have multiple files that each contain one column of strings:
File1:
123abc
456def
789ghi
File2:
123abc
456def
891jkl
File3:
234mno
123abc
456def
In total I have 25 of these type of file. (5 Replies)
Discussion started by: owwow14
5 Replies
9. Shell Programming and Scripting
Hi All,
Need to compare two date columns from the filname FinalDate.txt. My data's are like below
D_OT_START D_EXP_STR Amount
1/3/2012 1/3/2012 5000
6/21/2011 6/25/2011 6000
2/28/2011 2/28/2011 7000
7/16/2010 8/16/2010 8000
7/14/2010 10/26/2010 9000
... (3 Replies)
Discussion started by: suresh_target
3 Replies
10. Shell Programming and Scripting
i have the following files (all separated by tabs):
file 1.txt
1 yes
2 no
3 yes
4 yes
file 2.txt
a no
b no
c yes
d no
i combine the above files in file 3 which looks like
file 3.txt
1 yes a no
2 no b no
3 yes c yes
4 yes d no
now, i need to compare the values between column 2... (3 Replies)
Discussion started by: msonoth
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)