|
__init__(self,
odict=None)
x.__init__(...) initializes x; see x.__class__.__doc__ for
signature
|
|
__iter__(self)
iter(x)
|
|
__setitem__(self,
key,
item)
x[i]=y
|
|
__getitem__(self,
key)
x[y]
|
|
__delitem__(self,
key)
del x[y]
|
|
keys(self)
|
|
items(self)
|
|
values(self)
|
|
iterkeys(self)
|
|
iteritems(self)
|
|
itervalues(self)
|
|
clear(self)
Remove all items from D.
|
|
copy(self)
|
|
update(self,
odict)
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]
|
|
setdefault(self,
key,
d=None)
|
|
get(self,
key,
d=None)
d defaults to None.
|
|
has_key(self,
key)
|
|
popitem(self)
2-tuple; but raise KeyError if D is empty
|
|
pop(self,
key,
d=None)
If key is not found, d is returned if given, otherwise KeyError is
raised
|
|
fromkeys(keys,
d=None)
v defaults to None.
|
|
__contains__(self,
key)
|
|
__len__(self)
len(x)
|
|
__repr__(self)
repr(x)
|
|
__str__(self)
str(x)
|
|
__copy__(self)
|
|
__deepcopy__(self,
memo=None,
_nil=[])
|
|
Inherited from dict:
__cmp__,
__eq__,
__ge__,
__getattribute__,
__gt__,
__hash__,
__le__,
__lt__,
__ne__,
__new__
Inherited from object:
__delattr__,
__reduce__,
__reduce_ex__,
__setattr__
|