Struct Crossing 

pub struct Crossing {
    pub segments: [usize; 2],
    pub ends: [PointId; 4],
}

How the point of a vertex without input points came about.

Fields

segments: [usize; 2]

The smallest pair of segments crossing here, ascending.

ends: [PointId; 4]

The ends of those segments, in that order.

Trait Implementations

impl Clone for Crossing

fn clone(&self) -> Crossing

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Crossing

impl Debug for Crossing

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

Formats the value using the given formatter.

impl Eq for Crossing

impl PartialEq for Crossing

fn eq(&self, other: &Crossing) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Crossing