btree
golang-lru
| btree | golang-lru | |
|---|---|---|
| 5 | 4 | |
| 3,775 | 4,084 | |
| 0.8% | 0.8% | |
| 0.0 | 6.1 | |
| 5 months ago | about 1 month ago | |
| Go | Go | |
| Apache License 2.0 | Mozilla Public 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.
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
golang-lru
- Shaving 40% Off Google’s B-Tree Implementation with Go Generics
-
2Q cache with generics
Fun fact – 2Q implementation in hashicorp/golang-lru not follows paper properly.
-
LRU-based cache package written in Go
Have a look at hashicorp's implementation https://github.com/hashicorp/golang-lru
-
pretty easy client identification (rfc)
I think what you're looking for in this case is a LRU (Least Recently Used) Cache. I haven't used it myself, but something like this perhaps: https://github.com/hashicorp/golang-lru
What are some alternatives?
graph - A library for creating generic graph data structures and modifying, analyzing, and visualizing them.
2q - 2Q in-memory cache implementation.
concurrent-map - a thread-safe concurrent map for go
cache - LRU-based cache package for Go.
hooks - Simple, type-safe hook system to enable easier modularization of your Go code.
verify - Extensible, type-safe, fluent assertion Go library.
surf - CLI Text Search across your infrastructure platforms, Universal Ctrl+F for infra
go-events - :mega: Pure nodejs EventEmmiter for the Go Programming Language.
test - A modern generic testing assertions library for Go
btree - AVL balanced generic binary trees in Go
abseil-cpp - Abseil Common Libraries (C++)
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches