Hi,
I have writtena script that will recursivly go into subdirecotries and report out what files there are in there that have not been accessed over various date ranges.
I do this using a number of find commands:
find . -path './.snapshot' -prune -o -type f -atime -8
find... (4 Replies)
Hi All,
The developers want me to search and capture the weblogic log, you know this big logs of htmls.
They want to me to have ranges on the date and time. Like
from "2010-01-20 14:04:46,186" to "2010-01-20 15:00:12,490"
I can only do this,
cat /usr/local/bea/logs_prod1/debug.log |... (1 Reply)
Hi All,
The developers want me to search and capture the weblogic log, you know this big logs of htmls.
They want to me to have ranges on the date and time. Like
from "2010-01-20 14:04:46,186" to "2010-01-20 15:00:12,490"
I can only do this,
cat /usr/local/bea/logs_prod1/debug.log... (1 Reply)
I have a list of about 200,000 lines in a text file that look like this:
1 1 120
1 80 200
1 150 270
5 50 170
5 100 220
5 300 420
The first column is an identifier, the next 2 columns are a range (always 120 value range)
I'm trying fill in the values of those ranges, and remove... (4 Replies)
Good day to everyone!
So, let's start :)
I have a file with a numbers in some ranges
for example:
1 10
49 72
...
and this file need to transform to:
1
2
3
4 (14 Replies)
Hi,
I have two files
file1 chr1_22450_22500
chr2_12300_12350
chr1_34500_34550
file2 11000_13000
15000_19000
33000_44000
If the file 1 ranges fall between file2 ranges then assign the value of file2 in column 2 to file1
output:
chr2_12300_12350 11000_13000
chr1_34500_34550 ... (7 Replies)
Hi Guys,
I am having below tables used in oracle
bal
ID BALANCE BAL_DATE
1 -11.71 01-JAN-05 00.00.00
1 -405.71 02-JAN-05 00.00.00
1 -760.71 03-JAN-05 00.00.00
ref_table
PRODUCT EFF_FROM_DATE EFF_TO_DATE TYPE MIN_AMT MAX_AMT CHARGE
12 01-JAN-05 00.00.00 01-JAN-06... (6 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)
Hi There, Good Day !!
I have txt file containing data in the below format. There are many lines, here i have mentioned for example.
cat remo.txt
2/3/2017 file1
3/4/2016 file2
6/6/2015 file5
1/1/2018 file3
4/3/2014 file4
-
-
-
I need to grep the file names for given date rage... (11 Replies)
Discussion started by: kumar85shiv
11 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)