Hi,
I have one file stat.
Stat file contents are as follows: for example.
H50768020040913,00260100,507680,13,0000000643,0000000643,00000,0000
H50769520040808,00260100,507695,13,0000000000,0000000000,00000,0000 H50770620040611,00260100,507706,13,0000000000,0000000000,00000,0000
Now i... (1 Reply)
hello people
i need your help please
i want to achieve the following with the simplest, most efficient shell-tools:
i have a directory with a lot of files from users.
the script should check which partition the dir is on
if the partition with the directory is more than 90% full
... (2 Replies)
Hi
I am using the command below to list the 10 biggest directories and files in my present directory
du -hs * | sort +0 | tail -10
the output is
8K disk-space
16K rish
32K WINDOWS
48K tests
104K imgvdEwLa.jpg
168K 020204_aerosmith_1024768.jdk
3.2M Acdc -... (4 Replies)
Can some one help in sorting the attached file.
I used cmd: sort -r jar1.txt -o sortedjar.txt , but it didnt work.
Thanks for your help in Advance. (6 Replies)
Can you guys pls take a look at this.
I need to sort this list of numbers as follows:
2nd col first, then 1st col, then 3rd col, all in reverse (highest to lowest).
I'm doing this:
sort -k 2,2nr -k 1,1nr -k 3,3gr
but, as you see, the 3rd col does not get sorted properly.
Any idea... (0 Replies)
hello everyone,
I have file with de-limited values in random order shown below, where C1V0 represents column1 value1,
C2V0 represents column2 value 2, and so on.
Column0 is a constant value which i didn't represent in the sample input format.
Column1 is a numeric column.
Column2 is a... (0 Replies)
I have ran into a heavy case of PEBCAK*) and could need some advice on what i do wrong:
OS is Linux (kernel 2.6.35), sort --version reports "8.5" from 2010, shell is ksh.
Originally i had a file with with the following structure:
hdisk1 yyy
hdisk2 yyy
hdisk3 yyy
hdisk4 yyy
hdisk5 yyy... (2 Replies)
I have the below input data in a file and need to get the output as mentioned below. Need to sort the data by size(Asc/des)/by subdirectory
Below is the input which is there in a file:
120 /root/path2/part-00000-d3700305-428d-4b13-8161-42051f4ac5ed-c000.json
532 ... (3 Replies)
Discussion started by: ajarramuk
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)