02-20-2013
It helps if you tell us what Linux /UNIX you are using. Some awk implementations have asort() which is array sort. Other do not - so the correct answer for you depends on the system you are on.
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,everyone:
I'm new to shell, and now get trouble with some script:
line=`/usr/xpg4/bin/awk '/^(*\|){2}'"$CR"'/ {print $0}' ${TIER4FILE}|grep -v
OSNAME=`sed -n ''$LINE'p' $DATALOC/os`
sort +1 /tmp/LhasaCRs2 > /tmp/LhasaCRs1
I cannot understand the "{2}" here. My mentor said it... (1 Reply)
Discussion started by: mycoy
1 Replies
2. Homework & Coursework Questions
1. The problem statement, all variables and given/known data:
I dont know what I do wrong, I am trying to create shell programming database:
I have this command first:
&& > $fname
...
echo $Name:$Surname:$Agency:$Tel:$Ref: >> $fname
then I have
echo " Name Surname Agency Tel... (2 Replies)
Discussion started by: jeht
2 Replies
3. Shell Programming and Scripting
Hi,
I usually use Access to sort data however for some reason its not working. Our systems guys and myself cannot figure it out so ive tried to use AWK to do the sorting. The file is made up of single lines in the format
... (4 Replies)
Discussion started by: eknryan
4 Replies
4. Shell Programming and Scripting
Hi,
I've a fixed width file where I need to count the number of patterns from each line between characters 1 to 15 . so can we sort them and get a count for each pattern on the file between 1 to 15 characters.
65795648617522383763831552 410828003265795648 6175223837... (5 Replies)
Discussion started by: rudoraj
5 Replies
5. Shell Programming and Scripting
I'm trying to efficiently combine the fields of two vectors (vectors b and c) into a new vector (vector d) as defined by instructions from a 3rd vector (vector a). So vector a has either a 1 or 2 in each field specifying which vector (b or c respectively) should go into that field. Vector a is... (4 Replies)
Discussion started by: LaTortuga
4 Replies
6. Shell Programming and Scripting
I want to print out the lines that have the max value in column 3. and count the occurrence of column 1; if there are more than one occurrences, line with highest column 2 value will be printed.
I have this data:
input:
AV 234 25
AV 256 76
AS 421 34
AV 124 76
BD 136 71
BD 241 76
AW... (10 Replies)
Discussion started by: aydj
10 Replies
7. Shell Programming and Scripting
input file
abc1
abc23
abc12
abc15
output
abc1
abc12
abc15
abc23 (9 Replies)
Discussion started by: yanglei_fage
9 Replies
8. Shell Programming and Scripting
Hi guys
I have a problem trying to sort output produced with the help of 'Awk'.
After "grepping" the pattern out of the file and sorting it, sort command acts a little strange:
$ grep -w -n -i "p*cmo" /bb/data/rmt4db.lrl | sort -r
32:P1096CMO 63836 344 passthru
31:P1084CMO 121335 329 passthru... (3 Replies)
Discussion started by: aoussenko
3 Replies
9. Shell Programming and Scripting
Hi,
I need help to sort string using awk. I don't want to use sed or perl as I want to add this functionality in my existing awk script
Basically I have a variable in AWK which is string with comma separated value. I want to sort that string before using that variable in further processing
for... (10 Replies)
Discussion started by: rocky.community
10 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)