Hi,
I need to sort the 3rd column in ascending order , each and every column are seperated by ~.
sample input file :
2~Lead Time Metrics~jennife1
2~Lead Time Metrics~mmullis
2~Lead Time Metrics~lisah
2~Lead Time Metrics~pros
2~Lead Time Metrics~kenward
can any one help me out .
i... (1 Reply)
I have almost got my unix program working that im working on as a personal project, my file tvs.txt has around 500 records so this would make it alot easier for me to find specific information.
I have a file called tvs.txt, I'm using pico to edit the files and i want to be able to sort on the a... (6 Replies)
Hello all,
Is there a way to sort only one column while keeping everything else intact. Take for example this situation: (all columns are space separated)
11 AA asdf 1 -0.5 xx
11 AA axdf 1 -0.6 xx
11 AA csls 1 -0.7 xx
11 AA hjkj 1 -0.4 xx
11 AA uius 1 -0.8 xx
22 AA asdf 1 -0.4 xx
22 AA... (7 Replies)
Hi all,
Not sure if this should be in the programming forum, but I believe it will get more response under the Shell Programming and Scripting FORUM.
Am trying to write a customized df script in Perl and need some help with regards to using arrays and file handlers.
At the moment am... (3 Replies)
Hello,
I have two files as the following:
File1:
F0100020 A G
F0100030 A T
F0100040 A G
File2:
F0100040 A G BTA-28763-no-rs 77.2692
F0100030 A T BTA-29334-no-rs 11.4989
F0100020 A G BTA-29515-no-rs 127.006
I want to sort the second file based on the... (6 Replies)
hello,
I have a file as follows:
F0100010 A C F0100040 A G BTA-28763-no-rs 77.2692
F0100020 A G F0100030 A T BTA-29334-no-rs 11.4989
F0100030 A T F0100020 A G BTA-29515-no-rs 127.006
F0100040 A G F0100010 A C BTA-29644-no-rs 7.29827
F0100050 A... (9 Replies)
I am trying to arrange these columns so that they look like this:
Xray2_1255555 Number of Copies: 1
Boxcar_1387305895 Number of Copies: 2
Fox_1387305896 Number of Copies: 2
But I have one column after another like this:
Xray2_1255555
Number of Copies: 1
Xray2_12444444
Number of... (5 Replies)
Dear All,
I have a set of columns (usually unknown number) and I would like to sort each of them (descending values) but my columns are independent. Can you please help me
file1
1,5,7
3,4,9
2,6,8
outcome should be
1,4,7
2,5,8
3,6,9
I have tried
sort -n -k1,1 -k2,2 -k3,3
but this... (8 Replies)
I am trying to sort, do uniq by 1st column and report this 4 columns tab delimiter table , eg
chr10:112174128 rs2255141 2E-10 Cholesterol, total
chr10:112174128 rs2255141 7E-16 LDL
chr10:17218291 rs10904908 3E-11 HDL Cholesterol
chr10:17218291 rs970548 8E-9 TG... (4 Replies)
What im trying to do is sort the output by the number on the second column and than limit the result to only the first three lines.
This is the code
idlist="x23s52; f34233; 2343xs; 25x34; si342d"
cntr=1
idcnt=$(print $nidlist |tr ';' '\n' |wc -l)
numofgrps=0
while (($cntr <= $idcnt))... (3 Replies)
Discussion started by: ajetangay
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)