Hi (warning: newbie question),
I am writing a script to run a series of tests on a program, which involves a line:
but later I want to send the output to file.out. But I need to separate the filename and extension somehow...Also $file contains "test_suite/" before each entry as well, how do I get rid of that (I assume it's in a similar way as the separation above)
How to compare the file name for "zip" or "ZIP" extension.
I can put one more || condition to check the upper case in the below:
if ]; then
Is there any better way to compare using regular expressions.
Thx in advance. (4 Replies)
Hi All,
i need to change the filename extension. For simplicity, we can assume that the extension after '.' is 3 characters only... but the filenames can vary.
eg. changing from abc.doc to abc.dxs
can i have a oneline command to achieve this (3 Replies)
I am running my script from "/abc/" this path and it has no ".csv files" but has a ".txt" files namely temp1.txt
My script goes as below, wherein it is suppose to find files with *.txt extension and *.csv extension in another path namely "/abc/xyz/":
#!/bin/ksh
PATH1="/abc/xyz/"
value="*.csv... (1 Reply)
I need a small script (sh) to remove in a variable the filename extension.
Example:
f = "testfile.txt"
and I need a $a with "testfile".
Some one a idea? (4 Replies)
Hi Experts,
need one help.. m writing a shell script for which i need the entire path of the file but without its extension.
running the below script gives error at the statement DIR = `dirname $FILE` --command not found.
#!/bin/bash
jar xvf *jar
for FILE in `find . -name "*.class"`
... (3 Replies)
Is there an easy way to strip off a filename's extension?
For example, here's a filename:
blahblahblah.thisisok.thisisnotok
I want to get rid of .thisisnotok from the filename, so that what's left is
blahblahblah.thisisok
Thanks. I have a directory full of filenames that need to be... (5 Replies)
Hi all,
I have a folder with a bunch of files in them, and I would like to add an extension (.mp3)to all these filenames. The folder has only files that I'd like .mp3 added to.
It looks something like this:
Intput:
File1
File2
File3Output:
File1.mp3
File2.mp3
File3.mp3Thanks in... (2 Replies)
Hi,
I have files with filenames as below.
SGM Daily Sales Email-en-us-05312012.xlwa
I want to rename it in .xls. I am writing a script to change this, as there can be multiple files in subfolders.
I have the following script.
#!/bin/ksh
for oldfile in $(find... (1 Reply)
I need to write a shell script to display the output of ls command like this
ls -ltr *txt
I get this
-rw-r----- 1 oracle dba 51912704 Dec 11 10:27 /usr/local/sam/test12112012101247AM.txt
-rw-r--r-- 1 oracle dba 7 Dec 11 11:58 /usr/local/sam/test.txt
but I just need the latest... (7 Replies)
Heyas
As i often have decide things upon a filename its extension, i thought i'd write a script:
Just wondering if there would be a more efficent way?
out=""
FN=$( echo "$1" | sed s," ","",g) # Remove any spaces and make it a single string
for chance in $(echo "$FN"|sed s,"\."," ",g) # Use... (7 Replies)
Discussion started by: sea
7 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)