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

Re^2: Is there a way around grep?

by suaveant (Parson)
on Oct 11, 2011 at 15:53 UTC ( #930850=note: print w/ replies, xml ) Need Help??


in reply to Re: Is there a way around grep?
in thread Is there a way around grep?

Of course, if only looking for a match a good addition would be a last to break the loop as soon as a match is found.

Or use List::Util::first

                - Ant
                - Some of my best work - (1 2 3)


Comment on Re^2: Is there a way around grep?
Download Code
Re^3: Is there a way around grep?
by AnomalousMonk (Abbot) on Oct 11, 2011 at 22:42 UTC
Re^3: Is there a way around grep?
by ikegami (Pope) on Oct 15, 2011 at 08:26 UTC
    If you're looking for speed, I bet grep is normally faster than for+last.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (15)
As of 2015-07-06 20:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (81 votes), past polls