Curated collection of data structures for the JavaScript/TypeScript.
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Bitfield that allocates a series of small buffers to support sparse bits without allocating a massive buffer
Trie Data Structure to support cspell.
Run an array of functions in parallel
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
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
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.
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.
Minimal async jobs utility library, with streams support
ES Map/Set-compatible implementations with customizable equality semantics & supporting operations
Some git helpers that changesets use to get information
Sparse array implementation in JS with no dependencies
Run an array of functions in parallel, but limit the number of tasks executing at the same time
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.