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

mod adjacent;
mod bounding;
mod complement;
mod contains;
mod empty;
mod from;
mod hash;
mod intersection;
mod intersects;
mod merged;
mod union;

mod measure;

mod partial_ord;

use crate::bound::{Bound, Side};
use crate::numeric::Domain;

#[derive(Debug, Clone, PartialEq)]
pub(crate) enum Finite<T> {
    Empty,
    FullyBounded(Bound<T>, Bound<T>),
}

#[derive(Debug, Clone, PartialEq)]
pub(crate) struct HalfBounded<T> {
    side: Side,
    bound: Bound<T>,
}

#[derive(Debug, Clone, PartialEq)]
pub(crate) enum BoundCase<T> {
    Finite(Finite<T>),
    Half(HalfBounded<T>),
    Unbounded,
}

impl<T: Domain> Finite<T> {
    pub fn new(left: Bound<T>, right: Bound<T>) -> Self {
        if left.value() > right.value() {
            Self::Empty
        } else if left.value() == right.value() {
            if left.is_open() || right.is_open() {
                Self::Empty
            } else {
                // singleton set
                Self::new_unchecked(left, right)
            }
        } else {
            Self::new_unchecked(left.normalized(Side::Left), right.normalized(Side::Right))
        }
    }

    pub fn new_unchecked(left: Bound<T>, right: Bound<T>) -> Self {
        Self::FullyBounded(left, right)
    }

    pub fn map(&self, func: impl FnOnce(&Bound<T>, &Bound<T>) -> Self) -> Self {
        self.map_or(Self::Empty, func)
    }

    pub fn map_or<U>(&self, default: U, func: impl FnOnce(&Bound<T>, &Bound<T>) -> U) -> U {
        match self {
            Self::FullyBounded(left, right) => func(left, right),
            Self::Empty => default,
        }
    }

    pub fn map_or_else<F, D, U>(&self, default: D, func: F) -> U
    where
        D: FnOnce() -> U,
        F: FnOnce(&Bound<T>, &Bound<T>) -> U,
    {
        match self {
            Self::FullyBounded(left, right) => func(left, right),
            Self::Empty => default(),
        }
    }
}

impl<T: Domain> HalfBounded<T> {
    pub fn new(side: Side, bound: Bound<T>) -> Self {
        Self { side, bound }
    }
}