concurrent-map
btree
Our great sponsors
| concurrent-map | btree | |
|---|---|---|
| 1 | 5 | |
| 4,118 | 3,764 | |
| - | 1.2% | |
| 0.0 | 0.0 | |
| 3 months ago | 5 months ago | |
| Go | Go | |
| MIT License | Apache License 2.0 |
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.
concurrent-map
-
Any major projects using generics?
For libraries I use at work, cmap has a v2 using generics. I think that's a fairly widely used library. The events library we use is updated, but not released. When I get a chance, planning on looking on moving to hooks, which does have released generics support.
btree
-
Shaving 40% Off Google’s B-Tree Implementation with Go Generics
This may be confusing to those familiar with Google's libraries. The baseline is the Go BTree, which I personally never heard of until just now, not the C++ absl::btree_set. The benchmarks aren't directly comparable, but the C++ version also comes with good microbenchmark coverage.
https://github.com/google/btree
https://github.com/abseil/abseil-cpp/blob/master/absl/contai...
-
I created an in-memory SQL database called MemSQL as a learning project
You might be interested in https://github.com/google/btree and having a default tree based around a PK. A simpler tree like an AVL or Red-Black Tree would let you do efficient range lookups for the PK as well.
- Any major projects using generics?
-
AVL balanced generic binary trees in Go
Go has generics now, and the API surface of the most popular btree implementations llrb and google don't quite match what I like from an iteration and sorting perspective. AVL has a pretty straightforward balancing model, and it turns out to be pretty performant for what I wind up doing a lot of the time.
- What are some secrets for solving tree problems during code interviews
What are some alternatives?
TtlMap - A golang map in which entries expire after given a time period
graph - A library for creating generic graph data structures and modifying, analyzing, and visualizing them.
monproc - Process Monitor for Debian Linux Distros. Monitor CPU Utilization
hooks - Simple, type-safe hook system to enable easier modularization of your Go code.
set - Thread(Safe/Unsafe) Set data structure for Go.
verify - Extensible, type-safe, fluent assertion Go library.
go-left-right - A faster RWLock primitive in Go, 2-3 times faster than RWMutex. A Go implementation of concurrency control algorithm in paper <Left-Right - A Concurrency Control Technique with Wait-Free Population Oblivious Reads>
surf - CLI Text Search across your infrastructure platforms, Universal Ctrl+F for infra
go-events - :mega: Pure nodejs EventEmmiter for the Go Programming Language.
learn-go-concepts - This is a repo for Golang concepts and their practical implementation
test - A modern generic testing assertions library for Go