Struct `Reverse`

struct Reverse<T>(10174)

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.

Examples

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]);

Implementations

`impl<T> Any for Reverse<T>`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for Reverse<T>`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for Reverse<T>`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> CloneToUninit for Reverse<T>`

unsafe fn clone_to_uninit(self: &Self, dest: *mut u8)

`impl<T> Freeze for Reverse<T>`

`impl<T> From for Reverse<T>`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T> RefUnwindSafe for Reverse<T>`

`impl<T> Send for Reverse<T>`

`impl<T> StructuralPartialEq for Reverse<T>`

`impl<T> Sync for Reverse<T>`

`impl<T> Unpin for Reverse<T>`

`impl<T> UnwindSafe for Reverse<T>`

`impl<T, U> Into for Reverse<T>`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for Reverse<T>`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for Reverse<T>`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>

`impl<T: $crate::fmt::Debug> Debug for Reverse<T>`

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

`impl<T: $crate::hash::Hash> Hash for Reverse<T>`

fn hash<__H: $crate::hash::Hasher>(self: &Self, state: &mut __H)

`impl<T: $crate::marker::Copy> Copy for Reverse<T>`

`impl<T: Clone> Clone for Reverse<T>`

fn clone(self: &Self) -> Reverse<T>
fn clone_from(self: &mut Self, source: &Self)

`impl<T: ~const $crate::cmp::Eq> Eq for Reverse<T>`

`impl<T: ~const $crate::cmp::PartialEq> PartialEq for Reverse<T>`

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

`impl<T: ~const $crate::default::Default> Default for Reverse<T>`

fn default() -> Reverse<T>

`impl<T: ~const Ord> Ord for Reverse<T>`

fn cmp(self: &Self, other: &Reverse<T>) -> Ordering

`impl<T: ~const PartialOrd> PartialOrd for Reverse<T>`

fn partial_cmp(self: &Self, other: &Reverse<T>) -> Option<Ordering>
fn lt(self: &Self, other: &Self) -> bool
fn le(self: &Self, other: &Self) -> bool
fn gt(self: &Self, other: &Self) -> bool
fn ge(self: &Self, other: &Self) -> bool