Orbits
1
|
Public Member Functions | |
def | __setitem__ |
def | __delitem__ |
def | pop |
def | popitem |
def | clear |
def | update |
def | setdefault |
Public Member Functions inherited from _abcoll.Mapping | |
def | __getitem__ |
def | get |
def | __contains__ |
def | iterkeys |
def | itervalues |
def | iteritems |
def | keys |
def | items |
def | values |
def | __eq__ |
def | __ne__ |
Public Member Functions inherited from _abcoll.Sized | |
def | __len__ |
def | __subclasshook__ |
Public Member Functions inherited from _abcoll.Iterable | |
def | __iter__ |
def | __subclasshook__ |
Public Member Functions inherited from _abcoll.Container | |
def | __contains__ |
def | __subclasshook__ |
Static Private Attributes | |
tuple | __marker = object() |
A MutableMapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __setitem__, __delitem__, __iter__, and __len__.
def _abcoll.MutableMapping.__delitem__ | ( | self, | |
key | |||
) |
def _abcoll.MutableMapping.__setitem__ | ( | self, | |
key, | |||
value | |||
) |
def _abcoll.MutableMapping.clear | ( | self | ) |
def _abcoll.MutableMapping.pop | ( | self, | |
key, | |||
default = __marker |
|||
) |
D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised.
def _abcoll.MutableMapping.popitem | ( | self | ) |
D.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty.
def _abcoll.MutableMapping.setdefault | ( | self, | |
key, | |||
default = None |
|||
) |
def _abcoll.MutableMapping.update | ( | args, | |
kwds | |||
) |
D.update([E, ]**F) -> None. Update D from mapping/iterable E and F. If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v
|
staticprivate |
Copyright 2014 Google Inc. All rights reserved.