span-map 0.2.0

A data structure for efficiently managing sets of values over spans/ranges
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
132
133
134
135
136
137
138
139
140
141
142
143

mod left;
mod right;

use std::cmp::Ordering;

pub use left::LeftBound;
pub use right::RightBound;

impl<T> PartialEq<RightBound<T>> for LeftBound<T>
where
    T: Ord,
{
    fn eq(&self, other: &RightBound<T>) -> bool {
        match (self, other) {
            (LeftBound::Included(a), RightBound::Included(b)) => a == b,
            _ => false,
        }
    }
}

impl<T> PartialEq<LeftBound<T>> for RightBound<T>
where
    T: Ord,
{
    fn eq(&self, other: &LeftBound<T>) -> bool {
        other.eq(self)
    }
}

impl<T> PartialOrd<RightBound<T>> for LeftBound<T>
where
    T: Ord,
{
    fn partial_cmp(&self, other: &RightBound<T>) -> Option<Ordering> {
        match self {
            LeftBound::Unbounded => Some(Ordering::Less),
            LeftBound::Included(l) => match other {
                RightBound::Excluded(r) => {
                    if l == r {
                        Some(Ordering::Greater)
                    } else {
                        l.partial_cmp(r)
                    }
                }
                RightBound::Included(r) => l.partial_cmp(r),
                RightBound::Unbounded => Some(Ordering::Less),
            },
            LeftBound::Excluded(l) => match other {
                RightBound::Excluded(r) => {
                    if l == r {
                        Some(Ordering::Greater)
                    } else {
                        l.partial_cmp(r)
                    }
                }
                RightBound::Included(r) => {
                    if l == r {
                        Some(Ordering::Greater)
                    } else {
                        l.partial_cmp(r)
                    }
                }
                RightBound::Unbounded => Some(Ordering::Less),
            },
        }
    }
}

impl<T> PartialOrd<LeftBound<T>> for RightBound<T>
where
    T: Ord,
{
    fn partial_cmp(&self, other: &LeftBound<T>) -> Option<Ordering> {
        let res = other.partial_cmp(self);
        res.map(|o| o.reverse())
    }
}

#[cfg(test)]
mod tests {

    use super::*;

    #[test]
    fn test_left_right_equality() {
        assert_eq!(LeftBound::Included(5), RightBound::Included(5));
        assert_ne!(LeftBound::Included(5), RightBound::Included(6));
        assert_ne!(LeftBound::Excluded(5), RightBound::Included(5));
        assert_ne!(LeftBound::<usize>::Unbounded, RightBound::Unbounded);
    }

    #[test]
    fn test_left_bound_ordering() {
        // Test Unbounded
        assert!(LeftBound::Unbounded < RightBound::Excluded(0));
        assert!(LeftBound::Unbounded < RightBound::Included(0));
        assert!(LeftBound::<usize>::Unbounded < RightBound::Unbounded);

        // Test Included
        assert!(LeftBound::Included(5) > RightBound::Excluded(4));
        assert!(LeftBound::Included(5) > RightBound::Included(4));
        assert!(LeftBound::Included(5) > RightBound::Excluded(5));
        assert!(LeftBound::Included(5) == RightBound::Included(5));
        assert!(LeftBound::Included(5) < RightBound::Excluded(6));
        assert!(LeftBound::Included(5) < RightBound::Included(6));
        assert!(LeftBound::Included(5) < RightBound::Unbounded);

        // Test Excluded
        assert!(LeftBound::Excluded(5) > RightBound::Excluded(4));
        assert!(LeftBound::Excluded(5) > RightBound::Included(4));
        assert!(LeftBound::Excluded(5) > RightBound::Excluded(5));
        assert!(LeftBound::Excluded(5) > RightBound::Included(5));
        assert!(LeftBound::Excluded(5) < RightBound::Excluded(6));
        assert!(LeftBound::Excluded(5) < RightBound::Included(6));
        assert!(LeftBound::Excluded(5) < RightBound::Unbounded);
    }

    #[test]
    fn test_right_bound_ordering() {
        // Test Unbounded
        assert!(RightBound::<usize>::Unbounded > LeftBound::Excluded(0));
        assert!(RightBound::Unbounded > LeftBound::Included(0));
        assert!(RightBound::<usize>::Unbounded > LeftBound::Unbounded);

        // Test Included
        assert!(RightBound::Included(5) > LeftBound::Excluded(4));
        assert!(RightBound::Included(5) > LeftBound::Included(4));
        assert!(RightBound::Included(5) < LeftBound::Excluded(5));
        assert!(RightBound::Included(5) == LeftBound::Included(5));
        assert!(RightBound::Included(5) < LeftBound::Excluded(6));
        assert!(RightBound::Included(5) < LeftBound::Included(6));
        assert!(RightBound::Included(5) > LeftBound::Unbounded);

        // Test Excluded
        assert!(RightBound::Excluded(5) > LeftBound::Excluded(4));
        assert!(RightBound::Excluded(5) > LeftBound::Included(4));
        assert!(RightBound::Excluded(5) < LeftBound::Excluded(5));
        assert!(RightBound::Excluded(5) < LeftBound::Included(5));
        assert!(RightBound::Excluded(5) < LeftBound::Excluded(6));
        assert!(RightBound::Excluded(5) < LeftBound::Included(6));
        assert!(RightBound::Excluded(5) > LeftBound::Unbounded);
    }
}