Bases: dict
Dictionary that remembers insertion order
Attributes
__dict__ | |
__doc__ | str(object) -> string |
__hash__ | |
__module__ | str(object) -> string |
__weakref__ | list of weak references to the object (if defined) |
Public Methods
clear | |
copy | |
fromkeys | If not specified, the value defaults to None. |
items | |
iteritems | od.iteritems -> an iterator over the (key, value) pairs in od |
iterkeys | |
itervalues | od.itervalues -> an iterator over the values in od |
keys | |
pop | value. If key is not found, d is returned if given, otherwise KeyError |
popitem | Pairs are returned in LIFO order if last is true or FIFO order if false. |
setdefault | |
update | |
values | |
viewitems | |
viewkeys | |
viewvalues |
Private Methods
_OrderedDict__update |
Special Methods
__delitem__ | od.__delitem__(y) <==> del od[y] |
__eq__ | od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive |
__init__ | Initialize an ordered dictionary. |
__iter__ | |
__ne__ | od.__ne__(y) <==> od!=y |
__reduce__ | Return state information for pickling |
__repr__ | |
__reversed__ | |
__setitem__ | od.__setitem__(i, y) <==> od[i]=y |