fsm
bitmap
| fsm | bitmap | |
|---|---|---|
| 1 | 1 | |
| 2,777 | 299 | |
| 1.9% | - | |
| 2.9 | 4.3 | |
| 28 days ago | 10 months ago | |
| Go | Assembly | |
| Apache License 2.0 | 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.
fsm
-
Let it crash or handle the error gracefully?
I'm reevaluating some of my practices in Go and one of them is the idea of verifying everything before usage to prevent runtime panics. For example, how do you ensure something is properly initialized before it's used? I was thinking on introducing a state machine to controllm this kind of thigs. What do you think? https://github.com/looplab/fsm
bitmap
-
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?
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
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
bitset - Go package implementing bitsets
binpacker - A binary stream packer and unpacker
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
pipeline - Pipelines using goroutines
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
encoding - Integer Compression Libraries for Go
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.