pub struct EdgeKey { /* private fields */ }Expand description
An undirected mesh edge, named by its two vertex indices in sorted order.
Sorting is what makes the name canonical: the two faces sharing an edge visit it in opposite directions, and both must produce the same key.
Implementations§
Trait Implementations§
impl Copy for EdgeKey
impl Eq for EdgeKey
Source§impl Ord for EdgeKey
impl Ord for EdgeKey
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the minimum of two values. Read more
Source§impl PartialOrd for EdgeKey
impl PartialOrd for EdgeKey
impl StructuralPartialEq for EdgeKey
Auto Trait Implementations§
impl Freeze for EdgeKey
impl RefUnwindSafe for EdgeKey
impl Send for EdgeKey
impl Sync for EdgeKey
impl Unpin for EdgeKey
impl UnsafeUnpin for EdgeKey
impl UnwindSafe for EdgeKey
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