|
|
|
__contains__(D,
k)
Returns:
True if D has a key k, else False |
|
|
|
__delitem__(x,
y)
del x[y] |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
__init__()
x.__init__(...) initializes x; see x.__class__.__doc__ for signature |
|
|
|
|
|
|
|
|
|
|
|
|
|
__new__(T,
S,
...)
Returns:
a new object with type S, a subtype of T |
|
|
|
|
|
__setitem__(x,
i,
y)
x[i]=y |
|
|
|
clear(D)
Remove all items from D. |
|
|
|
copy(D)
Returns:
a shallow copy of D |
|
|
|
fromkeys(dict,
S,
v=...)
v defaults to None. |
|
|
|
get(D,
k,
d=...)
d defaults to None. |
|
|
|
has_key(D,
k)
Returns:
True if D has a key k, else False |
|
|
|
items(D)
Returns:
list of D's (key, value) pairs, as 2-tuples |
|
|
|
iteritems(D)
Returns:
an iterator over the (key, value) items of D |
|
|
|
iterkeys(D)
Returns:
an iterator over the keys of D |
|
|
|
itervalues(D)
Returns:
an iterator over the values of D |
|
|
|
keys(D)
Returns:
list of D's keys |
|
|
|
pop(D,
k,
d=...)
If key is not found, d is returned if given, otherwise KeyError is
raised |
|
|
|
popitem(D)
2-tuple; but raise KeyError if D is empty |
|
|
|
setdefault(D,
k,
d=...)
Returns:
D.get(k,d), also set D[k]=d if k not in D |
|
|
|
update(D,
E,
**F)
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] |
|
|
|
values(D)
Returns:
list of D's values |
|
|
Inherited from object :
__delattr__ ,
__reduce__ ,
__reduce_ex__ ,
__setattr__ ,
__str__
|