quadtree
Generic, zero-alloc, 100%-test covered Quadtree for golang (by s0rg)
bitmap
Simple dense bitmap index in Go with binary operators (by kelindar)
| quadtree | bitmap | |
|---|---|---|
| 1 | 1 | |
| 37 | 319 | |
| - | 3.4% | |
| 2.8 | 4.3 | |
| over 1 year ago | over 1 year ago | |
| Go | Assembly | |
| MIT License | MIT 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.
quadtree
Posts with mentions or reviews of quadtree.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-09-08.
-
generic quadtree for golang
https://github.com/s0rg/quadtree - generic, zero-alloc, 100%-test covered quadtree
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.
What are some alternatives?
When comparing quadtree and bitmap you can also consider the following projects:
swiss - Golang port of Abseil's SwissTable
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
go-geoindex - Go native library for fast point tracking and K-Nearest queries
fsm - Finite State Machine for Go
conjungo - A small flexible merge library in go
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.