Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
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).

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://994218]
help
Chatterbox?
[karlgoethebier]: Lady_Aleena: "Studying the sources is the way to go" (Dr Wisenheimer) ;-)
[Lady_Aleena]: karlgoethebier, when I don't know what I am looking at, it makes it hard to figure things out.

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (5)
As of 2017-06-26 09:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (575 votes). Check out past polls.