Re: Matching lines in 2+ GB logfiles.

in reply to Matching lines in 2+ GB logfiles.

Just my first thought; so instead of

while ( $window =~ m/\w{3}\s{1,2}\d{1,2}.*$re.*\n/oigc ) {
[download]

you could try

while ( $window =~ m/\w\w\w\s\s?\d\d?.*$re.*\n/iogc ) {
[download]

\w\w\w should run faster than \w{3}, same with \d\d? instead of \d{1,2}

Edit: and same with \s\s? vs. \s{1,2}. The direction should be clear.

Edit2: Maybe precompiling the regex with the qr// Operator might give another speedup.
By the way, I can't remember that /c Modifier, what is it for?

Comment on Re: Matching lines in 2+ GB logfiles. Select or Download Code

Replies are listed 'Best First'.
Re^2: Matching lines in 2+ GB logfiles. by CountZero (Bishop) on May 01, 2008 at 16:25 UTC
The `/c` modifier is always used together with the `/g` modifier and allows continued search after a failed /g match. Normally `pos()` is reset after a failed match. CountZero A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^2: Matching lines in 2+ GB logfiles.
by CountZero (Bishop) on May 01, 2008 at 16:25 UTC

/c

/g

pos()

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

[reply]
[d/l]
[select]

In Section Seekers of Perl Wisdom