augmented-rbtree 0.2.0

An augmented red-black tree with generic, user-defined per-node statistics — enables interval trees, order-statistics trees, range-sum trees, and more.
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

//! This example demonstrates how to visualize an augmented red-black tree using the `augmented-rbtree` crate.
//! It generates an SVG representation of the tree structure, which can be useful for debugging and understanding the tree's layout.

use crate::visual::dump_tree_to_svg;
use augmented_rbtree::interval_tree::IntervalTree;

#[path = "../tests/shared/visual.rs"]
mod visual;

fn main() -> Result<(), Box<dyn std::error::Error>> {
    let mut tree = IntervalTree::new();

    let intervals = [
        (38, 45, "A"),
        (18, 25, "B"),
        (12, 20, "C"),
        (42, 50, "D"),
        (28, 35, "E"),
        (32, 40, "F"),
        (48, 55, "G"),
        (22, 30, "H"),
        (2, 10, "I"),
        (5, 15, "J"),
    ];

    for i in &intervals {
        tree.insert(
            augmented_rbtree::interval_tree::Interval::new(i.0, i.1),
            i.2,
        );
    }

    // Automatically outputs into your project's assets directory for the README link
    std::fs::create_dir_all("assets")?;
    dump_tree_to_svg(tree.inner_tree(), "assets/visualization_demo.svg", false)?;

    println!("Successfully rendered tree visualization to 'assets/visualization_demo.svg'!");
    Ok(())
}