blooming-bella
bitset
| blooming-bella | bitset | |
|---|---|---|
| - | 1 | |
| 1 | 1,376 | |
| - | 1.9% | |
| 0.0 | 8.5 | |
| over 7 years ago | 25 days ago | |
| Go | Go | |
| - | BSD 3-clause "New" or "Revised" 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.
blooming-bella
We haven't tracked posts mentioning blooming-bella yet.
Tracking mentions began in Dec 2020.
bitset
-
I have some questions about defining a series of bits in Golang
For (3), and if you’re interested in checking if specific bits are set or not, take a look at https://github.com/bits-and-blooms/bitset and https://github.com/RoaringBitmap/roaring.
What are some alternatives?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
count-min-log - Go implementation of Count-Min-Log
Bloomfilter
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
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
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
bitmap - Simple dense bitmap index in Go with binary operators