tidwall/btree
Some data may be outdated — see provenance labels.
B-tree implementation for Go observed · 2026-10-01
Health v2 · maintenance only
76/100
- Activity 97
- Release rhythm 35
- Longevity 100
Flags: no_releases
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-10-22. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 3803
- days_rel: n/a
- days_push: 22
- n_releases_24m: 0
Adoption not part of the score
1229 stars · 109 forks observed · 2026-10-01
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A fast, generic B-tree implementation for Go providing ordered Map, Set, and thread-safe BTree types. It supports bulk loading, copy-on-write copies, path hinting, and array-like index operations.
Use cases
- store ordered key-value pairs in Go
- implement an in-memory sorted set
- bulk load presorted data into a tree
- iterate keys in ascending or descending order
- perform array-like indexed access on sorted data
- replace Go's built-in map when sorted iteration is needed
When to choose
- you need sorted iteration or range scans over keys in Go
- you want a fast pure-Go ordered map/set with generics
- you need copy-on-write snapshots or bulk loading of presorted data
When to avoid
- you only need an unordered key-value store (use the built-in map)
- you need persistence or disk-backed storage
- you need concurrent access with heavy write contention beyond its locking model
Facets
library · maturity stable
database developer-tools databases developer-tools go cross-platform b-tree data-structures generics ordered-map ordered-set copy-on-write algorithms
1 source
- readme: https://github.com/tidwall/btree · fetched 2026-10-01 · 880abe3893e0
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| tidwall/btree | main | 76 |
For agents
Data as of 2026-10-19T08:05:51.212177+00:00 · Report a problem