a_sync.a_sync.modifiers.cache package

Submodules

a_sync.a_sync.modifiers.cache.memory module

class a_sync.a_sync.modifiers.cache.memory.CacheKwargs[source]

Bases: TypedDict

__getitem__(): x.__getitem__(y) <==> x[y]

__init__(*args, **kwargs)

__iter__(): Implement iter(self).

__new__(**kwargs)

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

copy() → a shallow copy of D

fromkeys(value=None, /): Create a new dictionary with keys from iterable and values set to value.

get(key, default=None, /): Return the value for key if key is in the dictionary, else default.

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 the key is not found, return the default if given; otherwise, raise a KeyError.

popitem()

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault(key, default=None, /)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update([E, ]**F) → None. Update D from dict/iterable E and F.: If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

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

maxsize: int | None

ttl: int | None

typed: bool

a_sync.a_sync.modifiers.cache.memory.apply_async_memory_cache(coro_fn=None, maxsize=None, ttl=None, typed=False)[source]

Parameters:

coro_fn (Callable[[~P], Awaitable[T]] | int | None)
maxsize (int | None)
ttl (int | None)
typed (bool)

Return type:

Callable[[Callable[[~P], Awaitable[T]]], Callable[[~P], Awaitable[T]]] | Callable[[~P], Awaitable[T]]

Module contents

class a_sync.a_sync.modifiers.cache.CacheArgs[source]