A compact trie for mapping keys to values
https://en.wikipedia.org/wiki/Trie
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Unicode Trie data structure for fast character metadata lookup, ported from ICU
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.
Trie Data Structure to support cspell.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Curated collection of data structures for the JavaScript/TypeScript.
A library for obtaining browser versions with their maximum supported Baseline feature set and Widely Available status.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Fast and tiny fuzzy-search utility
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 source maps
Trace the original position through a source map
Packages @jridgewell/trace-mapping and @jridgewell/gen-mapping into the familiar source-map API
Provides functionality related to source maps.
Radix trie module.
TypeScript definitions for unicode-trie
Provides fast access to unicode character properties
Check permissions using Shiro-like strings, put in a trie.
Gamut map css colors to fit display specific gamuts