07-19-2010
IMG* is a wild card resulting more than 1 value. Try the following.
Quote:
#!/bin/sh
# Get the files:
FILES=`ls -1`
for FILENAME in $FILES
do
if [substr($FILENAME, 0, 3) = 'IMG' ]; then
---
---
--
done
8 More Discussions You Might Find Interesting
1. Programming
I am trying to learn how to use multiple modules and hearder files. I have tried a little experiment but cannot get it to work. Here is my code and compilation attempt. Any help with finding my problems appreciated.
The main function (main01.c) calls a function located in another file... (9 Replies)
Discussion started by: enuenu
9 Replies
2. Shell Programming and Scripting
How to make this script?
1. Write a portable bash shell script called change_password.bash that will
prompt the user for a password. Use a series of if statements to test if:
1.
The password is NOT 6 or more characters
2.
The password does not contain at least 3 consecutive letters... (1 Reply)
Discussion started by: 3junior
1 Replies
3. UNIX for Dummies Questions & Answers
Alright i'm having problems with this loop. Basically once the script is ran a parameter is required. Once entering the parameter it displays that in LIMIT. Alright so now the problem, I need my loop to ask my user for a number, and if that number is less than the limit then sum the input values... (4 Replies)
Discussion started by: tragic54
4 Replies
4. Shell Programming and Scripting
Hello Friends,
I am learning Perl now. I have a small query.
I have a directory Z with file name Z.txt.
I would like to copy this file Z.txt to 3 new dir with new filenames as follows
dir 1 1.txt
dir 2 2.txt
dir 3 3.txt
I would like to then open 1.txt from dir 1 and edit the first... (0 Replies)
Discussion started by: ramesh54
0 Replies
5. UNIX for Dummies Questions & Answers
Hello all
I am having problems using a bash script to read the input from the user and checking that its a valid number. I only want the user to input a maximum of a 3 number string (321 , 521 , 871 etc.). Anything longer or that includes a chararcter or symbol will display an error message.
... (8 Replies)
Discussion started by: ChrisHoogie
8 Replies
6. Shell Programming and Scripting
Hello, I am new to the Bash scripting language, and was given a tutorial page on how to setup a file. However I am trying to use cygwin to run this file and it is not working.
$ vi averagetime.sh
#
#
#
echo "Enter Dictorinary File Text "
read dict
echo "Enter Grid Name"
read grid... (13 Replies)
Discussion started by: killerqb
13 Replies
7. UNIX for Dummies Questions & Answers
Hi,
I have used pdftotext with good results in the past, but today for some reason I keep getting the same error message.
My command is as follows:
And the error message is
I am using Vmware player with Ubuntu server, but I don't think that is causing this issue as I have been using... (2 Replies)
Discussion started by: Joq
2 Replies
8. UNIX for Dummies Questions & Answers
Hi guys,
I have the following code:
int main(int argc, char *argv)
{
int pid1,pid2,i=0;
pid1=fork();
i+=2;
if(!pid1) i++;
if(i%3) pid2=fork();
if (pid2==0)
{
printf("sea \n ");
i-=1;
}
if(i>=2)... (4 Replies)
Discussion started by: pfpietro
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)