intervalsets 0.1.0-alpha.2

The intervalsets crate provides bounded and unbounded intervals implemented as sets with all the associated set operations.
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

use crate::numeric::Domain;
use crate::ops::Contains;

use super::*;

impl<T: Domain> Contains<T> for Finite<T> {
    fn contains(&self, rhs: &T) -> bool {
        self.map_or(false, |left, right| {
            left.contains(Side::Left, rhs) && right.contains(Side::Right, rhs)
        })
    }
}

impl<T: Domain> Contains<Self> for Finite<T> {
    fn contains(&self, rhs: &Self) -> bool {
        self.map_or(false, |left_out, right_out| {
            rhs.map_or(false, |left_in, right_in| {
                left_out.contains(Side::Left, left_in.value())
                    && right_out.contains(Side::Right, right_in.value())
            })
        })

        /*
        I'm curious to bench mark the two of these and see if there is any difference

        match self {
            Self::Empty => false,
            Self::NonZero(left, right) => match rhs {
                Self::Empty => false,
                Self::NonZero(a, b) => {
                    left.contains(Side::Left, &a.value)
                        && right.contains(Side::Right, &b.value)
                }
            },
        }*/
    }
}

impl<T: Domain> Contains<HalfBounded<T>> for Finite<T> {
    fn contains(&self, rhs: &HalfBounded<T>) -> bool {
        false
    }
}

impl<T: Domain> Contains<BoundCase<T>> for Finite<T> {
    fn contains(&self, rhs: &BoundCase<T>) -> bool {
        match rhs {
            BoundCase::Finite(rhs) => self.contains(rhs),
            BoundCase::Half(rhs) => self.contains(rhs),
            BoundCase::Unbounded => false,
        }
    }
}

impl<T: Domain> Contains<T> for HalfBounded<T> {
    fn contains(&self, rhs: &T) -> bool {
        self.bound.contains(self.side, rhs)
    }
}

impl<T: Domain> Contains<Finite<T>> for HalfBounded<T> {
    fn contains(&self, rhs: &Finite<T>) -> bool {
        rhs.map_or(false, |left, right| {
            self.contains(left.value()) && self.contains(right.value())
        })
    }
}

impl<T: Domain> Contains<Self> for HalfBounded<T> {
    fn contains(&self, rhs: &Self) -> bool {
        self.side == rhs.side && self.contains(rhs.bound.value())
    }
}

impl<T: Domain> Contains<BoundCase<T>> for HalfBounded<T> {
    fn contains(&self, rhs: &BoundCase<T>) -> bool {
        match rhs {
            BoundCase::Finite(rhs) => self.contains(rhs),
            BoundCase::Half(rhs) => self.contains(rhs),
            BoundCase::Unbounded => false,
        }
    }
}

impl<T: Domain> Contains<T> for BoundCase<T> {
    fn contains(&self, rhs: &T) -> bool {
        match self {
            Self::Finite(lhs) => lhs.contains(rhs),
            Self::Half(lhs) => lhs.contains(rhs),
            Self::Unbounded => true,
        }
    }
}

impl<T: Domain> Contains<Finite<T>> for BoundCase<T> {
    fn contains(&self, rhs: &Finite<T>) -> bool {
        match self {
            Self::Finite(lhs) => lhs.contains(rhs),
            Self::Half(lhs) => lhs.contains(rhs),
            Self::Unbounded => *rhs != Finite::Empty,
        }
    }
}

impl<T: Domain> Contains<HalfBounded<T>> for BoundCase<T> {
    fn contains(&self, rhs: &HalfBounded<T>) -> bool {
        match self {
            Self::Finite(lhs) => lhs.contains(rhs),
            Self::Half(lhs) => lhs.contains(rhs),
            Self::Unbounded => true,
        }
    }
}

impl<T: Domain> Contains<Self> for BoundCase<T> {
    fn contains(&self, rhs: &Self) -> bool {
        match self {
            Self::Finite(lhs) => lhs.contains(rhs),
            Self::Half(lhs) => lhs.contains(rhs),
            Self::Unbounded => match rhs {
                Self::Finite(rhs) => self.contains(rhs),
                Self::Half(rhs) => self.contains(rhs),
                Self::Unbounded => true,
            },
        }
    }
}