Then of course what would be interesting is what is the output of the command on the server that is working(as oppessed to telling us that some fileset is at 6.1.8.15 - these numbers differ with each fileset!)
But, without further ado I suggest you go to Fixcentral and download the "latest" (was released in February!) service pack Fixpack: 6100-08-02-1316 details and perform the command
Last edited by MichaelFelt; 05-06-2013 at 04:27 PM..
I wondered if someone could point out the differences between the time commmand and usr/bin/time and the accuracy one might have over another.
Also, is there a website or two a person could maybe link for me to describe the differences?
Thank you for your time. (2 Replies)
Hi,
This is my input file:
ali 5 usa abc
abu 4 uk bca
alan 6 brazil bac
pinky 10 utah sdc
My desired output:
pinky 10 utah sdc
alan 6 brazil bac
ali 5 usa abc
abu 4 uk bca
Based on the column two, I want to do the descending order and print out other related column at the... (3 Replies)
dear friends I want to convert four column data to one column data. For example:
from
1, 2, 3, 4
5, 6, 7, 8to
1
2
3
4
5
6
7
8what is the general command for that type of convertion.
thanks (5 Replies)
Dear All,
I have a data file input.csv like below. (Only five column shown here for example.)
Data1,StepNo,Data2,Data3,Data4
2,1,3,4,5
3,1,5,6,7
3,2,4,5,6
5,3,5,5,6
From this I want the below output
Data1,StepNo,Data2,Data3,Data4
2,1,3,4,5
3,1,5,6,7
where the second column... (4 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 have file named file1.txt with below contents
cat file1.txt
1/29/2014 0:00,706886
1/30/2014 0:00,791265
1/31/2014 0:00,987087
2/1/2014 0:00,1098572
2/2/2014 0:00,572477
2/3/2014 0:00,701715
I want to display as below
1/29/2014,706886
1/30/2014,791265
1/31/2014,987087... (5 Replies)
Hi,
I have the below text:
16:00 0.50
16:00 0.30
16:00 0.00
16:00 0.00
16:00 0.30
16:01 0.00
16:01 0.30
I want to find the max of the 2nd column grouping by the values in the 1st column using awk. So
16:00 0.50
16:01 0.30
I have tried (3 Replies)
Dear all,
I am kindly seeking assistance on the following issue.
I am working with data that is sampled every 0.05 hours (that is 3 minutes intervals) here is a sample data from the file
5.00000 15.5030
5.05000 15.6680
5.10000 16.0100
5.15000 16.3450
5.20000 16.7120
5.25000... (4 Replies)
Hello dears,
I have a log file with records like below and want to get a average of one column based on the search of one specific keyword.
2015-02-07 08:15:28 10.102.51.100 10.112.55.101 "kevin.c" POST ... (2 Replies)
Discussion started by: Newman
2 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)