I'm writting a script to find the difference between two timestamp. One field i get on delivery time of the file like 07:17 AM and other is my SLA time 06:30 AM
I need to find the difference between these two time (time exceeded to meet SLA). Need some suggestions. (8 Replies)
Hi,
I have two files A.txt and B.txt. And i have the following attributes in both the files.
<date and time> <a unique id>
For eg:
<2007 May 30 20:29:36:034 GMT> <ID1> in A.txt
<2007 May 30 20:42:36:038 GMT> <ID1> in B.txt
Now, i need to find the time difference... (0 Replies)
I have a requirement to find the time difference in second between 2 given time stamps. An example scenario is shown below:
30 Oct 11:42:29:992 DEBUG org.apache.commons.digester.Digester - New match='form-validation/global/validator' (IID=, TID=)
30 Oct 11:42:29:993 DEBUG... (0 Replies)
Hi,
i'm trying to compare two directories in Unix.
I need a recursive search ie my shell script should also compare common files in those two directory and so on...
any clues.. ?? (2 Replies)
There was this thread earlier with the same name and the solution provided was excellent. Here is the solution to find diffrenc between two timestamp
$ cat timestamp
#! /usr/bin/ksh
echo enter first time stamp
read TIME1
echo enter second time stamp
read TIME2
H1=${TIME1%:+()}... (3 Replies)
HI All,
can some one please help me how to fine the difference between two time stamps say
a= Nov 10, 2009 9:21:25 AM
b= Nov 10, 2009 10:21:25 AM
I want to find difference between the a & b
I googled and tried with some options but no luck.
My OS is AIX (1 Reply)
Hi,
I have two files
one with 12486 lines
second one with 13116
As per the comparsion between two files the count have 630 difference
I used diff command to find the difference between two files but it's not understandable
could any one suggest any command to get 630 records in a new... (4 Replies)
Hi,
My date is coming as
STARTDATE=Sun Jul 15 00:34:23 2012
ENDDATE=Sun Jul 15 00:50:04 2012I want difference between these two dates,anyone's helps will be appriciated.
Thanks
Prasoon (3 Replies)
Hi Friends,
Require a quick help to write the difference between 2 timestamps based on a unique column value:
Input file:
08/23/2012 12:36:09,JOB_5340,08/23/2012 12:36:14,JOB_5340
08/23/2012 12:36:22,JOB_5350,08/23/2012 12:36:26,JOB_5350
08/23/2012 13:08:51,JOB_5360,08/23/2012... (4 Replies)
Hi!
I'd like to know if it is possible for a command to find the first difference between two large files, output that line from both file and stop, so no need to continue after that to save some computation time.
I don't think looping through it will be efficient enough but that's the only... (6 Replies)
Discussion started by: Mojing
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)