if [ $x == "A" ]; then
t=$[t+1];
a=$y;
elif [ $x == "B" ]; then
t=$[t+3];
b=$y;
elif [ $x == "C" ]; then
Below is the error i am getting
Code:
./test2.ksh[5]: ==: A test command parameter is not valid.
./test2.ksh[8]: ==: A test command parameter is not valid.
./test2.ksh[11]: ==: A test command parameter is not valid.
put variables $x in quotes
Code:
if [ "$x" == "A" ]; then
t=$[t+1];
a=$y;
elif [ "$x" == "B" ]; then
t=$[t+3];
b=$y;
elif [ "$x" == "C" ]; then
Hi all,
I need a logic in UNIX to append contents of a file in same row, where the original contents are found one below the other. For example.
My i/p file contains:
“user1”,”employee1”,”04/28/2009”
“5678”
“78”
“user2”,”employee2”,”04/30/2009”
I want my output... (8 Replies)
This is the code:
while test 1 -eq 1
do
read a
$a
if test $a = stop
then
break
fi
done
I read a command on every loop an execute it.
I check if the string equals the word stop to end the loop,but it say that I gave too many arguments to test.
For example echo hello.
Now the... (1 Reply)
Hi
I want to append line 2n to 2n-1 line where n=1...LastLine in my file.
eg:
Actual File:
Hello
Everyone
Welcome
TO Unix
I need
Your help
Required File:
HelloEveryone
WelcomeTO Unix
I needYour help (5 Replies)
Hi All
I will run the same script every day in corn and output should go to same CSV file but in different row with dates on it. Below is my example in attached format.
Script i am using to collect switch port online
DATE=`date '+%d-%m-%y'`
for f in `cat... (1 Reply)
Hi! Is there a way to append column and row header to a file in awk script.
For example if I have
Jane F 39 manager
Carlos M 40 system administrator
Sam F 20 programmer
and I want it to be
# name gend age occup
1 Jane F 39 manager
2 Carlos M ... (4 Replies)
I have a script that is inventorying (not sure if thats a word) my environment.
It goes out and pulls Hostname OS, IP, and ENV (dev, prod, etc)..then spits all that to a logfile
At the top of my script i have a check to see if the logfile exist.
] || touch $LOGFILE && echo "ENV" "\t"... (3 Replies)
Hi ALL,
We have requirement in a file, i have multiple rows.
Example below:
Input file rows
01,1,102319,0,0,70,26,U,1,331,000000113200000011920000001212
01,1,102319,0,1,80,20,U,1,241,00000059420000006021
I need my output file should be as mentioned below. Last field should split for... (4 Replies)
Discussion started by: kotra
4 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)