pub struct HalfEdge {
pub origin: VertexId,
pub twin: HalfEdgeId,
pub next: HalfEdgeId,
pub prev: HalfEdgeId,
pub face: Option<FaceId>,
}Expand description
A single directed half-edge.
Fields§
§origin: VertexIdOrigin vertex of this half-edge.
twin: HalfEdgeIdThe twin (opposite) half-edge.
next: HalfEdgeIdThe next half-edge around the face (counter-clockwise).
prev: HalfEdgeIdThe previous half-edge around the face.
face: Option<FaceId>The face to the left of this half-edge.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for HalfEdge
impl RefUnwindSafe for HalfEdge
impl Send for HalfEdge
impl Sync for HalfEdge
impl Unpin for HalfEdge
impl UnsafeUnpin for HalfEdge
impl UnwindSafe for HalfEdge
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.