Struct creusot_contracts::std::cmp::Reverse

1.19.0 · source ·
#[repr(transparent)]
pub struct Reverse<T>(pub T);
Expand description

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§

1.19.0 · source§

impl<T> Clone for Reverse<T>
where T: Clone,

source§

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

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
1.19.0 · source§

impl<T> Debug for Reverse<T>
where T: Debug,

source§

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

Formats the value using the given formatter. Read more
source§

impl<T: DeepModel> DeepModel for Reverse<T>

source§

fn deep_model(self) -> Self::DeepModelTy

logic

pearlite! { Reverse(self.0.deep_model()) }

§

type DeepModelTy = Reverse<<T as DeepModel>::DeepModelTy>

1.19.0 · source§

impl<T> Default for Reverse<T>
where T: Default,

source§

fn default() -> Reverse<T>

Returns the “default value” for a type. Read more
1.19.0 · source§

impl<T> Hash for Reverse<T>
where T: Hash,

source§

fn hash<__H>(&self, state: &mut __H)
where __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
1.19.0 · source§

impl<T> Ord for Reverse<T>
where T: Ord,

source§

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

This method returns an Ordering between self and other. Read more
1.21.0 · source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl<T: OrdLogic> OrdLogic for Reverse<T>

source§

fn cmp_log(self, o: Self) -> Ordering

logic

match self.0.cmp_log(o.0) {
    Ordering::Equal => Ordering::Equal,
    Ordering::Less => Ordering::Greater,
    Ordering::Greater => Ordering::Less,
}
source§

fn cmp_le_log(x: Self, y: Self)

law

ensures

x.le_log(y) == (x.cmp_log(y) != Ordering::Greater)

source§

fn cmp_lt_log(x: Self, y: Self)

law

ensures

x.lt_log(y) == (x.cmp_log(y) == Ordering::Less)

source§

fn cmp_ge_log(x: Self, y: Self)

law

ensures

x.ge_log(y) == (x.cmp_log(y) != Ordering::Less)

source§

fn cmp_gt_log(x: Self, y: Self)

law

ensures

x.gt_log(y) == (x.cmp_log(y) == Ordering::Greater)

source§

fn refl(x: Self)

law

ensures

x.cmp_log(x) == Ordering::Equal

source§

fn trans(x: Self, y: Self, z: Self, o: Ordering)

law

requires

x.cmp_log(y) == o

requires

y.cmp_log(z) == o

ensures

x.cmp_log(z) == o

source§

fn antisym1(x: Self, y: Self)

law

requires

x.cmp_log(y) == Ordering::Less

ensures

y.cmp_log(x) == Ordering::Greater

source§

fn antisym2(x: Self, y: Self)

law

requires

x.cmp_log(y) == Ordering::Greater

ensures

y.cmp_log(x) == Ordering::Less

source§

fn eq_cmp(x: Self, y: Self)

law

ensures

(x == y) == (x.cmp_log(y) == Ordering::Equal)

source§

fn le_log(self, o: Self) -> bool

The logical <= operation. Read more
source§

fn lt_log(self, o: Self) -> bool

The logical < operation. Read more
source§

fn ge_log(self, o: Self) -> bool

The logical >= operation. Read more
source§

fn gt_log(self, o: Self) -> bool

The logical > operation. Read more
1.19.0 · source§

impl<T> PartialEq for Reverse<T>
where T: PartialEq,

source§

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

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
1.19.0 · source§

impl<T> PartialOrd for Reverse<T>
where T: PartialOrd,

source§

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

This method returns an ordering between self and other values if one exists. Read more
source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
source§

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

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
source§

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

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
1.19.0 · source§

impl<T> Copy for Reverse<T>
where T: Copy,

1.19.0 · source§

impl<T> Eq for Reverse<T>
where T: Eq,

1.19.0 · source§

impl<T> StructuralPartialEq for Reverse<T>

Auto Trait Implementations§

§

impl<T> !Freeze for Reverse<T>

§

impl<T> !RefUnwindSafe for Reverse<T>

§

impl<T> !Send for Reverse<T>

§

impl<T> !Sync for Reverse<T>

§

impl<T> !Unpin for Reverse<T>

§

impl<T> !UnwindSafe for Reverse<T>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> CloneToUninit for T
where T: Copy,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

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

source§

impl<T> MakeSized for T
where T: ?Sized,

source§

fn make_sized(&self) -> Box<T>

logic

ensures

*result == *self

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

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

Performs the conversion.