willf/bloom
mafsa
| willf/bloom | mafsa | |
|---|---|---|
| 2 | - | |
| 2,287 | 283 | |
| 1.0% | - | |
| 4.8 | 0.0 | |
| about 2 months ago | - | |
| Go | Go | |
| 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.
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.
mafsa
We haven't tracked posts mentioning mafsa yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
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
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
go-geoindex - Go native library for fast point tracking and K-Nearest queries
gostl - Data structure and algorithm library for go, designed to provide functions similar to C++ STL
bloom - Bloom filters implemented in Go.