Hi All,
a new bie to awk,
How to compare substring of col1,file 1 with
col2file2 and get file1contents+col3file2 as output.
file1
-----
kumarfghh,23,12000,5000
rajakumar,24,14000,2500
rajeshchauhan,25,16000,2600
manoj,26,17000,2300
file 2
--------
123,kumar,US,
123,sukumar,UK... (4 Replies)
Hi,
I have 2 text files n1 and n2.
cat n1 :
--------
1234567890
4444444444
cat n2 :
---------
1234567890
4444444444
7777777777
8888888888
they are some sample records. File n1 contains some lookup records, whereas file n2 contains some transaction records. I need to get the... (2 Replies)
I've been trying to use awk to compare two files that have pretty much the same data in apart from certain lines where in one file a fields value has changed. I want to print the line from the first file and the changed line from the second file.
At the moment, all I can get it to do is print the... (6 Replies)
hi,
i have 1 files a.csv temp.out
a.cvs looks like
add,16390,180,674X,HALIFAX_COMMONS_X,902,497,902-209
add,16390,180,674X,HALIFAX_COMMONS_X,902,497,902-219
add,16390,180,674X,HALIFAX_COMMONS_X,902,497,902-220
add,16390,180,674X,HALIFAX_COMMONS_X,902,497,902-221
and temp.out looks... (1 Reply)
i have one file say file1 having many records.Each record contains 2000 characters.i have to compare 192-200 (stored as name)characters in this file from other file say file2 having name stored in 1-9 characters.
after comparing i have to print the record from file1 in another file say file3 ... (3 Replies)
Hi,
I'm a new user in awk and i'm trying to compare two files to create a third one if some values match in both files.
The first file has this content:
s 45.960746365 _21_ AGT 2490 [21:0 22:0
s 45.980418496 _21_ AGT 2491 [21:0 22:0
s 46.000090627 _21_ AGT 2492 [21:0 22:0
s 47.906552206... (2 Replies)
I've two files with data like below:
file1.txt:
AAA,Apples,123
BBB,Bananas,124
CCC,Carrot,125
file2.txt:
Store1|AAA|123|11
Store2|BBB|124|23
Store3|CCC|125|57
Store4|DDD|126|38
So,the field separator in file1.txt is a comma and in file2.txt,it is |
Now,the output should be... (2 Replies)
so have file1 like this:
joe 123
jane 456
and then file2 like this:
123 left right
456 up down
joe ding dong
jane flip flop
what I need to do is compare col1 and col2 in file1 with col1 in file2 and generate a new file that has lines like this:
joe 123 ding dong left right
jane... (11 Replies)
Hi,
I need to compare two text files with awk.
File1:
-------
chr1 43815007 43815009 COSM19193 REF=TG;OBS=AA;ANCHOR=G AMPL495041
chr1 43815008 43815009 COSM18918 REF=G;OBS=T;ANCHOR=T AMPL495041
chr1 115256527 115256528 ... (6 Replies)
Discussion started by: RushiK
6 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)