10-20-2009
KK, thxz anyways for the time.
~H
7 More Discussions You Might Find Interesting
1. UNIX Desktop Questions & Answers
How can I set up the profile for a use so when entering a eg first charachter of a file and then pressing the tab OS will complete the file name.
Thanks in advance Tom (4 Replies)
Discussion started by: Tom_Zamani
4 Replies
2. UNIX for Dummies Questions & Answers
Hi all, This is my first post.
I am a complete noobie to the UNIX OS, I have an iMac G5 with the unix shell built in and am interested in learning how to use it to do things useful with it, but have no idea where to start. I have read over the basic commands but they haven't helped me much yet.... (3 Replies)
Discussion started by: avdrummerboy
3 Replies
3. Shell Programming and Scripting
Hi All,
I need some help to complete the below script, after executing below script blank lines are coming, but i am expecting 4 digit numeric no. Please solve the issue ASAP.
function portno
{
while (true)
do
random=`echo $RANDOM | cut -c 1-4`
port=`netstat -a | grep -c $random`
... (5 Replies)
Discussion started by: sridhusha
5 Replies
4. UNIX for Dummies Questions & Answers
Hi,
Does anyone know how to make BASH provide a list of possible completions on the first tab, and then start cycling through the possibilites on the next tab?
Right now this is what I have in my .bashrc:
bind "set show-all-if-ambiguous on"
bind \\C-o:menu-complete
This allows... (0 Replies)
Discussion started by: Mithu
0 Replies
5. UNIX for Dummies Questions & Answers
Hello Guys
I am a complete New bie in UNIX ( Just know a few of the commands ). Please guide how should I learn Unix In a proper way . I am doing a job, so i will have to do the study at home . Which books , Links, Pages you will suggest me so that i can learn UNIX fast .
Thanks (5 Replies)
Discussion started by: supercops
5 Replies
6. Homework & Coursework Questions
I have the following piece of codes. Please explain it to me in great detail how are these codes working.
1. #include <stdio.h>
int main(){
int x;
x=0;
while (x<2 && fork()){
if (!fork()) execlp("echo","x++","x",0);
x++;
system("echo x+x");
}
}
2.
#include <stdio.h>
int i;... (1 Reply)
Discussion started by: prakashabii
1 Replies
7. Post Here to Contact Site Administrators and Moderators
In general, would most experts, moderators and programmers, like to see the original entire script (even if very long), or just a simplified version of the problematic parts?
I currently have a GNU bash function (with a lot of issues). Is it more advisable to make separate posts for each... (3 Replies)
Discussion started by: AlphaLexman
3 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)