Proposed implementation for an Ordered Dictionary
Colin J. Williams
cjw at ncf.ca
Sat Feb 28 16:58:10 CET 2009
Raymond Hettinger wrote:
> [Paul Rubin]
>> Ehh, I guess I'm not surprised at the slowdown and extra complexity
>> from the second dict. Oh well. If the module really turns out to be
>> really used a lot, another (messy) approach would be to write a C
>> extension that uses a doubly linked list some day.
> That seems like an ideal implementation to me.
> O(1): appending, popping, searching, and deletion
> O(n): traversal
Sometimes, it's useful to be able to
obtain the data in the sorted sequence.
You might consider adding functionality
'''To return the items, sorted
by key. '''
return [self[k] for k in
''' To return the keys sorted. '''
''' To return the values, with
their keys, sorted by value. '''
v= [(it, it) for it in
More information about the Python-list