ttlcache
ttlcache
| ttlcache | ttlcache | |
|---|---|---|
| 3 | 2 | |
| 846 | 388 | |
| 1.7% | - | |
| 6.1 | 6.4 | |
| 24 days ago | about 2 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
- v3.1.0 of ttlcache - an in-memory cache with item expiration and generics
-
batching incoming POST requests
Take a look at: github.com/jellydator/ttlcache
- v3 of ttlcache - an in-memory cache with item expiration and generics
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
What are some alternatives?
go-mcache - Fast in-memory key:value store/cache with TTL
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
ttlcache - An in-memory cache with item expiration and generics
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.
PIE - A behavior for Internet Explorer allowing it to recognize and render various CSS3 box decoration properties
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
count-min-log - Go implementation of Count-Min-Log
iter - Go implementation of C++ STL iterators and algorithms.
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.