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::ops::Complement;
use crate::{Interval, IntervalSet, Side};

use super::{BoundCase, Finite, HalfBounded};

impl<T: Domain> Complement for Finite<T> {
    type Output = IntervalSet<T>;

    fn complement(&self) -> Self::Output {
        match self {
            Self::Empty => BoundCase::Unbounded.into(),
            Self::FullyBounded(left, right) => {
                let intervals: Vec<Interval<T>> = vec![
                    HalfBounded::new(Side::Right, left.flip()).into(),
                    HalfBounded::new(Side::Left, right.flip()).into(),
                ];
                IntervalSet::new_unchecked(intervals)
            }
        }
    }
}

impl<T: Domain> Complement for HalfBounded<T> {
    type Output = HalfBounded<T>;

    fn complement(&self) -> Self::Output {
        Self::new(self.side.flip(), self.bound.flip())
    }
}

impl<T: Domain> Complement for BoundCase<T> {
    type Output = IntervalSet<T>;

    fn complement(&self) -> Self::Output {
        match self {
            Self::Finite(interval) => interval.complement(),
            Self::Half(interval) => interval.complement().into(),
            Self::Unbounded => Finite::Empty.into(),
        }
    }
}