Well in theory, but if it comes to hashes that's pretty unlikely.
If one part of a hash is much more frequently accessed than another one, then the hashing function can't be very good.
Or it's always only the same key. :)
Anyway I once had stunning results after transforming a giant hash into a two tier HoH and letting the algorithm concentrating on always a very small group of second tier hashes.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
In reply to Re^4: Memory overhead of blessed hashes
by LanX
in thread Memory overhead of blessed hashes
by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |