10-05-2017
Please be aware that a sort key by default stops at line end; to confine it to a single field, the stop position needs to be specified as well, e.g. -k4,4. Also note that it's a lower case k .
This User Gave Thanks to RudiC For This Post:
8 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I'm new to shell scripting and I'm having a tough time figuring out how to script something. Can anyone help?
Here is my setup and what I want to do:
A directory contains a list of projects by year (2000, 2001, etc) and customers (01-001) all of which have the same internal directory setup... (3 Replies)
Discussion started by: medazinol
3 Replies
2. UNIX for Dummies Questions & Answers
Hi guys.
I'm willing to copy a specific file system hierarchy, but I would not like to maintain the directory tree organization.
For example:
Let's say /a/b/c is the fs I'm wanting to copy to my destination,
and that c is a directory with 30 files, 10 on /a/b/c , 10 on a/b/c/c1 and 10... (2 Replies)
Discussion started by: 435 Gavea
2 Replies
3. Tips and Tutorials
Hi,
Please have a look this: http://tldp.org/LDP/Linux-Filesystem-Hierarchy/Linux-Filesystem-Hierarchy.pdf
I think this can be very useful for a beginner/intermediate level user to understand the filesystem hierarchy and as well as it can be used as a reference to various linux commands and... (0 Replies)
Discussion started by: tayyabq8
0 Replies
4. Solaris
Hi all,
I would like to know the difference between the different dir structures present in solaris!!!
Meaning what does /usr contain, /etc ,/opt/ ,so on...
I know what /usr and /etc are used for.
But why are /opt /bin /sbin /var and many more that i have missed
I would appreciate if... (1 Reply)
Discussion started by: wrapster
1 Replies
5. Shell Programming and Scripting
If a.sh calls b.sh, how can we know inside b.sh that it was called by a.sh? (4 Replies)
Discussion started by: chaitu_inmage
4 Replies
6. Shell Programming and Scripting
Hi,
I have a file with the following structure
M17XX-050-01-001 1100000000
A16 1.341E+05
...
B18 3.084E+02
total 1.344E+05
XY35 5.694E+03
...
XY241 6.725E+02
total 9.897E+05
Wr81Z 5.195E+00
...
Wr91Z 1.029E+02
Wr92Z 1.285E+02
total 9.897E+05
M17XX-050-01-001 1010000000... (2 Replies)
Discussion started by: f_o_555
2 Replies
7. UNIX for Advanced & Expert Users
Where is the file list created by rsync when it says building file list ? (1 Reply)
Discussion started by: glev2005
1 Replies
8. Programming
Dear Team
I am using DB2 v9 .
I have a condition to check roles based on hierarchies like below example.
1.Ramesh has Roles as "Manager" and "Interviewer"
2.KITS has Roles as "Interviewer"
3.ANAND has Roles as "Manager" and "Interviewer"
select * FROM TESTING
NAME ... (6 Replies)
Discussion started by: Perlbaby
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)