Struct ChainedPatch 

pub struct ChainedPatch {
    pub sides: [Vec<PatchSide>; 4],
}

A patch of the network whose sides may each be a chain of curves.

The sides are walked as a PatchDef’s, each side’s curves in walking order, each meeting the next at a junction, where a curve of a neighbouring patch may end (a T-junction). An empty side is missing, as a PatchDef’s None.

A side split into several curves has its patch cross the same junctions from the side opposite: that side is split too, or is one curve, which then carries the junctions to the patch beyond it. A curve so carrying junctions may itself be one of the curves of a split side (nested junctions): every side then crosses as many strips as the curves along it carry between them, and the side opposite as many, the i-th along one direction opposite the i-th along it on the other.

Fields

sides: [Vec<PatchSide>; 4]

The sides, in walking order, each its curves in walking order.

Implementations

impl ChainedPatch

pub fn four(sides: [Vec<(usize, bool)>; 4]) -> Self

A four-sided patch from its sides’ curves in walking order, each with whether it runs against the walk.

Trait Implementations

impl Clone for ChainedPatch

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ChainedPatch

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

Formats the value using the given formatter.

impl Eq for ChainedPatch

impl From<PatchDef> for ChainedPatch

fn from(patch: PatchDef) -> Self

Converts to this type from the input type.

impl PartialEq for ChainedPatch

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ChainedPatch