Trait competitive_hpp::prelude::PartialOrd

#[lang = "partial_ord"]pub trait PartialOrd<Rhs = Self>: PartialEq<Rhs> where
    Rhs: ?Sized, {
#[must_use]    fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>;

#[must_use]    fn lt(&self, other: &Rhs) -> bool { ... }
#[must_use]    fn le(&self, other: &Rhs) -> bool { ... }
#[must_use]    fn gt(&self, other: &Rhs) -> bool { ... }
#[must_use]    fn ge(&self, other: &Rhs) -> bool { ... }
}

Trait for values that can be compared for a sort-order.

The comparison must satisfy, for all a, b and c:

• asymmetry: if a < b then !(a > b), as well as a > b implying !(a < b); and
• transitivity: a < b and b < c implies a < c. The same must hold for both == and >.

Note that these requirements mean that the trait itself must be implemented symmetrically and transitively: if T: PartialOrd<U> and U: PartialOrd<V> then U: PartialOrd<T> and T: PartialOrd<V>.

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 declaration order.

How can I implement PartialOrd?

PartialOrd only requires implementation of the partial_cmp method, with the others generated from default implementations.

However it remains possible to implement the others separately for types which do not have a total order. For example, for floating point numbers, NaN < 0 == false and NaN >= 0 == false (cf. IEEE 754-2008 section 5.11).

PartialOrd requires your type to be PartialEq.

Implementations of PartialEq, PartialOrd, and Ord must agree with each other. It's easy to accidentally make them disagree by deriving some of the traits and manually implementing others.

If your type is Ord, you can implement partial_cmp by using cmp:

use std::cmp::Ordering;

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

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

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

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

You may also find it useful to use partial_cmp on your type's fields. Here is an example of Person types who have a floating-point height field that is the only field to be used for sorting:

use std::cmp::Ordering;

struct Person {
    id: u32,
    name: String,
    height: f64,
}

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

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

Examples

let x : u32 = 0;
let y : u32 = 1;

assert_eq!(x < y, true);
assert_eq!(x.lt(&y), true);

Required methods

#[must_use]fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>

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

Examples

use std::cmp::Ordering;

let result = 1.0.partial_cmp(&2.0);
assert_eq!(result, Some(Ordering::Less));

let result = 1.0.partial_cmp(&1.0);
assert_eq!(result, Some(Ordering::Equal));

let result = 2.0.partial_cmp(&1.0);
assert_eq!(result, Some(Ordering::Greater));

When comparison is impossible:

let result = f64::NAN.partial_cmp(&1.0);
assert_eq!(result, None);

Loading content...

Provided methods

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

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

Examples

let result = 1.0 < 2.0;
assert_eq!(result, true);

let result = 2.0 < 1.0;
assert_eq!(result, false);

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

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

Examples

let result = 1.0 <= 2.0;
assert_eq!(result, true);

let result = 2.0 <= 2.0;
assert_eq!(result, true);

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

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

Examples

let result = 1.0 > 2.0;
assert_eq!(result, false);

let result = 2.0 > 2.0;
assert_eq!(result, false);

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

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

Examples

let result = 2.0 >= 1.0;
assert_eq!(result, true);

let result = 2.0 >= 2.0;
assert_eq!(result, true);

Loading content...

Implementations on Foreign Types

impl<'a, 'b> PartialOrd<Path> for Cow<'a, OsStr>

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

impl<'a, 'b> PartialOrd<Path> for Cow<'a, Path>

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

impl PartialOrd<str> for OsStr

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

impl PartialOrd<PathBuf> for PathBuf

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

impl<'a> PartialOrd<PrefixComponent<'a>> for PrefixComponent<'a>

fn partial_cmp(&self, other: &PrefixComponent<'a>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<&'a OsStr> for PathBuf

fn partial_cmp(&self, other: &&'a OsStr) -> Option<Ordering>

impl<'a, 'b> PartialOrd<Path> for &'a OsStr

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

impl<'a, 'b> PartialOrd<OsStr> for &'a Path

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

impl<'a, 'b> PartialOrd<OsStr> for PathBuf

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

impl PartialOrd<IpAddr> for IpAddr

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

fn lt(&self, other: &IpAddr) -> bool

fn le(&self, other: &IpAddr) -> bool

fn gt(&self, other: &IpAddr) -> bool

fn ge(&self, other: &IpAddr) -> bool

impl PartialOrd<Ipv4Addr> for Ipv4Addr

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

impl<'a, 'b> PartialOrd<Path> for OsStr

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

impl<'a, 'b> PartialOrd<PathBuf> for Cow<'a, OsStr>

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

impl<'a, 'b> PartialOrd<PathBuf> for OsStr

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

impl<'a, 'b> PartialOrd<&'a Path> for Cow<'b, OsStr>

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, OsStr>

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

impl<'a, 'b> PartialOrd<&'a OsStr> for Path

fn partial_cmp(&self, other: &&'a OsStr) -> Option<Ordering>

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b Path

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

impl PartialOrd<OsStr> for OsStr

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

fn lt(&self, other: &OsStr) -> bool

fn le(&self, other: &OsStr) -> bool

fn gt(&self, other: &OsStr) -> bool

fn ge(&self, other: &OsStr) -> bool

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsStr

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<PathBuf> for OsString

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

impl<'a, 'b> PartialOrd<OsString> for &'a Path

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

impl<'a, 'b> PartialOrd<Path> for PathBuf

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

impl<'a, 'b> PartialOrd<&'a Path> for OsStr

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

impl<'a, 'b> PartialOrd<Cow<'b, OsStr>> for &'a Path

fn partial_cmp(&self, other: &Cow<'b, OsStr>) -> Option<Ordering>

impl<'a> PartialOrd<Component<'a>> for Component<'a>

fn partial_cmp(&self, other: &Component<'a>) -> Option<Ordering>

fn lt(&self, other: &Component<'a>) -> bool

fn le(&self, other: &Component<'a>) -> bool

fn gt(&self, other: &Component<'a>) -> bool

fn ge(&self, other: &Component<'a>) -> bool

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for OsStr

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<OsString> for Path

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

impl PartialOrd<Ipv6Addr> for Ipv6Addr

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

impl PartialOrd<SystemTime> for SystemTime

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

fn lt(&self, other: &SystemTime) -> bool

fn le(&self, other: &SystemTime) -> bool

fn gt(&self, other: &SystemTime) -> bool

fn ge(&self, other: &SystemTime) -> bool

impl<'a, 'b> PartialOrd<OsString> for Cow<'a, Path>

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

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsString

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

impl PartialOrd<Ipv4Addr> for IpAddr

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

impl PartialOrd<CStr> for CStr

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

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for PathBuf

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for PathBuf

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<OsString> for PathBuf

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

impl<'a, 'b> PartialOrd<PathBuf> for Cow<'a, Path>

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

impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, Path>

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

impl<'a, 'b> PartialOrd<PathBuf> for Path

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

impl PartialOrd<IpAddr> for Ipv6Addr

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

impl<'a, 'b> PartialOrd<OsString> for OsStr

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

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for OsString

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<PathBuf> for &'a OsStr

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

impl PartialOrd<Ipv6Addr> for IpAddr

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

impl<'a, 'b> PartialOrd<&'a OsStr> for OsString

fn partial_cmp(&self, other: &&'a OsStr) -> Option<Ordering>

impl PartialOrd<CString> for CString

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

fn lt(&self, other: &CString) -> bool

fn le(&self, other: &CString) -> bool

fn gt(&self, other: &CString) -> bool

fn ge(&self, other: &CString) -> bool

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b OsStr

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for &'b OsStr

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

impl PartialOrd<OsString> for OsString

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

fn lt(&self, other: &OsString) -> bool

fn le(&self, other: &OsString) -> bool

fn gt(&self, other: &OsString) -> bool

fn ge(&self, other: &OsString) -> bool

impl<'a, 'b> PartialOrd<OsString> for &'a OsStr

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

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for Path

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

impl PartialOrd<str> for OsString

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

impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, Path>

fn partial_cmp(&self, other: &&'b OsStr) -> Option<Ordering>

impl PartialOrd<IpAddr> for Ipv4Addr

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

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for Path

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

impl PartialOrd<Instant> for Instant

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

fn lt(&self, other: &Instant) -> bool

fn le(&self, other: &Instant) -> bool

fn gt(&self, other: &Instant) -> bool

fn ge(&self, other: &Instant) -> bool

impl<'a, 'b> PartialOrd<PathBuf> for &'a Path

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

impl<'a, 'b> PartialOrd<OsStr> for OsString

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

impl<'a, 'b> PartialOrd<Path> for OsString

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

impl<'a> PartialOrd<Components<'a>> for Components<'a>

fn partial_cmp(&self, other: &Components<'a>) -> Option<Ordering>

impl<'a, 'b> PartialOrd<&'a Path> for OsString

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

impl PartialOrd<ErrorKind> for ErrorKind

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

impl<'a, 'b> PartialOrd<&'a Path> for PathBuf

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

impl<'a, 'b> PartialOrd<&'b Path> for Cow<'a, Path>

fn partial_cmp(&self, other: &&'b Path) -> Option<Ordering>

impl PartialOrd<Path> for Path

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

impl<'a> PartialOrd<Prefix<'a>> for Prefix<'a>

fn partial_cmp(&self, other: &Prefix<'a>) -> Option<Ordering>

fn lt(&self, other: &Prefix<'a>) -> bool

fn le(&self, other: &Prefix<'a>) -> bool

fn gt(&self, other: &Prefix<'a>) -> bool

fn ge(&self, other: &Prefix<'a>) -> bool

impl<'a, 'b> PartialOrd<OsStr> for Path

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

impl<'a, 'b> PartialOrd<OsString> for Cow<'a, OsStr>

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

impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, OsStr>

fn partial_cmp(&self, other: &&'b OsStr) -> Option<Ordering>

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

fn partial_cmp(&self, other: &fn(A) -> Ret) -> Option<Ordering>

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

fn partial_cmp(&self, other: &unsafe fn() -> Ret) -> Option<Ordering>

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

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

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

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

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

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

impl PartialOrd<NonZeroI64> for NonZeroI64

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

fn lt(&self, other: &NonZeroI64) -> bool

fn le(&self, other: &NonZeroI64) -> bool

fn gt(&self, other: &NonZeroI64) -> bool

fn ge(&self, other: &NonZeroI64) -> bool

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

fn partial_cmp(&self, other: &extern "C" fn(A, B) -> Ret) -> Option<Ordering>

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

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

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

fn partial_cmp(&self, other: &(A, B, C, D, E, F, G)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn le(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn ge(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn gt(&self, other: &(A, B, C, D, E, F, G)) -> bool

impl PartialOrd<u128> for u128

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

fn lt(&self, other: &u128) -> bool

fn le(&self, other: &u128) -> bool

fn ge(&self, other: &u128) -> bool

fn gt(&self, other: &u128) -> bool

impl PartialOrd<()> for ()

fn partial_cmp(&self, &()) -> Option<Ordering>

impl PartialOrd<u8> for u8

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

fn lt(&self, other: &u8) -> bool

fn le(&self, other: &u8) -> bool

fn ge(&self, other: &u8) -> bool

fn gt(&self, other: &u8) -> bool

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

fn partial_cmp(&self, other: &fn(A, B, C) -> Ret) -> Option<Ordering>

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

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

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

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

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

fn partial_cmp(&self, other: &[T; N]) -> Option<Ordering>

fn lt(&self, other: &[T; N]) -> bool

fn le(&self, other: &[T; N]) -> bool

fn ge(&self, other: &[T; N]) -> bool

fn gt(&self, other: &[T; N]) -> bool

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

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

fn lt(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

fn le(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

fn ge(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

fn gt(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

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

fn partial_cmp(&self, other: &fn(A, B, C, D) -> Ret) -> Option<Ordering>

impl PartialOrd<Error> for Error

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

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A) -> Ret
) -> Option<Ordering>

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

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

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

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

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

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

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

fn partial_cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, ...) -> Ret
) -> Option<Ordering>

impl PartialOrd<i16> for i16

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

fn lt(&self, other: &i16) -> bool

fn le(&self, other: &i16) -> bool

fn ge(&self, other: &i16) -> bool

fn gt(&self, other: &i16) -> bool

impl PartialOrd<i8> for i8

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

fn lt(&self, other: &i8) -> bool

fn le(&self, other: &i8) -> bool

fn ge(&self, other: &i8) -> bool

fn gt(&self, other: &i8) -> bool

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

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

impl PartialOrd<u64> for u64

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

fn lt(&self, other: &u64) -> bool

fn le(&self, other: &u64) -> bool

fn ge(&self, other: &u64) -> bool

fn gt(&self, other: &u64) -> bool

impl PartialOrd<NonZeroU16> for NonZeroU16

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

fn lt(&self, other: &NonZeroU16) -> bool

fn le(&self, other: &NonZeroU16) -> bool

fn gt(&self, other: &NonZeroU16) -> bool

fn ge(&self, other: &NonZeroU16) -> bool

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

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

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

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

fn lt(&self, other: &*mut T) -> bool

fn le(&self, other: &*mut T) -> bool

fn gt(&self, other: &*mut T) -> bool

fn ge(&self, other: &*mut T) -> bool

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, ...) -> Ret
) -> Option<Ordering>

impl PartialOrd<isize> for isize

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

fn lt(&self, other: &isize) -> bool

fn le(&self, other: &isize) -> bool

fn ge(&self, other: &isize) -> bool

fn gt(&self, other: &isize) -> bool

impl PartialOrd<NonZeroU32> for NonZeroU32

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

fn lt(&self, other: &NonZeroU32) -> bool

fn le(&self, other: &NonZeroU32) -> bool

fn gt(&self, other: &NonZeroU32) -> bool

fn ge(&self, other: &NonZeroU32) -> bool

impl PartialOrd<!> for !

fn partial_cmp(&self, &!) -> Option<Ordering>

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

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

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

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

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

Implements comparison of vectors lexicographically.

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

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

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

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

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

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

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

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

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

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

fn partial_cmp(
    &self,
    other: &extern "C" fn(A, B, ...) -> Ret
) -> Option<Ordering>

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

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

impl PartialOrd<char> for char

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

fn lt(&self, other: &char) -> bool

fn le(&self, other: &char) -> bool

fn ge(&self, other: &char) -> bool

fn gt(&self, other: &char) -> bool

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

fn partial_cmp(&self, other: &fn(A, B, C, D, E) -> Ret) -> Option<Ordering>

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

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

impl PartialOrd<NonZeroUsize> for NonZeroUsize

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

fn lt(&self, other: &NonZeroUsize) -> bool

fn le(&self, other: &NonZeroUsize) -> bool

fn gt(&self, other: &NonZeroUsize) -> bool

fn ge(&self, other: &NonZeroUsize) -> bool

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

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

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

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

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

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

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

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

impl PartialOrd<u16> for u16

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

fn lt(&self, other: &u16) -> bool

fn le(&self, other: &u16) -> bool

fn ge(&self, other: &u16) -> bool

fn gt(&self, other: &u16) -> bool

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

fn partial_cmp(&self, other: &unsafe fn(A, B, C) -> Ret) -> Option<Ordering>

impl PartialOrd<f32> for f32

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

fn lt(&self, other: &f32) -> bool

fn le(&self, other: &f32) -> bool

fn ge(&self, other: &f32) -> bool

fn gt(&self, other: &f32) -> bool

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

fn partial_cmp(&self, _other: &PhantomData<T>) -> Option<Ordering>

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

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

impl PartialOrd<NonZeroIsize> for NonZeroIsize

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

fn lt(&self, other: &NonZeroIsize) -> bool

fn le(&self, other: &NonZeroIsize) -> bool

fn gt(&self, other: &NonZeroIsize) -> bool

fn ge(&self, other: &NonZeroIsize) -> bool

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

fn partial_cmp(
    &self,
    other: &unsafe fn(A, B, C, D, E) -> Ret
) -> Option<Ordering>

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

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

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

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

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

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

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

fn partial_cmp(&self, other: &unsafe fn(A) -> Ret) -> Option<Ordering>

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

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

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

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

fn lt(&self, other: &&B) -> bool

fn le(&self, other: &&B) -> bool

fn gt(&self, other: &&B) -> bool

fn ge(&self, other: &&B) -> bool

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

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

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

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

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

fn partial_cmp(
    &self,
    other: &extern "C" fn(A, B, C, ...) -> Ret
) -> Option<Ordering>

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

fn partial_cmp(&self, other: &&mut B) -> Option<Ordering>

fn lt(&self, other: &&mut B) -> bool

fn le(&self, other: &&mut B) -> bool

fn gt(&self, other: &&mut B) -> bool

fn ge(&self, other: &&mut B) -> bool

impl PartialOrd<bool> for bool

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

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

fn partial_cmp(&self, other: &(A, B, C, D)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D)) -> bool

fn le(&self, other: &(A, B, C, D)) -> bool

fn ge(&self, other: &(A, B, C, D)) -> bool

fn gt(&self, other: &(A, B, C, D)) -> bool

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

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

impl PartialOrd<Infallible> for Infallible

fn partial_cmp(&self, _other: &Infallible) -> Option<Ordering>

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

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

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

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

impl PartialOrd<NonZeroI32> for NonZeroI32

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

fn lt(&self, other: &NonZeroI32) -> bool

fn le(&self, other: &NonZeroI32) -> bool

fn gt(&self, other: &NonZeroI32) -> bool

fn ge(&self, other: &NonZeroI32) -> bool

impl PartialOrd<u32> for u32

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

fn lt(&self, other: &u32) -> bool

fn le(&self, other: &u32) -> bool

fn ge(&self, other: &u32) -> bool

fn gt(&self, other: &u32) -> bool

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

fn partial_cmp(
    &self,
    other: &extern "C" fn(A, B, C, D, E) -> Ret
) -> Option<Ordering>

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

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

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

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

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

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

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

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

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

fn partial_cmp(
    &self,
    other: &extern "C" fn(A, B, C, D) -> Ret
) -> Option<Ordering>

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A, B) -> Ret
) -> Option<Ordering>

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

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

impl PartialOrd<usize> for usize

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

fn lt(&self, other: &usize) -> bool

fn le(&self, other: &usize) -> bool

fn ge(&self, other: &usize) -> bool

fn gt(&self, other: &usize) -> bool

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

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

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D) -> Ret
) -> Option<Ordering>

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

fn partial_cmp(&self, other: &GeneratorState<Y, R>) -> Option<Ordering>

fn lt(&self, other: &GeneratorState<Y, R>) -> bool

fn le(&self, other: &GeneratorState<Y, R>) -> bool

fn gt(&self, other: &GeneratorState<Y, R>) -> bool

fn ge(&self, other: &GeneratorState<Y, R>) -> bool

impl PartialOrd<NoneError> for NoneError

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

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

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

impl PartialOrd<i32> for i32

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

fn lt(&self, other: &i32) -> bool

fn le(&self, other: &i32) -> bool

fn ge(&self, other: &i32) -> bool

fn gt(&self, other: &i32) -> bool

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

fn partial_cmp(&self, other: &(A, B, C)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C)) -> bool

fn le(&self, other: &(A, B, C)) -> bool

fn ge(&self, other: &(A, B, C)) -> bool

fn gt(&self, other: &(A, B, C)) -> bool

impl PartialOrd<NonZeroI8> for NonZeroI8

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

fn lt(&self, other: &NonZeroI8) -> bool

fn le(&self, other: &NonZeroI8) -> bool

fn gt(&self, other: &NonZeroI8) -> bool

fn ge(&self, other: &NonZeroI8) -> bool

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

fn partial_cmp(&self, other: &fn(A, B) -> Ret) -> Option<Ordering>

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

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

impl PartialOrd<CpuidResult> for CpuidResult

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

fn lt(&self, other: &CpuidResult) -> bool

fn le(&self, other: &CpuidResult) -> bool

fn gt(&self, other: &CpuidResult) -> bool

fn ge(&self, other: &CpuidResult) -> bool

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

fn partial_cmp(&self, other: &extern "C" fn() -> Ret) -> Option<Ordering>

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

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

fn lt(&self, other: &*const T) -> bool

fn le(&self, other: &*const T) -> bool

fn gt(&self, other: &*const T) -> bool

fn ge(&self, other: &*const T) -> bool

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

fn partial_cmp(&self, other: &unsafe fn(A, B) -> Ret) -> Option<Ordering>

impl PartialOrd<NonZeroU8> for NonZeroU8

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

fn lt(&self, other: &NonZeroU8) -> bool

fn le(&self, other: &NonZeroU8) -> bool

fn gt(&self, other: &NonZeroU8) -> bool

fn ge(&self, other: &NonZeroU8) -> bool

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

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

impl PartialOrd<PhantomPinned> for PhantomPinned

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

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C, ...) -> Ret
) -> Option<Ordering>

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A, ...) -> Ret
) -> Option<Ordering>

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

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

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

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

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

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

impl PartialOrd<Duration> for Duration

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

fn lt(&self, other: &Duration) -> bool

fn le(&self, other: &Duration) -> bool

fn gt(&self, other: &Duration) -> bool

fn ge(&self, other: &Duration) -> bool

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

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

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

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

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

fn lt(&self, other: &(A,)) -> bool

fn le(&self, other: &(A,)) -> bool

fn ge(&self, other: &(A,)) -> bool

fn gt(&self, other: &(A,)) -> bool

impl PartialOrd<NonZeroU128> for NonZeroU128

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

fn lt(&self, other: &NonZeroU128) -> bool

fn le(&self, other: &NonZeroU128) -> bool

fn gt(&self, other: &NonZeroU128) -> bool

fn ge(&self, other: &NonZeroU128) -> bool

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

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

impl PartialOrd<str> for str

Implements comparison operations on strings.

Strings are compared lexicographically by their byte values. This compares 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. Comparing strings according to culturally-accepted standards requires locale-specific data that is outside the scope of the str type.

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

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

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

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

fn partial_cmp(&self, other: &Pin<Q>) -> Option<Ordering>

fn lt(&self, other: &Pin<Q>) -> bool

fn le(&self, other: &Pin<Q>) -> bool

fn gt(&self, other: &Pin<Q>) -> bool

fn ge(&self, other: &Pin<Q>) -> bool

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

fn partial_cmp(&self, other: &(A, B, C, D, E, F, G, H)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D, E, F, G, H)) -> bool

fn le(&self, other: &(A, B, C, D, E, F, G, H)) -> bool

fn ge(&self, other: &(A, B, C, D, E, F, G, H)) -> bool

fn gt(&self, other: &(A, B, C, D, E, F, G, H)) -> bool

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

fn partial_cmp(&self, other: &extern "C" fn(A, ...) -> Ret) -> Option<Ordering>

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

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

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

fn partial_cmp(&self, other: &extern "C" fn(A, B, C) -> Ret) -> Option<Ordering>

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

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

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

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

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

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

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

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

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

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

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

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

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

fn partial_cmp(
    &self,
    other: &unsafe fn(A, B, C, D, E, F) -> Ret
) -> Option<Ordering>

impl PartialOrd<NonZeroI128> for NonZeroI128

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

fn lt(&self, other: &NonZeroI128) -> bool

fn le(&self, other: &NonZeroI128) -> bool

fn gt(&self, other: &NonZeroI128) -> bool

fn ge(&self, other: &NonZeroI128) -> bool

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

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

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

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

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

fn partial_cmp(&self, other: &(A, B, C, D, E)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D, E)) -> bool

fn le(&self, other: &(A, B, C, D, E)) -> bool

fn ge(&self, other: &(A, B, C, D, E)) -> bool

fn gt(&self, other: &(A, B, C, D, E)) -> bool

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

fn partial_cmp(&self, other: &fn(A, B, C, D, E, F) -> Ret) -> Option<Ordering>

impl PartialOrd<NonZeroI16> for NonZeroI16

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

fn lt(&self, other: &NonZeroI16) -> bool

fn le(&self, other: &NonZeroI16) -> bool

fn gt(&self, other: &NonZeroI16) -> bool

fn ge(&self, other: &NonZeroI16) -> bool

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

fn partial_cmp(&self, other: &(A, B, C, D, E, F)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D, E, F)) -> bool

fn le(&self, other: &(A, B, C, D, E, F)) -> bool

fn ge(&self, other: &(A, B, C, D, E, F)) -> bool

fn gt(&self, other: &(A, B, C, D, E, F)) -> bool

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

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

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

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

impl PartialOrd<i128> for i128

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

fn lt(&self, other: &i128) -> bool

fn le(&self, other: &i128) -> bool

fn ge(&self, other: &i128) -> bool

fn gt(&self, other: &i128) -> bool

impl PartialOrd<i64> for i64

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

fn lt(&self, other: &i64) -> bool

fn le(&self, other: &i64) -> bool

fn ge(&self, other: &i64) -> bool

fn gt(&self, other: &i64) -> bool

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

fn partial_cmp(
    &self,
    other: &fn(A, B, C, D, E, F, G) -> Ret
) -> Option<Ordering>

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

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

impl PartialOrd<NonZeroU64> for NonZeroU64

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

fn lt(&self, other: &NonZeroU64) -> bool

fn le(&self, other: &NonZeroU64) -> bool

fn gt(&self, other: &NonZeroU64) -> bool

fn ge(&self, other: &NonZeroU64) -> bool

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

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

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

fn partial_cmp(
    &self,
    other: &unsafe extern "C" fn(A, B, C) -> Ret
) -> Option<Ordering>

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

fn partial_cmp(&self, other: &unsafe extern "C" fn() -> Ret) -> Option<Ordering>

impl PartialOrd<TypeId> for TypeId

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

fn lt(&self, other: &TypeId) -> bool

fn le(&self, other: &TypeId) -> bool

fn gt(&self, other: &TypeId) -> bool

fn ge(&self, other: &TypeId) -> bool

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

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

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

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

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

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

impl PartialOrd<f64> for f64

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

fn lt(&self, other: &f64) -> bool

fn le(&self, other: &f64) -> bool

fn ge(&self, other: &f64) -> bool

fn gt(&self, other: &f64) -> bool

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

fn partial_cmp(&self, other: &(A, B)) -> Option<Ordering>

fn lt(&self, other: &(A, B)) -> bool

fn le(&self, other: &(A, B)) -> bool

fn ge(&self, other: &(A, B)) -> bool

fn gt(&self, other: &(A, B)) -> bool

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

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

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

fn partial_cmp(&self, other: &extern "C" fn(A) -> Ret) -> Option<Ordering>

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

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

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

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

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

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

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

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

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

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

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

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

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

fn partial_cmp(&self, other: &unsafe fn(A, B, C, D) -> Ret) -> Option<Ordering>

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

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

impl<T> PartialOrd<Box<T>> for Box<T> where
    T: PartialOrd<T> + ?Sized, 

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

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

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

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

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

impl<'a, B> PartialOrd<Cow<'a, B>> for Cow<'a, B> where
    B: PartialOrd<B> + ToOwned + ?Sized, 

fn partial_cmp(&self, other: &Cow<'a, B>) -> Option<Ordering>

impl PartialOrd<String> for String

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

fn lt(&self, other: &String) -> bool

fn le(&self, other: &String) -> bool

fn gt(&self, other: &String) -> bool

fn ge(&self, other: &String) -> bool

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

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

Partial comparison for two Arcs.

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

Examples

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

let five = Arc::new(5);

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

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

Less-than comparison for two Arcs.

The two are compared by calling < on their inner values.

Examples

use std::sync::Arc;

let five = Arc::new(5);

assert!(five < Arc::new(6));

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

'Less than or equal to' comparison for two Arcs.

The two are compared by calling <= on their inner values.

Examples

use std::sync::Arc;

let five = Arc::new(5);

assert!(five <= Arc::new(5));

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

Greater-than comparison for two Arcs.

The two are compared by calling > on their inner values.

Examples

use std::sync::Arc;

let five = Arc::new(5);

assert!(five > Arc::new(4));

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

'Greater than or equal to' comparison for two Arcs.

The two are compared by calling >= on their inner values.

Examples

use std::sync::Arc;

let five = Arc::new(5);

assert!(five >= Arc::new(5));

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

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

Partial comparison for two Rcs.

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

Examples

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

let five = Rc::new(5);

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

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

Less-than comparison for two Rcs.

The two are compared by calling < on their inner values.

Examples

use std::rc::Rc;

let five = Rc::new(5);

assert!(five < Rc::new(6));

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

'Less than or equal to' comparison for two Rcs.

The two are compared by calling <= on their inner values.

Examples

use std::rc::Rc;

let five = Rc::new(5);

assert!(five <= Rc::new(5));

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

Greater-than comparison for two Rcs.

The two are compared by calling > on their inner values.

Examples

use std::rc::Rc;

let five = Rc::new(5);

assert!(five > Rc::new(4));

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

'Greater than or equal to' comparison for two Rcs.

The two are compared by calling >= on their inner values.

Examples

use std::rc::Rc;

let five = Rc::new(5);

assert!(five >= Rc::new(5));

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

Implements comparison of vectors, lexicographically.

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

impl PartialOrd<Greater> for Greater

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

impl PartialOrd<Z0> for Z0

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

impl PartialOrd<UTerm> for UTerm

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

impl PartialOrd<ATerm> for ATerm

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

impl PartialOrd<B1> for B1

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

impl<U> PartialOrd<PInt<U>> for PInt<U> where
    U: NonZero + Unsigned + PartialOrd<U>, 

fn partial_cmp(&self, other: &PInt<U>) -> Option<Ordering>

fn lt(&self, other: &PInt<U>) -> bool

fn le(&self, other: &PInt<U>) -> bool

fn gt(&self, other: &PInt<U>) -> bool

fn ge(&self, other: &PInt<U>) -> bool

impl PartialOrd<Less> for Less

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

impl<U, B> PartialOrd<UInt<U, B>> for UInt<U, B> where
    B: PartialOrd<B>,
    U: PartialOrd<U>, 

fn partial_cmp(&self, other: &UInt<U, B>) -> Option<Ordering>

fn lt(&self, other: &UInt<U, B>) -> bool

fn le(&self, other: &UInt<U, B>) -> bool

fn gt(&self, other: &UInt<U, B>) -> bool

fn ge(&self, other: &UInt<U, B>) -> bool

impl<V, A> PartialOrd<TArr<V, A>> for TArr<V, A> where
    A: PartialOrd<A>,
    V: PartialOrd<V>, 

fn partial_cmp(&self, other: &TArr<V, A>) -> Option<Ordering>

fn lt(&self, other: &TArr<V, A>) -> bool

fn le(&self, other: &TArr<V, A>) -> bool

fn gt(&self, other: &TArr<V, A>) -> bool

fn ge(&self, other: &TArr<V, A>) -> bool

impl<U> PartialOrd<NInt<U>> for NInt<U> where
    U: NonZero + Unsigned + PartialOrd<U>, 

fn partial_cmp(&self, other: &NInt<U>) -> Option<Ordering>

fn lt(&self, other: &NInt<U>) -> bool

fn le(&self, other: &NInt<U>) -> bool

fn gt(&self, other: &NInt<U>) -> bool

fn ge(&self, other: &NInt<U>) -> bool

impl PartialOrd<Equal> for Equal

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

impl PartialOrd<B0> for B0

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

impl<T> PartialOrd<ModInt<T>> for i8 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for i16 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for i32 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for i64 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for u8 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for u16 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for u32 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for u64 where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for isize where
    T: PrimInt, 

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

impl<T> PartialOrd<ModInt<T>> for usize where
    T: PrimInt, 

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

Loading content...

Implementors

impl PartialOrd<Sign> for Sign

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

impl PartialOrd<Ordering> for Ordering

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

impl PartialOrd<BigInt> for BigInt

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

impl PartialOrd<BigUint> for BigUint

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

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

fn partial_cmp(&self, other: &VecDeque<A>) -> Option<Ordering>

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

fn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering>

impl<L, R> PartialOrd<Either<L, R>> for Either<L, R> where
    L: PartialOrd<L>,
    R: PartialOrd<R>, 

fn partial_cmp(&self, other: &Either<L, R>) -> Option<Ordering>

fn lt(&self, other: &Either<L, R>) -> bool

fn le(&self, other: &Either<L, R>) -> bool

fn gt(&self, other: &Either<L, R>) -> bool

fn ge(&self, other: &Either<L, R>) -> bool

impl<T> PartialOrd<Ratio<T>> for Ratio<T> where
    T: Clone + Integer, 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<T> PartialOrd<T> for ModInt<T> where
    T: PrimInt, 

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

impl<T: PartialOrd> PartialOrd<ModInt<T>> for ModInt<T>

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

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

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

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

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

impl<T: PartialOrd> PartialOrd<Total<T>> for Total<T>

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

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

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

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

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

Loading content...