Enum arcs::algorithms::Closest

pub enum Closest<Space> {
    Infinite,
    One(Point2D<f64, Space>),
    Many(Vec<Point2D<f64, Space>>),
}

An enum containing the different possible solutions for [ClosestPoint::closest_point()].

Variants

Infinite

There are infinitely solutions.

One(Point2D<f64, Space>)

There is a single closest [Point2D].

Many(Vec<Point2D<f64, Space>>)

There are multiple closest [Point2D]s.

Implementations

impl<Space> Closest<Space>

pub fn is_infinite(&self) -> bool

Are there infinitely many closest points?

pub fn points(&self) -> &[Point2D<f64, Space>]

Get a slice of all the closest [Point2D]s.

Note

This will be empty if there are infinitely many closest points.

Trait Implementations

impl<Space> Clone for Closest<Space> where
    Space: Clone, 

fn clone(&self) -> Closest<Space>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Space> Debug for Closest<Space> where
    Space: Debug, 

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

Formats the value using the given formatter.

impl<Space> FromIterator<Point2D<f64, Space>> for Closest<Space>

fn from_iter<I>(iter: I) -> Closest<Space> where
    I: IntoIterator<Item = Point2D<f64, Space>>, 

Creates a value from an iterator.

impl<Space> PartialEq<Closest<Space>> for Closest<Space> where
    Space: PartialEq<Space>, 

fn eq(&self, other: &Closest<Space>) -> bool

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

fn ne(&self, other: &Closest<Space>) -> bool

This method tests for !=.

impl<Space> StructuralPartialEq for Closest<Space>