10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
is there any way to align my text so every column begins on the same line as the previous line?
here's my command:
printf "THEN ( ${SEARCHPATTB} = Hour = ${CALTOTB} ) %8s => %8s NOW ( ${SEARCHPATT} = Hour = ${CALTOT} ) %7s => %7s Reduced By: %7s -${RESULT}"\\n
output i'm currently getting... (2 Replies)
Discussion started by: SkySmart
2 Replies
2. Shell Programming and Scripting
Hi there
I have the following code
SDFFILE_SRC=$BACKEND_DIR/$SDFFILE_MIN_tar
SDFFILE_DST=$SIM_DIR/$SDFFILE_MIN
if ]
....
....
....
fi
Simply I need to check if $SDFFILE_SRC isa newer than $SDFFILE_DST or $SDFFILE_DST does not exist then execute the IF Body.
Although the the... (2 Replies)
Discussion started by: aelhosiny
2 Replies
3. Post Here to Contact Site Administrators and Moderators
Can you add hover texts (alt-texts) to icons? It is not always obvious what each of them mean just by looking at them. Sometimes it is clear from the url it points to, but for accessibility reasons alone it would be good to have alt-texts as a standard. (1 Reply)
Discussion started by: figaro
1 Replies
4. UNIX for Dummies Questions & Answers
Hi,
I have a file with texts shown below,
<2013 abc
<2013 start
request pdu
dot1q
end pdu
response pdu
dot1q
end pdu
am searching for the text "dot1q" , when it matches in the file , i need the contents between "<2013 start" and "end pdu". Can some one help on this ?
... (5 Replies)
Discussion started by: giri_luck
5 Replies
5. UNIX for Dummies Questions & Answers
Hi.
I'm new here, and I'm trying to enter this big world of unix.
I would like to know how can I install a SSH server for free so I can teste some things, like make a file, change files, rename and things like this?
If is there any easy way to test all commands it would be interesting too.
... (10 Replies)
Discussion started by: whity
10 Replies
6. Shell Programming and Scripting
Hi,
I want to concatenate the texts in the file but there are different scenario's.
Ist Scenario.
The contents of file has id`language,sequence number,text,language
Here id`language is a key pair to identify the correct language.
Sequnce number is the order the text being inserted.
Text... (3 Replies)
Discussion started by: vanitham
3 Replies
7. Shell Programming and Scripting
Hello,
I have two files:
File1:
a
b
c
d
File2:
b
c
e
I need 'e' as output....
Thanks..
---------- Post updated at 12:16 PM ---------- Previous update was at 12:15 PM ---------- (1 Reply)
Discussion started by: shekhar2010us
1 Replies
8. Shell Programming and Scripting
I need
1. to find all the files from a Folder "folder_name" and from its 4 or 5 sub folders which contain a certain pattern "pattern1".
2. from these files copy and merge all the text between "pattern1" and another different pattern "pattern2" to "mergefile".
3. Get rid of every html tag.
4.... (3 Replies)
Discussion started by: mjomba
3 Replies
9. Shell Programming and Scripting
How to check weather a string is like test* or test* ot *test* in if condition (5 Replies)
Discussion started by: johnjerome
5 Replies
10. Shell Programming and Scripting
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)
Discussion started by: Max89
1 Replies
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)