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.

fork of fast-memoize and support esm

A memoization library which only remembers the latest invocation

https://en.wikipedia.org/wiki/Trie

Memoize functions - An optimization used to speed up consecutive function calls by caching the result of calls with identical input

A memoization function that uses a WeakMap

Memoize decorator for Typescript

Unicode Trie data structure for fast character metadata lookup, ported from ICU

The lodash method `_.memoize` exported as a module.

Trie Data Structure to support cspell.

Memoize promise-returning & async functions

Intuitive magical memoization library with Proxy and WeakMap

A blazing fast memoization library that is tiny but feature-rich.

Curated collection of data structures for the JavaScript/TypeScript.

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

Fastest memoization lib that supports N arguments

Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

Faster than fast, smaller than micro ... a nano speed and nano size memoizer.