Hi,
I want to write bash script that will keep on looking for files in a directory and if any file exists, it processes them. I want it to be a background process, which keeps looking for files in a directory.
Is there any way to do that in bash script?
I can loop through all the files like... (4 Replies)
hello
i have a requirement where i have a direcotry in which i get files in the format
STOCKS.20080114.dat
STOCKS.20080115.dat
STOCKS.20080117.dat
STOCKS.20080118.dat
i need to loop through the directory and sort by create date descending order and i need to process the first file.
... (1 Reply)
Hi all,
Can somebody help me with this problem pls.
I need to extract one specific line from each files in a folder and put
the all lines extracted in a unique output file in the following format.
line extracted, respective name of file, date of file.
I´m, trying the part to extract... (3 Replies)
hi all
i have some files present in a directory
i want to loop through all the files in the directory
each time i loop
i should change the in_file parameter in the control file and load it into a table using sql loader
there is only one table where i have to load alll the files ... (3 Replies)
Hi,
I am new to unix and shell scripting,can anybody help me in sctipting a requirement.
my requirement is to get the latest directory the name of the directory will be like CSB.monthdate_time stamp
like CSB.Sep29_11:16 and CSB.Oct01_16:21.
i need to pick the latest directory.
in the... (15 Replies)
I was looking to get some help with copying files in one directory to another using a for-in loop. My script file is called copyfile and here is what I have:
for file in $(ls -a $1)
do
cp $file ~/dir-2
done
When I run copyfile dir-1 this is what I get
cp: omitting directory `.'... (1 Reply)
Hi,
I would like to write a loop to change the names of files in a directory. The files are called data1.txt through data1000.txt. I'd like to change their names to a1.txt through a1000.txt. How do I go about doing that? Thanks! (2 Replies)
I am trying to loop through files in a directory, and sort each file. No matter what changes I make to the code, I get the following errors:
'aunch.sh: line 4: syntax error near unexpected token `do
'aunch.sh: line 4: `for f in ${FILES}/*; do
#!/bin/bash
FILES=$(pwd)
for f in ${FILES}/*;... (1 Reply)
I am trying to loop through files in a directory, and sort each file. No matter what changes I make to the code, I get the following errors:
'aunch.sh: line 4: syntax error near unexpected token `do
'aunch.sh: line 4: `for f in ${FILES}/*; do
#!/bin/bash
FILES=$(pwd)
for f in ${FILES}/*;... (6 Replies)
I have one question.
On the directory I have many files start with
DB.DAILYxxxxxxx.YYYYMMDD.HHMMSS
and I have several files with other format, like
LET.20170310
daily.20170310
tba.20170310
How can I exclude from my loop DB.DAILY files?
I tried
ls *20170310* | while read... (4 Replies)
Discussion started by: digioleg54
4 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)