01-07-2013
It worked!!
![Smilie Smilie](https://www.unix.com/images/smilies/smile.gif)
---------- Post updated at 02:55 PM ---------- Previous update was at 02:54 PM ----------
Thanks very much!! It worked!!!
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
What's the command to sort a file in ascending order and redirect the output to another file?
Thanks!!!!!! (1 Reply)
Discussion started by: gyik
1 Replies
2. Shell Programming and Scripting
I appreciate all the help that I've already received but am running into one problem. I can find how to add something before a file with ascending numbers but not like this. I basically have a file that looks like this:
100
101
102
103
104
I need to add the following before each line with... (5 Replies)
Discussion started by: kerpm
5 Replies
3. UNIX for Advanced & Expert Users
Hello Friends,
I want to merge two files in ascending order on the first field. And if the first field matches sort on 3rd field i.e, TXADDR should come ahead of RXADDR .
file1
9 : TXADDR : 00000000
65 : TXDATA 0000000000000011
83 : TXDATA 0000000000000012
453 :... (10 Replies)
Discussion started by: user_prady
10 Replies
4. Shell Programming and Scripting
How can I check if array is in ascending order?
---------- Post updated at 01:53 PM ---------- Previous update was at 01:25 PM ----------
Done it now (0 Replies)
Discussion started by: kristinu
0 Replies
5. UNIX for Dummies Questions & Answers
Hi,
I have this single file with a number of sequence inside it of format
>string1
data
>string100
data
>string10
.....
>string5
...
>string67
......
the dots represent data.
I wanted to get the sequences arranged in ascending order like
>string1
data
>string5 (5 Replies)
Discussion started by: sonia102
5 Replies
6. Shell Programming and Scripting
I have a multiple file with the following name
like.
file_0.csv
file_1.csv
file_2.csv
file_3.csv
file_4.csv
file_5.csv
file_6.csv
file_7.csv
file_7.csv
file_8.csv
file_9.csv
file_10.csv
file_11.csv
file_12.csv
file_13.csv
file_14.csv (2 Replies)
Discussion started by: rakesh_arxmind
2 Replies
7. Shell Programming and Scripting
HI
I have a file
# vi assc
values order fin
100 34 45
200 12 64
120 10 23
Here I need to check whether the values of second column"order"
is arranged ascendingly
Note: Always order column will be arranged either in ascending or descending order
How to make it?... (1 Reply)
Discussion started by: Priya Amaresh
1 Replies
8. Shell Programming and Scripting
Hi,
I need to list files in ascending order. Filenames are in format inpTDT_1, inpTDT_2, inpTDT_3 and so on.
I want to list them in the ascending order based on the digit after underscore and send the output to a file.
Please help (5 Replies)
Discussion started by: Neelkanth
5 Replies
9. Shell Programming and Scripting
Hi All
I have a file like this:
ID1 ref_A 10 ref_B 30 ref_C 5
ID2 ref_F 69 ref_G 12 ref_H 5
Every ID is followed by a string(ref_X) followed by a number(every number is referred to the previous ref)
I would like to order the file like this(the column could be more, but always with the same... (4 Replies)
Discussion started by: giuliangiuseppe
4 Replies
10. Shell Programming and Scripting
Hello,
I am running ubuntu 16.04 and trying to list all files inside a directory, I need to sort them in ascending order. While surfing on the site, I found an old thread but somehow it did not work.
Link
Ascending order with sort -nk2 myfile.txt command gives below output:
file... (5 Replies)
Discussion started by: baris35
5 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)