A flat, index-based Red-Black Tree with no heap allocations. Ideal memory-constrained environments.
-
Updated
Jul 6, 2025 - Rust
#
rbtree
Here are 3 public repositories matching this topic...
about algorithm data structure, now has lru/lru-k/lfu/slab/rbtree/timerwheel with ttl, 关于算法常用的数据结构
lru bitmap arc rbtree ttl lru-cache lfu lrucache ttl-cache circularbuffer slab timerwheel slab-allocator lru-k
-
Updated
May 19, 2025 - Rust
Improve this page
Add a description, image, and links to the rbtree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the rbtree topic, visit your repo's landing page and select "manage topics."