Search results
36 packages found
A utility for autocompleting words using in memory trie data structure
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
a ~7kb, typed, zero-dependency trie library
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
- ternary search tree
- lexicographic tree
- trie
- set
- string set
- sorted set
- dictionary
- hash table
- word game
- word puzzle
- autocomplete
- prediction
- crossword solver
- anagram
Fast Trie structure implementation with matching feature
typescript implementation of the prefix trie data structure
An asynchronous autocomplete data store built on top of a trie.
Fast Trie structure implementation with matching feature
A fast in-memory dictionary for autocomplete as you type features based on a 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
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Autocomplete strategy with Redis
Preliminary implementation of trie that should be used in autosuggestions feature
Trie based search for autocompletes with Redis.