Struct Extrema 

pub struct Extrema<A, B> {
    pub approaches: Vec<Approach<A, B>>,
    pub family: bool,
}

Every stationary approach found, nearest first.

Fields

approaches: Vec<Approach<A, B>>

Stationary approaches, sorted by distance. Nearest approaches first; stationary farthest points, where they exist in the interior, are at the back of the same list.

family: bool

Whether the nearest distance is attained along a locus rather than at an isolated point: parallel lines, concentric circles, coaxial quadrics. When set, the nearest approaches are representatives of the family, not the family.

Implementations

impl<A, B> Extrema<A, B>

pub fn nearest(&self) -> Option<&Approach<A, B>>

The nearest stationary approach, if any is interior to both domains.

Trait Implementations

impl<A: Clone, B: Clone> Clone for Extrema<A, B>

fn clone(&self) -> Extrema<A, B>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for Extrema<A, B>

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

Formats the value using the given formatter.

impl<A: PartialEq, B: PartialEq> PartialEq for Extrema<A, B>

fn eq(&self, other: &Extrema<A, B>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A: PartialEq, B: PartialEq> StructuralPartialEq for Extrema<A, B>