Struct parry2d::utils::SortedPair [−][src]
pub struct SortedPair<T: PartialOrd>(_);
A pair of elements sorted in increasing order.
Implementations
impl<T: PartialOrd> SortedPair<T>
[src]
impl<T: PartialOrd> SortedPair<T>
[src]Trait Implementations
impl<T: Clone + PartialOrd> Clone for SortedPair<T>
[src]
impl<T: Clone + PartialOrd> Clone for SortedPair<T>
[src]fn clone(&self) -> SortedPair<T>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Copy + PartialOrd> Copy for SortedPair<T>
[src]
impl<T: Copy + PartialOrd> Copy for SortedPair<T>
[src]impl<T: Debug + PartialOrd> Debug for SortedPair<T>
[src]
impl<T: Debug + PartialOrd> Debug for SortedPair<T>
[src]impl<T: PartialOrd> Deref for SortedPair<T>
[src]
impl<T: PartialOrd> Deref for SortedPair<T>
[src]impl<T: Eq + PartialOrd> Eq for SortedPair<T>
[src]
impl<T: Eq + PartialOrd> Eq for SortedPair<T>
[src]impl<T: Hash + PartialOrd> Hash for SortedPair<T>
[src]
impl<T: Hash + PartialOrd> Hash for SortedPair<T>
[src]impl<T: Ord + PartialOrd> Ord for SortedPair<T>
[src]
impl<T: Ord + PartialOrd> Ord for SortedPair<T>
[src]impl<T: PartialEq + PartialOrd> PartialEq<SortedPair<T>> for SortedPair<T>
[src]
impl<T: PartialEq + PartialOrd> PartialEq<SortedPair<T>> for SortedPair<T>
[src]fn eq(&self, other: &SortedPair<T>) -> bool
[src]
fn ne(&self, other: &SortedPair<T>) -> bool
[src]
impl<T: PartialOrd> PartialOrd<SortedPair<T>> for SortedPair<T>
[src]
impl<T: PartialOrd> PartialOrd<SortedPair<T>> for SortedPair<T>
[src]fn partial_cmp(&self, other: &SortedPair<T>) -> Option<Ordering>
[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn lt(&self, other: &Rhs) -> bool#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn le(&self, other: &Rhs) -> bool#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn gt(&self, other: &Rhs) -> bool#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn ge(&self, other: &Rhs) -> boolimpl<T: PartialOrd> StructuralEq for SortedPair<T>
[src]
impl<T: PartialOrd> StructuralEq for SortedPair<T>
[src]impl<T: PartialOrd> StructuralPartialEq for SortedPair<T>
[src]
impl<T: PartialOrd> StructuralPartialEq for SortedPair<T>
[src]Auto Trait Implementations
impl<T> RefUnwindSafe for SortedPair<T> where
T: RefUnwindSafe,
impl<T> RefUnwindSafe for SortedPair<T> where
T: RefUnwindSafe,
impl<T> Send for SortedPair<T> where
T: Send,
impl<T> Send for SortedPair<T> where
T: Send,
impl<T> Sync for SortedPair<T> where
T: Sync,
impl<T> Sync for SortedPair<T> where
T: Sync,
impl<T> Unpin for SortedPair<T> where
T: Unpin,
impl<T> Unpin for SortedPair<T> where
T: Unpin,
impl<T> UnwindSafe for SortedPair<T> where
T: UnwindSafe,
impl<T> UnwindSafe for SortedPair<T> where
T: UnwindSafe,
Blanket Implementations
impl<T> CheckedAs for T
[src]
impl<T> CheckedAs for T
[src]pub fn checked_as<Dst>(self) -> Option<Dst> where
T: CheckedCast<Dst>,
[src]
T: CheckedCast<Dst>,
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<Src, Dst> LosslessTryInto<Dst> for Src where
Dst: LosslessTryFrom<Src>,
[src]
impl<Src, Dst> LosslessTryInto<Dst> for Src where
Dst: LosslessTryFrom<Src>,
[src]pub fn lossless_try_into(self) -> Option<Dst>
[src]
impl<Src, Dst> LossyInto<Dst> for Src where
Dst: LossyFrom<Src>,
[src]
impl<Src, Dst> LossyInto<Dst> for Src where
Dst: LossyFrom<Src>,
[src]pub fn lossy_into(self) -> Dst
[src]
impl<T> OverflowingAs for T
[src]
impl<T> OverflowingAs for T
[src]pub fn overflowing_as<Dst>(self) -> (Dst, bool) where
T: OverflowingCast<Dst>,
[src]
T: OverflowingCast<Dst>,
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> SaturatingAs for T
[src]
impl<T> SaturatingAs for T
[src]pub fn saturating_as<Dst>(self) -> Dst where
T: SaturatingCast<Dst>,
[src]
T: SaturatingCast<Dst>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<T> UnwrappedAs for T
[src]
impl<T> UnwrappedAs for T
[src]pub fn unwrapped_as<Dst>(self) -> Dst where
T: UnwrappedCast<Dst>,
[src]
T: UnwrappedCast<Dst>,
impl<T> WrappingAs for T
[src]
impl<T> WrappingAs for T
[src]pub fn wrapping_as<Dst>(self) -> Dst where
T: WrappingCast<Dst>,
[src]
T: WrappingCast<Dst>,