dsalgo 0.3.10

A package for Datastructures and Algorithms.
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

use crate::segment_tree_lazy_with_instance_homomorphism::*;

pub struct RangeUpdateRangeMinimum<T>(T);

impl<T> RangeUpdateRangeMinimum<T> {
    pub fn new(inf: T) -> Self {
        Self(inf)
    }
}

impl<T: Ord + Clone> Ops for RangeUpdateRangeMinimum<T> {
    type F = Option<T>;

    type S = T;

    fn op(
        &self,
        a: Self::S,
        b: Self::S,
    ) -> Self::S {
        a.min(b)
    }

    fn e(&self) -> Self::S {
        self.0.clone()
    }

    fn compose(
        &self,
        f: Self::F,
        g: Self::F,
    ) -> Self::F {
        if f.is_some() {
            f
        } else {
            g
        }
    }

    fn id(&self) -> Self::F {
        None
    }

    fn map(
        &self,
        f: Self::F,
        x: Self::S,
    ) -> Self::S {
        if let Some(f) = f {
            f
        } else {
            x
        }
    }
}