Struct GeometryGraph

pub struct GeometryGraph { /* private fields */ }

Immutable acyclic geometry graph with one or more roots.

Implementations

impl GeometryGraph

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

Whether the graph has no nodes.

pub fn get(&self, id: NodeId) -> Option<&GeometryNode>

Read a node by typed handle. A handle owned by another graph returns None.

pub fn roots(&self) -> &[NodeId]

Output roots in caller-specified order.

pub fn iter(&self) -> impl ExactSizeIterator

All nodes in stable topological insertion order.

Trait Implementations

impl Clone for GeometryGraph

fn clone(&self) -> GeometryGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GeometryGraph

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

Formats the value using the given formatter.

impl Default for GeometryGraph

fn default() -> GeometryGraph

Returns the “default value” for a type.

impl PartialEq for GeometryGraph

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