Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

The simplest way

by TheDamian (Priest)
on Apr 13, 2003 at 00:25 UTC ( #250099=note: print w/ replies, xml ) Need Help??

in reply to Making a match

Previous respondents have suggested efficient ways for various circumstances. As for the simplest way:

use Quantum::Superpositions; if ($x == any(@list)) { ... }

Note that the latest release of Q::S (just uploaded to the CPAN last week) is iterator-based and therefore much more efficient that previous versions. We have Steven Lembark to thank for that.

Note too that, whilst the performance of the grep- and hash-based solutions may improve slightly over time, the any solution will continue to improve significantly with future releases of Quantum::Superpositions, then with the new Perl6::Junctions module, and ultimately with the availability of any as a built-in feature of Perl 6.

Comment on The simplest way
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2015-10-05 05:17 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (107 votes), past polls