search-trie
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
- Latest release
- Oct 12, 2023
- Releases
- 6
- Known CVEs
- 0
- First release
- Feb 11, 2018
- License
- MIT
Repository
Source
- Stars
- —
- Forks
- —
- Open issues
- —
Security score
No OpenSSF Scorecard available for this repository.
Packages from this repo
No other tracked packages from this repository.
Insights
Activity
- Total releases
- 6
- Last 12 months
- 0
- Cadence
- ~1.0 years
- Dependencies
- 1
Releases per month
last 12 monthsRelease mix
- major 2
- minor 2
- patch 1
6
releases
Dependencies
Depends on
3.0.0-
tslib
^2.0.0
Used by
5Releases
| Version | Released | |
|---|---|---|
3.0.0
major
| ||
2.1.0
minor
| ||
2.0.1
patch
| ||
2.0.0
major
| ||
1.1.0
minor
| ||
1.0.0
initial
|