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
49
50
51
52
53
54
55
56
57
58
59
60

use crate::geometry::*;
use crate::intersects::has_disjoint_bboxes;
use crate::monotone_chain::{MonotoneChain, MonotoneChainSegment};
use crate::{GeoNum, Intersects};

impl<'a, T> Intersects<Coord<T>> for MonotoneChain<'a, T>
where
    T: GeoNum,
{
    fn intersects(&self, rhs: &Coord<T>) -> bool {
        if has_disjoint_bboxes(self, rhs) {
            return false;
        }

        self.segment_iter().any(|seg| seg.intersects(rhs))
    }
}
symmetric_intersects_impl!(Coord<T>, MonotoneChain<'a, T>);

impl<'a, T> Intersects<Line<T>> for MonotoneChain<'a, T>
where
    T: GeoNum,
{
    fn intersects(&self, rhs: &Line<T>) -> bool {
        if has_disjoint_bboxes(self, rhs) {
            return false;
        }

        self.segment_iter().any(|seg| seg.intersects(rhs))
    }
}
symmetric_intersects_impl!(Line<T>, MonotoneChain<'a, T>);

impl<'a, T> Intersects<MonotoneChain<'a, T>> for MonotoneChain<'a, T>
where
    T: GeoNum,
{
    fn intersects(&self, rhs: &MonotoneChain<'a, T>) -> bool {
        if has_disjoint_bboxes(self, rhs) {
            return false;
        }

        self.segment_iter().any(|seg| seg.intersects(rhs))
    }
}

impl<'a, T> Intersects<MonotoneChainSegment<'a, T>> for MonotoneChain<'a, T>
where
    T: GeoNum,
{
    fn intersects(&self, rhs: &MonotoneChainSegment<'a, T>) -> bool {
        if has_disjoint_bboxes(self, rhs) {
            return false;
        }

        self.segment_iter().any(|seg| seg.intersects(rhs))
    }
}

symmetric_intersects_impl!(MonotoneChainSegment<'a, T>, MonotoneChain<'a, T>);