Struct ncollide2d::utils::SortedPair

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

A pair of elements sorted in increasing order.

Methods

impl<T: PartialOrd> SortedPair<T>

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

Sorts two elements in increasing order into a new pair.

Trait Implementations

impl<T: Clone + PartialOrd> Clone for SortedPair<T>

fn clone(&self) -> SortedPair<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Copy + PartialOrd> Copy for SortedPair<T>

impl<T: Debug + PartialOrd> Debug for SortedPair<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: PartialOrd> Deref for SortedPair<T>

type Target = (T, T)

The resulting type after dereferencing.

fn deref(&self) -> &(T, T)

Dereferences the value.

impl<T: Eq + PartialOrd> Eq for SortedPair<T>

impl<T: Hash + PartialOrd> Hash for SortedPair<T>

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl<T: Ord + PartialOrd> Ord for SortedPair<T>

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

This method returns an [Ordering] between self and other.

#[must_use] fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use] fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use] fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<T: PartialEq + PartialOrd> PartialEq<SortedPair<T>> for SortedPair<T>

fn eq(&self, other: &SortedPair<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &SortedPair<T>) -> bool

This method tests for !=.

impl<T: PartialOrd> PartialOrd<SortedPair<T>> for SortedPair<T>

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

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &SortedPair<T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &SortedPair<T>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &SortedPair<T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &SortedPair<T>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: PartialOrd> StructuralEq for SortedPair<T>

impl<T: PartialOrd> StructuralPartialEq for SortedPair<T>