Struct unordered_pair::UnorderedPair
source · pub struct UnorderedPair<T>(pub T, pub T);
Expand description
A tuple struct representing an unordered pair
Tuple Fields
0: T
1: T
Trait Implementations
sourceimpl<T: Clone> Clone for UnorderedPair<T>
impl<T: Clone> Clone for UnorderedPair<T>
sourcefn clone(&self) -> UnorderedPair<T>
fn clone(&self) -> UnorderedPair<T>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<T: Debug> Debug for UnorderedPair<T>
impl<T: Debug> Debug for UnorderedPair<T>
sourceimpl<T> From<(T, T)> for UnorderedPair<T>
impl<T> From<(T, T)> for UnorderedPair<T>
sourcefn from(tuple: (T, T)) -> UnorderedPair<T>
fn from(tuple: (T, T)) -> UnorderedPair<T>
Converts to this type from the input type.
sourceimpl<T> Hash for UnorderedPair<T>where
T: Ord + Hash,
impl<T> Hash for UnorderedPair<T>where
T: Ord + Hash,
Computes the same hash regardless of the order of the contained items
sourceimpl<T> Into<(T, T)> for UnorderedPair<T>
impl<T> Into<(T, T)> for UnorderedPair<T>
sourceimpl<T> PartialEq<UnorderedPair<T>> for UnorderedPair<T>where
T: PartialEq,
impl<T> PartialEq<UnorderedPair<T>> for UnorderedPair<T>where
T: PartialEq,
Compares two pairs while disregarding the order of the contained items
sourcefn eq(&self, other: &UnorderedPair<T>) -> bool
fn eq(&self, other: &UnorderedPair<T>) -> bool
Auto Trait Implementations
impl<T> RefUnwindSafe for UnorderedPair<T>where
T: RefUnwindSafe,
impl<T> Send for UnorderedPair<T>where
T: Send,
impl<T> Sync for UnorderedPair<T>where
T: Sync,
impl<T> Unpin for UnorderedPair<T>where
T: Unpin,
impl<T> UnwindSafe for UnorderedPair<T>where
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more