set
willf/bloom
| set | willf/bloom | |
|---|---|---|
| - | 2 | |
| 26 | 2,415 | |
| - | 1.3% | |
| 0.0 | 3.3 | |
| about 2 years ago | 26 days ago | |
| Go | Go | |
| BSD 3-clause "New" or "Revised" 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.
set
We haven't tracked posts mentioning set 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?
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
levenshtein - Go implementation to calculate Levenshtein Distance.
bitset - Go package implementing bitsets
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
bit - Bitset data structure
gota - Gota: DataFrames and data wrangling in Go (Golang)
bloom - Bloom filters implemented in Go.
go-geoindex - Go native library for fast point tracking and K-Nearest queries
hilbert - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
bitmap - Simple dense bitmap index in Go with binary operators
mafsa