Dictionary in Python
Dictionary in Python
class dict(object)
| d = {}
| for k, v in iterable:
| d[k] = v
| __contains__(self, key, /)
| __delitem__(self, key, /)
| Delete self[key].
| __eq__(self, value, /)
| Return self==value.
|
| __ge__(self, value, /)
| Return self>=value.
| __getattribute__(self, name, /)
| __getitem__(self, key, /)
| Return self[key].
| __gt__(self, value, /)
| Return self>value.
| __ior__(self, value, /)
| Return self|=value.
| __iter__(self, /)
| Implement iter(self).
| __le__(self, value, /)
| Return self<=value.
| __len__(self, /)
| Return len(self).
| __lt__(self, value, /)
| Return self<value.
| __ne__(self, value, /)
| Return self!=value.
| __or__(self, value, /)
| Return self|value.
| __repr__(self, /)
| Return repr(self).
| __reversed__(self, /)
| __ror__(self, value, /)
| Return value|self.
|
| __setitem__(self, key, value, /)
| __sizeof__(self, /)
| clear(self, /)
| copy(self, /)
| Return the value for key if key is in the dictionary, else default.
| items(self, /)
| keys(self, /)
| D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
|
| raise a KeyError.
| popitem(self, /)
| Return the value for key if key is in the dictionary, else default.
| update(...)
| If E is present and has a .keys() method, then does: for k in E.keys(): D[k] =
E[k]
| values(self, /)
| Return an object providing a view on the dict's values.
| ----------------------------------------------------------------------
| __class_getitem__(object, /)
| fromkeys(iterable, value=None, /)
| Create a new dictionary with keys from iterable and values set to value.
| ----------------------------------------------------------------------
| __new__(*args, **kwargs)
| Create and return a new object. See help(type) for accurate signature.
| ----------------------------------------------------------------------
| __hash__ = None