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
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
153
154
155
156
157
158
159
160
161

use crate::numeric::Domain;
use crate::{Interval, IntervalSet};

/// Defines whether a set fully contains another.
///
/// For our purposes a point is the singleton set [T].
///
/// A contains B if and only if
/// for every element x of B,
/// x is also an element of A.
///
/// Contains is not commutative.
///
/// # Example
/// ```
/// use intervalsets::Interval;
/// use intervalsets::ops::Contains;
///
/// let x = Interval::open(0, 10);
/// assert_eq!(x.contains(&5), true);
/// assert_eq!(x.contains(&10), false);
/// assert_eq!(x.contains(&Interval::open(0, 10)), true);
/// ```
pub trait Contains<Rhs = Self> {
    fn contains(&self, rhs: &Rhs) -> bool;
}

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

impl<T: Domain> Contains<Self> for Interval<T> {
    fn contains(&self, rhs: &Self) -> bool {
        self.0.contains(&rhs.0)
    }
}

impl<T: Domain> Contains<IntervalSet<T>> for Interval<T> {
    fn contains(&self, rhs: &IntervalSet<T>) -> bool {
        rhs.intervals().iter().all(|subset| self.contains(subset))
    }
}

impl<T: Domain> Contains<T> for IntervalSet<T> {
    fn contains(&self, rhs: &T) -> bool {
        self.intervals().iter().any(|subset| subset.contains(rhs))
    }
}

impl<T: Domain> Contains<Interval<T>> for IntervalSet<T> {
    fn contains(&self, rhs: &Interval<T>) -> bool {
        self.intervals().iter().any(|subset| subset.contains(rhs))
    }
}

impl<T: Domain> Contains<Self> for IntervalSet<T> {
    fn contains(&self, rhs: &Self) -> bool {
        self.intervals().iter().all(|subset| self.contains(subset))
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[quickcheck]
    fn check_empty_contains_integer(x: i8) {
        let interval = Interval::<i8>::empty();
        assert_eq!(interval.contains(&x), false)
    }

    #[quickcheck]
    fn check_empty_contains_float(x: f32) {
        let interval = Interval::<f32>::empty();
        assert_eq!(interval.contains(&x), false)
    }

    #[quickcheck]
    fn check_finite_contains_integer(x: i8) {
        let iv = Interval::open(-100, 100);
        assert_eq!(iv.contains(&x), -100 < x && x < 100);
    }

    #[quickcheck]
    fn check_finite_contains_float(x: f32) {
        let iv = Interval::closed(-100.0, 100.0);
        assert_eq!(iv.contains(&x), -100.0 < x && x < 100.0);
    }

    #[quickcheck]
    fn check_half_contains_integer(x: i8) {
        let left = Interval::unbound_closed(0);
        assert_eq!(left.contains(&x), x <= 0);

        let right = Interval::closed_unbound(0);
        assert_eq!(right.contains(&x), x >= 0);
    }

    #[quickcheck]
    fn check_half_contains_float(x: f32) {
        let left = Interval::unbound_closed(0.0);
        assert_eq!(left.contains(&x), x <= 0.0);

        let right = Interval::closed_unbound(0.0);
        assert_eq!(right.contains(&x), x >= 0.0);
    }

    #[quickcheck]
    fn check_unbounded_contains_float(x: f32) {
        let iv = Interval::unbounded();
        assert!(iv.contains(&x));
    }

    #[quickcheck]
    fn check_finite_contains_finite_integer(a: i8, b: i8) {
        let interval = Interval::closed(-50, 50);
        let candidate = Interval::closed(a, b);

        assert_eq!(interval.contains(&candidate), a <= b && -50 <= a && b <= 50)
    }

    #[quickcheck]
    fn check_finite_contains_finite_float(a: f32, b: f32) {
        let interval = Interval::open(-100.0, 100.0);
        let candidate = Interval::open(a, b);

        assert_eq!(
            interval.contains(&candidate),
            a < b && -100.0 < a && b < 100.0
        )
    }

    #[quickcheck]
    fn check_finite_contains_unbounded_integer(x: i8) {
        let interval = Interval::closed(-100, 100);

        assert_eq!(interval.contains(&Interval::unbound_closed(x)), false);
        assert_eq!(interval.contains(&Interval::unbound_open(x)), false);
        assert_eq!(interval.contains(&Interval::open_unbound(x)), false);
        assert_eq!(interval.contains(&Interval::closed_unbound(x)), false);
        assert_eq!(interval.contains(&Interval::unbounded()), false);
    }

    #[quickcheck]
    fn check_half_contains_finite_integer(a: i8, b: i8) {
        let interval = Interval::open_unbound(0);

        let finite = Interval::closed(a, b);
        assert_eq!(interval.contains(&finite), 0 < a && a <= b);
    }

    #[quickcheck]
    fn check_unbounded_contains_finite_integer(a: i8, b: i8) {
        let interval = Interval::<i8>::unbounded();

        let finite = Interval::closed(a, b);
        assert_eq!(interval.contains(&finite), a <= b);
    }
}