Trait nom::lib::std::prelude::v1::v1::Ord

pub trait Ord: Eq + PartialOrd<Self> {
#[must_use]    pub fn cmp(&self, other: &Self) -> Ordering;

#[must_use]    pub fn max(self, other: Self) -> Self { ... }
#[must_use]    pub fn min(self, other: Self) -> Self { ... }
#[must_use]    pub fn clamp(self, min: Self, max: Self) -> Self { ... }
}

Trait for types that form a total order.

An order is a total order if it is (for all a, b and c):

• total and asymmetric: exactly one of a < b, a == b or a > b is true; and
• transitive, a < b and b < c implies a < c. The same must hold for both == and >.

Derivable

This trait can be used with #[derive]. When derived on structs, it will produce a lexicographic ordering based on the top-to-bottom declaration order of the struct's members. When derived on enums, variants are ordered by their top-to-bottom discriminant order.

Lexicographical comparison

Lexicographical comparison is an operation with the following properties:

• Two sequences are compared element by element.
• The first mismatching element defines which sequence is lexicographically less or greater than the other.
• If one sequence is a prefix of another, the shorter sequence is lexicographically less than the other.
• If two sequence have equivalent elements and are of the same length, then the sequences are lexicographically equal.
• An empty sequence is lexicographically less than any non-empty sequence.
• Two empty sequences are lexicographically equal.

How can I implement Ord?

Ord requires that the type also be PartialOrd and Eq (which requires PartialEq).

Then you must define an implementation for cmp. You may find it useful to use cmp on your type's fields.

Implementations of PartialEq, PartialOrd, and Ord must agree with each other. That is, a.cmp(b) == Ordering::Equal if and only if a == b and Some(a.cmp(b)) == a.partial_cmp(b) for all a and b. It's easy to accidentally make them disagree by deriving some of the traits and manually implementing others.

Here's an example where you want to sort people by height only, disregarding id and name:

use std::cmp::Ordering;

#[derive(Eq)]
struct Person {
    id: u32,
    name: String,
    height: u32,
}

impl Ord for Person {
    fn cmp(&self, other: &Self) -> Ordering {
        self.height.cmp(&other.height)
    }
}

impl PartialOrd for Person {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl PartialEq for Person {
    fn eq(&self, other: &Self) -> bool {
        self.height == other.height
    }
}

Required methods

#[must_use]pub fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

By convention, self.cmp(&other) returns the ordering matching the expression self <operator> other if true.

Examples

use std::cmp::Ordering;

assert_eq!(5.cmp(&10), Ordering::Less);
assert_eq!(10.cmp(&5), Ordering::Greater);
assert_eq!(5.cmp(&5), Ordering::Equal);

Loading content...

Provided methods

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

Compares and returns the maximum of two values.

Returns the second argument if the comparison determines them to be equal.

Examples

assert_eq!(2, 1.max(2));
assert_eq!(2, 2.max(2));

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

Compares and returns the minimum of two values.

Returns the first argument if the comparison determines them to be equal.

Examples

assert_eq!(1, 1.min(2));
assert_eq!(2, 2.min(2));

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

Restrict a value to a certain interval.

Returns max if self is greater than max, and min if self is less than min. Otherwise this returns self.

Panics

Panics if min > max.

Examples

assert!((-3).clamp(-2, 1) == -2);
assert!(0.clamp(-2, 1) == 0);
assert!(2.clamp(-2, 1) == 1);

Loading content...

Implementations on Foreign Types

impl Ord for IpAddr

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

impl Ord for Path

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

impl Ord for CStr

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

impl<'a> Ord for Prefix<'a>

pub fn cmp(&self, other: &Prefix<'a>) -> Ordering

impl Ord for SocketAddr

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

impl Ord for ErrorKind

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

impl Ord for Ipv6Addr

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

impl<'a> Ord for Component<'a>

pub fn cmp(&self, other: &Component<'a>) -> Ordering

impl Ord for CString

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

impl Ord for PathBuf

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

impl Ord for Ipv4Addr

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

impl<'_> Ord for Components<'_>

pub fn cmp(&self, other: &Components<'_>) -> Ordering

impl Ord for OsString

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

impl Ord for SystemTime

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

impl<'_> Ord for PrefixComponent<'_>

pub fn cmp(&self, other: &PrefixComponent<'_>) -> Ordering

impl Ord for SocketAddrV4

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

impl Ord for SocketAddrV6

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

impl Ord for Instant

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

impl Ord for OsStr

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

impl<Ret, A, B, C, D> Ord for unsafe fn(A, B, C, D) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B, C, D) -> Ret) -> Ordering

impl<'_, A> Ord for &'_ mut A where
    A: Ord + ?Sized, 

pub fn cmp(&self, other: &&'_ mut A) -> Ordering

impl<Ret> Ord for fn() -> Ret

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

impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G> Ord for unsafe fn(A, B, C, D, E, F, G) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B, C, D, E, F, G) -> Ret) -> Ordering

impl<Ret, A, B> Ord for extern "C" fn(A, B, ...) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, ...) -> Ret) -> Ordering

impl<A, B, C, D, E, F, G, H, I, J> Ord for (A, B, C, D, E, F, G, H, I, J) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F, G, H, I, J)) -> Ordering

impl<Ret, A, B> Ord for fn(A, B) -> Ret

pub fn cmp(&self, other: &fn(A, B) -> Ret) -> Ordering

impl Ord for NonZeroIsize

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

impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
) -> Ordering

impl Ord for u8

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

impl<Ret, A, B, C, D, E, F, G> Ord for fn(A, B, C, D, E, F, G) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D, E, F, G) -> Ret) -> Ordering

impl Ord for u64

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

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> Ordering

impl<T, const N: usize> Ord for [T; N] where
    T: Ord, 

Implements comparison of arrays lexicographically.

pub fn cmp(&self, other: &[T; N]) -> Ordering

impl<A, B, C, D> Ord for (A, B, C, D) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D)) -> Ordering

impl<Ret, A, B, C, D, E> Ord for unsafe extern "C" fn(A, B, C, D, E, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, ...) -> Ret
) -> Ordering

impl<Ret, A, B> Ord for unsafe extern "C" fn(A, B, ...) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A, B, ...) -> Ret) -> Ordering

impl Ord for char

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

impl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
) -> Ordering

impl Ord for NonZeroI16

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

impl Ord for NonZeroU128

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

impl Ord for str

Implements ordering of strings.

Strings are ordered lexicographically by their byte values. This orders Unicode code points based on their positions in the code charts. This is not necessarily the same as "alphabetical" order, which varies by language and locale. Sorting strings according to culturally-accepted standards requires locale-specific data that is outside the scope of the str type.

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

impl<Ret, A> Ord for unsafe fn(A) -> Ret

pub fn cmp(&self, other: &unsafe fn(A) -> Ret) -> Ordering

impl<Ret> Ord for unsafe fn() -> Ret

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

impl<T> Ord for *const T where
    T: ?Sized, 

pub fn cmp(&self, other: &*const T) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
) -> Ordering

impl Ord for i32

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

impl<T> Ord for *mut T where
    T: ?Sized, 

pub fn cmp(&self, other: &*mut T) -> Ordering

impl<T> Ord for RefCell<T> where
    T: Ord + ?Sized, 

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

Panics

Panics if the value in either RefCell is currently borrowed.

impl<Ret, A, B, C> Ord for extern "C" fn(A, B, C, ...) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, ...) -> Ret) -> Ordering

impl Ord for usize

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

impl Ord for NonZeroI128

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

impl<Ret, A, B, C, D> Ord for unsafe extern "C" fn(A, B, C, D, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, ...) -> Ret
) -> Ordering

impl<T> Ord for [T] where
    T: Ord, 

Implements comparison of vectors lexicographically.

pub fn cmp(&self, other: &[T]) -> Ordering

impl<A, B, C, D, E, F, G, H, I, J, K> Ord for (A, B, C, D, E, F, G, H, I, J, K) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F, G, H, I, J, K)) -> Ordering

impl Ord for Duration

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

impl Ord for u128

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

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

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

impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe fn(A, B, C, D, E, F, G, H) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B, C, D, E, F, G, H) -> Ret) -> Ordering

impl<Ret, A> Ord for unsafe extern "C" fn(A, ...) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A, ...) -> Ret) -> Ordering

impl<T> Ord for PhantomData<T> where
    T: ?Sized, 

pub fn cmp(&self, _other: &PhantomData<T>) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H> Ord for extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
) -> Ordering

impl<A> Ord for (A,) where
    A: Ord + ?Sized, 

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

impl<Ret, A, B, C, D, E> Ord for unsafe fn(A, B, C, D, E) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B, C, D, E) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F> Ord for fn(A, B, C, D, E, F) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D, E, F) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
) -> Ordering

impl<Ret> Ord for extern "C" fn() -> Ret

pub fn cmp(&self, other: &extern "C" fn() -> Ret) -> Ordering

impl Ord for i128

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

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> Ordering

impl<A, B, C, D, E, F, G> Ord for (A, B, C, D, E, F, G) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F, G)) -> Ordering

impl<Ret, A, B, C> Ord for unsafe extern "C" fn(A, B, C) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A, B, C) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
) -> Ordering

impl<A, B, C> Ord for (A, B, C) where
    A: Ord,
    B: Ord,
    C: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C)) -> Ordering

impl<Ret, A, B, C, D, E, F, G> Ord for extern "C" fn(A, B, C, D, E, F, G) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, D, E, F, G) -> Ret) -> Ordering

impl Ord for u16

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

impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret

pub fn cmp(
    &self,
    other: &unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
) -> Ordering

impl Ord for i8

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

impl<Ret, A> Ord for fn(A) -> Ret

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

impl Ord for TypeId

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

impl Ord for NonZeroU64

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

impl<Ret, A> Ord for extern "C" fn(A) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A) -> Ret) -> Ordering

impl Ord for isize

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

impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
) -> Ordering

impl<T> Ord for Cell<T> where
    T: Ord + Copy, 

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

impl Ord for CpuidResult

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

impl Ord for bool

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

impl<P> Ord for Pin<P> where
    P: Deref,
    <P as Deref>::Target: Ord, 

pub fn cmp(&self, other: &Pin<P>) -> Ordering

impl Ord for NonZeroI32

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

impl<Ret, A, B, C, D> Ord for extern "C" fn(A, B, C, D, ...) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, D, ...) -> Ret) -> Ordering

impl Ord for ()

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

impl Ord for !

pub fn cmp(&self, &!) -> Ordering

impl<Ret, A, B> Ord for extern "C" fn(A, B) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B) -> Ret) -> Ordering

impl<Ret, A, B, C, D> Ord for unsafe extern "C" fn(A, B, C, D) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A, B, C, D) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret

pub fn cmp(
    &self,
    other: &unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret

pub fn cmp(
    &self,
    other: &unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F> Ord for unsafe fn(A, B, C, D, E, F) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B, C, D, E, F) -> Ret) -> Ordering

impl<A, B, C, D, E, F> Ord for (A, B, C, D, E, F) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F)) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret

pub fn cmp(
    &self,
    other: &unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret
) -> Ordering

impl<Ret, A> Ord for extern "C" fn(A, ...) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, ...) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E> Ord for extern "C" fn(A, B, C, D, E) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, D, E) -> Ret) -> Ordering

impl Ord for NonZeroU8

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

impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> Ordering

impl Ord for NonZeroU16

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

impl<Ret, A, B, C> Ord for extern "C" fn(A, B, C) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
) -> Ordering

impl<Ret, A, B, C> Ord for unsafe extern "C" fn(A, B, C, ...) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A, B, C, ...) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret
) -> Ordering

impl Ord for u32

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

impl<Ret, A, B, C, D, E, F> Ord for unsafe extern "C" fn(A, B, C, D, E, F) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F) -> Ret
) -> Ordering

impl<'a> Ord for Location<'a>

pub fn cmp(&self, other: &Location<'a>) -> Ordering

impl<Ret, A, B, C, D, E> Ord for unsafe extern "C" fn(A, B, C, D, E) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E) -> Ret
) -> Ordering

impl<A, B, C, D, E> Ord for (A, B, C, D, E) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E)) -> Ordering

impl<Ret, A, B> Ord for unsafe extern "C" fn(A, B) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A, B) -> Ret) -> Ordering

impl<Ret, A, B, C, D> Ord for fn(A, B, C, D) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret

pub fn cmp(
    &self,
    other: &fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H> Ord for fn(A, B, C, D, E, F, G, H) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D, E, F, G, H) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
) -> Ordering

impl<T> Ord for NonNull<T> where
    T: ?Sized, 

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

impl<A, B, C, D, E, F, G, H, I, J, K, L> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> Ordering

impl<Ret, A, B, C> Ord for fn(A, B, C) -> Ret

pub fn cmp(&self, other: &fn(A, B, C) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H> Ord for extern "C" fn(A, B, C, D, E, F, G, H) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G> Ord for extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret
) -> Ordering

impl Ord for NonZeroI8

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

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

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

impl<Ret, A, B> Ord for unsafe fn(A, B) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
) -> Ordering

impl<Ret, A, B, C, D> Ord for extern "C" fn(A, B, C, D) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, D) -> Ret) -> Ordering

impl<A, B, C, D, E, F, G, H> Ord for (A, B, C, D, E, F, G, H) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F, G, H)) -> Ordering

impl<A, B, C, D, E, F, G, H, I> Ord for (A, B, C, D, E, F, G, H, I) where
    A: Ord,
    B: Ord,
    C: Ord,
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord + ?Sized, 

pub fn cmp(&self, other: &(A, B, C, D, E, F, G, H, I)) -> Ordering

impl Ord for NonZeroUsize

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

impl<Ret, A, B, C, D, E, F> Ord for unsafe extern "C" fn(A, B, C, D, E, F, ...) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, ...) -> Ret
) -> Ordering

impl Ord for i64

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

impl<Ret, A, B, C, D, E, F> Ord for extern "C" fn(A, B, C, D, E, F) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, D, E, F) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E> Ord for fn(A, B, C, D, E) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D, E) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F> Ord for extern "C" fn(A, B, C, D, E, F, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, ...) -> Ret
) -> Ordering

impl<Ret, A> Ord for unsafe extern "C" fn(A) -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn(A) -> Ret) -> Ordering

impl<Ret, A, B, C> Ord for unsafe fn(A, B, C) -> Ret

pub fn cmp(&self, other: &unsafe fn(A, B, C) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret

pub fn cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
) -> Ordering

impl Ord for PhantomPinned

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

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret

pub fn cmp(
    &self,
    other: &fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
) -> Ordering

impl<A, B> Ord for (A, B) where
    A: Ord,
    B: Ord + ?Sized, 

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

impl<Ret> Ord for unsafe extern "C" fn() -> Ret

pub fn cmp(&self, other: &unsafe extern "C" fn() -> Ret) -> Ordering

impl Ord for NonZeroU32

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

impl<'_, A> Ord for &'_ A where
    A: Ord + ?Sized, 

pub fn cmp(&self, other: &&'_ A) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret

pub fn cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for fn(A, B, C, D, E, F, G, H, I, J) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D, E, F, G, H, I, J) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E> Ord for extern "C" fn(A, B, C, D, E, ...) -> Ret

pub fn cmp(&self, other: &extern "C" fn(A, B, C, D, E, ...) -> Ret) -> Ordering

impl<Ret, A, B, C, D, E, F, G, H, I> Ord for fn(A, B, C, D, E, F, G, H, I) -> Ret

pub fn cmp(&self, other: &fn(A, B, C, D, E, F, G, H, I) -> Ret) -> Ordering

impl Ord for i16

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

impl Ord for NonZeroI64

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

impl<T> Ord for Arc<T> where
    T: Ord + ?Sized, 

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

Comparison for two Arcs.

The two are compared by calling cmp() on their inner values.

Examples

use std::sync::Arc;
use std::cmp::Ordering;

let five = Arc::new(5);

assert_eq!(Ordering::Less, five.cmp(&Arc::new(6)));

impl<T> Ord for Rc<T> where
    T: Ord + ?Sized, 

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

Comparison for two Rcs.

The two are compared by calling cmp() on their inner values.

Examples

use std::rc::Rc;
use std::cmp::Ordering;

let five = Rc::new(5);

assert_eq!(Ordering::Less, five.cmp(&Rc::new(6)));

impl<R> Ord for BitSel<R> where
    R: Ord + BitRegister, 

pub fn cmp(&self, other: &BitSel<R>) -> Ordering

impl<O, V> Ord for BitArray<O, V> where
    O: BitOrder,
    V: BitView, 

pub fn cmp(&self, other: &BitArray<O, V>) -> Ordering

impl<R> Ord for BitPos<R> where
    R: Ord + BitRegister, 

pub fn cmp(&self, other: &BitPos<R>) -> Ordering

impl<R> Ord for BitMask<R> where
    R: Ord + BitRegister, 

pub fn cmp(&self, other: &BitMask<R>) -> Ordering

impl<R> Ord for BitTail<R> where
    R: Ord + BitRegister, 

pub fn cmp(&self, other: &BitTail<R>) -> Ordering

impl Ord for Lsb0

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

impl<O, T> Ord for BitSlice<O, T> where
    O: BitOrder,
    T: BitStore, 

pub fn cmp(&self, rhs: &BitSlice<O, T>) -> Ordering

impl<O, T> Ord for BitBox<O, T> where
    O: BitOrder,
    T: BitStore, 

pub fn cmp(&self, other: &BitBox<O, T>) -> Ordering

impl<R> Ord for BitIdx<R> where
    R: Ord + BitRegister, 

pub fn cmp(&self, other: &BitIdx<R>) -> Ordering

impl Ord for Msb0

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

impl<O, T> Ord for BitVec<O, T> where
    O: BitOrder,
    T: BitStore, 

pub fn cmp(&self, other: &BitVec<O, T>) -> Ordering

impl Ord for Error

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

impl Ord for ErrorCode

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

impl<A> Ord for ArrayVec<A> where
    A: Array,
    <A as Array>::Item: Ord, 

pub fn cmp(&self, other: &ArrayVec<A>) -> Ordering

impl<A> Ord for ArrayString<A> where
    A: Array<Item = u8> + Copy, 

pub fn cmp(&self, rhs: &ArrayString<A>) -> Ordering

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

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

impl Ord for Span

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

impl Ord for ClassBytesRange

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

impl Ord for Utf8Sequence

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

impl Ord for Position

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

impl Ord for Literal

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

impl Ord for ClassUnicodeRange

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

impl Ord for Utf8Range

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

Loading content...

Implementors

impl Ord for Ordering

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

impl Ord for Infallible

pub fn cmp(&self, _other: &Infallible) -> Ordering

impl Ord for nom::lib::std::fmt::Error

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

impl Ord for NoneError

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

impl Ord for String

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

impl<'_, B> Ord for Cow<'_, B> where
    B: Ord + ToOwned + ?Sized, 

pub fn cmp(&self, other: &Cow<'_, B>) -> Ordering

impl<A> Ord for VecDeque<A> where
    A: Ord, 

pub fn cmp(&self, other: &VecDeque<A>) -> Ordering

impl<K, V> Ord for BTreeMap<K, V> where
    K: Ord,
    V: Ord, 

pub fn cmp(&self, other: &BTreeMap<K, V>) -> Ordering

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

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

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

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

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

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

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

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

impl<T> Ord for ManuallyDrop<T> where
    T: Ord + ?Sized, 

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

impl<T, A> Ord for Box<T, A> where
    A: AllocRef,
    T: Ord + ?Sized, 

pub fn cmp(&self, other: &Box<T, A>) -> Ordering

impl<T, A> Ord for Vec<T, A> where
    A: AllocRef,
    T: Ord, 

Implements ordering of vectors, lexicographically.

pub fn cmp(&self, other: &Vec<T, A>) -> Ordering

impl<T, E> Ord for Result<T, E> where
    E: Ord,
    T: Ord, 

pub fn cmp(&self, other: &Result<T, E>) -> Ordering

impl<Y, R> Ord for GeneratorState<Y, R> where
    R: Ord,
    Y: Ord, 

pub fn cmp(&self, other: &GeneratorState<Y, R>) -> Ordering

Loading content...