Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^3: Recursive substitution

by bobf (Monsignor)
on Nov 10, 2009 at 04:44 UTC ( #806125=note: print w/ replies, xml ) Need Help??

in reply to Re^2: Recursive substitution
in thread Recursive substitution

it's redundant to do a separate m/$pat/ check
You are absolutely correct, of course. I started playing with patterns that would have required the extra check (because the ones used in s/// and m// were different), but I failed to remove the extra code after changing my approach. I added a note to my original reply but left the crufty code to avoid confusing future readers of this thread.

Comment on Re^3: Recursive substitution
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (11)
As of 2015-10-07 17:00 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (191 votes), past polls