bloom
go-adaptive-radix-tree
bloom | go-adaptive-radix-tree | |
---|---|---|
- | - | |
147 | 372 | |
0.0% | - | |
0.0 | 6.3 | |
over 6 years ago | 11 days ago | |
Go | Go | |
MIT License | MIT License |
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.
bloom
We haven't tracked posts mentioning bloom yet.
Tracking mentions began in Dec 2020.
go-adaptive-radix-tree
We haven't tracked posts mentioning go-adaptive-radix-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
levenshtein - Go implementation to calculate Levenshtein Distance.
gota - Gota: DataFrames and data wrangling in Go (Golang)
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
bitmap - Simple dense bitmap index in Go with binary operators
merkletree - A Merkle Tree implementation written in Go.
bitset - Go package implementing bitsets
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
mafsa