06-06-2014
redirect "Your command output to a sed and do replace '*' with space and then do a sort -u on it"
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
hello everyone..
I was wondering is there a effective way to sort file that contains colomns and numeric one.
file
218900012192 8938929 8B8DF3664 1E7E2D59D5 0000 26538 1234 74024415
218900012979 8938929 8B8DF3664 1E7E2D59D5 0000 26538 1234 74024415
218900012992 8938929 8B8DF3664... (2 Replies)
Discussion started by: amon
2 Replies
2. Shell Programming and Scripting
Hi all,
I have a 10.txt file. In this file 2 words are present by name Active and Inactive and these words are repeated 7000 times. I want to take the unique 2 words from this 7000 lines.
Thanks
Mahalakshmi.A (3 Replies)
Discussion started by: mahalakshmi
3 Replies
3. Shell Programming and Scripting
Hi,
I have a file like this:
Some_String_Here 123 123 123 321 321 321 3432 3221 557 886 321 321
I would like to find only the unique values in the files and get the following output:
Some_String_Here 123 321 3432 3221 557 886
I am trying to get this done using awk. Can someone please... (5 Replies)
Discussion started by: Legend986
5 Replies
4. UNIX for Dummies Questions & Answers
Hi power user,
if I have this file:
file1.txt:
1111
1111
2222
2222
3333
3333
3333
4444
4444
4444
when I run the
sort file1.txt | uniq > data1.txt
the result is (2 Replies)
Discussion started by: anjas
2 Replies
5. UNIX for Dummies Questions & Answers
I don't really know much about UNIX commands, so if someone could help me understand how to do this, I'd really appreciate it.
I have a text file with data that looks like this (filename: numbers.txt):
1 1 1 1 1 1 1 1 1 2 1 1_2 2_1
1 1 1 1 1 1 1 1 2 1 2 1_2 2_1
1 1 1 1 1 1 1 1 2 1 2 1_2 2_1... (12 Replies)
Discussion started by: zac100
12 Replies
6. Shell Programming and Scripting
Hi All,
I have a file which is having 3 columns as (string string integer)
a b 1
x y 2
p k 5
y y 4
.....
.....
Question:
I want get the unique value of column 2 in a sorted way(on column 2) and the sum of the 3rd column of the corresponding rows. e.g the above file should return the... (6 Replies)
Discussion started by: amigarus
6 Replies
7. Shell Programming and Scripting
Hi Guys,
I have two files that I am using:
File1 is as follows:
wwe
khfgv
jfo
jhgfd
hoaha
hao
lkahe
This is like a master file which has entries in the order which I want. (4 Replies)
Discussion started by: npatwardhan
4 Replies
8. UNIX for Dummies Questions & Answers
Hi all,
I wanted to save the values of a file that contains unique entries based on a specific column (column 4). my sample file looks like the following:
input file: 200006-07file.txt
145 35 10 3
147 35 12 4
146 36 11 3
145 34 12 5
143 31 15 4
146 30 14 5
desired output files:... (5 Replies)
Discussion started by: ida1215
5 Replies
9. Shell Programming and Scripting
I am trying to sort, do uniq by 1st column and report this 4 columns tab delimiter table , eg
chr10:112174128 rs2255141 2E-10 Cholesterol, total
chr10:112174128 rs2255141 7E-16 LDL
chr10:17218291 rs10904908 3E-11 HDL Cholesterol
chr10:17218291 rs970548 8E-9 TG... (4 Replies)
Discussion started by: fat
4 Replies
10. UNIX for Beginners Questions & Answers
Hello All,
I am trying to write a script which returns me clientID,programId,userID indicated in bold from the below log files.Log file is having many such data , iam just presenting sample .
Sample Log file.
hostname 1525867288264 UA:MP:EP491418 http-nio-8080-exec-11 ERROR Get Price... (13 Replies)
Discussion started by: nextStep
13 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)