search-trie
MITA 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
69
Security score
0 known advisories in v3.0.0
OpenSSF Scorecard 2.0/10
Weekly downloads
—
Unpacked size
26.5 kB
Dependencies
1
Last publish
2 years ago
Security advisories
No known vulnerabilities affect v3.0.0.
OpenSSF ScorecardAug 24, 2026
- Maintained0
- SAST0
- Code-Review0
- Binary-Artifacts10
- CII-Best-Practices0
- Security-Policy0
- Fuzzing0
- License10
- Branch-Protection0