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: Copy + PartialOrd> Copy for SortedPair<T>

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

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

Formats the value using the given formatter.

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

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

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

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

This method tests for !=.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

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

fn hash<__HT: Hasher>(&self, __arg_0: &mut __HT)

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: PartialOrd> Deref for SortedPair<T>

type Target = (T, T)

The resulting type after dereferencing.

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

Dereferences the value.