08-16-2013
Thats exactly what i needed
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
I need a shell script for below requirement
Input file
P1 - 173310
P2 - 173476
P3 - 173230
P4 - 172737
P1 - 173546
P2 - 173765
P3 - 173876
P4 - 172989
Out put file
P1 173310 173546
P2 173476 173765
P3 173230 173876
P4 172737 172989
Suresh (6 Replies)
Discussion started by: suresh3566
6 Replies
2. Shell Programming and Scripting
hi,
Apologies if this has been covered.
I have requirement where i have to convert a single column into multiple column.
My data will be like this -
2
3
4
5
6
Output required -
2 3 4 5 6 (1 Reply)
Discussion started by: Nishithinfy
1 Replies
3. Shell Programming and Scripting
hi,
i have the file as below:
abc
def
ghi
jkl
i want the output as
abc,def,ghi,jki
please reply,
Thanks (4 Replies)
Discussion started by: namitai
4 Replies
4. Shell Programming and Scripting
Hi!
Does anybody help me in converting following data:
INPUT looks like this:
20. 100.
30 200.
40. 400.
50. 100.
60. 200.
70. 400.
80. 200.
150. 210.
30. 100.
OUTPUT should look like this:
20. 100. 30 200. 40. 400. 50. 100.
60. 200. 70.... (5 Replies)
Discussion started by: lovelinux
5 Replies
5. Shell Programming and Scripting
Hi Gurus,
How to convert rows in to columns using linux shell scripting
Input is like (sample.txt)
ABC
DEF
GHI
JKL
MNO
PQR
STU
VWX
YZA
BCD
output should be (sampleoutput.csv)
ABC,DEF,GHI,JKL,MNO
PQR,STU,VWX,YZA,BCD (2 Replies)
Discussion started by: infasriniit
2 Replies
6. Shell Programming and Scripting
Hi I have a matrix with n rows and m columns like below example. i want to extract all the pairs with values <200.
Input
A B C D
A 100 206 51 300
B 206 100 72 48
C 351 22 100 198
D 13 989 150 100
Output format
A,A:200
A,C:51
B,B:100... (2 Replies)
Discussion started by: anurupa777
2 Replies
7. Shell Programming and Scripting
I am looking to print the data in columns and after every 3 words it should be a new row.
cat example.out | awk 'END { for (i = 0; ++i < m;) print _;print _ }{ _ = _ x ? _ OFS $1 : $1}' m=1| grep -i INNER
I am looking to print in a new line after every 3 words.
... (2 Replies)
Discussion started by: lazydev
2 Replies
8. Shell Programming and Scripting
Hi Friends,
Hope all is well.
I have an input file like this
a gene1 10
b gene1 2
c gene2 20
c gene3 10
d gene4 5
e gene5 6
Steps to reach output.
1. Print unique values of column1 as column of the matrix, which will be
a
b
c (5 Replies)
Discussion started by: jacobs.smith
5 Replies
9. Shell Programming and Scripting
hi folks,
I have a sample data like what is shown below:
1,ID=1000
1,Org=CedarparkHospital
1,cn=john
1,sn=doe
1,uid=User001
2,uid=User002
2,ID=2000
2,cn=steve
2,sn=jobs
2,Org=Providence
I would like to convert it into the below format:
1,1000,CedarparkHospital,john,doe,User001... (11 Replies)
Discussion started by: vskr72
11 Replies
10. Shell Programming and Scripting
Team,
I am having requirement to convert rows to columns
Input is:
key ,count, id1, pulse1, id2, pulse2 ,id3, pulse3
12, 2 , 14 , 56 , 15, 65
13, 3, 12, 32, 14, 23, 18, 54
22, 1 , 32, 42
Expected Out put:
key, id,pulse
12, 14, 56
12, 15, 65
13 ,12, 32
13, 14 ,23
13, 18 ,54
22 ,32,... (3 Replies)
Discussion started by: syam1406
3 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)