new empty dictionary
|
__init__(self,
data=None)
x.__init__(...) initializes x; see x.__class__.__doc__ for signature |
|
|
|
|
|
|
|
|
|
an iterator over the keys of D
|
|
|
an iterator over the keys of D
|
|
|
None
|
clear(self)
Remove all items from D. |
|
|
|
a shallow copy of D
|
|
|
list of D's (key, value) pairs, as 2-tuples
|
|
|
an iterator over the (key, value) items of D
|
|
|
list of D's keys
|
|
|
v, remove specified key and return the corresponding value
|
pop(self,
key,
default=missing)
If key is not found, d is returned if given, otherwise KeyError is raised |
|
|
|
(k, v), remove and return some (key, value) pair as a
|
popitem(self,
key)
2-tuple; but raise KeyError if D is empty |
|
|
|
D.get(k,d), also set D[k]=d if k not in D
|
|
|
None
|
update(self,
dict)
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] |
|
|
|
list of D's values
|
|
|
an iterator over the values of D
|
|
|
Inherited from dict:
__cmp__,
__contains__,
__eq__,
__ge__,
__getattribute__,
__getitem__,
__gt__,
__hash__,
__le__,
__len__,
__lt__,
__ne__,
__new__,
__repr__,
fromkeys,
get,
has_key
Inherited from object:
__delattr__,
__reduce__,
__reduce_ex__,
__setattr__,
__str__
|