What Eily says. Then, according to perldata:
You can preallocate space for a hash by assigning to the keys() function. This rounds up the allocated buckets to the next power of two:keys(%users) = 1000; # allocate 1024 buckets
I'm not sure about the impact on performance, though.
In reply to Re: Faster Hash Slices
by shmem
in thread Faster Hash Slices
by jht
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |