flat_rbtree 0.1.2

A flat, index-based Red-Black Tree with no heap allocations. Ideal for performance-critical or memory-constrained environments.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

# flat_rbtree

![rust](https://img.shields.io/badge/Rust-000000?style=for-the-badge&logo=rust&logoColor=white)

A fast, index-based Red-Black Tree with no heap allocations — ideal for systems where performance and memory layout matter.

## Features

- **Flat storage**: all nodes are stored in a `Vec`, avoiding pointer indirection.
- **No allocations per node**: avoids `Box`, `Rc`, or `Arc`.
- **No-std friendly**: suitable for embedded environments.

## Usage

```rust
let mut tree = RedBlackTree::new();
tree.insert(10, "A");
tree.update(10, "B");
tree.search(10); // Some(&"B")
tree.remove(10);
```

## Benchmark: flat_rbtree vs [rbtree](https://docs.rs/rbtree/latest/rbtree/) (10,000 operations)

| Operation | flat_rbtree | [rbtree](https://docs.rs/rbtree/latest/rbtree/) |
|-----------|----------------|---------------|
| **Insert** | 1.93 ms (avg)   | 3.02 ms (avg)  | 
| **Remove** | 2.49 ns         | 0.41 ns        | 
| **Search** | 1.08 ms         | 0.88 ms        | 

> Results may vary depending on hardware and runtime conditions.

## 📝 License

This project is open-source under the MIT License.