nan
willf/bloom
| nan | willf/bloom | |
|---|---|---|
| - | 2 | |
| 84 | 2,287 | |
| - | 0.9% | |
| 3.0 | 4.8 | |
| 10 months ago | about 2 months 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.
nan
We haven't tracked posts mentioning nan 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?
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
levenshtein - Go implementation to calculate Levenshtein Distance.
gota - Gota: DataFrames and data wrangling in Go (Golang)
bit - Bitset data structure
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
bitset - Go package implementing bitsets
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
algorithms - CLRS study. Codes are written with golang.
go-geoindex - Go native library for fast point tracking and K-Nearest queries
mafsa