Struct Arrangement 

pub struct Arrangement {
    pub lines: Vec<Line2>,
    pub vertices: Vec<Point2>,
    pub edges: Vec<ArrangementEdge>,
    pub faces: Vec<ArrangementFace>,
    pub bbox_min: Point2,
    pub bbox_max: Point2,
}

A line arrangement: the planar subdivision induced by a set of lines.

Fields

lines: Vec<Line2>

The input lines.

vertices: Vec<Point2>

All intersection points (vertices of the arrangement).

edges: Vec<ArrangementEdge>

All edges (segments between consecutive vertices along each line).

faces: Vec<ArrangementFace>

All faces (cells of the subdivision).

bbox_min: Point2

The bounding box used to clip unbounded edges.

bbox_max: Point2

Implementations

impl Arrangement

pub fn counts(&self) -> ArrangementCounts

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.

impl PartialEq for Arrangement

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