A simple Trie data structure for optimized for lowercased latin alphanumeric strings. Optimization was done based on the following assumption:
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Curated collection of data structures for the JavaScript/TypeScript.
Trie Data Structure to support cspell.
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.
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.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
An Ethereum statemanager implementation
Radix trie module.
Provides fast access to unicode character properties
Check permissions using Shiro-like strings, put in a trie.
TypeScript definitions for unicode-trie
Radix Trie in Javascript
Lightweight Path Trie for TypeScript and 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
trie implementation in javascript