01-23-2013
It does not look like a valid shell variable. I guess it is a JAVA properties file.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
Could anyone please explain why we have arr=1 - what does this statement do?
awk -F\; 'FNR==NR{arr=1;next};$3 in arr' core.txt gmrd.txt
Any help appreciated (2 Replies)
Discussion started by: penfold
2 Replies
2. Shell Programming and Scripting
how does below tr command replace nonletters with newlines?
I think I understand tr -cs '\n' part.. but what is
A-Za-z\' <--- what is this??
tr -cs A-Za-z\' '\n' |
-c --complement
-s, --squeeze-repeats
replace each input sequence of a repeated character that is... (0 Replies)
Discussion started by: convenientstore
0 Replies
3. Shell Programming and Scripting
how does below tr command replace nonletters with newlines?
I think I understand tr -cs '\n' part.. but what is
A-Za-z\' <--- what is this??
tr -cs A-Za-z\' '\n' |
-c --complement
-s, --squeeze-repeats
replace each input sequence of a repeated character that is... (1 Reply)
Discussion started by: convenientstore
1 Replies
4. UNIX and Linux Applications
Hi am having a c pgm. It has the include files (unistd.h,sys/types.h,win.h,scr.h,curses.h,stdarg.h and color.h). I don't know the purpose of these include files. will u plz explain me. (1 Reply)
Discussion started by: Mari.kb
1 Replies
5. Shell Programming and Scripting
Hi
All,
Can anybody explain what this script is doing?
#!/bin/sh
who | cut -d " " -f1 | sort -u > userlist1
while true ; do
sleep 60
who | cut -d" " -f1 | sort -u >userlist2
for username in `cat userlist1` ; do
if ! grep "^$username$" userlist2 > /dev/null ; then
echo... (0 Replies)
Discussion started by: vishalpatel03
0 Replies
6. Shell Programming and Scripting
What does this part in the following code ?
if ; then
$t shows some time values for getting the response, but why .$t and what does the . after the !=
t=$(time -p wget --quiet --post-data='username=xxx&password=xxxx&id=xxxxxx' --no-check-certificate --output-document=/tmp/sms-status_out... (3 Replies)
Discussion started by: locutus01
3 Replies
7. UNIX for Dummies Questions & Answers
Its great someone provided this script that strips out a filename and extension but can someone explain how each line works?
file1='Jane Mid Doe.txt'
newfile='Jane.txt'
1) ext=${file1##*.}
2) filename=${file%%.???}
3) set -- $filename
4) newfile="1.$extension" (1 Reply)
Discussion started by: Lillyt
1 Replies
8. UNIX for Dummies Questions & Answers
Hi all
I am new to egrep can someone please explain me what does the below Statement do
egrep -v "^missing sales|^\
Thanks in advance
Sri
Please use next time code tags for your code and data (4 Replies)
Discussion started by: Sri3001
4 Replies
9. UNIX for Dummies Questions & Answers
Could anyone please advise what the in the following if statement means?
if ; then
Thank you. (2 Replies)
Discussion started by: jimbojames
2 Replies
10. Shell Programming and Scripting
Hi,
I need more explination on it, how it works
abcd="$(echo "$abcd" | sed 's/ //g')" >> ${LOGFILE} 2>&1
can any one suggest me on this?
Rgds,
LKR (1 Reply)
Discussion started by: lakshmanraok
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)