search-trie
v3.0.0npm· JavaScriptA 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
The verdict
Abandoned. Last published 2 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the npm registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityUnknown
SecurityClean
LicensePermissive
DepsLean
Maintenance
Last published 2 years ago.
Popularity
Download count unavailable.
Security
No known advisories for this version (OSV).
License
MIT
Dependencies
1 direct dependency
Recent releases
- 3.0.02 years ago
- 2.1.04 years ago
- 2.0.15 years ago
- 2.0.05 years ago
- 1.1.07 years ago
- 1.0.08 years ago