Struct de_pathing::graph::Step

pub(crate) struct Step {
    edge_id: u32,
    triangle_id: u32,
}

A step in the triangle edge neighbor graph. Id est triangle traversal from a set of points in the triangle (one point or a line segment) to (part of) an edge of the triangle.

Fields

edge_id: u32

triangle_id: u32

Implementations

impl Step

pub(crate) fn new(edge_id: u32, triangle_id: u32) -> Self

pub(crate) fn edge_id(&self) -> u32

A target edge ID (reached from neighboring edge).

pub(crate) fn triangle_id(&self) -> u32

ID of the traversed triangle (to reach Self::edge_id().

Trait Implementations

impl Clone for Step

fn clone(&self) -> Step

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Step

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

Formats the value using the given formatter.

impl Default for Step

fn default() -> Step

Returns the “default value” for a type.

impl PartialEq for Step

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Step

impl Eq for Step

impl StructuralPartialEq for Step