bitset
go-adaptive-radix-tree
Our great sponsors
| bitset | go-adaptive-radix-tree | |
|---|---|---|
| 1 | - | |
| 1,261 | 337 | |
| 1.8% | - | |
| 6.6 | 0.0 | |
| 27 days ago | 20 days ago | |
| Go | Go | |
| BSD 3-clause "New" or "Revised" License | MIT 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.
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.
go-adaptive-radix-tree
We haven't tracked posts mentioning go-adaptive-radix-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
Bloomfilter
gota - Gota: DataFrames and data wrangling in Go (Golang)
levenshtein - Go implementation to calculate Levenshtein Distance.
bloom - Bloom filters implemented in Go.
bitmap - Simple dense bitmap index in Go with binary operators
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
merkletree - A Merkle Tree implementation written in Go.