Don't ask to ask, just ask | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
> Because hash algorithms purposely try to distribute values widely, they are naturally more susceptible to this influence.
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 In reply to Re^2: Performance of hash and array inserts
by LanX
|
|