07-28-2014
Quote:
Originally Posted by
theshashi
I tried some option before putting question here.
It's file if you don't know like me.
You only needed one option. Show us what you tried!
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I have a large csv file that looks like this:
14 ,M0081,+000000001,200302,+00000100500,
14 ,M0081,+000000004,200301,+00000100500,
14 ,M0081,+000000005,200305,+00000100500,
14 ,M0081,+000000000,200205,+00000100500,
14 ,M0081,+000000008,200204,+00000100500,
... (2 Replies)
Discussion started by: edog
2 Replies
2. Shell Programming and Scripting
HI ALL,
i have a problem when i do a sort sum with many fields.
Is there a limit for fields?
Do you know a solution?
thanks in advance.
the shell is:
# SORT1
SORT1_rcode=777
if ; then
echo "USE $DARSEQ/OTPU.FTPEPREC RECORD F,1000 " > $DARPARSRT/TPEKL508.SORT1_$$.srt
... (6 Replies)
Discussion started by: tullo
6 Replies
3. Shell Programming and Scripting
Hi I have following fixed width file and I have to sort on 2 fields
ABC 111222333002555 77788
ABC 111222333004555 77788
ABC 111222333001555 77788
ABC 111222333003555 77788
ABC 111222333005555 77788
one is from field1 to field 3 "ABC" and another is on 14 to 16 "002" (based on first... (1 Reply)
Discussion started by: mgirinath
1 Replies
4. Shell Programming and Scripting
Hi experts,
I am trying sort command with my data but still not getting the expected results.
For example, I have 5 fields data here
c,18:12:45,c,c,c
d,12:34:34,d,d,d
a,13:50:10,a,a,a
b,13:50:50,b,b,b
a,13:50:50,a,a,a
b,14:10:01,b,b,b
c,10:12:45,c,c,c
I want to get
... (3 Replies)
Discussion started by: lalelle
3 Replies
5. UNIX for Dummies Questions & Answers
Hi I would like to sort a csv file. It has 50 fields and approx 1400000 lines. I want to sort by three columns as follows. Say sort on coulmn 5, if entries are equal sort on column 3 if this is also equal sort on column 6.
It seems that this is possible for 5 then 3 i.e.
sort -t "," -k 5,5 -k... (1 Reply)
Discussion started by: turquoise_man
1 Replies
6. UNIX for Dummies Questions & Answers
Hey,
I have a file i want to sort. It contains these kind of lines:
FirstName LastName buyID buyType
Eg:
John Doe 22 Car
Jane Simpson 4 Headset
John Doe 11 Telephone
Now if I use the sort command on it
cat purchases.txt | sort -k1,1 -k2,2
it would also sort the third and 4th field:... (4 Replies)
Discussion started by: ce3c
4 Replies
7. Shell Programming and Scripting
I have a file with contents below
123,502
123,506
123,702
234,101
235,104
456,104
456,100
i want to sort such that i get a unique value in column A, and for those with multiple value in A, i want the lowest value in B.
output should be
123,502
234,101
235,104
456,100 (3 Replies)
Discussion started by: dealerso
3 Replies
8. Shell Programming and Scripting
I have another file with three columns A,B,C as below
123,1,502
123,2,506
123,3,702
234,4,101
235,5,104
456,6,104
456,7,100
i want to sort such that i get a unique value in column A, and for those with multiple value in A, i want the lowest value in C.
output should be
Code:... (3 Replies)
Discussion started by: dealerso
3 Replies
9. Shell Programming and Scripting
hi,
i'm having a file stg_ff.txt
which contains 10 fields,which contains millions of records
i need to cat the first 10 rows in the file after doing a sorting on the first two fields i n the file.
can any body help me on this.
regards
Angel (4 Replies)
Discussion started by: angel12345
4 Replies
10. Shell Programming and Scripting
Hi
I have a file as below
<field1> <field2> <field3> ... <field_num1> <field_num2>
Trying to sort based on difference of <field_num1> and <field_num2> in desceding order and print all fields.
I tried this and it doesn't sort on the difference field .. Appreciate your help.
cat... (9 Replies)
Discussion started by: newstart
9 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)