Search results
308 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
https://en.wikipedia.org/wiki/Trie
Curated collection of data structures for the JavaScript/TypeScript.
- bag
- bimap
- bit array
- bit set
- bit vector
- bitset
- bk tree
- burkhard-keller tree
- cache
- circular buffer
- counter
- data structures
- default map
- deque
- View more
Trie Data Structure to support cspell.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Fork of HAMT that adds transient mutation and support for custom key types
Construct Merkle Trees and verify proofs
Strongly typed trie data structure for path and URL-like strings.
JavaScript implementation of Double-Array trie
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.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
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 and radix tree implementation tailored towards exact matches.
Standard data structure
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Generate regular expressions that match a set of strings
Check permissions using Shiro-like strings, put in a trie.
Implementation of verkle trees as used in Ethereum.
Lightweight Path Trie for TypeScript and JavaScript
trie implementation in javascript