geo 0.33.0

Geospatial primitives and algorithms
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

use crate::MonotoneChains;
use crate::monotone_chain::geometry::*;
use crate::{GeoNum, HasDimensions, Intersects};

chains_intersects_impl!(
    MonotoneChainMultiLineString<'a, T>,
    MonotoneChainLineString<'a, T>
);
chains_intersects_impl!(
    MonotoneChainMultiLineString<'a, T>,
    MonotoneChainMultiLineString<'a, T>
);

impl<'a, T> Intersects<MonotoneChainPolygon<'a, T>> for MonotoneChainMultiLineString<'a, T>
where
    T: GeoNum,
{
    fn intersects(&self, rhs: &MonotoneChainPolygon<'a, T>) -> bool {
        if self.is_empty() || rhs.is_empty() {
            return false;
        }
        self.chains()
            .any(|c| rhs.chains().any(|c2| c.intersects(c2)))
            || self
                .geometry()
                .iter()
                .filter_map(|c| c.0.first())
                .any(|c| c.intersects(rhs.geometry()))
    }
}

impl<'a, T> Intersects<MonotoneChainMultiPolygon<'a, T>> for MonotoneChainMultiLineString<'a, T>
where
    T: GeoNum,
{
    fn intersects(&self, rhs: &MonotoneChainMultiPolygon<'a, T>) -> bool {
        if self.is_empty() || rhs.is_empty() {
            return false;
        }
        self.chains()
            .any(|c| rhs.chains().any(|c2| c.intersects(c2)))
            || self
                .geometry()
                .iter()
                .filter_map(|c| c.0.first())
                .any(|c| c.intersects(rhs.geometry()))
    }
}