Pure string:val storage, using structural sharing
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
https://en.wikipedia.org/wiki/Trie
Trie Data Structure to support cspell.
Fork of HAMT that adds transient mutation and support for custom key types
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Curated collection of data structures for the JavaScript/TypeScript.
Immutable hash maps implemented as hash array papped tries
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
Immutable Data Collections
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
Strongly typed trie data structure for path and URL-like strings.
Generate hashes from javascript objects in node and the browser.
Stable JS value hash.
Implementation of JSON Web Signatures
Utilities for treating frozen JavaScript objects as persistent immutable collections.
Merkle tree implemented as a persistent datastructure
A MurmurHash2 implementation
JWA implementation (supports all JWS algorithms)