This implementation of a dictionary keeps track of the order in which
keys were inserted.
|
|
__init__(self,
d={})
x.__init__(...) initializes x; see x.__class__.__doc__ for signature |
source code
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
update(self,
d)
Update D from E and F: for k in E: D[k] = E[k] (if E has keys else:
for (k, v) in E: D[k] = v) then: for k in F: D[k] = F[k] |
source code
|
|
|
|
|
|
|
move(self,
key,
index)
Move the specified to key to *before* the specified index. |
source code
|
|
|
|
|
|
Inherited from dict:
__cmp__,
__contains__,
__eq__,
__ge__,
__getattribute__,
__getitem__,
__gt__,
__hash__,
__iter__,
__le__,
__len__,
__lt__,
__ne__,
__new__,
__repr__,
copy,
fromkeys,
get,
has_key,
iteritems,
iterkeys,
itervalues,
pop
Inherited from object:
__delattr__,
__reduce__,
__reduce_ex__,
__setattr__,
__str__
|