trie-memoize
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.
Activity
- Latest release
- 6y ago
- Total releases
- 27
- Cadence
- ~daily
- Last 12 months
- 0
Details
- License
- MIT
- First release
- Feb 26, 2019
Releases
| Version | Released | |
|---|---|---|
1.2.0
minor
| ||
1.1.5
patch
| ||
1.1.4
patch
| ||
1.1.3
patch
| ||
1.1.2
patch
| ||
1.1.1
patch
| ||
1.1.0
minor
| ||
1.0.19
patch
| ||
1.0.18
patch
| ||
1.0.17
patch
| ||
1.0.16
patch
| ||
1.0.15
patch
| ||
1.0.14
patch
| ||
1.0.13
patch
| ||
1.0.12
patch
| ||
1.0.11
patch
| ||
1.0.10
patch
| ||
1.0.9
patch
| ||
1.0.8
patch
| ||
1.0.7
patch
| ||
1.0.6
patch
| ||
1.0.5
patch
| ||
1.0.4
patch
| ||
1.0.3
patch
| ||
1.0.2
patch
| ||
1.0.1
patch
| ||
1.0.0
initial
|