gocache
willf/bloom
Our great sponsors
| gocache | willf/bloom | |
|---|---|---|
| 2 | 2 | |
| 2,229 | 2,283 | |
| - | 2.6% | |
| 6.1 | 4.8 | |
| 6 days ago | about 1 month ago | |
| Go | Go | |
| MIT License | BSD 2-clause "Simplified" 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.
gocache
-
Cacheme: Asyncio cache framework with multiple storages and thundering herd protection
I made Cacheme years ago, which support redis and synchronous API only. Then I switch to Go and found that there are some awesome cache projects in Go(ristretto, gocache...), I also made my own Cacheme go version: cacheme-go. After trying asyncio and type hint, I think it's time to rewrite my old Cacheme.
-
Any major projects using generics?
We are using https://github.com/eko/gocache in production projects.
willf/bloom
-
willf/bloom VS bloom_cpp - a user suggested alternative
2 projects | 17 Mar 2023
-
There are 87 bloom filter crates. Strategies for choosing one?
I also have a lot of sympathy for the casual user that has a bloom-filter-shaped hole in their program that all of these filters will fill, and having reduced this part of their task to a well-known solved problem, just want to plug in a random thing & move on, with the possibility of revisiting the selection later if bloomfiltering shows up in the profiler.
What are some alternatives?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
levenshtein - Go implementation to calculate Levenshtein Distance.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
bit - Bitset data structure
gota - Gota: DataFrames and data wrangling in Go (Golang)
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
fsm - Finite State Machine for Go
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
go-geoindex - Go native library for fast point tracking and K-Nearest queries
mspm - Multi-String Pattern Matching Algorithm Using TrieNode
mafsa