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
use super::Contains;
use crate::intersects::Intersects;
use crate::{CoordNum, Coordinate, GeoNum, Line, LineString, MultiPolygon, Point, Polygon};
impl<T> Contains<Coordinate<T>> for Polygon<T>
where
T: GeoNum,
{
fn contains(&self, coord: &Coordinate<T>) -> bool {
use crate::algorithm::coordinate_position::{CoordPos, CoordinatePosition};
self.coordinate_position(coord) == CoordPos::Inside
}
}
impl<T> Contains<Point<T>> for Polygon<T>
where
T: GeoNum,
{
fn contains(&self, p: &Point<T>) -> bool {
self.contains(&p.0)
}
}
impl<T> Contains<Line<T>> for Polygon<T>
where
T: GeoNum,
{
fn contains(&self, line: &Line<T>) -> bool {
self.contains(&line.start)
&& self.contains(&line.end)
&& !self.exterior().intersects(line)
&& !self.interiors().iter().any(|inner| inner.intersects(line))
}
}
impl<T> Contains<Polygon<T>> for Polygon<T>
where
T: GeoNum,
{
fn contains(&self, poly: &Polygon<T>) -> bool {
poly.exterior().lines().all(|line| self.contains(&line))
}
}
impl<T> Contains<LineString<T>> for Polygon<T>
where
T: GeoNum,
{
fn contains(&self, linestring: &LineString<T>) -> bool {
if linestring.points_iter().all(|point| self.contains(&point)) {
!self
.interiors()
.iter()
.any(|ring| ring.intersects(linestring))
} else {
false
}
}
}
impl<G, T> Contains<G> for MultiPolygon<T>
where
T: CoordNum,
Polygon<T>: Contains<G>,
{
fn contains(&self, rhs: &G) -> bool {
self.iter().any(|p| p.contains(rhs))
}
}