Struct splashsurf_lib::uniform_grid::EdgeIndex
source · pub struct EdgeIndex<I: Index> { /* private fields */ }
Expand description
Unique identifier for an edge on a grid, represented by an origin point and an axis
Implementations§
Trait Implementations§
source§impl<I: Ord + Index> Ord for EdgeIndex<I>
impl<I: Ord + Index> Ord for EdgeIndex<I>
1.21.0 · 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
source§impl<I: PartialEq + Index> PartialEq<EdgeIndex<I>> for EdgeIndex<I>
impl<I: PartialEq + Index> PartialEq<EdgeIndex<I>> for EdgeIndex<I>
source§impl<I: PartialOrd + Index> PartialOrd<EdgeIndex<I>> for EdgeIndex<I>
impl<I: PartialOrd + Index> PartialOrd<EdgeIndex<I>> for EdgeIndex<I>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<I: Copy + Index> Copy for EdgeIndex<I>
impl<I: Eq + Index> Eq for EdgeIndex<I>
impl<I: Index> StructuralEq for EdgeIndex<I>
impl<I: Index> StructuralPartialEq for EdgeIndex<I>
Auto Trait Implementations§
impl<I> RefUnwindSafe for EdgeIndex<I>where I: RefUnwindSafe,
impl<I> Send for EdgeIndex<I>
impl<I> Sync for EdgeIndex<I>
impl<I> Unpin for EdgeIndex<I>where I: Unpin,
impl<I> UnwindSafe for EdgeIndex<I>where I: UnwindSafe,
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
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.