06-28-2012
I'm not sure what you're even trying to do yet. I think \ is used for modulous sometimes but in a shell it's usually used as an escape.
What output do you actually want here?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
hi all, i have the following problem using awk in a script
i want to read the values from a column with real numbers and calculate the mean.the problem is that when i use a statement such as this
num = $4
i cant find a way to convert the variable from string to floating point to perform... (7 Replies)
Discussion started by: kanagias
7 Replies
2. Shell Programming and Scripting
I have a two files
>cat file1
jjjjj 10.345 6.673
ppp 9.000 5.883
>cat file2
mmm 80 10
jjjjj 10.305 6.873
ppp 9.000 5.883
I am reading file 1 line by line , and look for the string jjjj and then read the line in file 2 with jjjj
I want to get the... (5 Replies)
Discussion started by: jojan
5 Replies
3. Shell Programming and Scripting
Hai,
Can you please guide me, to compare the floating point numbers.
Eg.
If
then
echo "value1 is grater "
fi
This code is not working properly when i excuted with floating values or real numbers (13 Replies)
Discussion started by: padarthy
13 Replies
4. Shell Programming and Scripting
Hi All,
I'm trying to extract some floating point numbers from within some HTML code like this:
<TR><TD class='awrc'>Parse CPU to Parse Elapsd %:</TD><TD ALIGN='right' class='awrc'> 64.50</TD><TD class='awrc'>% Non-Parse CPU:</TD><TD ALIGN='right' class='awrc'> ... (2 Replies)
Discussion started by: pondlife
2 Replies
5. Shell Programming and Scripting
# if
> then
> echo "1"
> else
> echo "2"
> fi
-bash:
How can i compare floating point numbers inside statement? (15 Replies)
Discussion started by: proactiveaditya
15 Replies
6. Shell Programming and Scripting
How can we compare 2 floating point numbers in SHELL script? (11 Replies)
Discussion started by: dearanik
11 Replies
7. Shell Programming and Scripting
Hi I'm not using Korn93 but want to use floating point variable.
Is there any solution to do that ?
thx for help.
---------- Post updated at 02:28 PM ---------- Previous update was at 12:38 PM ----------
I have the following peace of code:
for n in `cat log.January.1.array`
do
... (3 Replies)
Discussion started by: presul
3 Replies
8. Programming
Hi guys
I have problem with my simple calculator, author of my book wrote
One way I tried is to test if one the inpur number is grater than zero, and then substatct
And my protptype function is
#include <stdio.h>
int main(void) {
float a, b , result;
... (11 Replies)
Discussion started by: solaris_user
11 Replies
9. UNIX for Dummies Questions & Answers
How do I use bash to add all the floating point numbers saved in a file like this?
490.47
244.61
263.07
131.59
246.81
115.20 (3 Replies)
Discussion started by: locoroco
3 Replies
10. Shell Programming and Scripting
I have the following code snippet in bash
if ]; then
minm=`echo "$diff" | bc`
fi
It works well for most of the cases. However lets say diff is -0.17 and minm is -0.0017. In such a case the comparison seems to fail. Is the correct way to compare a mixture of positive and... (12 Replies)
Discussion started by: ngabrani
12 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)