boost_geometry 0.0.8

Rust port of Boost.Geometry — same design philosophy (concepts, tags, strategy-based dispatch), works with your own point/geometry types, re-exported as a single API surface.
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

//! Public-facade parity tests for argument-order reversal.
//!
//! Mirrors the ordering semantics in
//! `test/core/reverse_dispatch.cpp:24-41` at the strategy boundary.

use boost_geometry::model::{Linestring, Point2D, Polygon, Ring, Segment};
use boost_geometry::prelude::{Cartesian, distance_with};
use boost_geometry::strategy::{
    CartesianIntersects, IntersectsStrategy, PointToSegment, Pythagoras, Reversed,
};

type P = Point2D<f64, Cartesian>;

/// `test/core/reverse_dispatch.cpp:36-41` — one public reversal adapter works
/// for different symmetric algorithm concepts, rather than each concept
/// exposing an unrelated wrapper type.
#[test]
fn one_reversed_adapter_serves_distance_and_intersects() {
    let segment = Segment::new(P::new(0.0, 0.0), P::new(4.0, 0.0));
    let point = P::new(2.0, 2.0);
    let distance = distance_with(
        &segment,
        &point,
        Reversed(PointToSegment::<Pythagoras>::default()),
    );
    assert!((distance - 2.0).abs() < 1e-12);

    let linestring = Linestring::from_vec(vec![P::new(1.0, 1.0), P::new(2.0, 2.0)]);
    let polygon: Polygon<P> = Polygon::new(Ring::from_vec(vec![
        P::new(0.0, 0.0),
        P::new(10.0, 0.0),
        P::new(10.0, 10.0),
        P::new(0.0, 10.0),
        P::new(0.0, 0.0),
    ]));
    let forward = CartesianIntersects.intersects(&linestring, &polygon);
    let reversed = Reversed(CartesianIntersects).intersects(&polygon, &linestring);
    assert_eq!(forward, reversed);
}