boost_geometry 0.0.8

//! Conventional star-imports for end users:
//!
//! ```ignore
//! use boost_geometry::prelude::*;
//! ```
//!
//! Brings in:
//!  * the algorithm free functions (`distance`, `area`, `length`,
//!    `within`, `intersects`, …);
//!  * the concept traits (`Point`, `Linestring`, `Polygon`, …) so
//!    that method calls on them resolve;
//!  * the coordinate-system types (`Cartesian`, `Spherical<U>`,
//!    `Geographic<U>`) and angle units (`Degree`, `Radian`);
//!  * the default model points (`Point2D`, `Point3D`).
//!
//! Items intentionally *not* in the prelude:
//!
//!  * the model linestring / ring / polygon types — they share their
//!    names with the same-named concept traits in [`crate::trait_`],
//!    so a single glob would collide. Pull the model variants
//!    explicitly when you need them:
//!
//!    ```ignore
//!    use boost_geometry::model::{Linestring, Polygon, Ring};
//!    ```
//!
//!  * the adapter types and the concrete strategies. They are
//!    seldom-used in any given file and pulling them via a glob
//!    obscures their origin. Import them explicitly:
//!
//!    ```ignore
//!    use boost_geometry::adapt::{Adapt, WithCs};
//!    use boost_geometry::strategy::geographic::Vincenty;
//!    use boost_geometry::strategy::spherical::Haversine;
//!    ```

pub use crate::algorithm::{
    CoordinatePosition, DynKindMismatch, append, append_to_ring, area, area_dyn, area_with,
    assign_values, azimuth, azimuth_with, box_area, centroid, centroid_with, chaikin_smoothing,
    clear, closest_points, closest_points_with, comparable_distance, comparable_distance_with,
    concave_hull, concave_hull_with, convert, convex_hull, coordinate_position, correct,
    correct_closure, covered_by, densify, destination, destination_with, discrete_frechet_distance,
    discrete_frechet_distance_with, discrete_hausdorff_distance, discrete_hausdorff_distance_with,
    disjoint, disjoint_box_box, distance, distance_dyn, distance_with, envelope, envelope_dyn,
    equals, expand, expand_with, for_each_point, for_each_segment, intersects, intersects_reversed,
    is_convex, is_empty, is_simple, k_nearest_concave_hull, length, length_dyn, length_with,
    line_interpolate, line_locate_point, linestring_segmentize, linestring_segmentize_with,
    make_box, make_point, make_segment, map_coords, map_coords_in_place, minimum_rotated_rect,
    monotone_subdivision, multi_polygon_area, num_geometries, num_interior_rings, num_points,
    num_segments, perimeter, perimeter_with, remove_spikes, reverse, rhumb_azimuth,
    rhumb_azimuth_with, rhumb_destination, rhumb_destination_with, rhumb_distance,
    rhumb_distance_with, rhumb_length, rhumb_length_with, ring_area, ring_perimeter,
    ring_perimeter_with, simplify, simplify_with, transform, triangulate_earcut, unique, within,
    within_dyn,
};
pub use crate::cs::{Cartesian, CoordinateSystem, Degree, Geographic, Radian, Spherical};
pub use crate::model::{Point2D, Point3D};
pub use crate::overlay::{
    De9im, Dimension, JoinStrategy, LineIntersection, OverlayError, PointStrategy, RelateError,
    ValidityFailure, ValidityOptions, buffer, buffer_convex_polygon, buffer_point, buffer_with,
    contains_properly, crosses, difference, intersection, is_valid, is_valid_polygon,
    is_valid_polygon_with, is_valid_ring, is_valid_ring_with, is_valid_with, line_intersection,
    merge_elements, merge_multipolygon, merge_polygons, overlaps, point_on_surface, relate,
    relation, stitch_triangles, sym_difference, touches, r#union, union_poly, validity_reason,
    validity_reason_with,
};
pub use crate::rtree::{
    Bounds, Indexable, Linear, Predicate, Quadratic, QueryPredicate, Rtree, and, not, satisfies,
};
pub use crate::trait_::{
    Box, Geometry, GeometryCollection, Linestring, MultiLinestring, MultiPoint, MultiPolygon,
    Point, PointMut, PointOrder, Polygon, PolyhedralSurface, Ring, Segment,
};