I was wondering what the difference was between the two commands, I understand that locate won't search for files with certain permissions set. Are there any others?
Thanks (1 Reply)
I have a file which gets appended with records daily..for eg. 1st day of the month i get 9 records ,2nd day 9 records .....till the last day in the month...the no of records may vary...i store the previous days file in a variable oldfile=PATH/previousdaysfile....i store the current days file in a... (6 Replies)
I need to find the difference between two files in UNIX. I tried diff, but couldn't get it right.
There are two files:
file1: apple
mango
strawberry
banana
grape
file2: grape
apple
banana
I need an output file like below: ... (11 Replies)
I have two files as below
File1:
a
b
c
d
File2:
a
b
When i find the difference the output would be c&d..
How can i get my requirement...pls help...
Many thanks in advance (10 Replies)
I have 2 files as follows.
file1.txt
<cell>123</cell>
<cell>345</cell>
file2.txt
<cell>123</cell>
<cell>456</cell>
out out should be
output.txt
<cell>456></cell>
How do we achieve this> The difference betwenn the two files should be wirtten to the output file..
... (2 Replies)
Hi,
The requirement is to compare two files that has single column of records each. Comparison is to happen on a whole and not line by line.
File1.txt
314589929
315611087
304924413
315989094
301171509
302984393
315609549
314593632
File2.txt
315611087
304924413
315989094 (2 Replies)
I have a file wich contains time formats and i need to get the time difference
TIME1 TIME2
==================================
20120624192555.6Z 20120624204006.5Z
which means first date 2012/6/24 19:25:55,second date 2012/6/24 20:40:06 so when i get the time... (1 Reply)
I have a file wich contains time formats and i need to get the time difference
TIME1 TIME2
=============== ===================
20120624192555.6Z 20120624204006.5Z
which means first date 2012/6/24 19:25:55,second date 2012/6/24 20:40:06 so when i get the time... (23 Replies)
Hi All,
Please find my problem below:
I have a file at two different nodes dev and test
1st find> find /u/dev/local/abc -name ab.dat
--Since this file can be in several sub directories
2nd find> find /u/test/local/abc -name ab.dat
I find my 1st find result and do compare with 2nd... (5 Replies)
Hi Friends,
I need to find the difference between two files ,
File_1 contained 4 columns, and File_2 contained 4 columns,
I need to find the difference using 1st column,
Or need to find the difference using 3st column, (6 Replies)
Discussion started by: Shenbaga.d
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)