Struct geo::LineString

pub struct LineString<T>(pub Vec<Coordinate<T>, Global>)
 where
    T: CoordNum;

An ordered collection of two or more Coordinates, representing a path between locations.

Semantics

A LineString is closed if it is empty, or if the first and last coordinates are the same. The boundary of a LineString is empty if closed, and otherwise the end points. The interior is the (infinite) set of all points along the linestring not including the boundary. A LineString is simple if it does not intersect except possibly at the first and last coordinates. A simple and closed LineString is a LinearRing as defined in the OGC-SFA (but is not a separate type here).

Validity

A LineString is valid if it is either empty or contains 2 or more coordinates. Further, a closed LineString must not self intersect. Note that the validity is not enforced, and the operations and predicates are undefined on invalid linestrings.

Examples

Create a LineString by calling it directly:

use geo_types::{Coordinate, LineString};

let line_string = LineString(vec![
    Coordinate { x: 0., y: 0. },
    Coordinate { x: 10., y: 0. },
]);

Create a LineString with the line_string! macro:

use geo_types::line_string;

let line_string = line_string![
    (x: 0., y: 0.),
    (x: 10., y: 0.),
];

Converting a Vec of Coordinate-like things:

use geo_types::LineString;

let line_string: LineString<f32> = vec![(0., 0.), (10., 0.)].into();

use geo_types::LineString;

let line_string: LineString<f64> = vec![[0., 0.], [10., 0.]].into();

Or collecting from a Coordinate iterator

use geo_types::{Coordinate, LineString};

let mut coords_iter =
    vec![Coordinate { x: 0., y: 0. }, Coordinate { x: 10., y: 0. }].into_iter();

let line_string: LineString<f32> = coords_iter.collect();

You can iterate over the coordinates in the LineString:

use geo_types::{Coordinate, LineString};

let line_string = LineString(vec![
    Coordinate { x: 0., y: 0. },
    Coordinate { x: 10., y: 0. },
]);

for coord in line_string {
    println!("Coordinate x = {}, y = {}", coord.x, coord.y);
}

You can also iterate over the coordinates in the LineString as Points:

use geo_types::{Coordinate, LineString};

let line_string = LineString(vec![
    Coordinate { x: 0., y: 0. },
    Coordinate { x: 10., y: 0. },
]);

for point in line_string.points_iter() {
    println!("Point x = {}, y = {}", point.x(), point.y());
}

Implementations

impl<T> LineString<T> where
    T: CoordNum, 

pub fn points_iter(&self) -> PointsIter<'_, T>

Return an iterator yielding the coordinates of a LineString as Points

pub fn into_points(self) -> Vec<Point<T>, Global>

Return the coordinates of a LineString as a Vec of Points

pub fn lines(&self) -> impl ExactSizeIterator + Iterator<Item = Line<T>>

Return an iterator yielding one Line for each line segment in the LineString.

Examples

use geo_types::{Coordinate, Line, LineString};

let mut coords = vec![(0., 0.), (5., 0.), (7., 9.)];
let line_string: LineString<f32> = coords.into_iter().collect();

let mut lines = line_string.lines();
assert_eq!(
    Some(Line::new(
        Coordinate { x: 0., y: 0. },
        Coordinate { x: 5., y: 0. }
    )),
    lines.next()
);
assert_eq!(
    Some(Line::new(
        Coordinate { x: 5., y: 0. },
        Coordinate { x: 7., y: 9. }
    )),
    lines.next()
);
assert!(lines.next().is_none());

pub fn triangles(&self) -> impl ExactSizeIterator + Iterator<Item = Triangle<T>>

An iterator which yields the coordinates of a LineString as Triangles

pub fn close(&mut self)

Close the LineString. Specifically, if the LineString has at least one coordinate, and the value of the first coordinate does not equal the value of the last coordinate, then a new coordinate is added to the end with the value of the first coordinate.

pub fn num_coords(&self) -> usize

👎 Deprecated:

Use geo::algorithm::coords_iter::CoordsIter::coords_count instead

Return the number of coordinates in the LineString.

Examples

use geo_types::LineString;

let mut coords = vec![(0., 0.), (5., 0.), (7., 9.)];
let line_string: LineString<f32> = coords.into_iter().collect();
assert_eq!(3, line_string.num_coords());

pub fn is_closed(&self) -> bool

Checks if the linestring is closed; i.e. it is either empty or, the first and last points are the same.

Examples

use geo_types::LineString;

let mut coords = vec![(0., 0.), (5., 0.), (0., 0.)];
let line_string: LineString<f32> = coords.into_iter().collect();
assert!(line_string.is_closed());

Note that we diverge from some libraries (JTS et al), which have a LinearRing type, separate from LineString. Those libraries treat an empty LinearRing as closed, by definition, while treating an empty LineString as open. Since we don’t have a separate LinearRing type, and use a LineString in its place, we adopt the JTS LinearRing is_closed behavior in all places, that is, we consider an empty LineString as closed.

This is expected when used in the context of a Polygon.exterior and elswhere; And there seems to be no reason to maintain the separate behavior for LineStrings used in non-LinearRing contexts.

Trait Implementations

impl<T> AbsDiffEq<LineString<T>> for LineString<T> where
    T: AbsDiffEq<T, Epsilon = T> + CoordNum, 

type Epsilon = T

Used for specifying relative comparisons.

pub fn default_epsilon() -> <LineString<T> as AbsDiffEq<LineString<T>>>::Epsilon

The default tolerance to use when testing values that are close together.

pub fn abs_diff_eq(
    &self,
    other: &LineString<T>,
    epsilon: <LineString<T> as AbsDiffEq<LineString<T>>>::Epsilon
) -> bool

Equality assertion with an absolute limit.

Examples

use geo_types::LineString;

let mut coords_a = vec![(0., 0.), (5., 0.), (7., 9.)];
let a: LineString<f32> = coords_a.into_iter().collect();

let mut coords_b = vec![(0., 0.), (5., 0.), (7.001, 9.)];
let b: LineString<f32> = coords_b.into_iter().collect();

approx::assert_relative_eq!(a, b, epsilon=0.1)

pub fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T> Area<T> for LineString<T> where
    T: CoordNum, 

fn signed_area(&self) -> T

fn unsigned_area(&self) -> T

impl<T> BoundingRect<T> for LineString<T> where
    T: CoordNum, 

type Output = Option<Rect<T>>

fn bounding_rect(&self) -> Self::Output

Return the BoundingRect for a LineString

impl<T> Centroid for LineString<T> where
    T: GeoFloat, 

type Output = Option<Point<T>>

fn centroid(&self) -> Self::Output

See: https://en.wikipedia.org/wiki/Centroid

impl<T> Clone for LineString<T> where
    T: Clone + CoordNum, 

pub fn clone(&self) -> LineString<T>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<F: GeoFloat> ClosestPoint<F, Point<F>> for LineString<F>

fn closest_point(&self, p: &Point<F>) -> Closest<F>

Find the closest point between self and p.

impl<T> ConcaveHull for LineString<T> where
    T: GeoFloat + RTreeNum, 

type Scalar = T

fn concave_hull(&self, concavity: Self::Scalar) -> Polygon<Self::Scalar>

impl<T> Contains<Coordinate<T>> for LineString<T> where
    T: GeoNum, 

fn contains(&self, coord: &Coordinate<T>) -> bool

impl<T> Contains<Line<T>> for LineString<T> where
    T: GeoNum, 

fn contains(&self, line: &Line<T>) -> bool

impl<F> Contains<LineString<F>> for MultiPolygon<F> where
    F: GeoFloat, 

fn contains(&self, rhs: &LineString<F>) -> bool

impl<T> Contains<LineString<T>> for Line<T> where
    T: GeoNum, 

fn contains(&self, linestring: &LineString<T>) -> bool

impl<T> Contains<LineString<T>> for LineString<T> where
    T: GeoNum, 

fn contains(&self, rhs: &LineString<T>) -> bool

impl<T> Contains<LineString<T>> for Polygon<T> where
    T: GeoFloat, 

fn contains(&self, linestring: &LineString<T>) -> bool

impl<T> Contains<Point<T>> for LineString<T> where
    T: GeoNum, 

fn contains(&self, p: &Point<T>) -> bool

impl<T> ConvexHull for LineString<T> where
    T: GeoNum, 

type Scalar = T

fn convex_hull(&self) -> Polygon<T>

impl<T> CoordinatePosition for LineString<T> where
    T: GeoNum, 

type Scalar = T

fn calculate_coordinate_position(
    &self,
    coord: &Coordinate<T>,
    is_inside: &mut bool,
    boundary_count: &mut usize
)

fn coordinate_position(&self, coord: &Coordinate<Self::Scalar>) -> CoordPos

impl<'a, T: CoordNum + 'a> CoordsIter<'a> for LineString<T>

type Iter = Copied<Iter<'a, Coordinate<T>>>

type ExteriorIter = Self::Iter

type Scalar = T

fn coords_iter(&'a self) -> Self::Iter

Iterate over all exterior and (if any) interior coordinates of a geometry.

fn coords_count(&'a self) -> usize

Return the number of coordinates in the LineString.

fn exterior_coords_iter(&'a self) -> Self::ExteriorIter

Iterate over all exterior coordinates of a geometry.

impl<T> Debug for LineString<T> where
    T: Debug + CoordNum, 

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> Eq for LineString<T> where
    T: Eq + CoordNum, 

impl<T> EuclideanDistance<T, Line<T>> for LineString<T> where
    T: GeoFloat + FloatConst + Signed + RTreeNum, 

LineString to Line

fn euclidean_distance(&self, other: &Line<T>) -> T

Returns the distance between two geometries

impl<T> EuclideanDistance<T, LineString<T>> for Point<T> where
    T: GeoFloat, 

fn euclidean_distance(&self, linestring: &LineString<T>) -> T

Minimum distance from a Point to a LineString

impl<T> EuclideanDistance<T, LineString<T>> for Line<T> where
    T: GeoFloat + FloatConst + Signed + RTreeNum, 

Line to LineString

fn euclidean_distance(&self, other: &LineString<T>) -> T

Returns the distance between two geometries

impl<T> EuclideanDistance<T, LineString<T>> for LineString<T> where
    T: GeoFloat + Signed + RTreeNum, 

LineString-LineString distance

fn euclidean_distance(&self, other: &LineString<T>) -> T

Returns the distance between two geometries

impl<T> EuclideanDistance<T, LineString<T>> for Polygon<T> where
    T: GeoFloat + FloatConst + Signed + RTreeNum, 

Polygon to LineString distance

fn euclidean_distance(&self, other: &LineString<T>) -> T

Returns the distance between two geometries

impl<T> EuclideanDistance<T, Point<T>> for LineString<T> where
    T: GeoFloat, 

fn euclidean_distance(&self, point: &Point<T>) -> T

Minimum distance from a LineString to a Point

impl<T> EuclideanDistance<T, Polygon<T>> for LineString<T> where
    T: GeoFloat + FloatConst + Signed + RTreeNum, 

LineString to Polygon

fn euclidean_distance(&self, other: &Polygon<T>) -> T

Returns the distance between two geometries

impl<T> EuclideanLength<T, LineString<T>> for LineString<T> where
    T: CoordFloat + Sum, 

fn euclidean_length(&self) -> T

Calculation of the length of a Line

impl<T> FrechetDistance<T, LineString<T>> for LineString<T> where
    T: GeoFloat + FromPrimitive, 

fn frechet_distance(&self, ls: &LineString<T>) -> T

Determine the similarity between two LineStrings using the Frechet distance.

impl<T> From<Line<T>> for LineString<T> where
    T: CoordNum, 

pub fn from(line: Line<T>) -> LineString<T>

Performs the conversion.

impl<T> From<LineString<T>> for Geometry<T> where
    T: CoordNum, 

pub fn from(x: LineString<T>) -> Geometry<T>

Performs the conversion.

impl<T, IC> From<Vec<IC, Global>> for LineString<T> where
    T: CoordNum,
    IC: Into<Coordinate<T>>, 

Turn a Vec of Point-like objects into a LineString.

pub fn from(v: Vec<IC, Global>) -> LineString<T>

Performs the conversion.

impl<T, IC> FromIterator<IC> for LineString<T> where
    T: CoordNum,
    IC: Into<Coordinate<T>>, 

Turn an iterator of Point-like objects into a LineString.

pub fn from_iter<I>(iter: I) -> LineString<T> where
    I: IntoIterator<Item = IC>, 

Creates a value from an iterator.

impl GeodesicLength<f64, LineString<f64>> for LineString<f64>

fn geodesic_length(&self) -> f64

Determine the length of a geometry on an ellipsoidal model of the earth.

impl<C: CoordNum> HasDimensions for LineString<C>

fn is_empty(&self) -> bool

Some geometries, like a MultiPoint, can have zero coordinates - we call these empty.

fn dimensions(&self) -> Dimensions

The dimensions of some geometries are fixed, e.g. a Point always has 0 dimensions. However for others, the dimensionality depends on the specific geometry instance - for example typical Rects are 2-dimensional, but it’s possible to create degenerate Rects which have either 1 or 0 dimensions.

fn boundary_dimensions(&self) -> Dimensions

use geo_types::line_string;
use geo::algorithm::dimensions::{HasDimensions, Dimensions};

let ls = line_string![(x: 0.,  y: 0.), (x: 0., y: 1.), (x: 1., y: 1.)];
assert_eq!(Dimensions::ZeroDimensional, ls.boundary_dimensions());

let ls = line_string![(x: 0.,  y: 0.), (x: 0., y: 1.), (x: 1., y: 1.), (x: 0., y: 0.)];
assert_eq!(Dimensions::Empty, ls.boundary_dimensions());

impl<T> Hash for LineString<T> where
    T: Hash + CoordNum, 

pub fn hash<__H>(&self, state: &mut __H) where
    __H: Hasher, 

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<T> HaversineLength<T, LineString<T>> for LineString<T> where
    T: CoordFloat + FromPrimitive, 

fn haversine_length(&self) -> T

Determine the length of a geometry using the haversine formula.

impl<T> Index<usize> for LineString<T> where
    T: CoordNum, 

type Output = Coordinate<T>

The returned type after indexing.

pub fn index(&self, index: usize) -> &Coordinate<T>

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for LineString<T> where
    T: CoordNum, 

pub fn index_mut(&mut self, index: usize) -> &mut Coordinate<T>

Performs the mutable indexing (container[index]) operation.

impl<T, G> Intersects<G> for LineString<T> where
    T: CoordNum,
    Line<T>: Intersects<G>, 

fn intersects(&self, geom: &G) -> bool

impl<T> Intersects<LineString<T>> for Coordinate<T> where
    LineString<T>: Intersects<Coordinate<T>>,
    T: CoordNum, 

fn intersects(&self, rhs: &LineString<T>) -> bool

impl<T> Intersects<LineString<T>> for Line<T> where
    LineString<T>: Intersects<Line<T>>,
    T: CoordNum, 

fn intersects(&self, rhs: &LineString<T>) -> bool

impl<T> Intersects<LineString<T>> for Polygon<T> where
    LineString<T>: Intersects<Polygon<T>>,
    T: CoordNum, 

fn intersects(&self, rhs: &LineString<T>) -> bool

impl<'a, T> IntoIterator for &'a mut LineString<T> where
    T: CoordNum, 

Mutably iterate over all the Coordinates in this LineString.

type Item = &'a mut Coordinate<T>

The type of the elements being iterated over.

type IntoIter = IterMut<'a, Coordinate<T>>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> IterMut<'a, Coordinate<T>>

Creates an iterator from a value.

impl<T> IntoIterator for LineString<T> where
    T: CoordNum, 

Iterate over all the Coordinates in this LineString.

type Item = Coordinate<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<Coordinate<T>, Global>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> <LineString<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T: HasKernel> IsConvex for LineString<T>

fn convex_orientation(
    &self,
    allow_collinear: bool,
    specific_orientation: Option<Orientation>
) -> Option<Orientation>

Test and get the orientation if the shape is convex. Tests for strict convexity if allow_collinear, and only accepts a specific orientation if provided.

fn is_collinear(&self) -> bool

Test if the shape lies on a line.

fn is_convex(&self) -> bool

Test if the shape is convex.

fn is_ccw_convex(&self) -> bool

Test if the shape is convex, and oriented counter-clockwise.

fn is_cw_convex(&self) -> bool

Test if the shape is convex, and oriented clockwise.

fn is_strictly_convex(&self) -> bool

Test if the shape is strictly convex.

fn is_strictly_ccw_convex(&self) -> bool

Test if the shape is strictly convex, and oriented counter-clockwise.

fn is_strictly_cw_convex(&self) -> bool

Test if the shape is strictly convex, and oriented clockwise.

impl<T> LineInterpolatePoint<T> for LineString<T> where
    T: CoordFloat + AddAssign + Debug,
    Line<T>: EuclideanLength<T>,
    LineString<T>: EuclideanLength<T>, 

type Output = Option<Point<T>>

fn line_interpolate_point(&self, fraction: T) -> Self::Output

impl<T> LineLocatePoint<T, Point<T>> for LineString<T> where
    T: CoordFloat + AddAssign,
    Line<T>: EuclideanDistance<T, Point<T>> + EuclideanLength<T>,
    LineString<T>: EuclideanLength<T>, 

type Output = Option<T>

type Rhs = Point<T>

fn line_locate_point(&self, p: &Self::Rhs) -> Self::Output

impl<T: CoordNum, NT: CoordNum> MapCoords<T, NT> for LineString<T>

type Output = LineString<NT>

fn map_coords(&self, func: impl Fn(&(T, T)) -> (NT, NT) + Copy) -> Self::Output

Apply a function to all the coordinates in a geometric object, returning a new object.

impl<T: CoordNum> MapCoordsInplace<T> for LineString<T>

fn map_coords_inplace(&mut self, func: impl Fn(&(T, T)) -> (T, T))

Apply a function to all the coordinates in a geometric object, in place

impl<T> PartialEq<LineString<T>> for LineString<T> where
    T: PartialEq<T> + CoordNum, 

pub fn eq(&self, other: &LineString<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &LineString<T>) -> bool

This method tests for !=.

impl<T> PointDistance for LineString<T> where
    T: Float + RTreeNum, 

pub fn distance_2(&self, point: &Point<T>) -> T

Returns the squared euclidean distance of an object to a point.

pub fn contains_point(
    &self,
    point: &<Self::Envelope as Envelope>::Point
) -> bool

Returns true if a point is contained within this object.

pub fn distance_2_if_less_or_equal(
    &self,
    point: &<Self::Envelope as Envelope>::Point,
    max_distance_2: <<Self::Envelope as Envelope>::Point as Point>::Scalar
) -> Option<<<Self::Envelope as Envelope>::Point as Point>::Scalar>

Returns the squared distance to this object or None if the distance is larger than a given maximum value.

impl<T> RTreeObject for LineString<T> where
    T: Float + RTreeNum, 

type Envelope = AABB<Point<T>>

The object’s envelope type. Usually, AABB will be the right choice. This type also defines the objects dimensionality.

pub fn envelope(&self) -> <LineString<T> as RTreeObject>::Envelope

Returns the object’s envelope.

impl<F: GeoFloat> Relate<F, GeometryCollection<F>> for LineString<F>

fn relate(&self, other: &GeometryCollection<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, Line<F>> for LineString<F>

fn relate(&self, other: &Line<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for Point<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for Line<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for LineString<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for Polygon<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for MultiPoint<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for MultiLineString<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for MultiPolygon<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for Rect<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for Triangle<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, LineString<F>> for GeometryCollection<F>

fn relate(&self, other: &LineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, MultiLineString<F>> for LineString<F>

fn relate(&self, other: &MultiLineString<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, MultiPoint<F>> for LineString<F>

fn relate(&self, other: &MultiPoint<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, MultiPolygon<F>> for LineString<F>

fn relate(&self, other: &MultiPolygon<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, Point<F>> for LineString<F>

fn relate(&self, other: &Point<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, Polygon<F>> for LineString<F>

fn relate(&self, other: &Polygon<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, Rect<F>> for LineString<F>

fn relate(&self, other: &Rect<F>) -> IntersectionMatrix

impl<F: GeoFloat> Relate<F, Triangle<F>> for LineString<F>

fn relate(&self, other: &Triangle<F>) -> IntersectionMatrix

impl<T> RelativeEq<LineString<T>> for LineString<T> where
    T: AbsDiffEq<T, Epsilon = T> + CoordNum + RelativeEq<T>, 

pub fn default_max_relative(
) -> <LineString<T> as AbsDiffEq<LineString<T>>>::Epsilon

The default relative tolerance for testing values that are far-apart.

pub fn relative_eq(
    &self,
    other: &LineString<T>,
    epsilon: <LineString<T> as AbsDiffEq<LineString<T>>>::Epsilon,
    max_relative: <LineString<T> as AbsDiffEq<LineString<T>>>::Epsilon
) -> bool

Equality assertion within a relative limit.

Examples

use geo_types::LineString;

let mut coords_a = vec![(0., 0.), (5., 0.), (7., 9.)];
let a: LineString<f32> = coords_a.into_iter().collect();

let mut coords_b = vec![(0., 0.), (5., 0.), (7.001, 9.)];
let b: LineString<f32> = coords_b.into_iter().collect();

approx::assert_relative_eq!(a, b, max_relative=0.1)

pub fn relative_ne(
    &self,
    other: &Rhs,
    epsilon: Self::Epsilon,
    max_relative: Self::Epsilon
) -> bool

The inverse of [RelativeEq::relative_eq].

impl<T> Rotate<T> for LineString<T> where
    T: GeoFloat, 

fn rotate(&self, angle: T) -> Self

Rotate the LineString about its centroid by the given number of degrees

impl<T> Simplify<T, T> for LineString<T> where
    T: GeoFloat, 

fn simplify(&self, epsilon: &T) -> Self

Returns the simplified representation of a geometry, using the Ramer–Douglas–Peucker algorithm

impl<T> SimplifyIdx<T, T> for LineString<T> where
    T: GeoFloat, 

fn simplify_idx(&self, epsilon: &T) -> Vec<usize>

Returns the simplified indices of a geometry, using the Ramer–Douglas–Peucker algorithm

impl<T> SimplifyVW<T, T> for LineString<T> where
    T: CoordFloat, 

fn simplifyvw(&self, epsilon: &T) -> LineString<T>

Returns the simplified representation of a geometry, using the Visvalingam-Whyatt algorithm

impl<T> SimplifyVWPreserve<T, T> for LineString<T> where
    T: CoordFloat + RTreeNum, 

fn simplifyvw_preserve(&self, epsilon: &T) -> LineString<T>

Returns the simplified representation of a geometry, using a topology-preserving variant of the Visvalingam-Whyatt algorithm.

impl<T> SimplifyVwIdx<T, T> for LineString<T> where
    T: CoordFloat, 

fn simplifyvw_idx(&self, epsilon: &T) -> Vec<usize>

Returns the simplified representation of a geometry, using the Visvalingam-Whyatt algorithm

impl<T> StructuralEq for LineString<T> where
    T: CoordNum, 

impl<T> StructuralPartialEq for LineString<T> where
    T: CoordNum, 

impl<T> TryFrom<Geometry<T>> for LineString<T> where
    T: CoordNum, 

Convert a Geometry enum into its inner type.

Fails if the enum case does not match the type you are trying to convert it to.

type Error = Error

The type returned in the event of a conversion error.

pub fn try_from(
    geom: Geometry<T>
) -> Result<LineString<T>, <LineString<T> as TryFrom<Geometry<T>>>::Error>

Performs the conversion.

impl<T: CoordNum, NT: CoordNum> TryMapCoords<T, NT> for LineString<T>

type Output = LineString<NT>

fn try_map_coords(
    &self,
    func: impl Fn(&(T, T)) -> Result<(NT, NT), Box<dyn Error + Send + Sync>> + Copy
) -> Result<Self::Output, Box<dyn Error + Send + Sync>>

Map a fallible function over all the coordinates in a geometry, returning a Result

impl<T> VincentyLength<T, LineString<T>> for LineString<T> where
    T: CoordFloat + FromPrimitive, 

fn vincenty_length(&self) -> Result<T, FailedToConvergeError>

Determine the length of a geometry using Vincenty’s formulae.

impl<T, K> Winding for LineString<T> where
    T: HasKernel<Ker = K>,
    K: Kernel<T>, 

type Scalar = T

fn winding_order(&self) -> Option<WindingOrder>

Return the winding order of this object if it contains at least three distinct coordinates, and None otherwise.

fn points_cw(&self) -> Points<'_, Self::Scalar>

Iterate over the points in a clockwise order

The Linestring isn’t changed, and the points are returned either in order, or in reverse order, so that the resultant order makes it appear clockwise

fn points_ccw(&self) -> Points<'_, Self::Scalar>

Iterate over the points in a counter-clockwise order

The Linestring isn’t changed, and the points are returned either in order, or in reverse order, so that the resultant order makes it appear counter-clockwise

fn make_cw_winding(&mut self)

Change this line’s points so they are in clockwise winding order

fn make_ccw_winding(&mut self)

Change this line’s points so they are in counterclockwise winding order

fn is_cw(&self) -> bool

True iff this is wound clockwise

fn is_ccw(&self) -> bool

True iff this is wound counterclockwise

fn clone_to_winding_order(&self, winding_order: WindingOrder) -> Self where
    Self: Sized + Clone, 

Return a clone of this object, but in the specified winding order

fn make_winding_order(&mut self, winding_order: WindingOrder)

Change the winding order so that it is in this winding order