Basically I want to compare column 1 from File 1 and column2 from File 2. If they match , I want to replace column 6 and column 14 of File 2 with Coulmn 2 and Column3 of File1 giving File3,
Hi,
I have a file like this.
"2006","10",25,"U","1129","32","C",0,0,0,0,0,0,0,0,0,0,0,0,352,16,4,0,0,0,0,0,"80",,1
"2006","11",25,"U","1148","32","C",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"80",,2
"2006","14",25,"U","1149","10","C",0,0,0,0,0,0,0,0,0,0,0,0,560,12,0,0,0,0,0,0,"80",,3... (1 Reply)
i want to take position 19-24(only first line) from all files and need to compare any duplication is there or not.
If duplication, then i have to print the file names.
I have written to take the characters from 19-24 from all files. but how to compare ?
... (1 Reply)
Hi,
I need to compare a column in two different csv files
file1
xyz.com,2/2/12,a,b,c
eg.com,2/2/23,a,b,ga
file2
1,2,ua,xyz.com
1,2,ua,abc.com
1,2,ua,eg.com
1,2,ua,easg.com
1,2,ua,zth.com
Read all entries in file1(which has 1000+) and compare column1 of file1 with the column4... (13 Replies)
Hi Gurus,
I have to fetch the records from a logs as per the time stamp . I am comfortable to use awk and sed in the script . But the logic to fetch the records as per comparison is the problem. $cat my_log.log
<Jul 30, 2010 7:01:12 AM EEST> <Error> <WebLogicServer>
<Jul 30, 2010 8:04:12 AM... (3 Replies)
Hi all
I need to compare two separate product lists that are changed weekly. New products are added, old products are removed and prices change.
I have found various Windows programs that do this function but it's not as clean as I like and just wondered if there was a simpler way with... (1 Reply)
Hi all,
Currently i am using
if( $0~/ NOT / && $0~/ NULL /)
{
.................
}
to check if the input record contains "NOT" and "NULL". But in some cases "NOT" and "NULL" are preceded and followed by tab. How do i find compare for these fields as well? (3 Replies)
Hi Experts,
I have two huge files in the format as shown below.I need to open a file1 and file 2 , cut first 24 characters of file 1 and search if the key exists
in file 2 first field (delimted by *).
If the value exists , copy the third field from file 2 and replace the 5th field in file 1 .... (4 Replies)
Hi Everyone
I am new to Unix shell scripting
Can anyone please explain me in detail how this command works
awk -F@ 'NR==FNR{A=$2;next}$3 in A{$3=A}1' file2 file1
The above command I got it from this forum, but unable to implement it as I am not getting how this works:mad:
I... (3 Replies)
Dear all,
I am having two files big files i need an output file as first occurance of file1 field in file2
example:
file1:raju
ranifile2:raju|123
raju|879
rani|623
rani|253result:raju|123
rani|623pls help me in this regard (3 Replies)
Discussion started by: suryanarayana
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)