google/btree
BTree provides a simple, ordered, in-memory data structure for Go programs. observed · 2026-08-28
Health v2 · maintenance only
10/100
- Activity 0
- Release rhythm 35
- Longevity 100
Flags: no_releases archived
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 4416
- days_rel: n/a
- days_push: 742
- n_releases_24m: 0
Adoption not part of the score
4163 stars · 421 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-29, confidence not recorded
A Go library providing an in-memory B-Tree implementation as an ordered, mutable data structure. It offers an API compatible with GoLLRB, allowing it to serve as a drop-in replacement for LLRB trees.
Use cases
- store sorted key-value data in memory in Go
- replace gollrb trees with a faster ordered structure
- implement ordered indexes for in-memory databases
- iterate over keys in sorted order efficiently
- build range queries over mutable ordered data
When to choose
- you need an ordered, mutable in-memory data structure in Go
- you want a drop-in replacement for GoLLRB
- you need efficient sorted iteration and range scans
When to avoid
- you need persistent on-disk storage
- you only need a simple map without ordering
- you are not programming in Go
Facets
library · maturity stable
database developer-tools go b-tree data-structures in-memory ordered-map algorithms
1 source
- readme: https://github.com/google/btree · fetched 2026-08-28 · 14559a319e34
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| google/btree | main | 10 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem