hey,
I have a file that looks smthng like this:
/*--- abcd_0050 ---*/
asdfjk
adsfkja
lkjljgafsd
/*---abcd_0005 ---*/
lkjkljbfkgj
ldfksjgf
dfkgfjb
/*-- abcd_0055--*/
klhfdghd
dflkjgd
jfdg
I would like it to be sorted so that it looks like this:
/*---abcd_0005 ---*/
lkjkljbfkgj (9 Replies)
how can i sort the next list just by look at the numbers (ignore letters)
example:
abc123
dff4f
aaa2aa
bbbb55555bb
output:
aaa2aa
dff4f
abc123
bbbb55555bb (1 Reply)
i have list of files:
Wang De Wong CVPR 09.pdf
Yaacob AFGR 99 Second edition.pdf
Shimon CVPR 01.pdf
Den CCC 97 long one.pdf
Ronald De Bour CSPP 04.pdf
.....
how can i sort this directory so the output will be in the next format:
<year>\t<conference/journal>\t<author list> - t is tab
(its... (1 Reply)
i have list of files:
Wang De Wong CVPR 09.pdf
Yaacob AFGR 99 Second edition.pdf
Shimon CVPR 01.pdf
Den CCC 97 long one.pdf
Ronald De Bour CSPP 04.pdf
.....
how can i sort this directory so the output will be in the next format:
<year>\t<conference/journal>\t<author list> - t is tab
(its... (1 Reply)
Let's say that I have a database that I call part ID. This database has the following grouping:
Dart1=4
Dart2=8
Dart3=12
Fork1=68
Fork2=72
Fork3=64
Bike1=28
Bike2=24
Bike3=20
Car1=44
Car2=40
Car3=36
I want to write a program that would read this database and tell me when the... (19 Replies)
hi everyone, I am kind of new to this forum. I need help in sorting this data out accordingly, I am actually doing a traceroute application and wants my AS path displayed in front of my address like this;
192.168.1.1 AS28513 AS65534 AS5089 AS5089 .... till the last AS number and if possible... (1 Reply)
hi everyone, I am kind of new to this forum. I need help in sorting this data out accordingly, I am actually doing a traceroute application and wants my AS path displayed in front of my address like this;
192.168.1.1 AS28513 AS65534 AS5089 AS5089 .... till the last AS number and if possible... (1 Reply)
Hi all,
Does anyone can help me the following question? I would like to write an AWK script.
In the following input file, each number in "start" is paired with numbers in column "end".
No Start End
A 22,222,33,22,1233,3232,44 555,333,222,55,1235,3235,66... (7 Replies)
Hi, Please i need help in writing an 'awk' script in sorting the following data;
traceroute6 to 2001:1ba0:2a0:5965:0:30:24:1 (2001:1ba0:2a0:5965:0:30:24:1) from 2001:418:1::62, 64 hops max, 16 byte packets
1 2001:418:1::4 0.342 ms
2 2001:418:1::1 0.630 ms
3 2001:504:16::1b1b 0.393 ms
4... (6 Replies)
Hii guys,
I need to sort my file and remove duplicates before writing to another file. The first line in the file are column names. I dont want this line to be sorted and should always be the first line in the output.
sort -u file.txt > file1.txt. is the command that i am using... (4 Replies)
Discussion started by: just4u_sharath
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)