Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re: Hash slices ?

by ChOas (Curate)
on Dec 01, 2000 at 15:38 UTC ( #44329=note: print w/replies, xml ) Need Help??

in reply to Hash slices ?

The original discussion for this one
started with my question: how do I find if
at least one of many keys in a list is in a hash
(quick, fast, and simple)
davorg offered me a working example, but when I
tried it, I inserted the 'four' at the start of the list
which didn't work
The push on the other hand DID.
and as you can see the unshift doesn't work either

Many thanks davorg !!
Let's see what people can tell us about this one ;))

Replies are listed 'Best First'.
Re: Re: Hash slices ?
by arturo (Vicar) on Dec 01, 2000 at 18:58 UTC
    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

      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://44329]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (4)
As of 2018-01-23 01:02 GMT
Find Nodes?
    Voting Booth?
    How did you see in the new year?

    Results (238 votes). Check out past polls.