tidwall/btree

Health v2 · maintenance only

Flags: no_releases

Adoption not part of the score

1226 stars · 105 forks observed · 2026-08-28

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

Member repositories

For agents

markdown · JSON · MCP: product_card(name="tidwall/btree")