hashicorp/go-immutable-radix
An immutable radix tree implementation in Golang observed · 2026-08-28
Health v2 · maintenance only
65/100
- Activity 94
- Release rhythm 8
- Longevity 100
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: 4111
- days_rel: n/a
- days_push: 37
- n_releases_24m: 0
Adoption not part of the score
1107 stars · 81 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A Go library implementing an immutable radix tree optimized for sparse nodes, with O(k) operations, ordered iteration, and transactional batch updates. Version 2 adds generics for compile-time type safety.
Use cases
- implement a prefix lookup structure in Go
- find the longest prefix match for keys like IP routing
- iterate keys in sorted lexicographic order
- perform range scans over string keys
- build persistent snapshots of a key-value map
- batch insert and delete operations efficiently
When to choose
- you need immutable, snapshot-friendly ordered key-value storage in Go
- you need fast longest-prefix matching or range scans
- you want better cache locality than a hash table for string keys
When to avoid
- you need a mutable tree that updates in place (use go-radix instead)
- you need approximate or fuzzy matching rather than exact prefix semantics
- you are not working in Go
Facets
library · maturity stable
search-engine developer-tools developer-tools databases go radix-tree immutable-data-structures data-structures prefix-tree generics algorithms
1 source
- readme: https://github.com/hashicorp/go-immutable-radix · fetched 2026-08-28 · 9e727af83155
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| hashicorp/go-immutable-radix | main | 65 |
For agents
markdown · JSON · MCP: product_card(name="hashicorp/go-immutable-radix")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem