antirez/rax
A radix tree implementation in ANSI C observed · 2026-08-28
Health v2 · maintenance only
32/100
- Activity 0
- 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-09-02. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 3472
- days_rel: n/a
- days_push: 1011
- n_releases_24m: 0
Adoption not part of the score
1267 stars · 177 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
Rax is a fully featured radix tree (trie) implementation written in portable ANSI C99, originally created for Redis. It emphasizes a balance of performance and memory usage with packed nodes, cache-friendly edge scanning, iterators, and OOM-safe APIs.
Use cases
- implement a radix tree in C
- memory-efficient key lookup data structure
- prefix search in C
- embed a trie in a database engine
- sorted iteration over string keys
- battle-tested radix tree library
When to choose
- you need a fast, memory-conscious radix tree in C
- you want iterators that tolerate concurrent tree modification
- you need a portable ANSI C implementation with fuzz-tested robustness
When to avoid
- you need a general-purpose hash table rather than prefix-based keys
- you want a high-level language binding out of the box
- you need actively developed new features
Facets
library · maturity maintenance
parser search-engine fuzzing databases developer-tools c cross-platform radix-tree data-structures ansi-c redis trie memory-efficient algorithms linux
1 source
- readme: https://github.com/antirez/rax · fetched 2026-08-28 · 2a55d59f4158
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| antirez/rax | main | 32 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem