Utilities

postprocess_copy_mutables(value: VT) -> VT

Shallow-copy value before returning it (only dict, list, and set)

Source code in cachebox/utils.py

def postprocess_copy_mutables(value: VT) -> VT:
    """
    Shallow-copy *value* before returning it (only `dict`, `list`, and `set`)
    """
    if type(value) in _COPY_TYPES:
        return _shallow_copy(value)

    return value

postprocess_copy(value: VT) -> VT

Shallow-copy value before returning it

Source code in cachebox/utils.py

def postprocess_copy(value: VT) -> VT:
    """Shallow-copy *value* before returning it"""
    return _shallow_copy(value)

postprocess_deepcopy_mutables(value: VT) -> VT

Deep-copy value before returning it (only dict, list, and set)

Source code in cachebox/utils.py

def postprocess_deepcopy_mutables(value: VT) -> VT:
    """
    Deep-copy *value* before returning it (only `dict`, `list`, and `set`)
    """
    if type(value) in _COPY_TYPES:
        return _deep_copy(value)

    return value

postprocess_deepcopy(value: VT) -> VT

Deep-copy value before returning it

Source code in cachebox/utils.py

def postprocess_deepcopy(value: VT) -> VT:
    """Deep-copy *value* before returning it"""
    return _deep_copy(value)

make_key(*args, **kwds) -> typing.Hashable

Default cache key.

Fast-path: a single int or str argument is returned as-is. Otherwise a plain tuple (plus a kwargs sentinel when needed) is returned.

Source code in cachebox/utils.py

def make_key(*args, **kwds) -> typing.Hashable:
    """
    Default cache key.

    Fast-path: a single ``int`` or ``str`` argument is returned as-is.
    Otherwise a plain tuple (plus a kwargs sentinel when needed) is returned.
    """
    if not kwds:
        if len(args) == 1 and type(args[0]) in _FAST_TYPES:
            return args[0]
        return args

    key = args + (_KWDS_MARK,)
    for item in kwds.items():
        key += item
    return key[0] if len(key) == 1 and type(key[0]) in _FAST_TYPES else key

make_hash_key(*args, **kwds) -> int

Key as the hash of all positional and keyword arguments.

Avoids storing the raw argument tuple, at the cost of potential hash collisions mapping distinct inputs to the same cache slot.

Source code in cachebox/utils.py

def make_hash_key(*args, **kwds) -> int:
    """
    Key as the hash of all positional and keyword arguments.

    Avoids storing the raw argument tuple, at the cost of potential hash
    collisions mapping distinct inputs to the same cache slot.
    """
    if not kwds:
        return hash(args)
    key = args + (_KWDS_MARK,)
    for item in kwds.items():
        key += item
    return hash(key)

make_typed_key(*args, **kwds) -> tuple

Key that includes the runtime type of every argument.

Ensures f(1) and f(1.0) are cached separately even though 1 == 1.0.

Source code in cachebox/utils.py

def make_typed_key(*args, **kwds) -> tuple:
    """
    Key that includes the runtime type of every argument.

    Ensures ``f(1)`` and ``f(1.0)`` are cached separately even though
    ``1 == 1.0``.
    """
    key: tuple = args
    if kwds:
        key += (_KWDS_MARK,)
        for item in kwds.items():
            key += item

    key += tuple(type(v) for v in args)
    if kwds:
        key += tuple(type(v) for v in kwds.values())

    return key

Frozen(cls: BaseCacheImpl[KT, VT], ignore: bool = False)

A wrapper class that prevents modifications to an underlying cache implementation.

This class provides a read-only view of a cache, optionally allowing silent suppression of modification attempts instead of raising exceptions.

Example::

from cachebox import Frozen, FIFOCache

cache = FIFOCache(10, {1:1, 2:2, 3:3})

frozen = Frozen(cache, ignore=True)
print(frozen[1]) # 1
print(len(frozen)) # 3

# Frozen ignores this action and do nothing
frozen.insert("key", "value")
print(len(frozen)) # 3

# Let's try with ignore=False
frozen = Frozen(cache, ignore=False)

frozen.insert("key", "value")
# TypeError: This cache is frozen.

Initialize a frozen cache wrapper.

Parameters:

• cls

  (BaseCacheImpl[KT, VT]) –

  The underlying cache implementation to be frozen.

• ignore

  (bool, default: False ) –

  If True, silently ignores modification attempts; if False, raises TypeError when modification is attempted. Default is False.

Source code in cachebox/utils.py

def __init__(self, cls: BaseCacheImpl[KT, VT], ignore: bool = False) -> None:
    """
    Initialize a frozen cache wrapper.

    Args:
        cls: The underlying cache implementation to be frozen.
        ignore: If ``True``, silently ignores modification attempts; if ``False``, raises
            ``TypeError`` when modification is attempted. Default is ``False``.
    """
    assert isinstance(cls, BaseCacheImpl)
    assert type(cls) is not Frozen

    self.__cache = cls
    self.ignore = ignore

cache: BaseCacheImpl[KT, VT] property

Returns the wrapped cache implementation.

getsizeof: typing.Callable[[KT, VT], int] | None property

Callable or None: The configured getsizeof function.

maxsize: int property

The configured maxsize.

__len__() -> int

Returns the number of entries currently in the cache.

Returns:

• int –

  The number of entries in the cache.

Source code in cachebox/utils.py

def __len__(self) -> int:
    """
    Returns the number of entries currently in the cache.

    Returns:
        The number of entries in the cache.
    """
    return len(self.__cache)

__new__(*args, **kwds) -> typing.Self

Allocates memory and returns an uninitialized instance.

Warning

Using the returned instance before calling __init__ is unsafe and causes panic errors.

Source code in cachebox/_core.pyi

def __new__(cls, *args, **kwds) -> typing.Self:
    """
    Allocates memory and returns an uninitialized instance.

    Warning:
        Using the returned instance before calling ``__init__`` is unsafe
        and causes panic errors.
    """
    ...

capacity() -> int

Returns the number of elements the map can hold without reallocating.

Returns:

• int –

  The current allocated capacity.

Source code in cachebox/utils.py

def capacity(self) -> int:
    """
    Returns the number of elements the map can hold without reallocating.

    Returns:
        The current allocated capacity.
    """
    return self.__cache.capacity()

clear(*, reuse: bool = False) -> None

Removes all items from the cache.

Parameters:

• reuse

  (bool, default: False ) –

  If True, retains the allocated memory for future reuse rather than freeing it. Defaults to False.

Source code in cachebox/utils.py

def clear(self, *, reuse: bool = False) -> None:
    """
    Removes all items from the cache.

    Args:
        reuse: If ``True``, retains the allocated memory for future reuse
            rather than freeing it. Defaults to ``False``.
    """
    return self._guard()

contains(key: KT) -> bool

Returns True if the cache contains an entry for key.

Equivalent to key in self. Prefer this method over key in self to keep code compatible across different cache policies.

Parameters:

• key

  (KT) –

  The key to look up.

Returns:

• bool –

  True if the key exists in the cache, False otherwise.

Source code in cachebox/utils.py

def contains(self, key: KT) -> bool:
    """
    Returns ``True`` if the cache contains an entry for ``key``.

    Equivalent to ``key in self``. Prefer this method over ``key in self``
    to keep code compatible across different cache policies.

    Args:
        key: The key to look up.

    Returns:
        ``True`` if the key exists in the cache, ``False`` otherwise.
    """
    return self.__cache.contains(key)

current_size() -> int

Returns the current total cumulative size of all stored entries.

Returns:

• int –

  The sum of sizes of all entries currently in the cache.

Source code in cachebox/utils.py

def current_size(self) -> int:
    """
    Returns the current total cumulative size of all stored entries.

    Returns:
        The sum of sizes of all entries currently in the cache.
    """
    return self.__cache.current_size()

drain(n: int) -> int

Calls popitem() n times and returns the count of removed items.

Parameters:

• n

  (int) –

  The number of items to remove.

Returns:

• int –

  The number of items successfully removed.

Source code in cachebox/utils.py

def drain(self, n: int) -> int:
    """
    Calls ``popitem()`` ``n`` times and returns the count of removed items.

    Args:
        n: The number of items to remove.

    Returns:
        The number of items successfully removed.
    """
    return self._guard()  # type: ignore[return-value]

is_empty() -> bool

Returns True if the cache is empty.

Returns:

• bool –

  True if the cache contains no entries.

Source code in cachebox/utils.py

def is_empty(self) -> bool:
    """
    Returns ``True`` if the cache is empty.

    Returns:
        ``True`` if the cache contains no entries.
    """
    return self.__cache.is_empty()

is_full() -> bool

Returns True when the cumulative size has reached the maxsize limit.

Returns:

• bool –

  True if the cache is at capacity.

Source code in cachebox/utils.py

def is_full(self) -> bool:
    """
    Returns ``True`` when the cumulative size has reached the maxsize limit.

    Returns:
        ``True`` if the cache is at capacity.
    """
    return self.__cache.is_full()

pop(key: KT, default: DT = None) -> typing.Union[VT, DT]

Removes the specified key and returns the corresponding value.

Parameters:

• key

  (KT) –

  The key to remove.

• default

  (DT, default: None ) –

  Value to return if the key is not found.

Returns:

• Union[VT, DT] –

  The value associated with key, or default if not found.

Raises:

• KeyError –

  If the key is not found and no default is provided.

Source code in cachebox/utils.py

def pop(self, key: KT, default: DT = None) -> typing.Union[VT, DT]:
    """
    Removes the specified key and returns the corresponding value.

    Args:
        key: The key to remove.
        default: Value to return if the key is not found.

    Returns:
        The value associated with ``key``, or ``default`` if not found.

    Raises:
        KeyError: If the key is not found and no ``default`` is provided.
    """
    return self._guard()  # type: ignore[return-value]

remaining_size() -> int

Returns the remaining available size.

Returns:

• int –

  The result of maxsize - current_size.

Source code in cachebox/utils.py

def remaining_size(self) -> int:
    """
    Returns the remaining available size.

    Returns:
        The result of ``maxsize - current_size``.
    """
    return self.__cache.remaining_size()

shrink_to_fit() -> None

Shrinks the internal allocation as close to the current length as possible.

Source code in cachebox/utils.py

def shrink_to_fit(self) -> None:
    """Shrinks the internal allocation as close to the current length as possible."""
    return self._guard()

CacheInfo = namedtuple('CacheInfo', ('hits', 'misses', 'maxsize', 'current_size', 'length', 'memory')) module-attribute

EVENT_MISS = 1 module-attribute

EVENT_HIT = 2 module-attribute

cached(cache: BaseCacheImpl | dict | typing.Callable[..., BaseCacheImpl] | None = None, key_maker: typing.Callable[..., typing.Hashable] = make_key, clear_reuse: bool = False, callback: _Callback | None = None, copy_level: int = 1, postprocess: _PostProcess | None = postprocess_copy_mutables) -> typing.Callable[[FT], FT]

Decorator to memoize function/method results.

Parameters:

• cache

  (BaseCacheImpl | dict | Callable[..., BaseCacheImpl] | None, default: None ) –

  Cache instance, dict, or callable (self) -> cache for per-instance caches. None defaults to an unbounded :class:LRUCache.

• key_maker

  (Callable[..., Hashable], default: make_key ) –

  Converts (args, kwds) to a hashable key. Built-ins: :func:make_key (default), :func:make_hash_key, :func:make_typed_key.

• clear_reuse

  (bool, default: False ) –

  Pass reuse=True to cache.clear() when :func:cache_clear is called.

• callback

  (_Callback | None, default: None ) –

  Called as callback(event, key, value) on every hit/miss. May be a coroutine in async contexts.

• copy_level

  (int, default: 1 ) –

  It has been deprecated and no longer has any effect. Use the postprocess parameter instead.

• postprocess

  (_PostProcess | None, default: postprocess_copy_mutables ) –

  Optional (value) -> value transform applied before returning a result to the caller. Ready-to-use options:

  • None - return the cached object as-is.
  • :func:postprocess_copy - shallow-copy.
  • :func:postprocess_copy_mutables - shallow-copy only dict, list and set (default).
  • :func:postprocess_deepcopy - deep-copy.
  • :func:postprocess_deepcopy_mutables - deep-copy only dict, list and set.

Note

Pass cachebox__ignore=True at call-time to bypass the cache. If cache isn't a lambda/function, these attributes will be attached to your function: cache (property), cache_info (callable), clear_cache (callable), and callback (property).

Examples::

@cachebox.cached(cachebox.LRUCache(128))
def add(a, b):
    return a + b

# Per-instance method cache
class Foo:
    def __init__(self):
        self._cache = cachebox.LRUCache(0)

    @cachebox.cached(lambda self: self._cache)
    def compute(self, n):
        return n * 2

Source code in cachebox/utils.py

def cached(
    cache: BaseCacheImpl | dict | typing.Callable[..., BaseCacheImpl] | None = None,
    key_maker: typing.Callable[..., typing.Hashable] = make_key,
    clear_reuse: bool = False,
    callback: _Callback | None = None,
    copy_level: int = 1,
    postprocess: _PostProcess | None = postprocess_copy_mutables,
) -> typing.Callable[[FT], FT]:
    """
    Decorator to memoize function/method results.

    Args:
        cache: Cache instance, ``dict``, or callable ``(self) -> cache`` for
            per-instance caches. ``None`` defaults to an unbounded
            :class:`LRUCache`.
        key_maker: Converts ``(args, kwds)`` to a hashable key. Built-ins:
            :func:`make_key` (default), :func:`make_hash_key`,
            :func:`make_typed_key`.
        clear_reuse: Pass ``reuse=True`` to ``cache.clear()`` when
            :func:`cache_clear` is called.
        callback: Called as ``callback(event, key, value)`` on every hit/miss.
            May be a coroutine in async contexts.
        copy_level: It has been deprecated and no longer has any effect. Use
            the postprocess parameter instead.
        postprocess: Optional ``(value) -> value`` transform applied before
            returning a result to the caller. Ready-to-use options:

            * ``None`` - return the cached object as-is.
            * :func:`postprocess_copy` - shallow-copy.
            * :func:`postprocess_copy_mutables` - shallow-copy only `dict`, `list` and `set` (default).
            * :func:`postprocess_deepcopy` - deep-copy.
            * :func:`postprocess_deepcopy_mutables` - deep-copy only `dict`, `list` and `set`.

    Note:
        Pass ``cachebox__ignore=True`` at call-time to bypass the cache.
        If *cache* isn't a lambda/function, these attributes will be attached to
        your function: ``cache`` (property), ``cache_info`` (callable), ``clear_cache`` (callable),
        and ``callback`` (property).

    Examples::

        @cachebox.cached(cachebox.LRUCache(128))
        def add(a, b):
            return a + b

        # Per-instance method cache
        class Foo:
            def __init__(self):
                self._cache = cachebox.LRUCache(0)

            @cachebox.cached(lambda self: self._cache)
            def compute(self, n):
                return n * 2
    """
    if copy_level != 1:
        import warnings

        warnings.warn(
            "`copy_level` parameter has been deprecated and no longer has any effect. Use the `postprocess` parameter instead",
            category=DeprecationWarning,
        )

    if cache is None:
        cache = LRUCache(0)
    elif type(cache) is dict:
        cache = LRUCache(0, cache)  # type: ignore[arg-type]

    cache_is_fn = callable(cache)
    if not isinstance(cache, BaseCacheImpl) and not cache_is_fn:
        raise TypeError("expected a cachebox cache or a callable, got %r" % (cache,))

    def decorator(func: FT) -> FT:
        builder = (
            _async_cached_wrapper
            if inspect.iscoroutinefunction(func)
            else _cached_wrapper
        )
        wrapper = builder(func, cache, key_maker, clear_reuse, callback, postprocess)  # type: ignore[arg-type]
        return functools.update_wrapper(wrapper, func)  # type: ignore[return-value]

    return decorator

is_cached(func: object) -> bool

Return True if func was decorated with :func:cached.

Parameters:

• func

  (object) –

  an object or function to check.

Source code in cachebox/utils.py

def is_cached(func: object) -> bool:
    """
    Return ``True`` if *func* was decorated with :func:`cached`.

    Args:
        func: an object or function to check.
    """
    return hasattr(func, "cache") and isinstance(func.cache, BaseCacheImpl)  # type: ignore[union-attr]

get_cached_cache(cached_func: object) -> BaseCacheImpl

A way to get cached_func.cache, without type-hint warnings.

Parameters:

• cached_func

  (object) –

  a function decorated with :func:cached.

Warning

If func wasn't decorated with :func:cached, or you passed a lambda/function as cache to :func:cached decorator, raises AttributeError.

Source code in cachebox/utils.py

def get_cached_cache(cached_func: object) -> BaseCacheImpl:
    """
    A way to get ``cached_func.cache``, without type-hint warnings.

    Args:
        cached_func: a function decorated with :func:`cached`.

    Warning:
        If *func* wasn't decorated with :func:`cached`, or you passed a lambda/function as *cache*
        to :func:`cached` decorator, raises ``AttributeError``.
    """
    return cached_func.cache  # type: ignore

get_cached_cache_info(cached_func: object) -> CacheInfo

A way to get cached_func.cache_info(), without type-hint warnings.

Parameters:

• cached_func

  (object) –

  a function decorated with :func:cached.

Warning

If func wasn't decorated with :func:cached, or you passed a lambda/function as cache to :func:cached decorator, raises AttributeError.

Source code in cachebox/utils.py

def get_cached_cache_info(cached_func: object) -> CacheInfo:
    """
    A way to get ``cached_func.cache_info()``, without type-hint warnings.

    Args:
        cached_func: a function decorated with :func:`cached`.

    Warning:
        If *func* wasn't decorated with :func:`cached`, or you passed a lambda/function as *cache*
        to :func:`cached` decorator, raises ``AttributeError``.
    """
    return cached_func.cache_info()  # type: ignore

get_cached_callback(cached_func: object) -> _Callback | None

A way to get cached_func.callback, without type-hint warnings.

Parameters:

• cached_func

  (object) –

  a function decorated with :func:cached.

Warning

If func wasn't decorated with :func:cached, or you passed a lambda/function as cache to :func:cached decorator, raises AttributeError.

Source code in cachebox/utils.py

def get_cached_callback(cached_func: object) -> _Callback | None:
    """
    A way to get ``cached_func.callback``, without type-hint warnings.

    Args:
        cached_func: a function decorated with :func:`cached`.

    Warning:
        If *func* wasn't decorated with :func:`cached`, or you passed a lambda/function as *cache*
        to :func:`cached` decorator, raises ``AttributeError``.
    """
    return cached_func.callback  # type: ignore

clear_cached_cache(cached_func: object) -> None

A way to call cached_func.cache_clear(), without type-hint warnings.

Parameters:

• cached_func

  (object) –

  a function decorated with :func:cached.

Warning

If func wasn't decorated with :func:cached, or you passed a lambda/function as cache to :func:cached decorator, raises AttributeError.

Source code in cachebox/utils.py

def clear_cached_cache(cached_func: object) -> None:
    """
    A way to call ``cached_func.cache_clear()``, without type-hint warnings.

    Args:
        cached_func: a function decorated with :func:`cached`.

    Warning:
        If *func* wasn't decorated with :func:`cached`, or you passed a lambda/function as *cache*
        to :func:`cached` decorator, raises ``AttributeError``.
    """
    return cached_func.cache_clear()  # type: ignore