I have list of files generated on 2 dates which are shown below:
Code:
-rw-r----- 1 bobby ccsdba 580945 Aug 16 16:13 file 1
-rw-r----- 1 bobby ccsdba 580945 Aug 16 16:16 file 2
-rwxrwxr-x 1 Shaan ccsdba 4422724 Aug 16 16:28 file 3
-rwxrwxr-x 1 bobby ccsdba 794 Aug 17 12:50 run_load.lg
-rw-r----- 1 Rocky ccsdba 251 Aug 17 13:47 file 3
Inorder to get the files from Aug16, what is the command that we going to use ?
The desired output should be like this :
Code:
-rw-r----- 1 bobby ccsdba 580945 Aug 16 16:13 file 1
-rw-r----- 1 bobby ccsdba 580945 Aug 16 16:16 file 2
-rwxrwxr-x 1 Shaan ccsdba 4422724 Aug 16 16:28 file 3
Moderator's Comments:
Please use code tags, thanks. If you furthermore ignore the admin/mod notices on code tags and collect enough infractions, you will be automatically banned - so maybe consider this if you like to get help here.
Last edited by zaxxon; 08-18-2011 at 10:18 AM..
Reason: code tags
I need to build a k shell script that will sort files in a directory where files appear like this "XXXX_2008021213.DAT. I need to sort by date in the filename and then move files by individual date to a working folder. concatenate the files in the working folder then start a process once... (2 Replies)
Hi,
I would appriciate if somebody can help me figure out how to search for all the *.xml file under a specific directory and subdirectroies (/home/username) and later search of content "<start>" inside the xml file returned by search.
-Lovin.V (2 Replies)
Hi people
A newbie here, thrown into the deep end. I want to select the group of files with in a range of dates and perform some operation on it. Are there inbuild date libraries i can use?
I did read thru the old posts on this topic. Couldnt get much idea :(, basically want to know how I... (7 Replies)
Hello Linux Masters,
I am not a linux expert therefore i need help from linux gurus.
Well i have a requirement where i need to search all files based on first patterns and after seraching all files then serach second pattern in all files which i have extracted based on first pattern.... (1 Reply)
Hi All,
I am new to shell srcipting.
Problem :
I need to write a script which copy the log files from /prod/logs directory based on todays date like (Jul 17) and place it to /home/hzjnr0 directory and then search the copied logfiles for the string "@ending successfully on Thu Jul 17". If... (2 Replies)
Hi,
i want to make script. In a directory everyday( exclude sat and sun) in between 10 pm to 1 am there are 2 files comes and when file comes it will mail us. Format for files is mentioned below.
please help me on making this, and also have year end consider and if files come after 12 am it... (6 Replies)
Hi All,
I need to find all files other than first two files dates & last file date for month and month/year wise list.
lets say there are following files in directory
Mar 19 2012 c.txt
Mar 19 2012 cc.txt
Mar 21 2012 d.txt
Mar 22 2012 f.txt
Mar 24 2012 h.txt
Mar 25 2012 w.txt
Feb 12... (2 Replies)
Hello,
I am a noob and need some help.
I am trying to find files created between a date range.
For Example:
These are files in directory.
-rw-r--r-- 1 user staff 6 May 8 09:43 file1.txt
-rw-r--r-- 1 user staff 6 May 8 09:43 file2.txt
-rw-r--r-- 1 user... (8 Replies)
Discussion started by: r@v!7*7@
8 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)
08-18-2011
