Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^2: how to loop through hash tables more efficiently

by Anonymous Monk
on Sep 17, 2012 at 21:20 UTC ( #994111=note: print w/replies, xml ) Need Help??


in reply to Re: how to loop through hash tables more efficiently
in thread updated_again: how to loop through hash tables more efficiently

So you don't need the second loop... You can use the exists function

he is already using exists, your code doesn't map well to his example , his faux hash of arrays

  • Comment on Re^2: how to loop through hash tables more efficiently

Replies are listed 'Best First'.
Re^3: how to loop through hash tables more efficiently
by roboticus (Chancellor) on Sep 18, 2012 at 15:32 UTC

    Oh, yes, I seem to have glossed over that. When I read it, I thought he was comparing keys with keys, rather than keys and values.

    ...roboticus

    When your only tool is a hammer, all problems look like your thumb.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://994111]
help
Chatterbox?
Corion munches on the traditional German winter fruit, strawberries. Imported from Spain at the price of EUR 0.77 per 150g - not really cheap but surprisingly good for a winter produce
Discipulus straberries portable edition
[Corion]: Discipulus: Haha ;) I hadn't made the connection to Strawberry Perl at all ;)

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (7)
As of 2017-01-20 10:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (174 votes). Check out past polls.