Timed memoize
fork of fast-memoize and support esm
A memoization library which only remembers the latest invocation
A memoization function that uses a WeakMap
Memoize functions - An optimization used to speed up consecutive function calls by caching the result of calls with identical input
Memoize decorator for Typescript
Fastest memoization lib that supports N arguments
Memoize promise-returning & async functions
The lodash method `_.memoize` exported as a module.
Intuitive magical memoization library with Proxy and WeakMap
A blazing fast memoization library that is tiny but feature-rich.
Timeout HTTP/HTTPS requests
Faster than fast, smaller than micro ... a nano speed and nano size memoizer.
Memoization utilities for cacheable
A memoization algorithm in which each function argument represents a new key, creating a trie of caches as defined by the array in your first argument.
A memoization algorithm that only caches the result of the latest set of arguments, where argument equality is determined via a provided equality function.
Garbage-collected memoizer for variadic functions
Fast memoization decorator and other helpers with 1st class support for Promises.
Memoize getters and methods to compute only once
Memoize/cache function results
Memoize any function using Keyv as storage backend.
A utility to provide lru memoization for any js function
TypeScript definitions for lodash.memoize
memoize the last result, in async way
Reusable module to extend named memoized blocks with an expiration time.
Memoize a method result, refetching after a time to live has elapsed.
Adds memoization to methods with optional time-to-live and LRU eviction
SafeMemoize is a production-ready, zero-dependency memoization library for Ruby. It uses Ruby's prepend mechanism to wrap methods with a thread-safe cache (Mutex + double-check locking) that correctly handles nil and false return values — fixing the silent bug in the common ||= pattern. Results are cached per unique argument combination, so parameterized methods only compute each variant once. Additional features include TTL expiration, LRU cache size limiting, conditional caching via if:/unless: predicates, lifecycle hooks for hit/eviction/expiration events, per-instance metrics (hit rate, miss rate, computation time), targeted cache invalidation, custom cache key generators, and introspection helpers. Method visibility (public, protected, private) is fully preserved.