gocache
btree
| gocache | btree | |
|---|---|---|
| 2 | 5 | |
| 2,254 | 3,779 | |
| - | 0.8% | |
| 6.6 | 0.0 | |
| 3 days ago | 6 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.
gocache
-
Cacheme: Asyncio cache framework with multiple storages and thundering herd protection
I made Cacheme years ago, which support redis and synchronous API only. Then I switch to Go and found that there are some awesome cache projects in Go(ristretto, gocache...), I also made my own Cacheme go version: cacheme-go. After trying asyncio and type hint, I think it's time to rewrite my old Cacheme.
-
Any major projects using generics?
We are using https://github.com/eko/gocache in production projects.
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?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
graph - A library for creating generic graph data structures and modifying, analyzing, and visualizing them.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
concurrent-map - a thread-safe concurrent map for go
gota - Gota: DataFrames and data wrangling in Go (Golang)
hooks - Simple, type-safe hook system to enable easier modularization of your Go code.
fsm - Finite State Machine for Go
verify - Extensible, type-safe, fluent assertion Go library.
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
surf - CLI Text Search across your infrastructure platforms, Universal Ctrl+F for infra
mspm - Multi-String Pattern Matching Algorithm Using TrieNode
go-events - :mega: Pure nodejs EventEmmiter for the Go Programming Language.