08-27-2009
9 More Discussions You Might Find Interesting
1. Programming
I have a structure which contains n number of elements. For example:
stFruits : apple, grapes, strawberry, pear, kiwi, melon, papaya, mango, orange, sweetlime ..... etc
Now i have to write a for loop as follows:
int i;
int j;
j=stFruits.apple+stFruits.grapes+stFruits.pear+.... and so... (3 Replies)
Discussion started by: jazz
3 Replies
2. Shell Programming and Scripting
Hi,
I am running a Java program from a unix script. I need to pass a variable to the Java code from a file. Here are teh details:
cat Parm <<this is my Parameter file>>
queuename=queue1
and my shell script is :
#!/bin/ksh
. ./Parm
/opt/java1.5/bin/java -classpath ./java.jar... (1 Reply)
Discussion started by: sangharsh
1 Replies
3. Shell Programming and Scripting
I'm creating a script that asks a user for a variable
ex
read filename;
read numberinput;
I also have a bunch of files named file.0 file.1 ... file.55
I'm trying to delete all files (if they exist) about file.$numberinput.
Can someone help me out on how to include the variable as part... (6 Replies)
Discussion started by: jenix4545
6 Replies
4. Solaris
I have 3 variables with different information.. they look like this (row-wise aswell):
Variable1 =
Roland
Kalle
Dalius
Variable2 =
ake123
ler321
kaf434
Variable3 =
Richardsen
Sworden
Lokthar
How can I sort them by variable3 alphabetical and add them into the same output so... (0 Replies)
Discussion started by: Prantare
0 Replies
5. Shell Programming and Scripting
Hi.
I have a for loop that I use to extract integer values in a shell script (ksh). Now, I would like to add the values. My preference, from my c programming days, would be to do something like the commented out line below in the for loop. However, this is not recognised. So I use the line... (2 Replies)
Discussion started by: mikem22
2 Replies
6. UNIX for Dummies Questions & Answers
oopps! I Meant "Define Variables within a UNIX Script"
What would be the best way to define a variable in a unix shell script so anyone who views this script doesn't know what value is assigned to that variable.
some other location...
a="/usr/lib/fileA"
Unix script...
sed... (5 Replies)
Discussion started by: macastor
5 Replies
7. Shell Programming and Scripting
Hi All,
I am using ETL tool Datastage and is installed on Linux environment. Few environment variables are set in datastage. Now my requirement is to use those environment variables in a unix script.
Is there any option I can do it?
Sugeestions from people working on datastage and linux... (1 Reply)
Discussion started by: bghosh
1 Replies
8. UNIX for Dummies Questions & Answers
Hello,
I want to add a letter to the end of a string if it repeats in a column.
so if I have a file like this:
DOG001
DOG0023
DOG004
DOG001
DOG0023
DOG001
the output should look like this:
DOG001-a
DOG0023-a
DOG004
DOG001-b (15 Replies)
Discussion started by: verse123
15 Replies
9. Windows & DOS: Issues & Discussions
So, I have this command:
mkdir rolled
for %%x in (*gif) do convert %%x -roll +2+6 %%x|move %%x rolled
I'd like to have the +2 and +6 accumulate here.
In each new gif tackled, it should increase by the amount: +2 (for x) and +6 (for y)
Is this possible?
I'm on Windows, DOS. (0 Replies)
Discussion started by: pasc
0 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)