Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re: Re^2: fastest pattern match

by japhy (Canon)
on Jun 24, 2002 at 22:29 UTC ( #176970=note: print w/ replies, xml ) Need Help??


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

Incorrect. It will not be compiled on every iteration, but its string form will be compared with its previous string form, to see whether it needs recompiling.

_____________________________________________________
Jeff[japhy]Pinyan: Perl, regex, and perl hacker, who'd like a job (NYC-area)
s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;


Comment on Re: Re^2: fastest pattern match
Re^4: fastest pattern match
by flounder99 (Friar) on Jun 25, 2002 at 11:53 UTC
    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://176970]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (7)
As of 2014-07-31 01:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (243 votes), past polls