Struct Crossing 

pub struct Crossing<P> {
    pub on_a: f64,
    pub on_b: f64,
    pub point: P,
    pub gap: f64,
    pub reach: f64,
}

One crossing of two curves.

Fields

on_a: f64

The parameter on the first curve.

on_b: f64

The parameter on the second.

point: P

Where, taken from the first curve.

gap: f64

How far apart the two curves are there.

Rounding for a planar crossing; real geometry for a spatial one, where two curves generically miss and “crossing” means passing within the caller’s tolerance.

reach: f64

How far along the curves this contact could honestly sit: zero for a transversal crossing, the length of the touching run where the curves meet tangentially: there the closest approach is anywhere in a valley the width of the gap, and a consumer placing a vertex at it owns that much doubt.

Trait Implementations

impl<P: Clone> Clone for Crossing<P>

fn clone(&self) -> Crossing<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Copy> Copy for Crossing<P>

impl<P: Debug> Debug for Crossing<P>

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

Formats the value using the given formatter.

impl<P: PartialEq> PartialEq for Crossing<P>

fn eq(&self, other: &Crossing<P>) -> 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<P: PartialEq> StructuralPartialEq for Crossing<P>