in reply to RE: Shift, Pop, Unshift and Push with Impunity!
in thread Shift, Pop, Unshift and Push with Impunity!
Says nobody in particular:
There is an example of unsuccessful order of data that will make Perl's implementation of hashes to take O(n) for searching.When Hashes Go Wrong
In Section
Meditations