memo

memo-package

A function to wrap. It should be a pure function (i.e. it should
not cause side effects, and should not depend on any variables that may
change.) It should not be a nonstandard-evaluating function. All arguments
will be forced by the wrapper.

A cache to use. Defaults to a new instance of
<code><a rd-options="" href="/link/lru_cache?package=memo&version=1.0" data-mini-rdoc="memo::lru_cache">lru_cache</a></code>.  Caches may be shared between memoized functions.

cache

A hashing strategy. "<code><a rd-options="" href="/link/digest_key?package=memo&version=1.0" data-mini-rdoc="memo::digest_key">digest_key</a></code>".
Other values include "pointer_key" and "hybrid_key".


Memoize a function.<p></p><p>This package implements a cache that can be used to avoid repeated
computations of functions. The cache lookup is based on object
identity (i.e.  pointer equivalence) which is suited for functions
like accessors or other functions that are called repeatedly on the
same object.  Description of memo goes here.
</p>

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

Peter Meilstrup

In-Memory Caching for Repeated Computations

memo function

A cache to use. Defaults to a new instance of
<code><a rd-options='' href='lru_cache'>lru_cache</a></code>.  Caches may be shared between memoized functions.

A hashing strategy. "<code><a rd-options='' href='digest_key'>digest_key</a></code>".
Other values include "pointer_key" and "hybrid_key".


Memoize a function.

This package implements a cache that can be used to avoid repeated
computations of functions. The cache lookup is based on object
identity (i.e.  pointer equivalence) which is suited for functions
like accessors or other functions that are called repeatedly on the
same object.  Description of memo goes here.


memo: Memoize a function.

Description

Usage

Arguments