#[repr(transparent)]pub struct Reverse<T>(pub T);
A helper struct for reverse ordering.
This struct is a helper to be used with functions like Vec::sort_by_key and can be used to reverse order a part of a key.
use std::cmp::Reverse; let mut v = vec![1, 2, 3, 4, 5, 6]; v.sort_by_key(|&num| (num > 3, Reverse(num))); assert_eq!(v, vec![3, 2, 1, 6, 5, 4]);
0: Timpl<T> Clone for Reverse<T>where
T: Clone,fn clone(&self) -> Reverse<T>
fn clone_from(&mut self, source: &Reverse<T>)
source. Read more
impl<T> Debug for Reverse<T>where
T: Debug,fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
impl<T> Default for Reverse<T>where
T: Default,impl<T> Hash for Reverse<T>where
T: Hash,fn hash<__H>(&self, state: &mut __H)where
__H: Hasher,fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,
Self: Sized,impl<T> Ord for Reverse<T>where
T: Ord,fn cmp(&self, other: &Reverse<T>) -> Ordering
fn max(self, other: Self) -> Selfwhere
Self: Sized,fn min(self, other: Self) -> Selfwhere
Self: Sized,fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized,impl<T> PartialEq for Reverse<T>where
T: PartialEq,fn eq(&self, other: &Reverse<T>) -> bool
self and other values to be equal, and is used by ==.fn ne(&self, other: &Rhs) -> bool
!=. The default implementation is almost always sufficient, and should not be overridden without very good reason.impl<T> PartialOrd for Reverse<T>where
T: PartialOrd,fn partial_cmp(&self, other: &Reverse<T>) -> Option<Ordering>
fn lt(&self, other: &Reverse<T>) -> bool
fn le(&self, other: &Reverse<T>) -> bool
fn gt(&self, other: &Reverse<T>) -> bool
fn ge(&self, other: &Reverse<T>) -> bool
impl<T> Copy for Reverse<T>where
T: Copy,impl<T> Eq for Reverse<T>where
T: Eq,impl<T> StructuralPartialEq for Reverse<T>
impl<T> Freeze for Reverse<T>where
T: Freeze,impl<T> RefUnwindSafe for Reverse<T>where
T: RefUnwindSafe,impl<T> Send for Reverse<T>where
T: Send,impl<T> Sync for Reverse<T>where
T: Sync,impl<T> Unpin for Reverse<T>where
T: Unpin,impl<T> UnwindSafe for Reverse<T>where
T: UnwindSafe,impl<T> Any for Twhere
T: 'static + ?Sized,impl<T> Borrow<T> for Twhere
T: ?Sized,impl<T> BorrowMut<T> for Twhere
T: ?Sized,impl<T> CloneToUninit for Twhere
T: Clone,unsafe fn clone_to_uninit(&self, dest: *mut u8)
clone_to_uninit #126799)
impl<T> From<T> for T
fn from(t: T) -> T
Returns the argument unchanged.
impl<T, U> Into<U> for Twhere
U: From<T>,fn into(self) -> U
Calls U::from(self).
That is, this conversion is whatever the implementation of From<T> for U chooses to do.
impl<T> ToOwned for Twhere
T: Clone,type Owned = T
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)
impl<T, U> TryFrom<U> for Twhere
U: Into<T>,type Error = Infallible
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/cmp/struct.Reverse.html