I created a small program that inserts N different values
into a hash, and timed how long it took for several values
of N. You can see the plot at http://perl.abigail.nl/Images/hash_insert.png. It plots the
average insert time against the total size.
The curve skyrockets when the hash is taking enough memory
that swapping is needed.
Abigail
Comment on Re: The Upper Limit of Perl's Native Data Structures