Struct ArrangementEdge

pub struct ArrangementEdge {
    pub from: usize,
    pub to: usize,
    pub bulge: f64,
    pub sources: Vec<EdgeSource>,
    /* private fields */
}

One piece of the subdivision: part of one or more input edges, running between two vertices with no other ring’s boundary crossing it.

Fields

from: usize

Start vertex, an index into ArcArrangement::vertices.

to: usize

End vertex.

bulge: f64

Bulge from from to to; 0 for a straight piece.

sources: Vec<EdgeSource>

Rings whose boundary carries this piece.

Implementations

impl ArrangementEdge

pub fn inside_left(&self, ring: usize) -> bool

Whether ring ring contains the region on the left of the piece.

Left and right are taken along from -> to. A ring whose boundary carries the piece contains exactly one side.

pub fn inside_right(&self, ring: usize) -> bool

Whether ring ring contains the region on the right of the piece.

Trait Implementations

impl Clone for ArrangementEdge

fn clone(&self) -> ArrangementEdge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ArrangementEdge

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

Formats the value using the given formatter.

impl PartialEq for ArrangementEdge

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