Home | Trees | Indices | Help |
|
---|
|
A hashable dict.
|
|||
new empty dictionary |
|
||
|
|||
|
|||
None |
|
||
D.get(k,d), also set D[k]=d if k not in D |
|
||
(k, v), remove and return some (key, value) pair as a |
|
||
None |
|
||
|
|||
Inherited from Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
x[i]=y
|
del x[y]
|
Remove all items from D.
|
|
2-tuple; but raise KeyError if D is empty
|
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]
|
hash(x)
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue May 19 22:38:41 2009 | http://epydoc.sourceforge.net |