What is the command for search the program name from the entire directory (all directories in the unix box, means including sub directories...) (2 Replies)
I'm trying to get a case statement to start over if an undefined option is selected... But I am ata loss on how to actually do it.
Here is a quick example of what I have.
Echo "1) do this/n
2) Do that/n
3) Quit/n
Make a selection/n"
Read answer
Case answer in
1) Dothid;;
2) Dothat;;... (3 Replies)
Is there a command (like ls -l) to get the file time stamp including seconds? The ls -l gives only the HH:MM, No SS
I don't have a C compiler to call stat()
I don't a command like stat too.
Please help. (8 Replies)
Hi,
Is it possible for me to include the results from a command in the subject line? What I am looking to do is get the file count and include it into the subject line as well as the list of files in the body.
Example Subject line: Currently 25 files in directory
My Code:
#!/bin/ksh
cd... (2 Replies)
I am writing a bash script that asks the user for input and I need it to repeat until the user selects quit.. I dont know how to write the loop for it I searched all over but i still do not get it.. if anyone could help with this it would be greatly apprciated here is my script so far:
#!... (2 Replies)
hello,
I would like to do exit at the end ie list all errors before exiting
How to put the token exit in a variable with a loop ?
Thanks
function g1 () {
case "$1" in
(-0-0 | -0-1 | -0-2 | -0-3 | -1-0 | -1-1 | -1-2 | -1-3)
# nothing, OK !
;;
(*)
echo 'Fatal, $1 = '"'$1'"', Date... (9 Replies)
I have the following awk statement that computes rank of a column and sorts it based on rank.
sort -k6 -n file | awk '$6 != prev { rank = NR }{ print $1, $6, rank ; prev = $6 }'
I need the above code to accept variables for the column in the sort statement ("-k6").
Is there a better... (6 Replies)
How can I merge the move statements with the "FOR" loop to do a move of a file right after it zips it and not wait until all of the files are zipped to move all outisde the for loop.
Here is my current code:
for file in `ls -rt $svdumpdir/* | grep -v '.gz$' | grep '.gtt$' `
do
echo... (8 Replies)
Hi All,
select app from the menu:
ABC
DEF
GHI
JKL
ALL # ALL will select all the apps in the menu
echo "Enter your option"
read option;
if
then
<execute the below command>
elif # option is the 1 selection from menu...not ALL
<execute the below command>
else (14 Replies)
Hello All,
I want to print data in between two lines in a file sample.txt through more or cat command on the screen. For that I am using below sed command to give the BEGIN and END text.
Content of sample.txt
server01:~ # cat /proc/mdstat
Hello this is a text message 1
Hello this is a... (5 Replies)
Discussion started by: Xtreme
5 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)