hugedict.cachedict#

Classes

CacheDict(mapping)

class CacheDict(mapping: MutableMapping[K, V])[source]#

Bases: CacheHugeMutableMapping[K, V]

Parameters:: mapping (MutableMapping[K, V]) –

keys() → a set-like object providing a view on D's keys[source]#

Return type:: KeysView[K]

values() → an object providing a view on D's values[source]#

Return type:: ValuesView[V]

items() → a set-like object providing a view on D's items[source]#

Return type:: ItemsView[K, V]

get(k[, d]) → D[k] if k in D, else d. d defaults to None.[source]#

Parameters:: key (K) –

cache() → CacheDict[K, V][source]#

Return a new mapping that will cache the results to avoid calling to an external mapping

Return type:: CacheDict[K, V]

update_cache(o: Union[Mapping[K, V], Sequence[Tuple[K, V]]]) → CacheDict[K, V][source]#

Update the cache with the given mapping or iterator

Parameters:: o (Union[Mapping[K, V], Sequence[Tuple[K, V]]]) –
Return type:: CacheDict[K, V]

clear() → None. Remove all items from 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.

popitem() → (k, v), remove and return some (key, value) pair#: as a 2-tuple; but raise KeyError if D is empty.

setdefault(k[, d]) → D.get(k,d), also set D[k]=d if k not in 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