Compute the Longest Common Prefix from some strings
Data structures, data types, and algorithms with superpowers! 💪
Trie-routing for Koa
Trie and radix tree implementation tailored towards exact matches.
Directed Acyclic Word Graph
simple trie implementation based on JS proxies
Trie datastructure with customer delimiters
Divide et impera. Organize declarative routes in an imperative way for trie, radix or prefix routers
A lightweight trie implementation.
>> Easiest package to build and manipulate prefix trie structures
A trie implementation for NodeJS
Server router for Micro
radix-trie implementation for Inverse Index Document Search.
Trie Data Structure reader for cspell
A ternary search tree implementation in TypeScript.
A wrapper of MARISA library.
Minimalistic trie implementation for prefix searches
Simple, modifiable item-title search index based on radix tries.
A compact trie for mapping keys to values that allows efficient prefix-based retrievals