04-26-2012
Hi sagar,
Did you understand the actual problem with your original script that is pointed out by rbatte1?
OK
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
In Unix script, how to get a "date - 1" ie, yesterday? (4 Replies)
Discussion started by: AC
4 Replies
2. Solaris
Hi all,
I have in one script something like this:
FIRSTOCC=`grep -n ORA- alert_bill2.log |tail -"$ROWS"|head -1|cut -d: -f1`
TOTAL=`more alert*|wc -l`
DIFFERENCE=`$TOTAL-$FIRSTOCC`
echo Total lines in alert_bill = $TOTAL
echo $DIFFERENCE
How do I make this substraction work?
Thk (2 Replies)
Discussion started by: mclaudiu
2 Replies
3. AIX
1) when user login to the server the session got colosed. How will resolve?
2) While firing the command ls -l we are not able to see the any files in the director. but over all view the file system using the command df -g it is showing 91% used. what will be the problem?
Thanks in advance. (1 Reply)
Discussion started by: pernasivam
1 Replies
4. Shell Programming and Scripting
hello
i have obtained the current date ..
current_date=date "+%m/%d%y"
and i have another date ,stored in my log file which i have already retrieved. i want to store the subtraction in a varible called diff.
diff=log_date - currentdate
ex: log_date=01/28/11
current_date=... (3 Replies)
Discussion started by: urfrnddpk
3 Replies
5. Shell Programming and Scripting
count=`cat /filecount.txt | tail -1 |head -1| awk '{print $1}'`
exact_count=`expr $value \* 24`
i want to subtract a="$exact_count" - "$count"
but its not taking o/p of "count" as number
$a is wrong answer
hence not getting proper output.
plz help me out
:confused:
Please use... (3 Replies)
Discussion started by: sagar_1986
3 Replies
6. Shell Programming and Scripting
I want to try solving system of linear algebraic equations in Shell bash but i have any problems Value input is matrix and I dont know how to input matrix in Shell because that is dont support 2-dimensional array Please help me. Thank you so much (3 Replies)
Discussion started by: newbieseos
3 Replies
7. Shell Programming and Scripting
Hello friends,
I am new on linux, i am facing issues on below script.
#!/bin/sh
current=1355147377
echo $current
last_modified=1354537347
echo $last_modified
DIFF='expr ($current - $last_modified)'
echo $DIFF
Please view this code tag video for how to use code tags when posting... (8 Replies)
Discussion started by: sanjay833i
8 Replies
8. Shell Programming and Scripting
Hi everyone,
I am trying to write a bash script which reads a data file and does some algebraic operations.
here is the structure of data.xml file that I have;
1 <data>
2 .
3 .
4 .
5 </data>
6 <data>
7 .
8 .
9 .
10</data>
etc.
Each data block contains same number of lines (say... (4 Replies)
Discussion started by: hayreter
4 Replies
9. Shell Programming and Scripting
I have 2 files:
file1.txt contains
/html/mybook/Charts/143712/reptiles.pdf
/html/mybook/Charts/198459/spices.pdf
/html/mybook/Charts/198459/fresh_nuts.pdf
/html/mybook/Charts/123457/dome_anim.pdf
/html/mybook/Charts/123457/vegetables.pdf
/html/content/3DInteractive/174091/CSPSGGB.html
... (6 Replies)
Discussion started by: Jojan Paul
6 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)