Search results
37 packages found
radix-trie implementation for Inverse Index Document Search.
A utility for autocompleting words using in memory trie data structure
A utility for autocompleting words using in memory trie data structure
Makes an auxilary tree structure to get O(m) efficient autocomplete results, (where m is the length of a search string), without use of external dependencies.<br /> The repo is holds a list of 300k english letter already formatted as tree and available fo
- tree
- trie
- autocomplete
- digital tree
- radix tree
- prefix tree
- search
- search tree
- pattern
- composite
- design pattern
- composite pattern
- hierarchical
- data structure
- View more
Trie based search for autocompletes with Redis. (support vietnamese)
A JavaScript package for implementing the Trie data structure, including essential methods for efficient data retrieval.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
My take on an efficient implementation of a Trie in Javascript
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
Customizable trie data structure built in JavaScript.
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
An asynchronous autocomplete data store built on top of a trie.
Autocomplete strategy with Redis
Preliminary implementation of trie that should be used in autosuggestions feature
Trie based search for autocompletes with Redis.