interavl 0.6.0

An optimised interval tree for efficient interval stabbing
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

use core::ops::Range;

use crate::node::Node;

use super::pruning_iter::PruningOracle;

pub(crate) struct OverlapsPruner;
impl<R, V> PruningOracle<R, V> for OverlapsPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.end > *subtree_root.interval().start()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().overlaps(query)
    }
}

pub(crate) struct MeetsPruner;
impl<R, V> PruningOracle<R, V> for MeetsPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.start >= *subtree_root.interval().start()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().meets(query)
    }
}

pub(crate) struct PrecedesPruner;
impl<R, V> PruningOracle<R, V> for PrecedesPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.start > *subtree_root.interval().start()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().precedes(query)
    }
}

pub(crate) struct PrecededByPruner;
impl<R, V> PruningOracle<R, V> for PrecededByPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.end < *subtree_root.subtree_max()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().preceded_by(query)
    }
}

pub(crate) struct MetByPruner;
impl<R, V> PruningOracle<R, V> for MetByPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.end <= *subtree_root.subtree_max()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().met_by(query)
    }
}

pub(crate) struct StartsPruner;
impl<R, V> PruningOracle<R, V> for StartsPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.start >= *subtree_root.interval().start()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().starts(query)
    }
}

pub(crate) struct FinishesPruner;
impl<R, V> PruningOracle<R, V> for FinishesPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.end <= *subtree_root.subtree_max()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().finishes(query)
    }
}

pub(crate) struct DuringPruner;
impl<R, V> PruningOracle<R, V> for DuringPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.end >= *subtree_root.interval().start()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().during(query)
    }
}

pub(crate) struct ContainsPruner;
impl<R, V> PruningOracle<R, V> for ContainsPruner
where
    R: Ord,
{
    fn visit_right(&self, subtree_root: &Node<R, V>, query: &Range<R>) -> bool {
        query.start >= *subtree_root.interval().start()
    }

    fn filter_yield(&self, n: &Node<R, V>, query: &Range<R>) -> bool {
        n.interval().contains(query)
    }
}