Struct HalfEdge

pub struct HalfEdge<IC>
where
    IC: IsIndexContainer,
{ /* private fields */ }

HalfEdge, the half edge data structure

Implementations

impl<IC> HalfEdge<IC>

where IC: IsIndexContainer,

pub fn new<T, M>(mesh: &M) -> Self

where M: IsMesh<T, Face3>,

Creates a new HalfEdge3D for the given IsMesh3D This only stays valid if IMesh3D is not changed after creation The mesh must be manifold

pub fn tail(&self, id: EId) -> Result<VId>

Returns the ID of the vertex the edge originates from (error if id out of bounds)

pub fn face(&self, id: EId) -> Result<FId>

Returns the ID of the face the edge belongs to (error if id out of bounds)

pub fn twin(&self, id: EId) -> Result<Option<EId>>

Returns the ID of the twin edge (None if there isn’t any) (error if id out of bounds)

pub fn next(&self, id: EId) -> Result<EId>

Returns the ID of the edge after this edge (error if id out of bounds)

pub fn prev(&self, id: EId) -> Result<EId>

Returns the ID of the edge before this edge (error if id out of bounds)

pub fn edges_originating(&self, id: VId, result: &mut Vec<EId>) -> Result<()>

Appends all edges originating (pointing away) from the given vertex (error if id out of bounds)

pub fn edges_ending( &self, id: VId, cache: &mut Vec<EId>, result: &mut Vec<EId>, ) -> Result<()>

Appends all edges ending (pointing at) the given vertex (error if id out of bounds) cache is used to avoid allocations, pass any Vec

pub fn edges_all( &self, id: VId, cache: &mut Vec<EId>, result: &mut Vec<EId>, ) -> Result<()>

Appends all edges connected to the vertex (both originating and ending) (error if id out of bounds) cache is used to avoid allocations, pass any Vec

pub fn faces( &self, id: VId, cache: &mut Vec<EId>, result: &mut Vec<FId>, ) -> Result<()>

Appends all faces a vertex is part of (error if id out of bounds) cache is used to avoid allocations, pass any Vec

pub fn ensure_edge_id(&self, id: EId) -> Result<()>

Fails if the edge ID is out of bounds

pub fn ensure_vertex_id(&self, id: VId) -> Result<()>

Fails if the vertex ID is out of bounds

Trait Implementations

impl<IC> Clone for HalfEdge<IC>

where IC: IsIndexContainer + Clone,

fn clone(&self) -> HalfEdge<IC>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<IC> Debug for HalfEdge<IC>

where IC: IsIndexContainer + Debug,

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

Formats the value using the given formatter.

impl<IC> From<(IC, Vec<Option<EId>>, Vec<IC>)> for HalfEdge<IC>

where IC: IsIndexContainer,

fn from(ev: (IC, Vec<Option<EId>>, Vec<IC>)) -> Self

Converts to this type from the input type.

impl<IC> Hash for HalfEdge<IC>

where IC: IsIndexContainer + Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<IC> Into<(IC, Vec<Option<EId>>)> for HalfEdge<IC>

where IC: IsIndexContainer,

fn into(self) -> (IC, Vec<Option<EId>>)

Converts this type into the (usually inferred) input type.

impl<IC> Into<(IC, Vec<Option<EId>>, Vec<IC>)> for HalfEdge<IC>

where IC: IsIndexContainer,

fn into(self) -> (IC, Vec<Option<EId>>, Vec<IC>)

Converts this type into the (usually inferred) input type.

impl<IC> Into<Vec<IC>> for HalfEdge<IC>

where IC: IsIndexContainer,

fn into(self) -> Vec<IC>

Converts this type into the (usually inferred) input type.

impl<IC> Ord for HalfEdge<IC>

where IC: IsIndexContainer + Ord,

fn cmp(&self, other: &HalfEdge<IC>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<IC> PartialEq for HalfEdge<IC>

where IC: IsIndexContainer + PartialEq,

fn eq(&self, other: &HalfEdge<IC>) -> 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<IC> PartialOrd for HalfEdge<IC>

where IC: IsIndexContainer + PartialOrd,

fn partial_cmp(&self, other: &HalfEdge<IC>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<IC> Eq for HalfEdge<IC>

where IC: IsIndexContainer + Eq,

impl<IC> StructuralPartialEq for HalfEdge<IC>

where IC: IsIndexContainer,