If you're basically looking for a quick Set membership test then using a hash rather than an array coould help.
my %hash = ('a' => undef, 'b' => undef, 'c' => undef, 'd' => undef);
if (exists $hash{'a'})
{
# yadda yadda
}
Setting up the hash can be made a bit neater once you know what a hash slice is
my %hash;
@hash{'a', 'b', 'c', 'd'} = ();
If your set of elements is going to be large and you're going to be checking frequently then a hash will be much quicker than anything that searches an array. Inserting and removing elements is also quick and doesn't have a problem with duplicates like an array could.
You could also do a cpan search for "set" and use one of the modules there, some of them would be even faster and than hashes I think.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|