Struct unordered_pair::UnorderedPair

pub struct UnorderedPair<T>(pub T, pub T);

A tuple struct representing an unordered pair

Tuple Fields

0: T

1: T

Implementations

impl<T: Ord> UnorderedPair<T>

pub fn into_ordered_tuple(self) -> (T, T)

Transforms the UnorderedPair<T> into a (T,T). The tuple’s components are always in the same order, smallest to largest.

Examples

use unordered_pair::UnorderedPair;

let pair = UnorderedPair(1,2);
let rev = UnorderedPair(2,1);

let tuple_pair = pair.into_ordered_tuple();
let tuple_rev = rev.into_ordered_tuple();

assert_eq!(tuple_pair, (1,2));
assert_eq!(tuple_rev, (1,2));

Trait Implementations

impl<T: Clone> Clone for UnorderedPair<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for UnorderedPair<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for UnorderedPair<T>

fn default() -> UnorderedPair<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for UnorderedPair<T> where
    T: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<T> From<(T, T)> for UnorderedPair<T>

fn from(tuple: (T, T)) -> UnorderedPair<T>

Converts to this type from the input type.

impl<T> From<UnorderedPair<T>> for (T, T)

fn from(pair: UnorderedPair<T>) -> (T, T)

Converts to this type from the input type.

impl<T> Hash for UnorderedPair<T> where
    T: Ord + Hash, 

Computes the same hash regardless of the order of the contained items

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

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> PartialEq<UnorderedPair<T>> for UnorderedPair<T> where
    T: PartialEq, 

Compares two pairs while disregarding the order of the contained items

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T> Serialize for UnorderedPair<T> where
    T: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<T: Copy> Copy for UnorderedPair<T>

impl<T: Eq> Eq for UnorderedPair<T>

impl<T> StructuralEq for UnorderedPair<T>