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
36
37
38
39
40

[[bench]]
harness = false
name = "compare_rbtree"
path = "benches/compare_rbtree.rs"

[dependencies]

[dev-dependencies.criterion]
version = "0.6.0"

[dev-dependencies.rand]
version = "0.9.1"

[dev-dependencies.rbtree]
version = "0.1.7"

[lib]
name = "flat_rbtree"
path = "src/lib.rs"

[package]
authors = ["Matheus-git <mathiew0@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["data-structures", "embedded", "no-std"]
description = "A flat, index-based Red-Black Tree with no heap allocations. Ideal for performance-critical or memory-constrained environments."
edition = "2024"
keywords = ["rbtree", "red-black-tree", "no-alloc", "index", "flat"]
license = "MIT"
name = "flat_rbtree"
readme = "README.md"
repository = "https://github.com/matheus-git/flat_rbtree"
version = "0.1.2"

[profile.bench]
debug = 0