09-17-2012
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
nawk -F "|" 'FNR==NR {a=$2 OFS $3 OFS $4 OFS $5 OFS $6;next}\
{if ($5 in a)print $1,"test",$5,a, $2,$3,$4 OFS OFS OFS OFS OFS OFS OFS OFS $2-$3-$4 ; \
else print $1,"Database",$5 OFS OFS OFS OFS OFS OFS $2,$3,$4 OFS OFS OFS OFS OFS OFS OFS OFS $2-$3-$4 }' OFS="|" \
file1 file2 > file3
This... (5 Replies)
Discussion started by: pinnacle
5 Replies
2. Shell Programming and Scripting
I want to print the 1st field in a comma seperated file to lower case and the rest the case they are.
I tried this
nawk -F"," '{print tolower($0)}' OFS="," file
this converts whole line in to lower case i just want the first column to be converted.
The below doesnt work because in... (11 Replies)
Discussion started by: pinnacle
11 Replies
3. UNIX for Dummies Questions & Answers
Hi,
I have a file that looks like this:
s6 98
s6 91
s6 56
s5 32
s5 10
s5 4
So what I want to do is print only the highest value for each value in the column:
So the file will look like this:
s6 98
s5 32
Thanks (4 Replies)
Discussion started by: phil_heath
4 Replies
4. Shell Programming and Scripting
Hello,
I got data like that,
=111
A= alpha
B= 1
C= qq
D= 45
F= ss
G= 334
=1234
A=
B= 2w
C=
D= 443
F=
G=
=3434
A=
B= e3e (5 Replies)
Discussion started by: davidkhan
5 Replies
5. UNIX for Dummies Questions & Answers
Hello all. I have a problem that I need help solving.
I would like to convert the following file:
human pool1_12 10e-02 45 67
human pool1_1899 10e-01 45 29
human pool1_1829 10e-01 43 26
horse pool1_343 10e-20 65 191
horse pool1_454 10e-09 44 43... (5 Replies)
Discussion started by: viralnerd
5 Replies
6. Solaris
Dear All,
I'm using autosys in my production system.
My concern is as follows:
autosys -j <some_job_nm>
Output:
Job Name Last Start Last End ST Run Pri/Xit
... (1 Reply)
Discussion started by: saps19
1 Replies
7. Shell Programming and Scripting
Hi everyone,
Ok here's the scenario.
I have a control file like this.
component1,file1,file2,file3,file4,file5
component2,file1,file2,file3,file4,file5I want to do a while loop here to read all files for each component.
file_count=2
while ]
do
file_name=`cat list.txt | grep... (2 Replies)
Discussion started by: The Gamemaster
2 Replies
8. Shell Programming and Scripting
Hi, I have data of the following type,
chr1 234 678 39 852 638 abcd 7895
chr1 526 326 33 887 965 kilj 5849
Now, I would like to have something like this
chr1 234 678 39 852 638 abcd 7895 <a href="http://unix.com/thread=chr1:234-678">Link</a>
chr1 526 326 33 887 965 kilj 5849 <a... (5 Replies)
Discussion started by: jacobs.smith
5 Replies
9. Shell Programming and Scripting
I was trying to simplify this from what I'm actually doing, but I started getting even more confused so I gave up. Here is the content of my input file:
Academic year,Term,Course name,Period,Last name,Nickname
2012-2013,First Semester,English 12,7th Period,Davis,Lucille
When I do this:
... (3 Replies)
Discussion started by: nextyoyoma
3 Replies
10. Shell Programming and Scripting
Hello:
I've input data:
Input data
--- 3:60069:C:T 60069 C T 1 0 0 1 0 0 1 0 0 1 0 0 1
--- 3:60079:A:G 60079 A G 1 0 0 0.988 0.012 0 1 0 0 1 0 0 1
--- rs186476240:60157:G:A 60157 G A 1 0 0 1 0 0 1 0 0 1 0 0 1
I edit/make first few columns before numbers (6th column) and want to... (4 Replies)
Discussion started by: genome
4 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)