whats going on guys. below is a script i made and am just curious if there is a "time stamp" command. so i can set the timestamp in a filename.
#! /bin/ksh
#
# This scripts takes a list of files in the INDIR variable and compairs it to a list of files that are open in the same directory.... (2 Replies)
Hi
i want to replace the previous time stamp with the current timsatp at the start of the file like
20090710_113354_FT0710a.txt this one to 20091111__113354_FT0710a.txt
thanks in advance (3 Replies)
Hi.,
My file name is of the format:
name_abc_20100531_142528.txt
where.,
my timestamp is of the format:
yyyymmdd_hhmmss
How to extract the date strring and time string into seperate variables in the shell script, after reading the file as the input?
I want to get the variables... (9 Replies)
Hi,
Below is a directory containing links new2,list,new1.
I need to get the size and timestamp for them.
How do i get these details. Please help
lrwxrwxrwx 1 xxx abc 11 Nov 24 17:34 new2 -> ./org1/new2
lrwxrwxrwx 1 xxx abc 11 Nov 24 17:34 list -> ./org2/list
lrwxrwxrwx 1 xxx abc 10... (2 Replies)
Hi all.
I am very new to linux scripting and i have a task i can only solve with a script.
I need to sort files base on the date string in their filenames and create a folder using the same date string then move the files to their respective folders.
Scenario:
Folder Path:... (1 Reply)
Hi all.
I am very new to linux scripting and i have a task i can only solve with a script.
I need to sort files base on the date string in their filenames and create a folder using the same date string then move the files to their respective folders.
Scenario:
Folder Path:... (1 Reply)
Hi Gurus,
I have different files with different timestamp and different base file name, I have to group those files based on basename and provide a unique file name for similar file names.
My Directory has following files.
abc_filename_20130623:00:09:00.txt... (1 Reply)
Hello Friends,
I would like my script to display date timestamps in the file name for every script execution.
Below is the scenario: (just for testing purpose)
I scheduled a cron job, lets say it runs every 5 min and record/logs output in to a log file.
0,5,10,15,20,25,30,35,40,45,50,55 *... (5 Replies)
Discussion started by: System Admin 77
5 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)