Write a shell program that takes one or any number of file names as input; sorts the lines of each file in ascending order and displays the non blank lines of each sorted file and merge them as one combined sorted file. The program should generate an error message in case any input file does not... (1 Reply)
Hi all
i am facing a problem in sorting command. The script depending on the sorting command works fine only if ascii sorting is done.
i need to know how to find out how to perform ascii sorting. sorting is case insensitive in
my file has data in the following format.
AA/BB/
AAA/BB\
also... (1 Reply)
Hi All,
I am new to unix,please help me on the following its urgent
I have 2 question
1 question
I need a script for following senario
I have get some files in directory by using grep
i need to sort all files to new files for example (abc.dat --> abc.dat.sort)
ex:grep *050508* ... (3 Replies)
Hi experts,
i have a file.If i will delete some intermediate records from the file then the output file will be in sorted format as show below.
file A
====
D001 ty gh
D002 fg hi
D003 jk lr
.
.
.
if i will delete the 2nd record then the output file is as follows:
outputfile:... (1 Reply)
Hi I'm writing a shell that goes through a bunch of files and does a simple test on each. Each file has a numeric name (ex. 100.jpg). My problem is that the shell is going through the files in alphabetical rather than numeric order.
Thus, after checking file 19.jpg it skips to 100.jpg. Once... (7 Replies)
Hi
I have a query regarding syncsort in Unix. What is the difference between Syncsort and normal sort. If I have 4 columns to do sort in a csv file and and first col, and third col to be done in descending order. How can I do that in Unix/
Please help me..Its urgent. (3 Replies)
Hi I need how to sort string characters
for Example i have a file that contains this data
example string "fan" but i want to display "afn" contained words
"afn" is in sorted format for fan.
File data
faty
gafny
gaifny
dafan
gafnniunt
O/p
gafny
gafnniunt (3 Replies)
hi experts,
I have a flat file with 2 fields, 1st field is alpha-numeric and 2nd is numeric.
Input file is ::
A_0 11
A_0 12
A_0 13
C_0 3
B_1 21
B_1 22
A_0 1
A_0 2
I want to sort this file, first based on 1st field, then on 2nd field
Output should be ::
A_0 1
A_0 2
A_0 11... (1 Reply)
Dear all,
I have a complex data file shown below,,,,,
A_ABCD_13208 0 0 4.16735 141044 902449 1293900 168919
C_ABCD_13208 0 0 4.16735 141044 902449 1293900 168919
A_ABCDEF715 52410.9 18598.2 10611 10754.7 122535 252426 36631.4
C_DBCDI_1353 0... (19 Replies)
Discussion started by: AAWT
19 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)