permanent_cache

lru_cache

`basic_cache` makes a cache that does not expire old entries.
It should be used in situations where you know the number of
things to remember is bounded.
Construct a cache with least-recently-used policy.

A simple in-memory, LRU cache that can be wrapped
around any function to memoize it. The cache is keyed on a hash of the input data (using 'digest') or on pointer equivalence.

Peter Meilstrup

memo

In-Memory Caching of Repeated Computations (Memoization)

permanent_cache function

<dl><dt>size</dt>
<dd>The maximum number of results to keep.</dd></dl>

Arguments

`basic_cache` makes a cache that does not expire old entries.
It should be used in situations where you know the number of
things to remember is bounded. — permanent_cache

<dl>

<dt>size</dt>
<dd>The maximum number of results to keep.</dd>

</dl>

`basic_cache` makes a cache that does not expire old entries.
It should be used in situations where you know the number of
things to remember is bounded.

permanent_cache: `basic_cache` makes a cache that does not expire old entries. It should be used in situations where you know the number of things to remember is bounded.

Description

Usage

Value

Arguments