art
Adaptive Radix Tree done right (by recoilme)
trie
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search. (by shivamMg)
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
art
Posts with mentions or reviews of art.
We have used some of these posts to build our list of alternatives
and similar projects.
trie
Posts with mentions or reviews of trie.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-14.
-
trie: A Trie implementation meant for auto-completion use cases
Yes. You can get the code for it in the demo directory.
What are some alternatives?
When comparing art and trie you can also consider the following projects:
trie - Missing Trie implementation for Go
go-succinct-data-structure-trie - Succinct Data Structure of Trie, written in Go
trie - Generic prefix tree for golang
data-structures - Go datastructures.
ptrie - A prefix tree implementation in go
Go - Algorithms and Data Structures implemented in Go for beginners, following best practices.
gptcli - An interactive ChatGPT client featuring shortcuts and auto-complete.