02-08-2013
Try again leaving spaces around the / .
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
i need to divide this count by 2, what variable can i use in my script?
26 hcscprod_cpus_totals /2 = 13
13 hcncprod_cpus_totals /2= 6.5
541 ktazp_cpus_totals /2= 270.5
346 ktazd_cpus_totals /2=173
110 ktazi_cpus_totals /2=55
10 ktazq_cpus_totals /2=5 (2 Replies)
Discussion started by: wereyou
2 Replies
2. Shell Programming and Scripting
Dear,
i want to devide the first 4 values from a raw over the next 4 values like the following:
$1+$2+$3+$4 / $5+$6+$7+$8
using AWK ....can someone help me?
Sanks (1 Reply)
Discussion started by: tontal
1 Replies
3. UNIX for Dummies Questions & Answers
Hi,
I have a issue dividing 2 values in UNIX
a=15
b=100
c = a / b ==> and it is returning 0 instead of 0.15 into variable C.
How can i resolve this issue ? please help (1 Reply)
Discussion started by: kotasateesh
1 Replies
4. UNIX for Dummies Questions & Answers
I'm new at this and frustratd because I know this must be simple but here goes. I'm trying to write a script that will give me the percentage of a particular field over multiple text files.
Each day I have around 1500 files that are generated. Each file has around 100 lines in it. The lines... (3 Replies)
Discussion started by: mikez104
3 Replies
5. Shell Programming and Scripting
I have a file, let's say X
BTS 0 UNLOCKED ENABLED NONE
TRX 0 UNLOCKED ENABLED NONE
TRX 1 UNLOCKED ENABLED NONE
BTS 1 UNLOCKED ENABLED NONE
TRX 0 UNLOCKED ENABLED NONE... (4 Replies)
Discussion started by: amaulana
4 Replies
6. Shell Programming and Scripting
Hi All,
here D Prints the bytes value .plz help to convert the variable D value to MB in new variable $E
D=`more $C |awk '{print $6;}'`
Thanks in Advance.:) (3 Replies)
Discussion started by: netdbaind
3 Replies
7. Shell Programming and Scripting
Hi,
I've been working on a few scripts and have been getting great info.
How, would I include in the below script, how I would let a user know that if they divide a SECOND number by zero, that they would get a divide by zero error? What's the easiest way of working this?
Cordially,
joe.
... (1 Reply)
Discussion started by: jefferj54
1 Replies
8. UNIX for Dummies Questions & Answers
Hello,
I have two files, f1 and f2. f1 has 5 columns like so:
a b c d 154
e f g h 365
.....
f2 has two columns, the first column contains the name of the above file and second column contains a constant which is to be used for division.
e.g.
file1 56
I want to divide the 5th... (2 Replies)
Discussion started by: Gussifinknottle
2 Replies
9. UNIX for Dummies Questions & Answers
We have large log files, and we need to extract last four hours lines only,
Please let us know the command.
Thanks,
Saurau. (1 Reply)
Discussion started by: saurau
1 Replies
10. Shell Programming and Scripting
Dear ALL,
I have sample file :
tx_bytes: 2422,
tx_packets: 13,
uptime: 16119,
tx_bytes: 2342,
tx_packets: 14,
uptime: 11009,
tx_bytes: 252,
tx_packets: 12,
uptime: 3113,
my formula :
minutes=$(( uptime/60%60 ))
hours=$(( uptime/60/60%24 )) (3 Replies)
Discussion started by: gnulyn
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)