Hi ,
Can somebody please help me with this.
The date format is in MM/DD/YY HH24:MI:SS
suppose I have a start_date=09/03/02 04:15:02
& Finish date= 09/04/02 07:13:51
I want to find out the difference between the two ie finish_time-start time.
How can I do this.
Morever I want the... (2 Replies)
First off thank you for any help.
Here is the problem. I have two text files that fit the same format. The first I created using an ls -d command and then with the help of the forums ran awk resulting in the fallowing output.
W00CHZ0103345-I1CZ44
W00E6S1016722-I01JW159... (8 Replies)
Input file:
Tue Oct 21 12:56:35 2008 Started
Tue Oct 21 12:56:39 2008 Completed
Tue Oct 21 12:57:25 2008 Started
Tue Oct 21 12:57:32 2008 Completed
Tue Oct 21 12:58:12 2008 Started
Tue Oct 21 12:58:50 2008 Completed
Output required:
Tue Oct 21 12:56:35 2008 Started
Tue Oct 21... (2 Replies)
Hi all ,
i am trying to calculate time difference btw the script execution
I am using solaris
start_time=`date +%s`
sleep 2
end_time=`date +%s`
duration=`expr $end_time - $start_time`
when i try to subtract i get the error
line 13: %s - -time : syntax error: operand expected... (3 Replies)
Is there a way to tell diff to show differences one line at a time and not to group them? For example, I have two files:
file1:
line 1
line 2
line 3 diff
line 4 diff
line 5 diff
line 6
line 7
file2:
line 1
line 2
line 3 diff.
line 4 diff.
line 5 diff.
line 6
line 7 (13 Replies)
Dear All
I want to diff between two time(FIRST 4 COLUMN) in hours in last column. Kindly help me for same.
2013-11-23 15:51:23 2013-11-23 12:20:06 BRC023 CG
2013-11-23 15:51:23 2013-11-23 12:20:08 BRC064CG
2013-11-23 15:51:23 2013-11-22 13:17:49 BLM003 NG
2013-11-23 15:51:23 2013-11-22... (9 Replies)
Hi,
I am quite scripting illiterate and have been trying to write a bash script to compare to two files which i have populated in two seperate arrays as below and confirmed that all the files are loaded into the array.
IFS=$'\n'
filea=($(find /var/tmp/dir1 -type f -follow -print))... (12 Replies)
Hi All,
I have one file which contains time for request and response.
I want to calculate time difference in milliseconds for each line.
This file can contain 10K lines.
Sample file with 4 lines.
for first line.
Request Time: 15:23:45,255
Response Time: 15:23:45,258
Time diff... (6 Replies)
Discussion started by: Raza Ali
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)