Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Optimizing many many regex matches

by xdg (Monsignor)
on Oct 22, 2006 at 22:25 UTC ( [id://579914]=note: print w/replies, xml ) Need Help??


in reply to Optimizing many many regex matches

This might be a situation where study might be helpful. Here's section from the docs:

Takes extra time to study SCALAR ($_ if unspecified) in anticipation +of doing many pattern matches on the string before it is next modifie +d. This may or may not save time, depending on the nature and number +of patterns you are searching on, and on the distribution of characte +r frequencies in the string to be searched--you probably want to comp +are run times with and without it to see which runs faster. Those loo +ps that scan for many short constant strings (including the constant +parts of more complex patterns) will benefit most.

-xdg

Code written by xdg and posted on PerlMonks is public domain. It is provided as is with no warranties, express or implied, of any kind. Posted code may not have been tested. Use of posted code is at your own risk.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (7)
As of 2024-04-25 11:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found