int-interval-stack 0.1.0

Integer half-open interval stack structures for overlap multiplicity.
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

use super::*;

impl<I> IntCOStack<I>
where
    I: IntCO,
{
    #[inline]
    pub fn is_empty(&self) -> bool {
        self.points.is_empty()
    }

    #[inline]
    pub fn contains_point(&self, x: I::CoordType) -> bool {
        self.height_at(x) != 0
    }

    pub fn intersects_interval<Q>(&self, query: Q) -> bool
    where
        Q: IntCO<CoordType = I::CoordType>,
    {
        if query.start() >= query.end_excl() {
            return false;
        }

        if self.height_at(query.start()) != 0 {
            return true;
        }

        let i = self.points.partition_point(|p| p.at <= query.start());

        self.points[i..]
            .iter()
            .take_while(|p| p.at < query.end_excl())
            .any(|p| p.height_after != 0)
    }

    pub fn contains_interval<Q>(&self, query: Q) -> bool
    where
        Q: IntCO<CoordType = I::CoordType>,
    {
        if query.start() >= query.end_excl() {
            return true;
        }

        if self.height_at(query.start()) == 0 {
            return false;
        }

        let i = self.points.partition_point(|p| p.at <= query.start());

        !self.points[i..]
            .iter()
            .take_while(|p| p.at < query.end_excl())
            .any(|p| p.height_after == 0)
    }
}
#[cfg(test)]
mod tests_for_predicates;