I am using solaris 5.10 environment and need help on doing parallel increment of nested for loop.
Samples
definitely there will be equal amount of records in both variable a & b. based on the file availability in the corresponding path in variable b, i need to choose the corresponding path from variable a.
say for example *"$x".txt file was available in the path /xyz/sd/fd3 (3rd iteration) i need to choose the corresponding path (/xyz/pg/as3) from variable a for further processing.
Hi Guys,
My first post..:)
Right...I want to move existing files (with some date in their name) currently in $mainftp, to $mainfolder/$foldate/system1.
I'd like to be able to increment date in the for loop? Is this possible or should I use a different technique.
The script return the... (4 Replies)
Hi ,
I am trying to increment the nested for loops parellely,but i cant ,i used continue 2 but the second loop not getting increment.
no1="1 6 5 4 8"
no2="4 7 8 0 1"
for var1 in $no1 ; do
for var2 in $no2 ; do
line1
line 2
line 3
continue 2
done
done
Please help on this (4 Replies)
Hello men.
How can i build a simple increment for $a by Xquery such as ?
let $a := 0
for $i in (1 to 10)
let $a := $a + 1
return $a
why a in this loop always is '1'
Thank you for reading, its will really helpful for my job if i can solve this problem :D:D (3 Replies)
Hi Team,
I just want to check whether my nested if loop used is correct or not.
if ]
if ]
export1
else
export2
fi
else
if ]
export3
else
export4
fi
fi
Thanks
Shiva (5 Replies)
Daily stupid question. I want to increment the file name everytime the script is run. So for example if the filename is manager.log and I run the script, I want the next sequence to be manager.log1. So to be clear I only want it to increment when the script is executed. So
./script... (10 Replies)
I created script (sh shell) to generate vlc playlist based on some data files. All works fine so far except one string I do not know how to handle with.
VLCSTART='<vlc:id>'
VLCV=0
VLCEND='</vlc:id>'
echo -e $'\n'$'\t'$'\t'$'\t'$'\t'\$VLCSTART$VLCV$VLCENDOutput file contains several occurences... (10 Replies)
I am trying to have the below batch file do following two things:
1. only allow the values YES,yes,Y,y, or NO,no,N,n
2. increment the counter %var1 only if answer to question 2 is "y" and not able to get the syntax correct. If %var1%=1 then I am trying to display function :end. Thank you :).... (0 Replies)
Discussion started by: cmccabe
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)