|
OpenQuizz
Une application de gestion des contenus pédagogiques
|


Public Member Functions | |
| def | __init__ (self, *maps) |
| def | __missing__ (self, key) |
| def | __getitem__ (self, key) |
| def | get (self, key, default=None) |
| def | __len__ (self) |
| def | __iter__ (self) |
| def | __contains__ (self, key) |
| def | __bool__ (self) |
| def | __repr__ (self) |
| def | fromkeys (cls, iterable, *args) |
| def | copy (self) |
| def | new_child (self) |
| def | parents (self) |
| def | __setitem__ (self, key, value) |
| def | __delitem__ (self, key) |
| def | popitem (self) |
| def | pop (self, key, *args) |
| def | clear (self) |
Data Fields | |
| maps | |
A ChainMap groups multiple dicts (or other mappings) together to create a single, updateable view. The underlying mappings are stored in a list. That list is public and can accessed or updated using the *maps* attribute. There is no other state. Lookups search the underlying mappings successively until a key is found. In contrast, writes, updates, and deletions only operate on the first mapping.
| def __init__ | ( | self, | |
| * | maps | ||
| ) |
Initialize a ChainMap by setting *maps* to the given mappings. If no mappings are provided, a single empty dictionary is used.
| def __bool__ | ( | self | ) |
| def __contains__ | ( | self, | |
| key | |||
| ) |
| def __delitem__ | ( | self, | |
| key | |||
| ) |
| def __getitem__ | ( | self, | |
| key | |||
| ) |
| def __iter__ | ( | self | ) |
| def __len__ | ( | self | ) |
| def __missing__ | ( | self, | |
| key | |||
| ) |
| def __repr__ | ( | self | ) |
| def __setitem__ | ( | self, | |
| key, | |||
| value | |||
| ) |
| def clear | ( | self | ) |
| def copy | ( | self | ) |
| def fromkeys | ( | cls, | |
| iterable, | |||
| * | args | ||
| ) |
| def get | ( | self, | |
| key, | |||
default = None |
|||
| ) |
| def new_child | ( | self | ) |
| def parents | ( | self | ) |
| def pop | ( | self, | |
| key, | |||
| * | args | ||
| ) |
| def popitem | ( | self | ) |
| maps |