Struct ncollide3d::utils::SortedPair[−][src]

pub struct SortedPair<T: PartialOrd>(_);

A pair of elements sorted in increasing order.

Implementations

`impl<T: PartialOrd> SortedPair<T>`[src]

`pub fn new(element1: T, element2: T) -> Self`[src]

Sorts two elements in increasing order into a new pair.

Trait Implementations

`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: Debug + PartialOrd> Debug for SortedPair<T>`[src]

`fn fmt(&self, f: &mut Formatter<'_>) -> Result`[src]

`impl<T: PartialOrd> Deref for SortedPair<T>`[src]

`type Target = (T, T)`

The resulting type after dereferencing.

`fn deref(&self) -> &(T, T)`[src]

`impl<T: Hash + PartialOrd> Hash for SortedPair<T>`[src]

`fn hash<H: Hasher>(&self, state: &mut H)`[src]

`pub fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,` 1.3.0 [src]

`impl<T: Ord + PartialOrd> Ord for SortedPair<T>`[src]

`fn cmp(&self, other: &SortedPair<T>) -> Ordering`[src]

`#[must_use] pub fn max(self, other: Self) -> Self`1.21.0 [src]

`#[must_use] pub fn min(self, other: Self) -> Self`1.21.0 [src]

`#[must_use] pub fn clamp(self, min: Self, max: Self) -> Self`1.50.0 [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]

`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 le(&self, other: &Rhs) -> bool`1.0.0 [src]

`#[must_use] pub fn gt(&self, other: &Rhs) -> bool`1.0.0 [src]

`#[must_use] pub fn ge(&self, other: &Rhs) -> bool`1.0.0 [src]

`impl<T: Copy + PartialOrd> Copy for SortedPair<T>`[src]

`impl<T: Eq + PartialOrd> Eq for SortedPair<T>`[src]

`impl<T: PartialOrd> StructuralEq 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> 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

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> CallHasher for T where T: Hash,` [src]

`pub fn get_hash<H>(&self, hasher: H) -> u64 where H: Hasher,` [src]

`impl<T> Downcast for T where T: Any,` [src]

`pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>`[src]

`pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>`[src]

`pub fn as_any(&self) -> &(dyn Any + 'static)`[src]

`pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)`[src]

`impl<T> DowncastSync for T where T: Any + Send + Sync,` [src]

`pub fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + 'static + Send + Sync>`[src]

`impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized,` [src]

`pub fn equivalent(&self, key: &K) -> bool`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> Pointable for T`[src]

`pub const ALIGN: usize`[src]

`type Init = T`

The type for initializers.

`pub unsafe fn init(init: <T as Pointable>::Init) -> usize`[src]

`pub unsafe fn deref<'a>(ptr: usize) -> &'a T`[src]

`pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T`[src]

`pub unsafe fn drop(ptr: usize)`[src]

`impl<T> Same<T> for T`[src]

`type Output = T`

Should always be Self

`impl<T> Scalar for T where T: Copy + PartialEq<T> + Debug + Any,` [src]

`pub fn inlined_clone(&self) -> T`[src]

`pub fn is<T>() -> bool where T: Scalar,` [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> ToOwned for T where T: Clone,` [src]

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

`impl<V, T> VZip<V> for T where V: MultiLane<T>,` [src]

`pub fn vzip(self) -> V`[src]

`impl<N> NodeTrait for N where N: Copy + Ord + Hash,` [src]

`impl<T> Slottable for T where T: Copy,` [src]

Struct ncollide3d::utils::SortedPair⎘[−][src]

Implementations

impl<T: PartialOrd> SortedPair<T>[src]

pub fn new(element1: T, element2: T) -> Self[src]

Trait Implementations

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: Debug + PartialOrd> Debug for SortedPair<T>[src]

fn fmt(&self, f: &mut Formatter<'_>) -> Result[src]

impl<T: PartialOrd> Deref for SortedPair<T>[src]

type Target = (T, T)

fn deref(&self) -> &(T, T)[src]

impl<T: Hash + PartialOrd> Hash for SortedPair<T>[src]

fn hash<__H: Hasher>(&self, state: &mut __H)[src]

pub fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher, 1.3.0[src]

impl<T: Ord + PartialOrd> Ord for SortedPair<T>[src]

fn cmp(&self, other: &SortedPair<T>) -> Ordering[src]

#[must_use]pub fn max(self, other: Self) -> Self1.21.0[src]

#[must_use]pub fn min(self, other: Self) -> Self1.21.0[src]

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self1.50.0[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]

fn partial_cmp(&self, other: &SortedPair<T>) -> Option<Ordering>[src]

#[must_use]pub fn lt(&self, other: &Rhs) -> bool1.0.0[src]

#[must_use]pub fn le(&self, other: &Rhs) -> bool1.0.0[src]

#[must_use]pub fn gt(&self, other: &Rhs) -> bool1.0.0[src]

#[must_use]pub fn ge(&self, other: &Rhs) -> bool1.0.0[src]

impl<T: Copy + PartialOrd> Copy for SortedPair<T>[src]

impl<T: Eq + PartialOrd> Eq for SortedPair<T>[src]

impl<T: PartialOrd> StructuralEq 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> 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

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<T> CallHasher for T where T: Hash, [src]

pub fn get_hash<H>(&self, hasher: H) -> u64 where H: Hasher, [src]

impl<T> Downcast for T where T: Any, [src]

pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>[src]

pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>[src]

pub fn as_any(&self) -> &(dyn Any + 'static)[src]

pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)[src]

impl<T> DowncastSync for T where T: Any + Send + Sync, [src]

pub fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + 'static + Send + Sync>[src]

impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized, [src]

pub fn equivalent(&self, key: &K) -> bool[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T> Pointable for T[src]

pub const ALIGN: usize[src]

type Init = T

pub unsafe fn init(init: <T as Pointable>::Init) -> usize[src]

pub unsafe fn deref<'a>(ptr: usize) -> &'a T[src]

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T[src]

pub unsafe fn drop(ptr: usize)[src]

impl<T> Same<T> for T[src]

type Output = T

impl<T> Scalar for T where T: Copy + PartialEq<T> + Debug + Any, [src]

pub fn inlined_clone(&self) -> T[src]

pub fn is<T>() -> bool where T: Scalar, [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> ToOwned for T where T: Clone, [src]