52
flat_rbtree
v0.2.3 ExperimentalA flat, index-based Red-Black Tree with no heap allocations. Ideal for performance-critical or memory-constrained environments.
MIT Edition 2024
Data structuresMemory managementEmbedded developmentNo standard library #embedded#no_std#rbtree#no-alloc#red-black-tree
Quick Verdict
- !Pre-1.0: API may have breaking changes
- โTiny footprint (15KB, 3 deps)
- โPermissive license (MIT)
Security
Checking security advisories...
Downloads
4.5K
Dependents
0
Releases
12
Size
15KB
Deep Insights
๐
Strong growth momentum
16 downloads in the last 30 days (1/day), up 1500% from the previous period.
๐ชถ
Minimal dependencies
Only 3 direct dependencies. Lean dependency tree means faster builds and lower supply chain risk.
๐
Compact crate
At 15KB, flat_rbtree is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Maintenance 16/25
Recency, release consistency, active ratio
Quality 16/25
Yanked ratio, deps, size, maturity, features
Community 6/20
Reverse deps, ownership, ecosystem
Popularity 4/15
Downloads, momentum, growth trend
Documentation 10/15
Docs, repo, license, metadata
Download Trend
Daily downloads ยท last 90 days
1/day avg-76%
Version Adoption
v0.2.3
25%
v0.1.7
19%
v0.2.1
19%
v0.1.6
19%
v0.2.2
18%
Release Timeline
12 releasessince 2025
J
F
M
A
M
J
J
A
S
O
N
D
2025
12
2026
LessMore
Feature Flags
expanded
README
Loading README...
Maintainers
Dependencies
3
direct dependencies
Dependents
0
crates depend on flat_rbtree