What happens when the array fills up?
When the lists get too long:
Perl doubles the number of buckets and rebuilds the table:
Rebuilding happens only O(log n) times and the average total cost per item is O(1)
| Next | Hash Hash Hash | 32 |
When the lists get too long:
Perl doubles the number of buckets and rebuilds the table:
Rebuilding happens only O(log n) times and the average total cost per item is O(1)
| Next |  |
32 |