seg-tree 0.3.0

A simple segment tree library
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

use crate::nodes::Node;

/// Implementation of range min for generic type T, it only implements [`Node`].
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct Min<T> {
    value: T,
}

impl<T> Node for Min<T>
where
    T: Ord + Clone,
{
    type Value = T;
    fn initialize(v: &Self::Value) -> Self {
        Self { value: v.clone() }
    }
    fn combine(a: &Self, b: &Self) -> Self {
        Self {
            value: a.value.clone().min(b.value.clone()),
        }
    }
    fn value(&self) -> &Self::Value {
        &self.value
    }
}
#[cfg(test)]
mod tests {
    use crate::{nodes::Node, utils::Min};

    #[test]
    fn min_works() {
        const N: usize = 1_000;
        let nodes: Vec<Min<usize>> = (0..=N).map(|x| Min::initialize(&x)).collect();
        let result = nodes
            .iter()
            .fold(Min::initialize(&0), |acc, new| Min::combine(&acc, new));
        assert_eq!(result.value(), &0);
    }
}