Hi All,
I have multiple files which contains 5 columns and multiple rows.....
I want to calculate the minimum value of column 5th, if column 2 is MET, till column 1 comes to the next number.
Also it must skip the condition similar to 1st line where column number 1 and 3 are same and... (9 Replies)
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
I am trying to complete a script which will allow me to find:
a) reads a value from the keyboard. (ask the... (4 Replies)
Hi Friends,
my input file is this way
chr1 100 120 abc
chr1 100 121 def
chr1 100 122 ghi
chr2 240 263 kil
chr2 240 276 ghj
chr2 255 290 hjh
my output
chr1 100 122 abc
chr2 240 276 kil
chr2 255 290 hjh
Basically, I want to match on first and second column and then print the... (4 Replies)
Can I print the minimum and maximum values of values in first 4 columns ?
input
3038669 3038743 3037800 3038400 m101c
3218627 3218709 3217600 3219800 m290
.............
output
3037800 3038743 m101c
3217600 3219800 m290 (2 Replies)
Hi Evreyone
below is the sample data i have in one file
Wed Jan 30 7 :04:50 2013 type1 419990050 101 ms
Wed Jan 30 7 :04:58 2013 type1 488226363 101 ms
Wed Jan 30 7 :05:03 2013 type1 431525334 101 ms
Wed Jan 30 7 :05:48 2013 type2 400676615 101 ms
Wed Jan 30 8 :09:46... (3 Replies)
From the below table I want to print highest value and lowest value using awk script.
aaa 55 66 96 77
ggg 22 96 77 23
ddd 74 58 18 3
kkk 45 89 47 92
zzz 34 58 89 92
Thanks, Green
edit by bakunin: it sure is not news to you that you should use CODE-tags, no? And that we do not want such... (3 Replies)
Good evening
In a production system there are houndred of Jobs running and i´ve got to monitor all of them, but the problem arises when a job running takes much longer or conversely takes nothing and as operator is almost imposible to detect the máximum or mínimum threshold for a running job.
Ive... (1 Reply)
Hi All
I hope that someone could help me!
I have an input file like this, with 4 colum(ID, feature1, start, end):
a x 1 5
b x 3 10
b x 4 9
b x 5 16
c x 5 9
c x 4 8
And my output file should be like this:
a x 1 5
b x 3 16
c x 4 9
What I would like to do is to output for each ID... (2 Replies)
Hello,
I need to find out the minimum and maximum values based on specific column, and then print out the entire row with the max value.
Infile.txt:
scf6 290173 290416 . + X_047241 T_00113118-1
scf6 290491 290957 . + X_047241 T_00113118-2
scf6 290898 290957 . + X_047241 T_00113119-3
scf6... (2 Replies)
Using the input file for each row , using columns 1 (min) and 2 (max) , and with increment of 4 each time I want to create the output file.
Input file
1000 1012 2000 2001
2000 2008 3000 3001
Output desired
1000 2000 2001
1004 2000 2001
1008 2000 2001
1012 2000 2001
2000 3000 3001... (5 Replies)
Discussion started by: jiam912
5 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)