Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^2: line by line match on an array of strings

by WoodyWeaver (Monk)
on Jan 09, 2008 at 21:38 UTC ( [id://661514]=note: print w/replies, xml ) Need Help??


in reply to Re: line by line match on an array of strings
in thread line by line match on an array of strings

Just trying to restate what Mike was saying.

> however with a few hundred thousand lines to seach, and an array of a few hundred it is far too slow.

It could be slow because it has to do a lot of work at each end step, which is where optimizing the regex helps.

I think it is slow because your looping is of order (a few hundred thousand) TIMES (a few hundred).

It would be much better if the looping is of order (a few hundred thousand) times a big constant. You might be able to get away with that by 'precompile your regexen' (wonderful phrase) -- or imho more likely if your line can be broken into a small number of tokens, just do a dispatch table on tokens broken out from the line.

--woody

  • Comment on Re^2: line by line match on an array of strings

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://661514]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (3)
As of 2024-04-20 00:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found