Trees | Indices | Help |
|
---|
|
object --+ | dict --+ | ordereddict
a dictionary which remembers its keys in the order in which they were given
|
|||
new empty dictionary |
|
||
|
|||
None |
|
||
|
|||
a shallow copy of D |
|
||
list of D's (key, value) pairs, as 2-tuples |
|
||
an iterator over the (key, value) items of D |
|
||
an iterator over the keys of D |
|
||
an iterator over the keys of D |
|
||
an iterator over the values of D |
|
||
list of D's keys |
|
||
(k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty |
|
||
v, remove specified key and return the corresponding value |
|
||
Inherited from Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
x[i]=y
|
Update D from E: for k in E.keys(): D[k] = E[k]
|
del x[y]
|
|
|
|
iter(x)
|
iter(x)
|
|
|
2-tuple; but raise KeyError if D is empty
|
remove entry from dict and internal list
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Sep 23 13:50:52 2008 | http://epydoc.sourceforge.net |