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
56
57
58
59
60
61
62
63
64
65
66
67
68

use std::ops::*;

use crate::sqrt_decomposition_lazy_with_instance_homomorphism::*;

pub struct RangeAddRangeMinimum<T>(T, T);

impl<T> RangeAddRangeMinimum<T> {
    pub fn new(
        inf: T,
        zero: T,
    ) -> Self {
        Self(inf, zero)
    }
}

impl<T> Ops for RangeAddRangeMinimum<T>
where
    T: Ord + Clone + Add<Output = T>,
{
    type F = 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 {
        f + g
    }

    fn id(&self) -> Self::F {
        self.1.clone()
    }

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

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}