12-03-2009
Nicely done. I even read the "end it at POS2" in the man page and glossed right over it.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I'm looking to edit a file which contains various data including date.(ddmmyyyy)
I want to sort by date and then count the number of different dates found
Any ideas how to acheive this
Thanks in advance. (2 Replies)
Discussion started by: Mudshark
2 Replies
2. Shell Programming and Scripting
Hi ,
I would like to list or sort by date and time (the files are named in day and time format) where the latest file will be placed at the bottom and the earliest file be placed at the top. Can anybody help me?
My files are named in the following manner.
EG: abc_071128_144121_data
"... (21 Replies)
Discussion started by: Raynon
21 Replies
3. Linux
Hi All,
Sorry to throw this frequent question but I lost my notes on it.
How do you list the files by date? I'm on red hat.
Thanks in advance,
itik (1 Reply)
Discussion started by: itik
1 Replies
4. Shell Programming and Scripting
Hello World~
Please Help Me(BASH)
input:
dde,2007.8.25,891
dde,2007.8.23,356
dfe,2007.10.12,341
cba,2005.12.5,342
I wanna know how to sort by the date(2005.12.5)
output:
cba,2005.12.5,342
dde,2007.8.23,356
dde,2007.8.25,891
dfe,2007.10.12,341
Thanks in advance (3 Replies)
Discussion started by: lifegeek
3 Replies
5. Shell Programming and Scripting
Hi Everyone,
# cat b
Sat 12 Sep 2009 10:31:49 PM MYT;a;a;a;Sun 13 Sep 2009 11:32:49 AM MYT;
Sat 13 Sep 2009 10:31:49 PM MYT;a;a;a;Mon 14 Sep 2009 10:31:49 PM MYT;
Sat 14 Sep 2009 10:31:49 PM MYT;a;a;a;Sun 13 Sep 2009 10:31:49 PM MYT;
# sort -t';' -k5 b
Sat 13 Sep 2009 10:31:49 PM... (8 Replies)
Discussion started by: jimmy_y
8 Replies
6. UNIX for Dummies Questions & Answers
The problem:
I have a task to give a my boss:
1. the files and directory sizes in human readable form: du -h
2. He also wants me to give him the date stamp on the files and directories. something like ls -R or sort by date
Does anyone have a script that can do this efficiently (I am... (2 Replies)
Discussion started by: obology
2 Replies
7. Shell Programming and Scripting
Hi All,
Please help me to sort the date field which is in the format 2012-02-03 16:09:37.388...
Platform: Red Hat linux
Thanks in advance (2 Replies)
Discussion started by: jesu
2 Replies
8. Shell Programming and Scripting
Hi,
The input file is as follows,
22.06.2012 17:58:38 CPUser: xxxxxxx, billedAfterStatus: Active
13.07.2012 08:46:15 CPUser: xxxxxxx, billedAfterStatus: Active
20.07.2012 08:56:24 CPUser: xxxxxxx, billedAfterStatus: Active
20.03.2012 08:56:24 CPUser: xxxxxxx, billedAfterStatus: Active... (16 Replies)
Discussion started by: nanthagopal
16 Replies
9. Shell Programming and Scripting
Hi Experts,
I have a filelist collected from another server , now want to sort the output using date/time stamp filed.
- Filed 6, 7,8 are showing the date/time/stamp.
Here is the input:
#----------------------------------------------------------------------
-rw------- 1 root ... (3 Replies)
Discussion started by: rveri
3 Replies
10. Shell Programming and Scripting
nawk '$1=="Date" {d=$(NF-2);next} $1=="Queue" {q=$NF;next} $1=="Forms"{print q, $NF, d}' OFS='|' printfile.log
I have this script working. Please let me know how to sort by Queue and then Date. (4 Replies)
Discussion started by: Daniel Gate
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)