Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^4: fastest pattern match

by flounder99 (Friar)
on Jun 25, 2002 at 11:53 UTC ( #177067=note: print w/ replies, xml ) Need Help??


in reply to Re: Re^2: fastest pattern match
in thread fastest pattern match

Thanks,

I remember reading that it still did the recompile even if the variable in the regex did not change. Of course I read that a LONG time ago. Apparently it has been fixed.(probably a long time ago) So would the /o faster by avoiding the extra string compare? I know this would probably be insignificant unless there where a bajillion iterations. But I was just curious.
Do you even know anything about regexes? (see sig)

--

flounder

Do you even know anything about perl?
--Anonymous Coward to Tom Christiansen on slashdot

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2016-06-30 11:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (393 votes). Check out past polls.