count-min-log
willf/bloom
Our great sponsors
| count-min-log | willf/bloom | |
|---|---|---|
| - | 2 | |
| 66 | 2,283 | |
| - | 3.0% | |
| 0.0 | 4.8 | |
| about 7 years 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.
count-min-log
We haven't tracked posts mentioning count-min-log yet.
Tracking mentions began in Dec 2020.
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.
binpacker - A binary stream packer and unpacker
bit - Bitset data structure
skiplist - skiplist for golang
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
go-geoindex - Go native library for fast point tracking and K-Nearest queries
blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
mafsa