Basis for efficient persistent data structures
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Immutable Data Collections
Trie Data Structure to support cspell.
Curated collection of data structures for the JavaScript/TypeScript.
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.
Utilities for treating frozen JavaScript objects as persistent immutable collections.
Check the immutability of TypeScript types
PropType validators that work with Immutable.js.
redux-immutable is used to create an equivalent function of Redux combineReducers that works with Immutable.js state.
Immutable hash maps implemented as hash array papped tries
a date and time library for javascript
TypeScript definitions for unicode-trie
Check permissions using Shiro-like strings, put in a trie.
Radix trie module.
No description provided.
No description provided.
No description provided.