trie-search
trie-search copied to clipboard
A trie implementation that maps keys to objects. Most common use will be for typeahead searches.
Bumps [@babel/traverse](https://github.com/babel/babel/tree/HEAD/packages/babel-traverse) from 7.21.4 to 7.23.2. Release notes Sourced from @babel/traverse's releases. v7.23.2 (2023-10-11) NOTE: This release also re-publishes @babel/core, even if it does not appear in the linked release...
Note: this bug actually exists in the HashArray code but I'm putting it here since this library is the primary user of HashArray. For example, if you do this somewhere...
There should be a way to mark which found items are an exact match in the returned results to help with sorting. This would also make it trivial to add...
I think it would be fairly trivial to add a feature to the Trie that allows it during lookups to "look ahead" one character to allow for matches on misspellings...
If typing in `spot rock`, the `TrieSearch.RANK_REDUCER` will sort the results like: ``` 0: 'spot rock' // exact word match, correct order 1: 'spotify rocks' // incomplete word match, correct...