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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173

use std::ops::Bound::Unbounded;
use std::ops::{Bound, Range, RangeFrom, RangeFull, RangeInclusive, RangeTo, RangeToInclusive};
use na::{Point, Scalar};

use crate::{BBox, Intersection, PointBounds};
use crate::traits::DimensionBounds;

/// Builds a bounding box from a range of points
///
/// # Example
/// ```
/// use std::ops::Bound::Unbounded;
/// use nalgebra::point;
/// use pythagore::BBox;
///
/// assert_eq!(
///     BBox::<i32, 2>::from(..),
///     BBox::from([
///        (Unbounded, Unbounded),
///        (Unbounded, Unbounded),
///     ])
/// )
/// ```
impl<N: Copy + Scalar, const D: usize> From<RangeFull> for BBox<N, D> {
    fn from(_value: RangeFull) -> Self {
        BBox::from([(Unbounded, Unbounded); D])
    }
}

impl<N: Scalar, const D: usize> DimensionBounds<N, D> for RangeFull {
    type Output = RangeFull;

    #[inline]
    fn get_bounds(&self, _idx: usize) -> Self::Output {
        ..
    }

    #[inline]
    unsafe fn get_bounds_unchecked(&self, _idx: usize) -> Self::Output {
        ..
    }
}

impl<N: Scalar, const D: usize> PointBounds<N, D> for RangeFull {
    #[inline]
    fn start_point(&self) -> Option<Point<N, D>> {
        None
    }

    #[inline]
    fn end_point(&self) -> Option<Point<N, D>> {
        None
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<BBox<N, D>> for RangeFull {
    type Output = BBox<N, D>;

    #[inline]
    fn intersection(&self, rhs: &BBox<N, D>) -> Self::Output {
        *rhs
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<Range<Point<N, D>>> for RangeFull {
    type Output = Range<Point<N, D>>;

    #[inline]
    fn intersection(&self, rhs: &Range<Point<N, D>>) -> Self::Output {
        rhs.clone()
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<RangeFrom<Point<N, D>>> for RangeFull {
    type Output = RangeFrom<Point<N, D>>;

    #[inline]
    fn intersection(&self, rhs: &RangeFrom<Point<N, D>>) -> Self::Output {
        rhs.clone()
    }
}

impl Intersection for RangeFull {
    type Output = RangeFull;

    #[inline]
    fn intersection(&self, _: &RangeFull) -> Self::Output {
        *self
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<RangeInclusive<Point<N, D>>> for RangeFull {
    type Output = RangeInclusive<Point<N, D>>;

    #[inline]
    fn intersection(&self, rhs: &RangeInclusive<Point<N, D>>) -> Self::Output {
        rhs.clone()
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<RangeTo<Point<N, D>>> for RangeFull {
    type Output = RangeTo<Point<N, D>>;

    #[inline]
    fn intersection(&self, rhs: &RangeTo<Point<N, D>>) -> Self::Output {
        *rhs
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<RangeToInclusive<Point<N, D>>> for RangeFull {
    type Output = RangeToInclusive<Point<N, D>>;

    #[inline]
    fn intersection(&self, rhs: &RangeToInclusive<Point<N, D>>) -> Self::Output {
        *rhs
    }
}

impl<N: Copy + Scalar, const D: usize> Intersection<(Bound<Point<N, D>>, Bound<Point<N, D>>)> for RangeFull {
    type Output = (Bound<Point<N, D>>, Bound<Point<N, D>>);

    #[inline]
    fn intersection(&self, rhs: &(Bound<Point<N, D>>, Bound<Point<N, D>>)) -> Self::Output {
        *rhs
    }
}

// Tests
#[cfg(test)]
mod tests {
    use na::point;
    use super::*;

    #[test]
    fn test_intersection() {
        assert_eq!((..).intersection(&(point![5, 0]..point![15, 10])), point![5, 0]..point![15, 10]);
        assert_eq!((..).intersection(&(point![5, 0]..)), point![5, 0]..);
        assert_eq!((..).intersection(&(..)), ..);
        assert_eq!((..).intersection(&(point![5, 0]..=point![15, 10])), point![5, 0]..=point![15, 10]);
        assert_eq!((..).intersection(&(..point![15, 10])), ..point![15, 10]);
        assert_eq!((..).intersection(&(..=point![15, 10])), ..=point![15, 10]);
    }

    mod dimension_bounds {
        use super::*;

        #[test]
        fn test_get_bounds() {
            assert_eq!(DimensionBounds::<i32, 2>::get_bounds(&(..), 0), ..);
            assert_eq!(DimensionBounds::<i32, 2>::get_bounds(&(..), 1), ..);
        }
    }

    mod point_bounds {
        use super::*;

        #[test]
        fn test_start_point() {
            assert_eq!(
                (..).start_point(),
                None::<Point<i32, 2>>
            );
        }

        #[test]
        fn test_end_point() {
            assert_eq!(
                (..).end_point(),
                None::<Point<i32, 2>>
            );
        }
    }
}