Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
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)

Replies are listed 'Best First'.
Re^3: Is there a way around grep?
by AnomalousMonk (Chancellor) 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?
[SuicideJunkie]: We are certainly vastly more educated and wealthy. Raw intelligence is much more difficult to measure.
[james28909]: exactly. i think the question that should be asked is, where will intelligence take us.

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (10)
As of 2017-12-15 15:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (433 votes). Check out past polls.

    Notices?