The TRIE data structure and search algorithm, on top of leveldb.
Curated collection of data structures for the JavaScript/TypeScript.
https://en.wikipedia.org/wiki/Trie
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
Trie Data Structure to support cspell.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
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.
Fast and tiny fuzzy-search utility
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Crazy fast http radix based router
An Ethereum statemanager implementation
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.
Radix trie module.
Check permissions using Shiro-like strings, put in a trie.
TypeScript definitions for unicode-trie
Provides fast access to unicode character properties
Radix Trie in Javascript
Splits an url into sub-domain, domain and effective top-level-domain
trie implementation in javascript
A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp
Minimalistic trie implementation for prefix searches
No description provided.
No description provided.
No description provided.
No description provided.