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

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

/// Defines whether two sets intersect.
///
/// For these two sets is there at least one
/// element which is contained in each?
///
/// Intersects is commutative.
///
/// # Example
///
/// ```
/// use intervalsets::Interval;
/// use intervalsets::ops::Intersects;
///
/// let interval = Interval::closed(10, 20);
/// if interval.intersects(&Interval::closed_unbound(15)) {
///     // true: do something
/// }
/// ```
pub trait Intersects<Rhs = Self> {
    fn intersects(&self, rhs: &Rhs) -> bool;

    fn is_disjoint_from(&self, rhs: &Rhs) -> bool {
        !self.intersects(rhs)
    }
}

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

impl<T: Domain> Intersects<Interval<T>> for IntervalSet<T> {
    fn intersects(&self, rhs: &Interval<T>) -> bool {
        // binary search for
        self.intervals().iter().any(|subset| subset.intersects(rhs))
    }
}
commutative_predicate_impl!(Intersects, intersects, Interval<T>, IntervalSet<T>);

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

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

    #[test]
    fn test_finite_intersects() {
        assert!(Interval::open(0, 10).intersects(&Interval::open(5, 15)));

        assert!(!Interval::open(0, 10).intersects(&Interval::closed(10, 20)));
    }

    #[test]
    fn test_set_set_intersects() {
        let a = IntervalSet::new_unchecked(vec![
            Interval::unbound_open(0.0),
            Interval::closed(100.0, 110.0),
            Interval::open(1000.0, 1100.0),
        ]);
        let b = IntervalSet::new_unchecked(vec![
            Interval::open(10.0, 20.0),     // no
            Interval::closed(110.0, 120.0), // [110.0, 110.0]
        ]);

        assert!(a.intersects(&b));
    }
}