blooming-bella
roaring
| blooming-bella | roaring | |
|---|---|---|
| - | 5 | |
| 1 | 2,349 | |
| - | 0.9% | |
| 0.0 | 7.6 | |
| almost 7 years ago | 13 days ago | |
| Go | Go | |
| - | Apache License 2.0 |
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.
roaring
-
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.
- Bitmasks - how and why to use?
-
Skipfilter
Each topic has a roaring bitmap. Each bit corresponds to a subscriber in the skip list. For each topic, head and tail cursors are also maintained to ensure that newly added subscriptions are always tested and deleted subscriptions are always evicted. Roaring bitmaps are compressed and discontinuous so memory usage again remains bounded as subscribers come and go.
-
Bit shifting blew my mind
Definitely take a look at a roaring bitmap. https://github.com/RoaringBitmap/roaring
-
Protocol buffers database, a Key-Value database on the wire
Roaring bitmaps + btrees are a rock solid indexing approach. Alternatively, bleve has a lot out of the box but that's introducing a new datastore, basically.
What are some alternatives?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
skiplist - skiplist for golang
count-min-log - Go implementation of Count-Min-Log
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
bit - Bitset data structure
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
bitset - Go package implementing bitsets
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
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
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.