11-25-2009
Hi,
This is Pushpa. I have registered few minutes ago. I don't know how to post question to this Forum. Can you please help me for this.
Thank you,
Pushpa.
10 More Discussions You Might Find Interesting
1. UNIX and Linux Applications
I have been using a procmail recipe for some time. I successfully include numerous INCLUDERC files. However, since each of these include files have become rather large over time, I started to try to organize better.
So where procmailrc once just had:
INCLUDERC=$PMDIR/original-filters.rc
... (0 Replies)
Discussion started by: BostonDriver
0 Replies
2. Shell Programming and Scripting
Hi to all.
I'm trying to sort this with the Unix command sort.
user1:12345678:3.5:2.5:8:1:2:3
user2:12345679:4.5:3.5:8:1:3:2
user3:12345687:5.5:2.5:6:1:3:2
user4:12345670:5.5:2.5:5:3:2:1
user5:12345671:2.5:5.5:7:2:3:1
I need to get this:
user3:12345687:5.5:2.5:6:1:3:2... (7 Replies)
Discussion started by: daniel.gbaena
7 Replies
3. Shell Programming and Scripting
#! /bin/csh
set pattern = ""
set deli = |
foreach i ( `cat pattern`)
set pattern = "$pattern$deli$i"
end
all i want to accomplish is create a string a|b|c, but instead I got an invalid null command error,
thanks for your help (1 Reply)
Discussion started by: jdsignature88
1 Replies
4. Shell Programming and Scripting
hi,
i have to put in my script a command that should tell me if the contents of two different paths are the same.
I thought to write an "if" command who makes the diff of two files which contains the `ls` of the folders and go on with the script if is not null, but i'm afraid of the fact... (13 Replies)
Discussion started by: zangarules
13 Replies
5. Shell Programming and Scripting
Hello Everybody :) !!!. i have question in mind, is it possible to sort a list of hexadecimal numbers using "sort" command? (9 Replies)
Discussion started by: Kesavan
9 Replies
6. Red Hat
Hi ,
On my box everything works fine. But whenever I run command
It returns nothing as you see @(none) too.
Its very strange issue I have never noticed on any other system yet.
Any one have any idea about this.
Thank you (2 Replies)
Discussion started by: pratapsingh
2 Replies
7. UNIX for Advanced & Expert Users
Why does this not work?
echo 'find / -iname \'*katt*\' -size +500M 2>/dev/null'
How does this work? I have 5 single quotes. I though you needed an even amount of single quotes.
echo 'find / -iname \'*katt*\' -size +500M 2>/dev/null''
What is the trick to make it work with an alias? This... (4 Replies)
Discussion started by: cokedude
4 Replies
8. Shell Programming and Scripting
Hello everyone
I am doing a join command. Obviously, before I need two files sorted first. ( Both files have headers and have about 2 million lines each one )
The problem is, one of the files has null values in the key to sort (which is the first filed ). For example I have the original... (4 Replies)
Discussion started by: viktor1985
4 Replies
9. Shell Programming and Scripting
Hi,
I have this script which gives me output as Invalid null command
set recent_file=`grep '^-.*xlsx$' $FTP_LOG |\
sed -e 's/Jan/1/g' \
-e 's/Feb/2/g' \
-e 's/Mar/3/g' \
-e... (6 Replies)
Discussion started by: juzz4fun
6 Replies
10. Shell Programming and Scripting
I am using ISQL command in ksh script.
Suppose if i get NULL value from the query which i run,how can i handle it?
I am getting a NULL result set and the following error is coming.
############### output of isql command for getting the sum of JEs ################
-----------
NULL... (4 Replies)
Discussion started by: Sharma331
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)