09-07-2011
And what exactly do you mean by "it does not help"?
9 More Discussions You Might Find Interesting
1. UNIX for Advanced & Expert Users
Hi guys,
I have few files on my laptop. I am connected to a network called 'asx'(intranet). I have ssh2 and reflections on my system. I need to copy these few files from my system to a folder on the server(called 'CSSX').
Please can anyone explain me how to acheive this? I am new to UNIX and... (4 Replies)
Discussion started by: uniksbro
4 Replies
2. Shell Programming and Scripting
Hello,
I have to move all files, except one, from one directory to another. I tried it with mv and find:
mv -f $(find $SOURCE -maxdepth 1 ! -name "FileNotToMove") $TARGET
It nearly worked out, but unfortunately not only the content of the $SOURCE directory got moved, but also the directory... (4 Replies)
Discussion started by: Kim Walisch
4 Replies
3. UNIX for Dummies Questions & Answers
I have multiple file with names
april.0001.frm.edi
april.0002.frm.edi
I created a list with all the file names which has "860" inside the file and named the list as april-860-list
I need to move all the files to name
CHRY.860.01
CHRY.860.02
from that list.
How do I do that?
I... (3 Replies)
Discussion started by: yshahiac
3 Replies
4. Shell Programming and Scripting
Hi,
I am a newbie to shell scripting. here is my objective:
1)The shell program should take 2 parameters - ie-> DestinationFolder, WebFolder
2)Destination folder contains few files that has to has be verified and deleted.
3)WebFolder is a folder containing a list of master files
4)It... (1 Reply)
Discussion started by: sandhyagupta
1 Replies
5. UNIX for Dummies Questions & Answers
I know I can use an ls -l junk1 command to get a listing of all files in the directory junk1, but I was wondering how I'd go about going through the files in junk1 in a for-in loop and issuing the ls -l command on them one by one.
This is what I have so far:
for file in $(ls -a $1)
do
ls... (1 Reply)
Discussion started by: Trinimini
1 Replies
6. Shell Programming and Scripting
I would like to transfer all files ending with .log from /tmp and to /tmp/archive (using find )
The directory structure looks like :-
/tmp
a.log
b.log
c.log
/abcd
d.log
e.log
When I tried the following command , it movies all the log files... (8 Replies)
Discussion started by: frintocf
8 Replies
7. Shell Programming and Scripting
I want to move all files from one directory to another directory excluding today (sysdate files) on daily basis.
file name is in pattern file_2013031801, file_2013031802 etc (2 Replies)
Discussion started by: khattak
2 Replies
8. Shell Programming and Scripting
Hey guys,
I have wrote the following script to apply a module named "trinity" on my files. (it takes two input files and spit a trinity.fasta as output)
#!/bin/bash -l
#SBATCH -p node
#SBATCH -A <projectID>
#SBATCH -n 16
#SBATCH -t 7-00:00:00
#SBATCH --mem=128GB
#SBATCH --mail-type=ALL... (1 Reply)
Discussion started by: @man
1 Replies
9. Shell Programming and Scripting
Hello,
First time poster. I am looking for a way to script or program the process of moving files from one folder to another, automatically, based on the count of files in the destination folder.
I was thinking a shell script would work, but am open to the suggestions of the experts... (6 Replies)
Discussion started by: comtech
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)