https://en.wikipedia.org/wiki/Trie
Curated collection of data structures for the JavaScript/TypeScript.
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Trie Data Structure to support cspell.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
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.
Fast and tiny fuzzy-search utility
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.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Crazy fast http radix based router
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Strongly typed trie data structure for path and URL-like strings.
generate random IDs and avoid collisions
A cache object that deletes the least-recently-used items.
A lightweight cache for file metadata, ideal for processes that work on a specific set of files and only need to reprocess files that have changed since the last run
Require hook for automatic V8 compile cache persistence
Provides Telemetry APIs for Red Hat applications
A simple key/value storage using files to persist the data
Radix trie module.
Provides fast access to unicode character properties
Check permissions using Shiro-like strings, put in a trie.
TypeScript definitions for unicode-trie
Require hook for automatic V8 compile cache persistence