Unicode Trie data structure for fast character metadata lookup, ported from ICU
Curated collection of data structures for the JavaScript/TypeScript.
Fork of HAMT that adds transient mutation and support for custom key types
A tiny trie implementation
compressed-trie data-structure
A simple trie structure to perform search on texts in O(n) time, where n - number of characters in searched word.
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.
Generate regular expressions that match a set of strings
Trie and radix tree implementation tailored towards exact matches.
Check permissions using Shiro-like strings, put in a trie.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Alternative Map and Set implementations with customizable equality semantics & supporting operations
TypeScript definitions for unicode-trie
TypeScript implementation of the Aho-Corasick algorithm for efficient string matching
Composable trie based router
An efficient immutable ordered sequence of elements akin to a Vector
Like Lego For Databases
An in-memory autocomplete package based on the trie data structure
trie implementation in javascript
Minimalistic trie implementation for autosuggest and autocomplete components.
A fast weighted autocompleter
Apache Shiro permission style using Trie data structure
production-ready data structures implementation in javascript & typescript.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
A trie data structure for arrays
A module for performing a dictionary search
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
TypeScript definitions for trie-prefix-tree