Alexander Schremmer <2008a <at> usenet.alexanderweb.de> writes:
Even worse, most of them are slow, i.e. show a wrong algorithmic complexity ...
I already said that in the initial post.
I have an example implementation here that incorporates the ideas from ordereddict, Django's OrderedDict and Babel's odict:
... like your implementation. It is not too hard to get the delitem O(log n) compared to your O(n), see here:
That implementation is intended as example implementation for a possible API not one you should actually use.