Keep It Simple, Stupid | |
PerlMonks |
Re: A short meditation about hash search performanceby Abigail-II (Bishop) |
on Nov 16, 2003 at 02:58 UTC ( [id://307409]=note: print w/replies, xml ) | Need Help?? |
Well, if you can't do queries in O(1) time, you can't do
deletes in O(1) time (because to delete something, you first
need to find it), and you can only do inserts in O(1) if
you accept duplicates - which Perl hashes don't.
Abigail
In Section
Meditations
|
|