Struct ncollide2d::utils::SortedPair
source · pub struct SortedPair<T: PartialOrd>(_);
Expand description
A pair of elements sorted in increasing order.
Implementations§
source§impl<T: PartialOrd> SortedPair<T>
impl<T: PartialOrd> SortedPair<T>
Trait Implementations§
source§impl<T: Clone + PartialOrd> Clone for SortedPair<T>
impl<T: Clone + PartialOrd> Clone for SortedPair<T>
source§fn clone(&self) -> SortedPair<T>
fn clone(&self) -> SortedPair<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<T: Debug + PartialOrd> Debug for SortedPair<T>
impl<T: Debug + PartialOrd> Debug for SortedPair<T>
source§impl<T: PartialOrd> Deref for SortedPair<T>
impl<T: PartialOrd> Deref for SortedPair<T>
source§impl<T: Hash + PartialOrd> Hash for SortedPair<T>
impl<T: Hash + PartialOrd> Hash for SortedPair<T>
source§impl<T: Ord + PartialOrd> Ord for SortedPair<T>
impl<T: Ord + PartialOrd> Ord for SortedPair<T>
source§fn cmp(&self, other: &SortedPair<T>) -> Ordering
fn cmp(&self, other: &SortedPair<T>) -> Ordering
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<T: PartialEq + PartialOrd> PartialEq<SortedPair<T>> for SortedPair<T>
impl<T: PartialEq + PartialOrd> PartialEq<SortedPair<T>> for SortedPair<T>
source§fn eq(&self, other: &SortedPair<T>) -> bool
fn eq(&self, other: &SortedPair<T>) -> bool
source§impl<T: PartialOrd + PartialOrd> PartialOrd<SortedPair<T>> for SortedPair<T>
impl<T: PartialOrd + PartialOrd> PartialOrd<SortedPair<T>> for SortedPair<T>
source§fn partial_cmp(&self, other: &SortedPair<T>) -> Option<Ordering>
fn partial_cmp(&self, other: &SortedPair<T>) -> Option<Ordering>
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<T: Copy + PartialOrd> Copy for SortedPair<T>
impl<T: Eq + PartialOrd> Eq for SortedPair<T>
impl<T: PartialOrd> StructuralEq for SortedPair<T>
impl<T: PartialOrd> StructuralPartialEq for SortedPair<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for SortedPair<T>where
T: RefUnwindSafe,
impl<T> Send for SortedPair<T>where
T: Send,
impl<T> Sync for SortedPair<T>where
T: Sync,
impl<T> Unpin for SortedPair<T>where
T: Unpin,
impl<T> UnwindSafe for SortedPair<T>where
T: UnwindSafe,
Blanket Implementations§
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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.