Struct BezierArrangementChain2 

pub struct BezierArrangementChain2 { /* private fields */ }

One endpoint-connected traversal chain through retained Bezier fragments.

Implementations

impl BezierArrangementChain2

pub fn new(fragment_indices: Vec<usize>, closed: bool) -> CurveResult<Self>

Constructs a traversal chain from retained fragment indices.

pub fn fragment_indices(&self) -> &[usize]

Returns retained fragment indices in traversal order.

pub fn into_fragment_indices(self) -> Vec<usize>

Consumes the chain and returns retained fragment indices.

pub const fn is_closed(&self) -> bool

Returns true when the chain’s last endpoint equals its first endpoint.

pub fn len(&self) -> usize

Returns the number of fragments in the chain.

pub fn is_empty(&self) -> bool

Returns true when the chain contains no fragments.

Trait Implementations

impl Clone for BezierArrangementChain2

fn clone(&self) -> BezierArrangementChain2

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BezierArrangementChain2

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

Formats the value using the given formatter.

impl PartialEq for BezierArrangementChain2

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