{"package":"search-trie","ecosystem":"npm","exists":true,"latest_version":"3.0.0","repository":"https://github.com/theKashey/search-trie","license":"MIT","description":"A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp","downloads_weekly":4151,"deprecated":false,"health":{"score":45},"_cache":"db_only_bot","_partial":true,"_response_ms":0,"_powered_by":"depscope.dev — bot fast path (DB-only)","recommendation":{"action":"review"}}