Just a simple Trie structure built for javascript.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Trie Data Structure to support cspell.
https://en.wikipedia.org/wiki/Trie
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Curated collection of data structures for the JavaScript/TypeScript.
Unicode Trie data structure for fast character metadata lookup, ported from ICU
JavaScript implementation of Double-Array trie
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
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
Strongly typed trie data structure for path and URL-like strings.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Ensure that no reserved words are used.
Radix Trie in Javascript
Convert a string of words to a JavaScript identifier
Check permissions using Shiro-like strings, put in a trie.
Trie Data Structure reader for cspell
Split a double-precision floating-point number into a higher order word and a lower order word.
Radix trie module.
Create a double-precision floating-point number from a higher order word and a lower order word.
Provides fast access to unicode character properties