Struct Reverse 

#[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.

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

Tuple Fields

0: T

Trait Implementations

impl<T> Clone for Reverse<T>

where T: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Reverse<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for Reverse<T>

where T: Default,

fn default() -> Reverse<T>

Returns the “default value” for a type.

impl<T> Eq for Reverse<T>

where T: Eq,

#[doc(hidden)] fn assert_receiver_is_total_eq(&self)

impl<T> Hash for Reverse<T>

where T: Hash,

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> Ord for Reverse<T>

where T: Ord,

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for Reverse<T>

where T: PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. 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>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

#[doc(hidden)] fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

If self == other, returns ControlFlow::Continue(()). Otherwise, returns ControlFlow::Break(self < other).

#[doc(hidden)] fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for <= instead of <.

#[doc(hidden)] fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for > instead of <.

#[doc(hidden)] fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for >= instead of <.

impl<T> Copy for Reverse<T>

where T: Copy,

impl<T> StructuralPartialEq for Reverse<T>