07-03-2014
Thank you very much RudiC. Wow, it worked in many column.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
i have a file where the records are like this.
vt100 2048 D402 MG0010 0
586 262144 D403 MG0011 1000
486 8192 D404 MG0012 270
386 8192 A423 CC0177 40
586 65536 A424 CC0182 670
486 16384 A423 CC0183 100
486 16384 A425 CC0184 80
65000 4096 B407 EE1027 80
I want firstly,
to count how... (10 Replies)
Discussion started by: sickboy
10 Replies
2. Shell Programming and Scripting
Hi all
I have a variable called "variable" and is of the form
variable ="AAA BBB CCC DDD" {basically it has values separated by spaces}
What is the simplest way to check if "variable" has more that one value in its list?
Thanks. (9 Replies)
Discussion started by: felixmat1
9 Replies
3. Shell Programming and Scripting
The file content is dynamic and using this format:
name1 number1
name2 number2
name3 number3
name4 number4
....................
Need a smooth way to calculate the sum of all the numbers in that file (number1 + number2 + number3 + number4........ = total ) (11 Replies)
Discussion started by: TehOne
11 Replies
4. Solaris
Hi,
I wanted a script to find sum of files for a particular date, below is my script
ls -lrt *.req | nawk '$6 == "Aug"' | nawk '$7 == "1"'| awk '{sum = sum + $5} END {print sum}'
However, i get the error below
/usr/bin/ls: arg list too long
How do i fix that.
Many thanks before. (2 Replies)
Discussion started by: beginningDBA
2 Replies
5. Shell Programming and Scripting
Long list of input file:
AGDRE1 0.1005449050
AGDRE1 2.1005443435
AGDRE1 1.2005449050
AGDRE1 5.1005487870
AASFV3 50.456304789
AASFV3 2.3659706549
AASFV3 6.3489807860
AASFV3 3.0089890148
RTRTRS 5.6546403546
.
.
Desired output file:
AGDRE1 8.5021829410
AASFV3 62.180245240... (2 Replies)
Discussion started by: perl_beginner
2 Replies
6. Programming
Hello, I need some help to correct my algorithm steps to sum a number. I am confused... please input some steps
Example:
Let's say a number 5.
Now we can get a list of numbers: 1, 2, 3, 4 (less than 5 in sorted order).
so the sum could be: 1+4; 2+3 ( 1+1+1+1+1 or 1+2+2 is not a solution).
... (1 Reply)
Discussion started by: sureshcisco
1 Replies
7. Homework & Coursework Questions
Hi All,
I need to calculat the sum of the particular field in text file. And the datatype of the field in file is decimal(18,2). If the file is small, then I am facing any problem. But the file is huge, then the result is converted into exponential format.
I tried using various command thr... (0 Replies)
Discussion started by: lathanandhini
0 Replies
8. Shell Programming and Scripting
Input file:
101M
10M10D20M1I70M
10M10D39M4I48M
10M10D91M
10M10I13M2I7M1I58M
10M10I15M1D66M
Output file:
101M 101 0 0
10M10D20M1I70M 100 1 10
10M10D39M4I48M 97 4 10
10M10D91M 101 0 10
10M10I13M2I7M1I58M 88 13 0
10M10I15M1D66M 91 10 1
I'm interested to count how many total of... (6 Replies)
Discussion started by: perl_beginner
6 Replies
9. Shell Programming and Scripting
In the awk I am trying to subtract the difference $3-$2 of each matching $4 before the first _ (underscore) and print that value in $13.
I think the awk will do that, but added comments. What I am not sure off is how to add a line or lines that will add sum each matching $13 value and put it in... (2 Replies)
Discussion started by: cmccabe
2 Replies
10. Shell Programming and Scripting
I have a file that looks like this:
HP ColorPlotter Z-6100
ACMARTIN IP 192.168.x.x
"VIRTUAL HP ( C9468A ) PART 1 of 2 (REAL CARTRIDGE 1)"
"VIRTUAL HP ( C9468A ) PART 2 of 2 (REAL CARTRIDGE 1)"
181
181
"VIRTUAL HP ( C9471A ) PART 1 of 2 (REAL CARTRIDGE 2)"
"VIRTUAL HP ( C9471A ) PART 2... (4 Replies)
Discussion started by: SysAdminRialto
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)