hey guys
having some trouble figuring this out.
my program is supposed to take a name of a directory as a command line argument and change the filenames inside that directory to lowercase.
what i dont get is how you access that directory and go thru all the files and change the filenames... (1 Reply)
I have a list of files in a particular folder
Example:
File name - sample.F1.test
I want to change the extension of the above file to .csv
The final file should be renamed as sample.csv (4 Replies)
Hello, everyone! :]
I'm having an issue with my camera/uploading to Photobucket.
When my camera transfers it's photos to my hard drive, it transfers them as .JPG. Unfortunately, when I go to upload to my Photobucket account, it only accepts .jpg & .jpeg files. Every time I want to upload, I... (6 Replies)
Hello all,
I need to change file extension for all .doc files to .txt file in multiple folders. I know the way to rename them by going to each folder and doing that, but I need something which I can run from home directory so that It does the renaming in all the nested directories.
Thanks. (4 Replies)
I have lot of files whose names are something like the following. I want to change the name of all the files from 'npt02' to 'n02'.
npt02-z30-sr65-rgdt0p50-dc0p01-16x12drw.tpf
npt02-z30-sr65-rgdt0p50-dc0p01-8x6drw.back
npt02-z30-sr65-rgdt0p50-dc0p01-8x6drw-bst-mis.xy... (5 Replies)
I have written a csh script that changes the name of file from src to dst.
I am getting the error below:
TESTAmvfiles
DONE TESTAmvfiles
set: Variable name must begin with a letter.
The csh script is:
#!/bin/csh
#... (0 Replies)
I want to type only the filename of a gcc source that has ".syn" as an extension and copy it, changing the extension to ".c" so it can be compiled.
I do it as follows:
if (-e $1.syn) then
/bin/cp $1.syn $1.c
endif
This works fine, but if I want to repeat the compilation by... (1 Reply)
I have file names as shown and want to change the name to have only the first four numbers.
/home/chrisd/Desktop/nips/nips_2013/5212-learning-feature-selection-dependencies-in-multi-task-learning.pdf
/home/chrisd/Desktop/nips/nips_2013/5213-parametric-task-learning.pdf... (3 Replies)
I have a series of files as follows
file-1.pdf
file-2.pdf
file-3.pdf
file-4.pdf
file-5.pdf
file-6.pdf
file-7.pdf
I want to have the file names with odd numbers
starting from an initial number, for example 2000.
The result would be the following:
file-2001.pdf
file-2003.pdf... (9 Replies)
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)