#[repr(transparent)]pub struct Unordered<T>(pub T)
where
T: ?Sized;
Expand description
Wrapper to view a value without considering the order of the objects entries.
Tuple Fields§
§0: T
Trait Implementations§
Source§impl<T> Hash for Unordered<T>where
T: UnorderedHash,
impl<T> Hash for Unordered<T>where
T: UnorderedHash,
Source§impl<T> PartialEq for Unordered<T>where
T: UnorderedPartialEq,
impl<T> PartialEq for Unordered<T>where
T: UnorderedPartialEq,
impl<T> Eq for Unordered<T>where
T: UnorderedEq,
Auto Trait Implementations§
impl<T> Freeze for Unordered<T>
impl<T> RefUnwindSafe for Unordered<T>where
T: RefUnwindSafe + ?Sized,
impl<T> Send for Unordered<T>
impl<T> Sync for Unordered<T>
impl<T> Unpin for Unordered<T>
impl<T> UnwindSafe for Unordered<T>where
T: UnwindSafe + ?Sized,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> BorrowUnordered for T
impl<T> BorrowUnordered for T
fn as_unordered(&self) -> &Unordered<T>
Source§impl<T> CallHasher for T
impl<T> CallHasher for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
fn equivalent(&self, key: &K) -> bool
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.