rangetools 0.1.4

Extending the Rust Range structs found in std::ops
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
144
145
146
147
148
149
150
151
152

use crate::{
    BoundedRange, BoundedSet, EmptyRange, LowerBoundedRange, LowerBoundedSet,
    PiecewiseUnboundedSet, RangeIntersection, Rangetools, UnboundedRange, UnboundedSet,
    UpperBoundedRange, UpperBoundedSet,
};

impl<T, R> RangeIntersection<R, BoundedRange<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = BoundedRange<T>>,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(mut self, other: R) -> Self::Output {
        let other = other.to_inner();
        for range in self.ranges.iter_mut() {
            *range = RangeIntersection::intersection(*range, other);
        }
        self.ranges.retain(|r| !r.is_empty());
        self
    }
}

impl<T, R> RangeIntersection<R, BoundedSet<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = BoundedSet<T>> + Clone,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(self, other: R) -> Self::Output {
        let mut set = BoundedSet::empty();
        for range in self.ranges.iter() {
            set.add_set(RangeIntersection::intersection(*range, other.clone()));
        }
        set
    }
}

impl<T, R> RangeIntersection<R, LowerBoundedRange<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = LowerBoundedRange<T>>,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(mut self, other: R) -> Self::Output {
        let other = other.to_inner();
        for range in self.ranges.iter_mut() {
            *range = RangeIntersection::intersection(*range, other);
        }
        self.ranges.retain(|r| !r.is_empty());
        self
    }
}

impl<T, R> RangeIntersection<R, LowerBoundedSet<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = LowerBoundedSet<T>> + Clone,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(self, other: R) -> Self::Output {
        let mut set = RangeIntersection::intersection(
            self.clone(),
            other.clone().to_inner().lower_bounded_range,
        );
        for range in self.ranges.iter() {
            set.add_set(RangeIntersection::intersection(*range, other.clone()));
        }
        set
    }
}

impl<T, R> RangeIntersection<R, UpperBoundedRange<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = UpperBoundedRange<T>>,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(mut self, other: R) -> Self::Output {
        let other = other.to_inner();
        for range in self.ranges.iter_mut() {
            *range = RangeIntersection::intersection(*range, other);
        }
        self.ranges.retain(|r| !r.is_empty());
        self
    }
}

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = UpperBoundedSet<T>> + Clone,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(self, other: R) -> Self::Output {
        let mut set = RangeIntersection::intersection(
            self.clone(),
            other.clone().to_inner().upper_bounded_range,
        );
        for range in self.ranges.iter() {
            set.add_set(RangeIntersection::intersection(*range, other.clone()));
        }
        set
    }
}

impl<T, R> RangeIntersection<R, UnboundedRange> for BoundedSet<T>
where
    R: Rangetools<Inner = UnboundedRange>,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(self, _: R) -> Self::Output {
        self
    }
}

impl<T, R> RangeIntersection<R, UnboundedSet<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = UnboundedSet<T>>,
    T: Copy + Ord,
{
    type Output = BoundedSet<T>;
    fn intersection(self, other: R) -> Self::Output {
        match other.to_inner() {
            UnboundedSet::Full => self,
            UnboundedSet::Piecewise(PiecewiseUnboundedSet {
                lower_bounded_range,
                ranges,
                upper_bounded_range,
            }) => {
                let mut set = RangeIntersection::intersection(self.clone(), upper_bounded_range);
                set.add_set(RangeIntersection::intersection(
                    self.clone(),
                    lower_bounded_range,
                ));
                set.add_set(RangeIntersection::intersection(self, ranges));
                set
            }
        }
    }
}

impl<T, R> RangeIntersection<R, EmptyRange<T>> for BoundedSet<T>
where
    R: Rangetools<Inner = EmptyRange<T>>,
    T: Copy + Ord,
{
    type Output = EmptyRange<T>;
    fn intersection(self, other: R) -> Self::Output {
        other.to_inner()
    }
}