pythagore 0.8.3

Mathematics tools for simple geometry
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

use std::ops::Bound::{self, *};
use std::ops::{Range, RangeFrom, RangeFull, RangeInclusive, RangeTo, RangeToInclusive};

/// Tests to known if a range does not contain anything
pub trait IsRangeEmpty {
    /// Returns true if range is empty.
    fn is_range_empty(&self) -> bool;
}

// Implementations
/// Always return false for RangeFull
impl IsRangeEmpty for RangeFull {
    #[inline]
    fn is_range_empty(&self) -> bool {
        false
    }
}

/// Always return false for RangeFrom
impl<N> IsRangeEmpty for RangeFrom<N> {
    #[inline]
    fn is_range_empty(&self) -> bool {
        false
    }
}

/// Always return false for RangeTo
impl<N> IsRangeEmpty for RangeTo<N> {
    #[inline]
    fn is_range_empty(&self) -> bool {
        false
    }
}

/// Always return false for RangeToInclusive
impl<N> IsRangeEmpty for RangeToInclusive<N> {
    #[inline]
    fn is_range_empty(&self) -> bool {
        false
    }
}

/// Return true for Range if start >= end
impl<N: PartialOrd> IsRangeEmpty for Range<N> {
    #[inline]
    fn is_range_empty(&self) -> bool {
        self.start >= self.end
    }
}

/// Returns true for RangeInclusive if start > end
impl<N: PartialOrd> IsRangeEmpty for RangeInclusive<N> {
    #[inline]
    fn is_range_empty(&self) -> bool {
        self.start() > self.end()
    }
}

/// Return true if this bound tuple does not "contain" anything
impl<N: PartialOrd> IsRangeEmpty for (Bound<N>, Bound<N>) {
    fn is_range_empty(&self) -> bool {
        match self {
            (Included(l), Included(r)) => l > r,
            (Included(l), Excluded(r)) |
            (Excluded(l), Included(r)) |
            (Excluded(l), Excluded(r)) => l >= r,
            _ => false,
        }
    }
}