Thanks dude, i should have thought of double awk matching. I was thinking it was way more complicated.
I suppose it will get more complicated if the hour actualy doesnt exist as a string in the file though.
e.g From my sample text above if i wanted to search for events between 03-Feb-2010 12:00 and 04-Feb-2010 18:00 the awks wouldn't have anything to match.
I am trying to replace the word ACTIVE with 2002 in a file and I am getting the following error. Does anyone know what this means?
$ sed "s/ACTIVE/2002" mydata.txt > yourdata.txt
sed: 0602-404 Function s/ACTIVE/2002 cannot be parsed. (5 Replies)
Hi all,
When in 'less' or '-' or whatever your alias is, if you search for a string, you get all of it's occurences highlighted. Is there any option I can set in VI, .exrc or whtever, to have the same behaviour in VI?
thanks (2 Replies)
Hi have Input in this way
KEY AAAA
BBBB
END1
KEY AAAA
BBBB
END2
KEY AAAA
BBBB
END3
I need to find any thing matching in between KEY And ending with "END1|END2|END3"
This didnot work
awk '/KEY/,/END1|END2|END3/' (3 Replies)
Hi experts..
I am trying to write a shell script which will scan a log file for three strings ie success image1, success image2, success image3.
My shell is tcsh
If all the 3 strings are found then insert the 3 strings to a file1 and send mail to developers with file1
If all 3 are note... (0 Replies)
Hi,
i have a file a.txt like
--------------------------------
col1|col2|col3
data1|data2|data3
other1|other2|other3
--------------------------------
i need to search 2 strings(data in a.txt file is case sesnsitive), suppose data1 and data2. If these 2 strings found then only i need... (2 Replies)
I have a need to search for files containing 2 strings as in (AND operator). No one at my site seems to know if it is possible. There is only documentation for the "or' operator.
I know I can do a search, copy all the matched files into a temp directory & do the second search in the temp... (14 Replies)
Hi All,
Could you help me to get the command to search two different strings in a file using vi as editor.
I know that we use /StringToSearch for searching a string, but i want a command to search two strings.
Eg.
In FileOne i want to search the occurence of StringOne or StringTwo at a time.... (6 Replies)
Based on the forums i have tried with grep command but i am unable to get the required output.
search this value /*------
If that is found then search for temp_vul and print
and also search until /*------- and print new_vul
Input file contains:
... (5 Replies)
Hi,
Is there a command to do a sensitive/in-sensitive search for a string on a line and print how many times that string appears?
For example, if I have a line of text below:
dog cat rat apple banana dog lion tiger dog
Is there a command to search for dog that will print out 3 as a... (7 Replies)
I have written a script which will search logfiles directory particular two strings and send a message to user to kill the process id if string found every 15 minutes
Note::dont have cron tab access(Auto run every 15 minute)
oS--AIX
Please add script search the PID into logfile "My PID is:... (5 Replies)
Discussion started by: sri1999
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)