Hi ,
I need to sort a file based on multiple columns All the columns are of varchar type
can any one give me the command to sort for varchar columns?
Thanks (3 Replies)
Please help to sort columns in this file:
a b d f c e
1 4 10 16 7 13
2 5 11 17 8 14
3 6 12 18 9 15
I need to sort COLUMNS (so sort command doesn't work) like this:
a b c d e f
1 4 7 10 13 16
2 5 8 11 14 17
3 6 9 12 15 18
I know sed can do it but don't know how... :( (7 Replies)
Hi, Please I need urgent help in sorting below data, I had similar post but there was a kind of space in between the data but now there is no space and I have tried adjusting the old script to work but it didn't.
here are the data;
traceroute to 2001:1ba0:2a0:5965:0:30:24:1... (6 Replies)
Hi all,
I'm using Solaris 10, and need help in sorting the below output from the syslog file in descending rather than ascending order.
I would like both the hostname and message columns to be sorted, but right now only the message is sorted and the count column, whose order I would like... (2 Replies)
Hi,
We have a requirement of need to sort a file based on fields 1,3 and 4. I tried with sort command however it is not giving expected output, can we achieve any other way? Please let me know ASAP.
File
a e w a
a b a a
a a d g
a a h h
c d a e
a a a w
Output
a b a a
a a a w
a a d... (4 Replies)
I have a space delimited text file that I would like to sort by multiple columns. First I want to sort by column 1, then by column 2. Both columns are numerical. Thanks! (1 Reply)
Hi
I have a text file that has four columns (Logonid,First Name,Last Name,Status)
Logonid First Name Last Name Status
abc2 Fred Mercury Inactive
abc1 John Deacon Active
abc3 Roger Taylor Active
abc4 Brian ... (2 Replies)
Hello!
So ive been presented with this comma-delimited file:
I need a print to look as below
"
lastname, phone_number, zip
for every person with a last name starting with the letter H, I
only with a 650-area code phone number. output should be sorted by reverse ZIP code "
I only have... (5 Replies)
Hi, I have a tab delimited columnar file where I want to remove lines wherever two particular columns match. so for this file, I want to toss the lines where columns 1 and 2 match:
a a 1 3
a b 2 4
b b 3 5
because there are matches column 1 and 2 in lines 1 and 3, I would like a script to... (2 Replies)
I have a file which contains following lines:
0114714710147 09013 00025.00D986532147
2814714710147 09013 00045.00D985532147
Now, I need to sort the file with above bold and colured one. Means:
first sorting will be done by: 147147 then by 10147 09013 after that by 986532147.
The... (2 Replies)
Discussion started by: George1234
2 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)