Search results
1000+ packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
Trie, prefix tree
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
The extremely fast compressed trie implementation.
Minimalistic trie implementation for autosuggest and autocomplete components.
- autosuggest
- autocomplete
- auto suggest
- auto complete
- trie autosuggest
- trie autocomplete
- trie auto suggest
- trie auto complete
- autosuggest trie
- autocomplete trie
- auto suggest trie
- auto complete trie
A fast and lightweight autocomplete library using a trie data structure.
An in-memory autocomplete package based on the trie data structure
trie data structure
Minimal trie datastructure representation
- trie
- trie-d
- auto complete
- near match
- search
- hashmatch
- node-trie
- trie-search
- keywords-search
- dynamic trie
- word search
- word
- autocomplete
- autosearch
- View more
Customizable trie data structure built in JavaScript.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m
radix-trie implementation for Inverse Index Document Search.
Customizable trie data structure built in JavaScript.
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Trie based search for autocompletes with Redis.
A trie-based autocompleter
typescript implementation of the prefix trie data structure
Customizable trie data structure built in JavaScript.
Fast Trie structure implementation with matching feature
Trie based search for autocompletes with Redis. (support vietnamese)
radix-trie implementation for Inverse Index Document Search.