null
bitmap
Our great sponsors
| null | bitmap | |
|---|---|---|
| 1 | 1 | |
| 32 | 273 | |
| - | - | |
| 0.0 | 4.3 | |
| over 2 years ago | 6 months ago | |
| Go | Assembly | |
| MIT 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.
null
-
Ask HN: What are some tools / libraries you built yourself?
I build a logging library for Go, because I couldn't find one that logs to stdout AND stderr. If you used a logging lib on GCP for example, all log output went into the same pile of junk and it was hard to find "real" errors: https://github.com/emvi/logbuch
Then there is "null", also because I couldn't find one that got both, marshalling to JSON and be able to store null values in db: https://github.com/emvi/null
And finally, our "flagship" open-source project Pirsch, an embedded library for web analytics: https://github.com/pirsch-analytics/pirsch
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?
go-edlib - 📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
fsm - Finite State Machine for Go
nan - Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
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
algorithms - CLRS study. Codes are written with golang.
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
gota - Gota: DataFrames and data wrangling in Go (Golang)
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
go-mcache - Fast in-memory key:value store/cache with TTL
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog