This builds a string with current time - 1 hour eg:
This is used as a command line options to awk to set the value of 5 variables Y,T,D,H and M for Year, monTh, Day, Hour, Minute.
-F '[[ /:]' set field seperator to one of [ / space and :
Now input lines are split up into fields so from [8/12/13 23:07:12:000 EDT] log message
we get $1= $2=8 $3=12 $4=13 $5=23 $6=07 $7=12
Below will set variable v if date/time is less than 1 hour ago (i.e. year is greater than current year OR year is current year and month is greater than current month OR etc)
And finally print line if line starts with [ and variable v is set: /^[[]/&&v
This User Gave Thanks to Chubler_XL For This Post:
hi, i have a text file wich contains following informations:
1 Record 90 in base GUJA_2008 (Created: 2008-01-14 19:00:38, Modified: 2008-01-15 18:54:33)
1 YADM_20080101_A91645666_A91645666
4 2008/01/15/ADM.ADM/20080101.ADM.ADM.A91645666G001.jff
1 Record 91 in base GUJA_2008 (Created:... (3 Replies)
I have a huge file and every paragraph has a date. But I want to retrieve the paras for the last two days only. So I can grep and findout the linenum for the first line since yesterday. Now I want to display everything after that line. And I am trying to do this inside a script so the linenum is a... (4 Replies)
Hi all,
I'm looking for some help. I have a file (very long) that is organized like below:
>Cluster 0
0 283nt, >01_FRYJ6ZM12HMXZS... at +/99%
1 279nt, >01_FRYJ6ZM12HN12A... at +/99%
2 281nt, >01_FRYJ6ZM12HM4TS... at +/99%
3 283nt, >01_FRYJ6ZM12HM946... at +/99%
4 279nt,... (4 Replies)
Hi Guys,
Was trying to attempt the below using awk and sed, have no luck so far, so any help would be appreciated.
Current Text File: The first line has got an "\n", and the second line has got spaces/tabs then the word and "\n"
TIME SERVER/CLIENT TEXT... (6 Replies)
Hi,
I am trying to locate the occurences of certain pattern like 'Possible network disconnect' in a text file. I can get the actual lines matching the pttern using:
grep -w 'Possible network disconnect' file_name.
But I am more interested in getting the timing of these events which are... (7 Replies)
Hello Masters,
I need one help.
I want to copy the files which are continuously generating on one server.
But this would be on hourly basis.
e.g.
-rw-rw-r-- 1 akore akore 0 Feb 12 03:20 test1.log
-rw-rw-r-- 1 akore akore 0 Feb 12 03:42 test2.log
-rw-rw-r-- 1 akore akore 0 Feb 12 04:22... (2 Replies)
Hi all I am trying to process some data sample input is like this
VARIABLE : T
axis TDAY
TIME : 02-FEB-2004 17:54
19755.
VARIABLE : quality flag
FILENAME : 1900054_prof.nc
Z : 41
... (3 Replies)
I want to extract a pattern from a log file within last hour.
I am doing
grep "pattern" filename | tail -1
It gives the last latest pattern but not within last hour.
and if the pattern found in last hour, output success or else failure. (3 Replies)
'Hi
I'm using the following code to extract the lines(and redirect them to a txt file) after the pattern match. But the output is inclusive of the line with pattern match.
Which option is to be used to exclude the line containing the pattern?
sed -n '/Conn.*User/,$p' > consumers.txt (11 Replies)
Hi all!
Thanks for taking the time to view this!
I want to grep out all lines of a file that starts with pattern 1 but also does not match with the second pattern.
Example:
Drink a soda
Eat a banana
Eat multiple bananas
Drink an apple juice
Eat an apple
Eat multiple apples
I... (8 Replies)
Discussion started by: demmel
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)