R: Hashmaps and Memoization (in-Memory Caching of Repeated Computations)

# Hashmaps and Memoization (in-Memory Caching of Repeated Computations)

## Documentation for package ‘memo’ version 1.1.2

- DESCRIPTION file
- User guides, package vignettes and other documentation
- Package NEWS
- Package README

## Help Pages

memo-package | In-memory caching of repeated computations, by pointer equivalence.
cache_stats | Report cache statistics.
digest_key | Strategies for caching items.
dropKey | A reference-valued, key-value store.
from_pairs | A reference-valued, key-value store.
hashmap | A reference-valued, key-value store.
hasKey | A reference-valued, key-value store.
hybrid_key | Strategies for caching items.
keys | A reference-valued, key-value store.
lru_cache | 'permanent_cache' constructs a cache that does not expire old entries. It should be used in situations where you know the number of values to remember is bounded.
memo | Memoize a function.
permanent_cache | 'permanent_cache' constructs a cache that does not expire old entries. It should be used in situations where you know the number of values to remember is bounded.
pointer_key | Strategies for caching items.
strategies | Strategies for caching items.
to_pairs | A reference-valued, key-value store.
values | A reference-valued, key-value store.
[.hashmap | A reference-valued, key-value store.
[<-.hashmap | A reference-valued, key-value store.
[[.hashmap | A reference-valued, key-value store.
[[<-.hashmap | A reference-valued, key-value store.