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).
In reply to Re^3: how to loop through hash tables more efficiently
by Anonymous Monk
in thread updated_again: how to loop through hash tables more efficiently
by lrl1997
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |