for i in `cat file1 | sort | uniq`;do grep -w $i file2; done
---------- Post updated at 12:06 PM ---------- Previous update was at 11:42 AM ----------
how it is not working. can you please post your message here.. instead of private message.. so that some one help you....
Code:
kamaraj@kamaraj-laptop:~/Desktop/testing$ for i in `cat file1 | sort | uniq`;do grep -w $i file2; done
rs2840532 1 2359977 G A 0.363 0.3373 1.123
rs3001336 1 2365193 G A 0.0812 0.07319 1.12
rs3984736 1 2371236 G A 0.0975 0.08456 1.133
kamaraj@kamaraj-laptop:~/Desktop/testing$ cat file1
rs3001336
rs3984736
rs2840532
kamaraj@kamaraj-laptop:~/Desktop/testing$ cat file2
rs3736330 1 2359237 A G 0.28 1.099 0.010
rs2840532 1 2359977 G A 0.363 0.3373 1.123
rs3001336 1 2365193 G A 0.0812 0.07319 1.12
rs1129333 1 2367838 A G 0.0817 0.0731 1.126
rs3984736 1 2371236 G A 0.0975 0.08456 1.133
rs4531246 1 2394182 A C 0.315 0.9488 0.1
kamaraj@kamaraj-laptop:~/Desktop/testing$
Hi,
I haven't done this for awhile, and further, I've never done it in perl so I appreciate any help you can give me.
I have a file of lines, each with 5 data points that look like this:
AB,N,ALLIANCEBERNSTEIN HLDNG L.P,AB,N
ALD,N,ALLIED CAPITAL CORPORATION,ALD,N
AFC,N,ALLIED CAPITAL... (4 Replies)
Hi friends,,
i have find the matching data between 2files.
My file1 have a data like
rs3001336
rs3984736
rs2840532
File2 have a data like
rs3736330 1 2359237 A G 0.28 1.099 0.010
rs2840532 1 2359977 G A 0.363 0.3373 1.123
rs3001336 1 2365193 G A 0.0812 0.07319 1.12 ... (1 Reply)
Hi,
Can anyone help me to compare two files and get the matching data... say i have file1 and file2 ... file1 has 300 unique data with that i need to match with file2 to see how may are matching.. file2 have 1000 records. (4 Replies)
Hello Experts,
I have come back to this forum after a while now, since require a better way to get my result.. My query is as below..
I have 3 files -- 1 Input file, 2 Data files .. Based on the input file, data has to be retreived matching from two files which has one common key..
For EX:... (4 Replies)
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
I must write a shell script that calls two external Perl functions--one of which sorts the data in a file, and... (6 Replies)
I encountered a weird issue with globbing in perl not returning all files, while I was testing out a script for recursive dir-processing on my Synology NAS.
Basically it didn't show (/match?) all the files in a specific directory. If I move the file to a different directory or even rename it, it... (2 Replies)
Hello all,
this is my first and probably not my last question around here. I do hope you can help or at least point me in the right direction.
My question is as follows, I need to find files and possible folders which are not owner = AAA group = BBB with a said location and all sub folders ... (7 Replies)
OK.
if the first file is :
3184 2014-07-28 04:15 global.Remote-Access 10.111.8.25 81.245.6.25 tcp 3268
3035 2014-07-28 04:16 global.Remote-Access 10.111.8.12 81.245.6.25 tcp 3268If the second file is:
1 Jul 28 04:12 2014-07-28 id967254(BGC-TLW-Cert) Tunneling: User with IP... (8 Replies)
Hello,
I am looking to output all of the lines from file2 whose 11th field is present in the first field in file1. Then the second field from file1 should be appended as such:
file1:
2222 0.35
4444 0.25
5555 0.75
file2:
col1 col2 col3 col4 col5 col6 col7 col8 col9 col10 1111
col1 col2... (4 Replies)
We have the data looks like below in a log file.
I want to generat files based on the string between two hash(#) symbol like below
Source:
#ext1#test1.tale2 drop
#ext1#test11.tale21 drop
#ext1#test123.tale21 drop
#ext2#test1.tale21 drop
#ext2#test12.tale21 drop
#ext3#test11.tale21 drop... (5 Replies)
Discussion started by: Sanjeev G
5 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)