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

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

/// The boundaries of a Set on the number line.
///
/// The left and right boundary represented here
/// are are extrema of a Set, and would properly
/// define the convex hull of a Set.
pub trait Bounding<T> {
    fn bound(&self, side: Side) -> Option<&Bound<T>>;

    fn left(&self) -> Option<&Bound<T>> {
        self.bound(Side::Left)
    }

    fn right(&self) -> Option<&Bound<T>> {
        self.bound(Side::Right)
    }

    fn lval(&self) -> Option<&T> {
        self.left().map(|b| b.value())
    }

    fn rval(&self) -> Option<&T> {
        self.right().map(|b| b.value())
    }
}

impl<T: Domain> Bounding<T> for Interval<T> {
    fn bound(&self, side: Side) -> Option<&Bound<T>> {
        self.0.bound(side)
    }
}

impl<T: Domain> Bounding<T> for IntervalSet<T> {
    fn bound(&self, side: Side) -> Option<&Bound<T>> {
        match side {
            Side::Left => self.intervals().first().and_then(|s| s.left()),
            Side::Right => self.intervals().last().and_then(|s| s.right()),
        }
    }
}