Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

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

by Anonymous Monk
on Sep 18, 2012 at 07:27 UTC ( #994218=note: print w/ replies, xml ) Need Help??


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

Indeed; the real speed gain comes from the iterator-like workings of each -- no need to build a list of keys to feed to foreach before even starting the loop (and at 20k keys, that costs quite a bit).


Comment on Re^3: how to loop through hash tables more efficiently
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2014-11-29 02:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (203 votes), past polls