Struct Arrangement 

pub struct Arrangement {
    pub vertices: Vec<Vertex>,
    pub pieces: Vec<Piece>,
    pub paths: Vec<Vec<(PieceId, bool)>>,
    pub crossings: usize,
    /* private fields */
}

The pieces of a set of segments.

Fields

vertices: Vec<Vertex>

The vertices.

pieces: Vec<Piece>

The pieces, ordered by their ends.

paths: Vec<Vec<(PieceId, bool)>>

Per input segment, its pieces in order from its first end to its second, each with whether that direction runs from ends[0] to ends[1] of the piece.

crossings: usize

The number of vertices without input points.

Implementations

impl Arrangement

pub fn fan( &self, points: &ExactPoints, vertex: VertexId, ) -> GeomResult<Vec<(PieceId, bool)>>

The pieces at vertex in counter-clockwise order in the points’ frame, each with whether it leaves the vertex at ends[0].

Both orient and the half-plane split are in the stored axes up to the frame sign, which reverses the order within a half but keeps the cyclic order. Two pieces that leave a vertex the same way overlap, which arrange has cut apart, so they are an inconsistency.

Trait Implementations

impl Clone for Arrangement

fn clone(&self) -> Arrangement

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Arrangement

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

Formats the value using the given formatter.