Hi,
I am trying to do something with grep, but for some reason I just can't get it to to work.
I am looking for find a match in the second field, the length must be 10 characters and end with 'abc'.
The file is in this format:
<int><tab><field2>
I've tried a few patterns, some work,... (2 Replies)
Hello All,
I have been using String.h with gcc 2.95. Now I have upgraded to gcc 3.4. The support for String.h has been removed and I believe Regex.h support is also not inbuilt. So I tried to build my own library for String.h. I had to use Regex.h and rx.h for a succesful library compilation.... (0 Replies)
Hi all,
I am looking to create words from a sentence which adhere to a custom search pattern from my website:
Example:
! +! / += ~
where the terms ! = not, +! = AND NOT, += - and equals and ~ = can be like....
Now here is the issue...i want to split a sentence like the one above on... (1 Reply)
Hi,
Can someone tell me why the first regular expression with the + fails to match the input string?
SUN /web>echo cat | grep '+'
SUN /web>echo cat | grep ''
cat
I'm running SunOS 5.10
Thanks.
Chris (2 Replies)
Hi there,
How can we use regex in perl to store the Route Distinguisher (the bold field) and also the underlined and bold lines in the below file?
Note:
These highlighted pattern is redundant through the whole input file. Basically, we just need to extract these fields at least to store them... (4 Replies)
Need some help with a regex if loop problem.
File1:
2323
3232
4230
3230
4340
4343
233
32320
I want to print "Zero" if the number ends with a zero, but print "number" if it does not!
#!/bin/bash
/usr/bin/nawk '{
if ($1 ==/+0\b/){
print "Zero"}
else{
print "number"} (5 Replies)
Hi,
I tried to extract the time from `date` with sed.
(I know it works with `date +%H:%M:%S` as well)
I got three solutions of which just one worked. I thought "+" should repeat the previous expression 1 or more times and {n} should repeat the previous expression n times.
$ date
Thu... (9 Replies)
hi everyone
suppose my input file is
ABC-12345
ABCD-12345
BCD-123456
i want to search the specific pattern which looks like
-
in a file so i used this command
cat $file | awk ' { if ($0 ~ /-/) { print } }'
so it gives me the result as
ABCD-12345
BCD-12345
BCD-12345
... (31 Replies)
Hi,
I am looking for regex to extract following words from text:
The word which comes after "Replaced" means
Replaced disk
Replaced floppy
Replaced memory
Please suggest the regex for it.
Thanks! (4 Replies)
Script logs into switches on my list but nothing seems to happen.
Following error:
tr nope, doesn't (yet) match (?-xism:-]+ ?(?:\(config*\))? ? ?$)
du SEEN:
Here is code in question:
@version_info = $session_obj->cmd('term length 0');
$session_obj->cmd('show int | i... (5 Replies)
Discussion started by: mrlayance
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)