hi there
can anyone tell me how to search and copy files under unix?
im writing shell scripts with 'vi' and 'pico'
something like
read directoryName
if
then
echo Copying the files
copy those *.src files to sub1(another directory) using cp
else
... (4 Replies)
I need to concatenate files that are inside a directory and subdirectories. Those files end with .c
Can anyone help me
I am using comand 9find) and (cat) but they don't work together.:confused: (1 Reply)
Hi,
I have a file
/db01/dat/march 2006/7001DW06.03B
Please note, between "march 2006" there is a space/tab.
While running the following script, it identifies
/db01/dat/march ----> as first file
2006/7001DW06.03B ---> as second file.
SRC_PATH = /db01/dat
SEARCH_FILENAME =... (12 Replies)
Hi,
This question may be quite newbish.
I've stored a few files on my Unix system and am wondering how to search for their contents (i.e. I input the keyword and get a list of files with this keyword)
I'd then like to put it on my website (php).
I thought of find and grep, but am not... (19 Replies)
hi there,
im writing some script in awk; in few words i have a list from router (mac address- ip address) and the second list with only the mac addresses.
the thing is that i want search list from router for the first mac address; if found - print the ip address, if not print error; then search... (1 Reply)
Hello All,
i have to search a pattern in all the files in all subfolders that are present in current directory.
suppose i am in d1 directory and in that sd1,sd2,sd3 are subdirectories.
in
sd1 i have files f1,f2
sd2 i have files f3,f4
sd3 i have file f5
i have to list out all those... (4 Replies)
I have a list of files in directory and i should write a script if any of these files contains words given in a text file test.txt. the words can be case ignored and word should match.
The output should be the name of the directory in which the file is present followed by list of file names
Eg:... (1 Reply)
Hi, I have the following command to list files beginning with a specific name and containing some text...
find . -type f -name "dm_merge_domain_adm*" -exec grep -il "Error Message:" '{}' \; -print|xargs ls -ltr
It works fine, but seems to list two of each file, when they only exist once...any... (1 Reply)
I have a list of pattern in a file, I want each of these pattern been searched from 4 files. I was wondering this can be done in SED / AWK.
say my 4 files to be searched are
> cat f1
abc/x(12) 1
abc/x 3
cde 2
zzz 3
fdf 4
> cat f2
fdf 4
cde 3
abc 2... (6 Replies)
Discussion started by: novice_man
6 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)