pub struct EdgeId(/* private fields */);Expand description
A unique identifier to an edge made of an ascendingly sorted pair of half-edge ids.
The ascending sort is to ensure uniqueness and correctness of comparison by having only one possible representation. Otherwise, for each edge there would be two possible values, (x, y) and (y, x).
Implementations§
Source§impl EdgeId
impl EdgeId
Sourcepub fn lesser(self) -> HalfEdgeId
pub fn lesser(self) -> HalfEdgeId
Returns the smaller of the two half-edge indexes.
Sourcepub fn greater(self) -> HalfEdgeId
pub fn greater(self) -> HalfEdgeId
Returns the greater of the two half-edge indexes.
Trait Implementations§
Source§impl Ord for EdgeId
impl Ord for EdgeId
Source§impl PartialOrd for EdgeId
impl PartialOrd for EdgeId
impl Copy for EdgeId
impl Eq for EdgeId
impl StructuralPartialEq for EdgeId
Auto Trait Implementations§
impl Freeze for EdgeId
impl RefUnwindSafe for EdgeId
impl Send for EdgeId
impl Sync for EdgeId
impl Unpin for EdgeId
impl UnsafeUnpin for EdgeId
impl UnwindSafe for EdgeId
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