boomfilters
willf/bloom
Our great sponsors
boomfilters | willf/bloom | |
---|---|---|
- | 2 | |
1,574 | 2,283 | |
- | 3.0% | |
0.0 | 4.8 | |
about 3 years ago | about 1 month ago | |
Go | Go | |
Apache License 2.0 | 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.
boomfilters
We haven't tracked posts mentioning boomfilters 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.
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
bit - Bitset data structure
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
bitset - Go package implementing bitsets
go-geoindex - Go native library for fast point tracking and K-Nearest queries
mafsa
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
bloom - Bloom filters implemented in Go.