Perl Monk, Perl Meditation | |
PerlMonks |
Re: writing perl function like sql INby blokhead (Monsignor) |
on Aug 31, 2004 at 00:26 UTC ( [id://387073]=note: print w/replies, xml ) | Need Help?? |
Quantum::Superpositions might give the most readable way to do this:
A hash is better than an array or quickly checking of whether an item is included. If you can keep the set of candidates around as a hash with candidates as keys instead of an array of candidates, you can check whether a key is one of the candidates with exists. blokhead
In Section
Seekers of Perl Wisdom
|
|