i can only find the first occurance of a pattern how do i set it to loop untill all occurances have changed.
#! /usr/bin/perl
use POSIX;
open (DFH_FILE, "./dfh") or die "Can not read file ($!)";
foreach (<DFH_FILE>) {
if ($_ !~ /^#|^$/) {
chomp;
... (1 Reply)
hi i am trying to get digits inside brackes from file , whose structure is defined below
CREATE TABLE TELM
(SOC_NO CHAR (3) NOT NULL,
TXN_AMOUNT NUMBER (17,3)
SIGN_ON_TIME CHAR (8)
TELLER_APP_LIMIT NUMBER (17,3)
FIL01 ... (2 Replies)
Hello
I got the below one from in one of this forums
For Ex: Loading File System Networking in nature
now i need to extract the patterns between the words File and Networking :
i.e. sample output: System
cmd used : cat <file> | sed 's/.*File //' | sed 's/Closing.*$//'
Actually... (0 Replies)
Hi,
I got doubt in Pattern matching, could you tell me how the following differs in action ??
if ( $line1==/$line2/ )
if ( $line1=~/$line2/ )
if ( $line1=~m/$line2/)
What is the significance of '~' in matching.
Thanks in advance
CoolBhai (5 Replies)
Hi experts,
I have many occurances of the following headers in a file. I need to grep for the word changed/inserted in the header, calculate the difference between the two numbers and list the count incrementally.
Headers in a file look like this:
-------------------
---------------------... (6 Replies)
I am doing a file patterhn matching for a text file in PERL
I am using this,,, but it says that no file is found
$filepattern = '\d{1,4}.*A0NW9693.NDM.HBIDT.*.AD34XADJ.txt';
Can anyone help me out with Perl Pattern Matching concepts and how to do pattern matching for this txt file:... (4 Replies)
I have a 2 files in .gz format and it consists of 5 million lines the format of the file would be
gzcat file1.gz | more
abcde
aerere
ffgh56
..
..
12345
gzcat file2.gz | more
abcde , 12345 , 67890,
ffgh56 , 45623 ,12334
whatever the string is in the file1 should be matched... (3 Replies)
My log file looks as given below, its actually a huge file around 1 GB and these are some of the line:
conn=5368758 op=10628050 msgId=64 - RESULT err=0 tag=101 nentries=1 etime=0
conn=7462122 op=-1 msgId=-1 - fd=247 slot=247 LDAPS connection from 10.13.18.12:37645 to 10.18.6.45
conn=7462122... (5 Replies)
Hi,
I have a list of IP, eg :
192.168.0.15
192.168.0.24
192.168.2.110
192.168.2.200
And I would like the shortest pattern who match with '192.168.0' and '192.168.2' (without the last dot and number). (7 Replies)
I am using Perl version 5.8.4 and trying to understand the use of regular expression. Following is my code and output.
$string = "Perl is a\nScripting language";
($start) = ($string =~ /\A(.*?) /);
@lines = ($string =~ /^(.*?) /gm);
print "First Word (using \\A): $start\n","Line... (4 Replies)
Discussion started by: jnrohit2k
4 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)