@final-hill/multi-key-map
A map implementation that supports multiple keys
A map implementation that supports multiple keys
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
Trie generator.
Trie, Prefix tree. Javascript & Typescript Data Structure.
ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)
A prefix tree class
Trie