Struct Nearest 

pub struct Nearest<A, B> {
    pub a: (A, Vector3),
    pub b: (B, Vector3),
    pub distance: Scalar,
    pub candidates: Vec<(A, B)>,
}

The least distance between two sets, as least_distance finds it.

Fields

a: (A, Vector3)

The point of the first set, and where on it.

b: (B, Vector3)

The point of the second set, and where on it.

distance: Scalar

The least distance between the sets: at least the search’s lower bound, at most the distance between a and b.

candidates: Vec<(A, B)>

Where on each set the pairs left at the handoff attain a point: where else a least distance could be, for Newton to refine.

Trait Implementations

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

fn clone(&self) -> Nearest<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 Nearest<A, B>

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

Formats the value using the given formatter.