Hi
I have something like
cat $HOME/all_dirs | while read ln_old_dirs
do
if
then
echo "$ln_all_old_dirs"
fi
done
As you know that the variable ln_all_old_dirs is not accessable from outside the... (2 Replies)
Hi,
I am using the following command to initialize and array
# arr=ffffff00
# echo $arr
ffffff00
my requirement is i want to fetch the one by one character from array.
I don't know how to fetch one by one charcter from array.
Please i need an help.
Thank you very much
Ravi R N (2 Replies)
I want to read $3,$4,$5,$6,$7 of fileA in array and when
fileb $1 = fileA $4
the i want to print array and few fields from fileB.
This should work but has some syntax error.
nawk -F, 'FNR==NR{a=;next} a{print a}' fileB fileA
Appreciate if someone can correct this. (2 Replies)
I have a file that is a text file, how to get all the words into and array, i am able to get each line but not each word :(.
Here is what i searched and already found...https://www.unix.com/shell-programming-scripting/99207-pipe-text-file-into-array.html.
This one reads a whole line into... (6 Replies)
I have this portion of a script and it works:
base_config="A B C D E"
for field in $base_config
do
var=`echo $field`
((i=$i+1))
done
I get an array of var=A, var=B, and so on.
What if I have this example with white space and want to put it into an array while... (1 Reply)
set -A title
set -A author
count=1
index=0
while
do
read -A ${title}?"Booktitle: "
read -A ${author}?"Author(s): "
(( count = count + 1 ))
(( index = index + 1 ))
done
Hi... (1 Reply)
I have some version problem to use this code in my server
while read line; do
read -A array <<<$line <---------- the server dont read <<<
n=${#array}
for ((i=1;i<$n;i++)); do
print "${array}"
done
func=${array}
data1=${array}
data2=${array}
... (1 Reply)
Hi,
I need to read a file into array and print them in a loop:-
1st file :-cat a.txt
RC1
RC2
RC3
RC4
My Program:-
#!/bin/ksh
index=0
while
do
read cnt<a.txt
print "cnt value is ${cnt}
index=`expr $index + 1`
done
Code tags for code, please. (5 Replies)
Hi I have a file with contents as below :
server | ABC Issue : File System Missing XYZ Issue : Wrong Syntax PQR Issue : Old File to be removed
Now I am looking for an o/p similar to
server <tab> ABC Issue : File System Missing
<tab> XYZ Issue : Wrong Syntax
<tab>... (4 Replies)
Hi All,
need help with reading the array and sum of the array elements.
given an array of integers of size N . You need to print the sum of the elements in the array, keeping in mind that some of those integers may be quite large.
Input Format
The first line of the input consists of an... (1 Reply)
Discussion started by: nishantrefound
1 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)