ecs
Example of Entity Component System in Go (by kelindar)
bitmap
Simple dense bitmap index in Go with binary operators (by kelindar)
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.
ecs
Posts with mentions or reviews of ecs.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-03.
- Known "Entity Component Systems" implementations in Go?
- Example of Entity Component System in Go
-
GitHub - kelindar/ecs: Example of Entity Component System in Go
Now, over Christmas holidays I've put together a small demo of how an ECS can be done in Go: kelindar/ecs. As I said, it's still very raw but I'm curious if anyone has feedback or finds it useful.
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.