Non-standard utility msort allows you to specify fields from the right as well as the left:
producing:
The msort utility is available in many repositories, distributions of Linux, FreeBSD (ports), etc.
See the URL in the comment in the script for more ways to get msort.
Hi at all,
I have to sort a log file on timestamp field. That's field is the third!
a log file sample.....
1|EVTVOD-1-20060709_000614|2006/07/09-0:11:23|0.3.8
1|EVTVOD-1-20060709_000614|2006/07/09-0:11:16|0.3.8
1|EVTVOD-1-20060709_000614|2006/07/09-0:11:20|0.3.8... (3 Replies)
Hi,
I have a list of files that take on the format ABCDE_yymmdd and wish to sort them in ascending date order. I can't use the unix time stamp for the file as this could possibly be different from the date given in the file name.
Does anyone know of any way this can be done using unix shell... (14 Replies)
Hi guys... I've been trying to do this for ages. Maybe you can help.
I have log files like the examples below and I have grepped out certain lines from the files so that I can get an idea of who is logging on and how. So now I have the information in a new file but it is now in a different order... (7 Replies)
I'm not sure if this really belongs anywhere on this forum but my previous experiences on here have shown me that you guys are very helpful so I figure I may as well try.
I have a bunch of large 2d arrays in matlab and each has a column for a date that each row corresponds to. The format is... (1 Reply)
I am trying to sort by two columns. The first column in an ID, the second is a date in the form yyyy-mm-dd. I need to sort by the ID column, then in ascending order for the date column (earliest date to most recent date compared to today).
Input data:
012-abc 2012-04-25 ... (3 Replies)
Hello.
Sorting data file by date and time with the following issues:
Date is in the following format m/d/yyyy, no leading zeros
Time is in the following format h:m:s AM/PM, no leading zeros
Any ideas on how to sort data when the above issues?
Could the date/time be converted inline to... (5 Replies)
I have file having below data
01-MAY-13 2.38.11.00.100089 IN 4512 0000741881
01-JUN-13 2.38.11.00.100089 IN 1514 0000764631
01-NOV-13 2.38.11.00.100089 IN 1514 0000856571
01-NOV-13 2.38.15.00.100015 IN 300.32 0000856531
01-JUN-13 2.38.19.00.100000 IN 2698 0000764493
01-JUL-13... (2 Replies)
I have file a.txt having below data
cat a.txt
01-MAY-13 2.38.11.00.100089 IN 4512 0000741881
01-JUN-13 2.38.11.00.100089 IN 1514 0000764631
01-NOV-13 2.38.11.00.100089 IN 1514 0000856571
01-NOV-13 2.38.15.00.100015 IN 300.32 0000856531
01-JUN-13 2.38.19.00.100000 IN 2698 0000764493... (5 Replies)
Hi all,
I have a file with a list of rpm's that have different dates. I am trying to just grab the latest rpm and install date, and discard the rest. The file has 1000's of entries all with different names and dates.
I have tried sort -k on the file and I am not grabbing the info,
... (4 Replies)
Discussion started by: gartie
4 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)