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

Re: Re:{4} Getting impossible things right (behaviour of keys)

by blakem (Monsignor)
on Oct 24, 2001 at 21:39 UTC ( #121207=note: print w/ replies, xml ) Need Help??


in reply to Re:{4} Getting impossible things right (behaviour of keys)
in thread Getting impossible things right (behaviour of keys)

Add the requirement that it has to be anchored at the end, and you will get the longest match. Try /(ot|foot|refoot)$/ and see which one matches. Bet ya its the longest one.

-Blake


Comment on Re: Re:{4} Getting impossible things right (behaviour of keys)
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (14)
As of 2014-12-19 21:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (92 votes), past polls