Crate flat_rbtree

Source
Expand description

A fast, index-based Red-Black Tree with no heap allocations.

§Features

  • Flat storage: all nodes are stored in an array, avoiding pointer indirection.
  • No allocations per node: avoids Box, Rc, or Arc.
  • No-std: works in embedded or bare-metal environments without relying on the Rust standard library.
  • Preallocated with MaybeUninit: memory for all nodes is allocated upfront, minimizing runtime overhead and ensuring safe initialization.
  • Fixed capacity: tree size is bounded at compile-time, making resource usage predictable.

§Example

Structs§

RedBlackTree
Index-based Red-Black Tree implementation
RedBlackTreeIter
An iterator over the entries of a RedBlackTree.