10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I am trying to compare/confirm the output of an script using the perl below, which does execute. However I can not seem to print $1 and $2 in each line of the input separated by a tab in each line of the output. The input file is quite large so I have only included a portion, but the format is the... (0 Replies)
Discussion started by: cmccabe
0 Replies
2. Shell Programming and Scripting
What would be the best way to store the name of an extracted file from a tar to a text file?
I want to extract one file from a tar and store the name of the extracted file to a temp file.
tar -xvf tar_file.tar file_to_be_extracted (1 Reply)
Discussion started by: erin00
1 Replies
3. Shell Programming and Scripting
Hi,
Please excuse for posting new thread on control characters,
I am facing some difficulties in removing the control character from a file extracted from top command,
i am able to see control characters using more command and in vi mode, through cat control characters are not visible ... (8 Replies)
Discussion started by: karthikram
8 Replies
4. UNIX for Dummies Questions & Answers
I need to extract a ,rar file and getting the below error while using
unrar e filename.rar
error: ksh: unrar: not found.
I guess I need to install unrar. please let me know how to install unrar.
my os is -
SunOS e08k24 5.10 Generic_141444-09 sun4u sparc SUNW,Sun-Fire-880 (1 Reply)
Discussion started by: lohithsunny
1 Replies
5. Shell Programming and Scripting
Hi,
I have two .rar files on unix server.
but how to unrar these files ?? (6 Replies)
Discussion started by: milink
6 Replies
6. Shell Programming and Scripting
I've written the script below to merge only .txt files that exist in one directory into one huge .txt file and ignore other files with other extensions.
now the result is one huge .txt file with all the contents of other .txt files
how can i add a File Name as a comment before each file?
... (12 Replies)
Discussion started by: miss_dodi
12 Replies
7. Shell Programming and Scripting
I am not a programer so I need a litle help here.
On linux I have installed unrar.
What I need is a script which will unrar all rar files in folders and subfolders and subfolders of subfolders, then check this files which are unpacked and then delete this rar files if check is ok.
If someone can... (2 Replies)
Discussion started by: blisk
2 Replies
8. Shell Programming and Scripting
I am trying to run a script called install.sh as follows:
I get a jar file, and extract it using the command:
unzip filename.jar -D path/to/files
then I navigate to that directory where I extracted the files, and run the command:
sh install.sh
(where install.sh is one of the files... (12 Replies)
Discussion started by: albert_newton
12 Replies
9. UNIX for Dummies Questions & Answers
Hi,
I have been trying to shoot an email with the email body to be obtained from a file.
Can someone please help me with it..
I have been trying to use the MAILX commad for the same.
mailx -s "test email" -r sender@test.com < file.txt
but it sends the file as an attachment,while i... (3 Replies)
Discussion started by: rohit.shetty84
3 Replies
10. UNIX Desktop Questions & Answers
i want know how to compress and uncompress file using unix,
compress uncompress,zip,unzip,rar,unrar,how its work and more about this.:confused: (1 Reply)
Discussion started by: ismael xavier
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)