# 1.0.0[−][src]Enum sgx_tstd::cmp::Ordering

An `Ordering`

is the result of a comparison between two values.

# Examples

use std::cmp::Ordering; let result = 1.cmp(&2); assert_eq!(Ordering::Less, result); let result = 1.cmp(&1); assert_eq!(Ordering::Equal, result); let result = 2.cmp(&1); assert_eq!(Ordering::Greater, result);

## Variants

An ordering where a compared value is less than another.

An ordering where a compared value is equal to another.

An ordering where a compared value is greater than another.

## Implementations

`impl Ordering`

[src]

`#[must_use]pub fn reverse(self) -> Ordering`

[src]

Reverses the `Ordering`

.

`Less`

becomes`Greater`

.`Greater`

becomes`Less`

.`Equal`

becomes`Equal`

.

# Examples

Basic behavior:

use std::cmp::Ordering; assert_eq!(Ordering::Less.reverse(), Ordering::Greater); assert_eq!(Ordering::Equal.reverse(), Ordering::Equal); assert_eq!(Ordering::Greater.reverse(), Ordering::Less);

This method can be used to reverse a comparison:

let data: &mut [_] = &mut [2, 10, 5, 8]; // sort the array from largest to smallest. data.sort_by(|a, b| a.cmp(b).reverse()); let b: &mut [_] = &mut [10, 8, 5, 2]; assert!(data == b);

`#[must_use]pub fn then(self, other: Ordering) -> Ordering`

1.17.0[src]

Chains two orderings.

Returns `self`

when it's not `Equal`

. Otherwise returns `other`

.

# Examples

use std::cmp::Ordering; let result = Ordering::Equal.then(Ordering::Less); assert_eq!(result, Ordering::Less); let result = Ordering::Less.then(Ordering::Equal); assert_eq!(result, Ordering::Less); let result = Ordering::Less.then(Ordering::Greater); assert_eq!(result, Ordering::Less); let result = Ordering::Equal.then(Ordering::Equal); assert_eq!(result, Ordering::Equal); let x: (i64, i64, i64) = (1, 2, 7); let y: (i64, i64, i64) = (1, 5, 3); let result = x.0.cmp(&y.0).then(x.1.cmp(&y.1)).then(x.2.cmp(&y.2)); assert_eq!(result, Ordering::Less);

`#[must_use]pub fn then_with<F>(self, f: F) -> Ordering where`

F: FnOnce() -> Ordering,

1.17.0[src]

F: FnOnce() -> Ordering,

Chains the ordering with the given function.

Returns `self`

when it's not `Equal`

. Otherwise calls `f`

and returns
the result.

# Examples

use std::cmp::Ordering; let result = Ordering::Equal.then_with(|| Ordering::Less); assert_eq!(result, Ordering::Less); let result = Ordering::Less.then_with(|| Ordering::Equal); assert_eq!(result, Ordering::Less); let result = Ordering::Less.then_with(|| Ordering::Greater); assert_eq!(result, Ordering::Less); let result = Ordering::Equal.then_with(|| Ordering::Equal); assert_eq!(result, Ordering::Equal); let x: (i64, i64, i64) = (1, 2, 7); let y: (i64, i64, i64) = (1, 5, 3); let result = x.0.cmp(&y.0).then_with(|| x.1.cmp(&y.1)).then_with(|| x.2.cmp(&y.2)); assert_eq!(result, Ordering::Less);

## Trait Implementations

`impl Clone for Ordering`

[src]

`pub fn clone(&self) -> Ordering`

[src]

`fn clone_from(&mut self, source: &Self)`

[src]

`impl Copy for Ordering`

[src]

`impl Debug for Ordering`

[src]

`impl Eq for Ordering`

[src]

`impl Hash for Ordering`

[src]

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

__H: Hasher,

[src]

__H: Hasher,

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

H: Hasher,

1.3.0[src]

H: Hasher,

`impl Ord for Ordering`

[src]

`pub fn cmp(&self, other: &Ordering) -> Ordering`

[src]

`#[must_use]fn max(self, other: Self) -> Self`

1.21.0[src]

`#[must_use]fn min(self, other: Self) -> Self`

1.21.0[src]

`#[must_use]fn clamp(self, min: Self, max: Self) -> Self`

[src]

`impl PartialEq<Ordering> for Ordering`

[src]

`impl PartialOrd<Ordering> for Ordering`

[src]

`pub fn partial_cmp(&self, other: &Ordering) -> Option<Ordering>`

[src]

`#[must_use]fn lt(&self, other: &Rhs) -> bool`

[src]

`#[must_use]fn le(&self, other: &Rhs) -> bool`

[src]

`#[must_use]fn gt(&self, other: &Rhs) -> bool`

[src]

`#[must_use]fn ge(&self, other: &Rhs) -> bool`

[src]

`impl StructuralPartialEq for Ordering`

[src]

## Auto Trait Implementations

`impl RefUnwindSafe for Ordering`

`impl Send for Ordering`

`impl Sync for Ordering`

`impl Unpin for Ordering`

`impl UnwindSafe for Ordering`

## Blanket Implementations

`impl<T> Any for T where`

T: 'static + ?Sized,

[src]

T: 'static + ?Sized,

`impl<T> Borrow<T> for T where`

T: ?Sized,

[src]

T: ?Sized,

`impl<T> BorrowMut<T> for T where`

T: ?Sized,

[src]

T: ?Sized,

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

[src]

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

[src]

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

U: From<T>,

[src]

U: From<T>,

`impl<T> ToOwned for T where`

T: Clone,

[src]

T: Clone,

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`

[src]

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

[src]

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

U: Into<T>,

[src]

U: Into<T>,

`type Error = Infallible`

The type returned in the event of a conversion error.

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

[src]

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

U: TryFrom<T>,

[src]

U: TryFrom<T>,