hugedict.types

Classes

CacheHugeMapping()
CacheHugeMutableMapping()
HugeMapping()
HugeMutableMapping()

Exceptions

InvalidUsageError

exception InvalidUsageError

Bases: Exception

args

with_traceback()

Exception.with_traceback(tb) – set self.__traceback__ to tb and return self.

class HugeMapping

Bases: Mapping[K, V]

abstract cache() → CacheHugeMapping[K, V]

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

Return type:

CacheHugeMapping[K, V]

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

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

values() → an object providing a view on D's values

class HugeMutableMapping

Bases: MutableMapping[K, V]

abstract cache() → CacheHugeMutableMapping[K, V]

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

Return type:

CacheHugeMutableMapping[K, V]

clear() → None.  Remove all items from D.

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

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

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

values() → an object providing a view on D's values

class CacheHugeMapping

Bases: HugeMapping[K, V]

abstract update_cache(o: Union[Mapping[K, V], Sequence[Tuple[K, V]]]) → CacheHugeMapping[K, V]

Update the cache with the given mapping or iterator

Parameters:

o (Union[Mapping[K, V], Sequence[Tuple[K, V]]]) –

Return type:

CacheHugeMapping[K, V]

abstract cache() → CacheHugeMapping[K, V]

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

Return type:

CacheHugeMapping[K, V]

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

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

values() → an object providing a view on D's values

class CacheHugeMutableMapping

Bases: HugeMutableMapping[K, V]

abstract update_cache(o: Union[Mapping[K, V], Sequence[Tuple[K, V]]]) → CacheHugeMutableMapping[K, V]

Update the cache with the given mapping or iterator

Parameters:

o (Union[Mapping[K, V], Sequence[Tuple[K, V]]]) –

Return type:

CacheHugeMutableMapping[K, V]

abstract cache() → CacheHugeMutableMapping[K, V]

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

Return type:

CacheHugeMutableMapping[K, V]

clear() → None.  Remove all items from D.

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

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

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

values() → an object providing a view on D's values