ttlcache
levenshtein
Our great sponsors
| ttlcache | levenshtein | |
|---|---|---|
| 3 | 2 | |
| 842 | 319 | |
| 3.7% | - | |
| 6.2 | 0.0 | |
| 15 days ago | about 1 year 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
levenshtein
- Levenshtein Distance
-
find the difference between two strings ?
Wow, the original post has been deleted but replying still as somebody might hear about Levenshtein distance for the first time. https://github.com/agnivade/levenshtein
What are some alternatives?
go-mcache - Fast in-memory key:value store/cache with TTL
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
ttlcache - An in-memory cache with item expiration and generics
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.
bitset - Go package implementing bitsets
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
PIE - A behavior for Internet Explorer allowing it to recognize and render various CSS3 box decoration properties
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
bloom - Bloom filters implemented in Go.