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::traits::empty::MaybeEmpty;

use super::*;

impl<T> MaybeEmpty for Finite<T> {
    fn is_empty(&self) -> bool {
        matches!(self, Finite::Empty)
    }
}

impl<T> MaybeEmpty for BoundCase<T> {
    fn is_empty(&self) -> bool {
        match self {
            Self::Finite(inner) => inner.is_empty(),
            _ => false,
        }
    }
}

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

    #[test]
    fn test_private_maybe_empty() {
        let x = Finite::new(Bound::closed(0), Bound::closed(10));
        assert_eq!(x.is_empty(), false);

        let x = BoundCase::Finite(x);
        assert_eq!(x.is_empty(), false);

        let x = Finite::<i32>::Empty;
        assert_eq!(x.is_empty(), true);

        let x = BoundCase::Finite(x);
        assert_eq!(x.is_empty(), true);

        let x = HalfBounded::new(Side::Left, Bound::closed(0));
        let x = BoundCase::Half(x);
        assert_eq!(x.is_empty(), false);
    }
}