ttlcache
count-min-log
Our great sponsors
| ttlcache | count-min-log | |
|---|---|---|
| 2 | - | |
| 388 | 66 | |
| - | - | |
| 6.4 | 0.0 | |
| about 2 years ago | about 7 years 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.
ttlcache
-
Easy and Simple in-memory cache in Golang
And the library that will be used to cache our application data is ttlcache, because it is easy to use and has an immensely intuitive API.
-
Lazy cache with an interface as a key
My favourite form of caching is one that expires auto-magically https://github.com/ReneKroon/ttlcache
count-min-log
We haven't tracked posts mentioning count-min-log yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
binpacker - A binary stream packer and unpacker
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
skiplist - skiplist for golang
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
levenshtein - Go implementation to calculate Levenshtein Distance.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
bit - Bitset data structure