[−][src]Struct oxygengine_physics_2d::prelude::ncollide2d::utils::SortedPair
A pair of elements sorted in increasing order.
Implementations
impl<T> SortedPair<T> where
T: PartialOrd<T>,
[src]
T: PartialOrd<T>,
pub fn new(element1: T, element2: T) -> SortedPair<T>
[src]
Sorts two elements in increasing order into a new pair.
Trait Implementations
impl<T> Clone for SortedPair<T> where
T: Clone + PartialOrd<T>,
[src]
T: Clone + PartialOrd<T>,
fn clone(&self) -> SortedPair<T>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T> Copy for SortedPair<T> where
T: PartialOrd<T> + Copy,
[src]
T: PartialOrd<T> + Copy,
impl<T> Debug for SortedPair<T> where
T: PartialOrd<T> + Debug,
[src]
T: PartialOrd<T> + Debug,
impl<T> Deref for SortedPair<T> where
T: PartialOrd<T>,
[src]
T: PartialOrd<T>,
impl<T> Eq for SortedPair<T> where
T: Eq + PartialOrd<T>,
[src]
T: Eq + PartialOrd<T>,
impl<T> Hash for SortedPair<T> where
T: PartialOrd<T> + Hash,
[src]
T: PartialOrd<T> + Hash,
fn hash<__H>(&self, state: &mut __H) where
__H: Hasher,
[src]
__H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T> Ord for SortedPair<T> where
T: Ord + PartialOrd<T>,
[src]
T: Ord + PartialOrd<T>,
fn cmp(&self, other: &SortedPair<T>) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<T> PartialEq<SortedPair<T>> for SortedPair<T> where
T: PartialEq<T> + PartialOrd<T>,
[src]
T: PartialEq<T> + PartialOrd<T>,
fn eq(&self, other: &SortedPair<T>) -> bool
[src]
fn ne(&self, other: &SortedPair<T>) -> bool
[src]
impl<T> PartialOrd<SortedPair<T>> for SortedPair<T> where
T: PartialOrd<T>,
[src]
T: PartialOrd<T>,
fn partial_cmp(&self, other: &SortedPair<T>) -> Option<Ordering>
[src]
fn lt(&self, other: &SortedPair<T>) -> bool
[src]
fn le(&self, other: &SortedPair<T>) -> bool
[src]
fn gt(&self, other: &SortedPair<T>) -> bool
[src]
fn ge(&self, other: &SortedPair<T>) -> bool
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for SortedPair<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for SortedPair<T> where
T: Send,
T: Send,
impl<T> Sync for SortedPair<T> where
T: Sync,
T: Sync,
impl<T> Unpin for SortedPair<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for SortedPair<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Any for T where
T: Any,
T: Any,
fn get_type_id(&self) -> TypeId
impl<T> BodyHandle for T where
T: 'static + PartialEq<T> + Eq + Send + Copy + Sync + Hash,
[src]
T: 'static + PartialEq<T> + Eq + Send + Copy + Sync + Hash,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> ColliderHandle for T where
T: Debug + CollisionObjectHandle,
[src]
T: Debug + CollisionObjectHandle,
impl<T> CollisionObjectHandle for T where
T: 'static + PartialEq<T> + Eq + Send + Copy + Sync + Hash,
[src]
T: 'static + PartialEq<T> + Eq + Send + Copy + Sync + Hash,
impl<T> Downcast for T where
T: Any,
T: Any,
fn into_any(self: Box<T>) -> Box<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn as_any(&self) -> &(dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
impl<T> DowncastSync for T where
T: Send + Sync + Any,
T: Send + Sync + Any,
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
fn equivalent(&self, key: &K) -> bool
[src]
impl<T> Event for T where
T: Send + Sync + 'static,
T: Send + Sync + 'static,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<N> NodeTrait for N where
N: Copy + Ord + Hash,
[src]
N: Copy + Ord + Hash,
impl<T> Resource for T where
T: Any,
T: Any,
impl<T> RuleType for T where
T: Eq + Ord + Copy + Debug + Hash,
[src]
T: Eq + Ord + Copy + Debug + Hash,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> Scalar for T where
T: PartialEq<T> + Copy + Any + Debug,
[src]
T: PartialEq<T> + Copy + Any + Debug,
impl<T> Slottable for T where
T: Copy,
[src]
T: Copy,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> UserData for T where
T: Clone + Send + Sync + Any,
[src]
T: Clone + Send + Sync + Any,
fn clone_boxed(&self) -> Box<dyn UserData + 'static>
[src]
fn to_any(&self) -> Box<dyn Any + 'static + Sync + Send>
[src]
fn as_any(&self) -> &(dyn Any + 'static + Sync + Send)
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,