06-21-2010
Hi pludi,
for "my @test=("a","b","c","d");", after print, it will be abcd, but my own pattern is "c" is the 1st, "b" is the 2nd, "d" is 3rd, and last "a".
if i just use "cmp" or "<=>", cannot achieve this customized sort pattern.
Thanks
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
Is there any way to sort a file in cshell by sort command, sorting it by multiple fields, like to sort it first by the second column and then by the first column.
Thanks forhead (1 Reply)
Discussion started by: Takeeshe
1 Replies
2. Shell Programming and Scripting
Hi all,
I am trying to extract the values ( text between the xml tags) based on the Order Number.
here is the sample input
<?xml version="1.0" encoding="UTF-8"?>
<NJCustomer>
<Header>
<MessageIdentifier>Y504173382</MessageIdentifier>
... (13 Replies)
Discussion started by: oky
13 Replies
3. Shell Programming and Scripting
Hi All,
When i give ls -ltr my filenames looks like this:
Filename Pattern: Abc_Def_mmddyyyyHHmm.csv
$ ls -ltr
Jun 05 04:30 Abc_Def_060520111245.csv
Jun 05 08:40 Abc_Def_071220121458.csv
Jun 06 03:30 Abc_Def_071220111458.csv
Jun 06 04:25 Abc_Def_060620110439.csv
Jun 07 04:37... (12 Replies)
Discussion started by: HemaV
12 Replies
4. Shell Programming and Scripting
Hi,
I am having trouble sorting one file based on another file. I tried the grep -f function and failed. Basically what I have is two files that look like this:
File 1 (the list)
gh
aba
for
hmm
File 2 ( the file that needs to be sorted)
aba 2 4 6 7
for 2 4 7 4... (4 Replies)
Discussion started by: phil_heath
4 Replies
5. UNIX for Dummies Questions & Answers
Hi,
I am able to get next line if it is matching a particular pattern. But i need a way to skip if next line also matches same pattern..
For example:
No Records
No Records
Records found
got it
Records found
Now i want to find 'Records found' after 'No Records' pattern matches..
... (5 Replies)
Discussion started by: nagpa531
5 Replies
6. Shell Programming and Scripting
I have a file which has the following data :-
how can I sort the data in descending order .
My files may have the first column with 1 to 10000 numbers .I need to arrange them in descending order .
Thanks (2 Replies)
Discussion started by: lazydev
2 Replies
7. Shell Programming and Scripting
Hi there, I am pretty new to those things, so I couldn't figure out how to solve this, and if it is actually that easy. just found that awk could help:(.
so i have a textfile with strings and numbers (originally copy pasted from word, therefore some empty cells) in the following structure:
SC... (9 Replies)
Discussion started by: luja
9 Replies
8. Shell Programming and Scripting
Hi,
i need to sort content of files based on a specific value. An example as below.
Input1.txt
Col_1
SW_MH2_ST
ST_F72_9S
SW_MH3_S6
Col_2
SW_MH3_AS7
ST_S15_9CH
SW_MH3_AS8
SW_MH3_ST
Col_3
ST_M93_SZ
ST_C16_TC (12 Replies)
Discussion started by: redse171
12 Replies
9. UNIX for Beginners Questions & Answers
Hi,
This is one of the thing that am looking for when I post the question on the ps wrapper. It has since been closed as it has taken me too long to post an example.
I have replaced some of the original content of the ps output.
uname -a = SunOS <hostname> 5.11 11.3 sun4v sparc sun4v
... (1 Reply)
Discussion started by: newbie_01
1 Replies
10. UNIX for Beginners Questions & Answers
Hi All ,
I am having an input file like this
Input file
7 sks/jsjssj/ddjd/hjdjd/hdhd/Q 10 0.5 13
dkdkd/djdjd/djdjd/djd/QB 01 0.5
ldld/dkd/jdf/fjfjf/fjf/Q 0.5
10 sjs/jsdd/djdkd/dhd/Q 01 0.5 21
kdkd/djdd/djdd/jdd/djd/QB 01 0.5
dkdld/djdjd/djd/Q 01 0.5
... (9 Replies)
Discussion started by: kshitij
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)