bitmap
Simple dense bitmap index in Go with binary operators (by kelindar)
bitset
Go package implementing bitsets (by willf)
Our great sponsors
bitmap | bitset | |
---|---|---|
1 | 1 | |
276 | 1,261 | |
- | 1.8% | |
4.3 | 6.6 | |
6 months ago | 27 days ago | |
Assembly | Go | |
MIT License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
bitmap
Posts with mentions or reviews of bitmap.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-30.
-
Example of Entity Component System in Go
Good question, I think there's many different lessons. To your point about bitmasks, you can imagine that each component (i.e. column) has an array of data and a large bitmap that identifies whether a component is present or not. Had to build a SIMD implementation so you can do and, and not, or and xor operations on millions of components within reasonable amount of time. Interestingly enough, you still need a hashmap or b+tree in case you want to retrieve a component by it's ID instead of an index, but the rest of things can be modeled with bitmap indexes.
bitset
Posts with mentions or reviews of bitset.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-14.
-
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?
When comparing bitmap and bitset you can also consider the following projects:
fsm - Finite State Machine for Go
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
Bloomfilter
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
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
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog