count-min-log
go-adaptive-radix-tree
Our great sponsors
| count-min-log | go-adaptive-radix-tree | |
|---|---|---|
| - | - | |
| 66 | 337 | |
| - | - | |
| 0.0 | 0.0 | |
| about 7 years ago | 16 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.
count-min-log
We haven't tracked posts mentioning count-min-log 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?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
binpacker - A binary stream packer and unpacker
gota - Gota: DataFrames and data wrangling in Go (Golang)
skiplist - skiplist for golang
bitmap - Simple dense bitmap index in Go with binary operators
bloom - Bloom filters implemented in Go.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
bitset - Go package implementing bitsets
blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
levenshtein - Go implementation to calculate Levenshtein Distance.