hi all,
i am new to unix. Actually i need to compare two string and print the result...
suppose type='sun'
if; then
echo good morning
else
echo good night
fi
whether the comparison is right r we need to use eq????
help me please.... :confused:
thanks in advance.... (1 Reply)
hello
I want to do a pattern match for string in the if statement, but I am not sure how to use regex inside the if statement.
I am looking for something like this:
if {2,3} ]; then
.....
....
...
fi (7 Replies)
Hi all,
I am trying to compare two strings/dates, but its throwing error::Syntax error at line 5:
Please help !!
Any alternate way to compare two dates is also fine....
logdate1=`date -u '+%Y.%m.%d %T'`
sleep 5
logdate2=`date -u '+%Y.%m.%d %T'`
if test... (5 Replies)
I iterate in string list well but when I try to add a case statement in order to wrap the string value in a more accurate message I faced different problems.
#Code starts
ST_CODES="CN CU BU CQ LE"
for ST_CODE in $ST_CODES
do
#echo $ST_CODE
CODE="$ST_CODE""\n"
... (3 Replies)
Hi,
Here is my script
#!/bin/ksh
echo $pick_typ
if ];then
echo "inside if"
else
echo "outside if"
fi
when ever i pass CUS as parameter to this script am getting the correct value CUS, however if i pass ORD as parameter it is not coming inside if it is echoing else "Outside... (12 Replies)
Hello , I want to Compare with 2 strings and get if they are True or not
please would like some help on this
#!bin/ksh
echo "Enter Name 1"
read Name1
echo "Enter Name 2"
read Name2
echo "------------------------"
echo "First Name: $Name1"
echo "Second Name: $Name2"
echo... (25 Replies)
hi..
i have a problem to compare two string
my code is like that
if ]
then
echo "both data are correct"
elif ]
echo "data is wrong"
fi
here $username1 is taking value from file.. (7 Replies)
I have 2 values V_1_4_4_b1 and V_1_5_1_RC_b1. I would need to compare them and determine if the 1st value is greater, less or equal
than the 2nd value. The result should need to have a return value.
I have below code in bash function but it seems it is not comparing it correctly. Any help will... (8 Replies)
I think there is a way to detect mouse movement.
valuator changes if the mouse moves.
So I need to compare the two strings.
Not sure how to do that.
How could I send the valuator string to a file ?
I would need to do it twice.
andy@7_~/Downloads$ xinput query-state 9
2 classes :... (7 Replies)
Discussion started by: drew77
7 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)