_Photo by Jamie Street on _Unsplash - "trie" is from "Retrieval" thus the cute 🐶 "Retriever"

I've released @cshooks/usetrie.

It's a React Hook for Typeahead/autocompletion.

@cshooks/hooks will be the home 🏠 of Computer Science data structures/algorithms related hooks.

🤔 Why?

When you have a list of texts you want to match by prefix, you have to match each text in an array one by one, which can be time consuming.

Trie is a data structure, which stores text in a tree, which enables a fast prefix look up.
And useTrie works as a facade to enable fast prefix search.

🔧 How?

Check out the README file, which explains the usage in detail.

Here are some quick demo Sandboxes for the impatients.

• Simple demo add/remove texts
• String/object array & Reddit data demo

Demos

➕ Additional Info

I've created this initially for academic purposes to learn Trie data structure so Trie class is imperative and useTrie hook was forced to fit to work with declarative nature of React as shown below, which is not ideal.

https://gist.github.com/dance2die/168fcb4c7e85fbe8573c160b32520250

add/remove returns a new instance

https://github.com/cshooks/hooks/blob/master/packages/useTrie/src/index.ts#L191

I'd really appreciate any feedback on how I can improve the code base.

I will share in the next post what I've learned and failures.

And I plan to add other hooks returning Min/Max heaps & Permutations.

🏔 Resources

• NPM - @cshooks/usetrie
• Source Code on GitHub
• License - MIT