Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Re: Hash slices ?

by arturo (Vicar)
on Dec 01, 2000 at 18:58 UTC ( #44357=note: print w/ replies, xml ) Need Help??

in reply to Re: Hash slices ?
in thread Hash slices ?

how do I find if at least one of many keys in a list is in a hash (quick, fast, and simple)

Dunno if this meets *all* of your criteria, but I find this simple enough:

my @search_keys = qw(one two three); my %hash = ( four=>4, five=>5, six=>6); my $foundit =0; foreach (@search_keys) { if (exists $hash{$_}) { $foundit =1; print "found an entry for $_ in %hash!\n"; } }

Philosophy can be made out of anything. Or less -- Jerry A. Fodor

Comment on Re: Re: Hash slices ?
Download Code
Replies are listed 'Best First'.
Re: Re: Re: Hash slices ?
by davorg (Chancellor) on Dec 01, 2000 at 19:06 UTC

    Given that the idea is to find out if any of the keys exist in the hash, it would be more efficient to call last and exit the loop once you've found one.


    "Perl makes the fun jobs fun
    and the boring jobs bearable" - me

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (6)
As of 2015-10-08 18:59 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (223 votes), past polls