rene 0.2.0

Computational 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

use crate::bounded;
use crate::bounded::Bounded;
use crate::geometries::{Point, Segment};
use crate::operations::{merge_bounds, segmental_to_bounds};
use crate::traits::{Elemental, Segmental};

use super::types::Multisegment;

impl<'a, Scalar: Ord> Bounded<&'a Scalar> for &'a Multisegment<Scalar>
where
    for<'b> &'b Point<Scalar>: Elemental<Coordinate = &'b Scalar>,
    for<'b> &'b Segment<Scalar>: Segmental<Endpoint = &'b Point<Scalar>>,
{
    fn to_bounding_box(self) -> bounded::Box<&'a Scalar> {
        let (min_x, max_x, min_y, max_y) =
            merge_bounds(self.segments.iter().map(segmental_to_bounds));
        bounded::Box::new(min_x, max_x, min_y, max_y)
    }

    fn to_max_x(self) -> &'a Scalar {
        unsafe {
            self.segments
                .iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.x().max(end.x())
                })
                .max()
                .unwrap_unchecked()
        }
    }

    fn to_max_y(self) -> &'a Scalar {
        unsafe {
            self.segments
                .iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.y().max(end.y())
                })
                .max()
                .unwrap_unchecked()
        }
    }

    fn to_min_x(self) -> &'a Scalar {
        unsafe {
            self.segments
                .iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.x().min(end.x())
                })
                .min()
                .unwrap_unchecked()
        }
    }

    fn to_min_y(self) -> &'a Scalar {
        unsafe {
            self.segments
                .iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.y().min(end.y())
                })
                .min()
                .unwrap_unchecked()
        }
    }
}

impl<Point, Scalar: Ord> Bounded<Scalar> for Multisegment<Scalar>
where
    Point: Elemental<Coordinate = Scalar>,
    Segment<Scalar>: Segmental<Endpoint = Point>,
{
    fn to_bounding_box(self) -> bounded::Box<Scalar> {
        let (min_x, max_x, min_y, max_y) =
            merge_bounds(self.segments.into_iter().map(segmental_to_bounds));
        bounded::Box::new(min_x, max_x, min_y, max_y)
    }

    fn to_max_x(self) -> Scalar {
        unsafe {
            self.segments
                .into_iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.x().max(end.x())
                })
                .max()
                .unwrap_unchecked()
        }
    }

    fn to_max_y(self) -> Scalar {
        unsafe {
            self.segments
                .into_iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.y().max(end.y())
                })
                .max()
                .unwrap_unchecked()
        }
    }

    fn to_min_x(self) -> Scalar {
        unsafe {
            self.segments
                .into_iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.x().min(end.x())
                })
                .min()
                .unwrap_unchecked()
        }
    }

    fn to_min_y(self) -> Scalar {
        unsafe {
            self.segments
                .into_iter()
                .map(|segment| {
                    let (start, end) = segment.endpoints();
                    start.y().min(end.y())
                })
                .min()
                .unwrap_unchecked()
        }
    }
}