Nonsense-Mike again ...
When hashes grow they allocate in doubling steps, they don't waste much space in the internal lookup table, which is just an array anyway
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
In reply to Re^2: Performance of hash and array inserts
by LanX
in thread Performance of hash and array inserts
by bliako
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |