Trait std::cmp::PartialOrd

1.0.0 · source ·
pub trait PartialOrd<Rhs = Self>: PartialEq<Rhs>where
    Rhs: ?Sized,{
    // Required method
    fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>;

    // Provided methods
    fn lt(&self, other: &Rhs) -> bool { ... }
    fn le(&self, other: &Rhs) -> bool { ... }
    fn gt(&self, other: &Rhs) -> bool { ... }
    fn ge(&self, other: &Rhs) -> bool { ... }
}
Expand description

Trait for types that form a partial order.

The lt, le, gt, and ge methods of this trait can be called using the <, <=, >, and >= operators, respectively.

The methods of this trait must be consistent with each other and with those of PartialEq. The following conditions must hold:

  1. a == b if and only if partial_cmp(a, b) == Some(Equal).
  2. a < b if and only if partial_cmp(a, b) == Some(Less)
  3. a > b if and only if partial_cmp(a, b) == Some(Greater)
  4. a <= b if and only if a < b || a == b
  5. a >= b if and only if a > b || a == b
  6. a != b if and only if !(a == b).

Conditions 2–5 above are ensured by the default implementation. Condition 6 is already ensured by PartialEq.

If Ord is also implemented for Self and Rhs, it must also be consistent with partial_cmp (see the documentation of that trait for the exact requirements). It’s easy to accidentally make them disagree by deriving some of the traits and manually implementing others.

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

  • transitivity: a < b and b < c implies a < c. The same must hold for both == and >.
  • duality: a < b if and only if b > a.

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

Violating these requirements is a logic error. The behavior resulting from a logic error is not specified, but users of the trait must ensure that such logic errors do not result in undefined behavior. This means that unsafe code must not rely on the correctness of these methods.

Corollaries

The following corollaries follow from the above requirements:

  • irreflexivity of < and >: !(a < a), !(a > a)
  • transitivity of >: if a > b and b > c then a > c
  • duality of partial_cmp: partial_cmp(a, b) == partial_cmp(b, a).map(Ordering::reverse)

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 discriminants. By default, the discriminant is smallest for variants at the top, and largest for variants at the bottom. Here’s an example:

#[derive(PartialEq, PartialOrd)]
enum E {
    Top,
    Bottom,
}

assert!(E::Top < E::Bottom);
Run

However, manually setting the discriminants can override this default behavior:

#[derive(PartialEq, PartialOrd)]
enum E {
    Top = 2,
    Bottom = 1,
}

assert!(E::Bottom < E::Top);
Run

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.

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: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

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

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

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
    }
}
Run

Examples

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

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

Required Methods§

source

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

When comparison is impossible:

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

Provided Methods§

source

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

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

Examples
assert_eq!(1.0 < 1.0, false);
assert_eq!(1.0 < 2.0, true);
assert_eq!(2.0 < 1.0, false);
Run
source

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
assert_eq!(1.0 <= 1.0, true);
assert_eq!(1.0 <= 2.0, true);
assert_eq!(2.0 <= 1.0, false);
Run
source

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

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

Examples
assert_eq!(1.0 > 1.0, false);
assert_eq!(1.0 > 2.0, false);
assert_eq!(2.0 > 1.0, true);
Run
source

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
assert_eq!(1.0 >= 1.0, true);
assert_eq!(1.0 >= 2.0, false);
assert_eq!(2.0 >= 1.0, true);
Run

Implementors§

source§

impl PartialOrd<AsciiChar> for AsciiChar

1.34.0 · source§

impl PartialOrd<Infallible> for Infallible

source§

impl PartialOrd<ErrorKind> for ErrorKind

1.7.0 · source§

impl PartialOrd<IpAddr> for IpAddr

1.16.0 · source§

impl PartialOrd<IpAddr> for Ipv4Addr

1.16.0 · source§

impl PartialOrd<IpAddr> for Ipv6Addr

source§

impl PartialOrd<SocketAddr> for SocketAddr

source§

impl PartialOrd<Which> for Which

source§

impl PartialOrd<Ordering> for Ordering

source§

impl PartialOrd<bool> for bool

source§

impl PartialOrd<char> for char

source§

impl PartialOrd<f32> for f32

source§

impl PartialOrd<f64> for f64

source§

impl PartialOrd<i8> for i8

source§

impl PartialOrd<i16> for i16

source§

impl PartialOrd<i32> for i32

source§

impl PartialOrd<i64> for i64

source§

impl PartialOrd<i128> for i128

source§

impl PartialOrd<isize> for isize

source§

impl PartialOrd<!> for !

source§

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.

source§

impl PartialOrd<str> for OsStr

source§

impl PartialOrd<str> for OsString

source§

impl PartialOrd<u8> for u8

source§

impl PartialOrd<u16> for u16

source§

impl PartialOrd<u32> for u32

source§

impl PartialOrd<u64> for u64

source§

impl PartialOrd<u128> for u128

source§

impl PartialOrd<()> for ()

source§

impl PartialOrd<usize> for usize

1.27.0 · source§

impl PartialOrd<CpuidResult> for CpuidResult

source§

impl PartialOrd<TypeId> for TypeId

source§

impl PartialOrd<CStr> for CStr

1.64.0 · source§

impl PartialOrd<CString> for CString

source§

impl PartialOrd<OsStr> for OsStr

1.8.0 · source§

impl PartialOrd<OsStr> for Path

1.8.0 · source§

impl PartialOrd<OsStr> for PathBuf

source§

impl PartialOrd<OsString> for OsString

1.8.0 · source§

impl PartialOrd<OsString> for Path

1.8.0 · source§

impl PartialOrd<OsString> for PathBuf

source§

impl PartialOrd<Error> for Error

1.33.0 · source§

impl PartialOrd<PhantomPinned> for PhantomPinned

1.16.0 · source§

impl PartialOrd<Ipv4Addr> for IpAddr

source§

impl PartialOrd<Ipv4Addr> for Ipv4Addr

1.16.0 · source§

impl PartialOrd<Ipv6Addr> for IpAddr

source§

impl PartialOrd<Ipv6Addr> for Ipv6Addr

1.45.0 · source§

impl PartialOrd<SocketAddrV4> for SocketAddrV4

1.45.0 · source§

impl PartialOrd<SocketAddrV6> for SocketAddrV6

1.34.0 · source§

impl PartialOrd<NonZeroI8> for NonZeroI8

1.34.0 · source§

impl PartialOrd<NonZeroI16> for NonZeroI16

1.34.0 · source§

impl PartialOrd<NonZeroI32> for NonZeroI32

1.34.0 · source§

impl PartialOrd<NonZeroI64> for NonZeroI64

1.34.0 · source§

impl PartialOrd<NonZeroI128> for NonZeroI128

1.34.0 · source§

impl PartialOrd<NonZeroIsize> for NonZeroIsize

1.28.0 · source§

impl PartialOrd<NonZeroU8> for NonZeroU8

1.28.0 · source§

impl PartialOrd<NonZeroU16> for NonZeroU16

1.28.0 · source§

impl PartialOrd<NonZeroU32> for NonZeroU32

1.28.0 · source§

impl PartialOrd<NonZeroU64> for NonZeroU64

1.28.0 · source§

impl PartialOrd<NonZeroU128> for NonZeroU128

1.28.0 · source§

impl PartialOrd<NonZeroUsize> for NonZeroUsize

1.8.0 · source§

impl PartialOrd<Path> for OsStr

1.8.0 · source§

impl PartialOrd<Path> for OsString

source§

impl PartialOrd<Path> for Path

1.8.0 · source§

impl PartialOrd<Path> for PathBuf

1.8.0 · source§

impl PartialOrd<PathBuf> for OsStr

1.8.0 · source§

impl PartialOrd<PathBuf> for OsString

1.8.0 · source§

impl PartialOrd<PathBuf> for Path

source§

impl PartialOrd<PathBuf> for PathBuf

const: unstable · source§

impl PartialOrd<Alignment> for Alignment

source§

impl PartialOrd<String> for String

1.3.0 · source§

impl PartialOrd<Duration> for Duration

1.8.0 · source§

impl PartialOrd<Instant> for Instant

1.8.0 · source§

impl PartialOrd<SystemTime> for SystemTime

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

source§

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

source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.10.0 · source§

impl<'a> PartialOrd<Location<'a>> for Location<'a>

source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

1.8.0 · source§

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

source§

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

source§

impl<A, B> PartialOrd<&B> for &Awhere A: PartialOrd<B> + ?Sized, B: ?Sized,

source§

impl<A, B> PartialOrd<&mut B> for &mut Awhere A: PartialOrd<B> + ?Sized, B: ?Sized,

source§

impl<Dyn> PartialOrd<DynMetadata<Dyn>> for DynMetadata<Dyn>where Dyn: ?Sized,

1.4.0 · source§

impl<F> PartialOrd<F> for Fwhere F: FnPtr,

source§

impl<K, V, A> PartialOrd<BTreeMap<K, V, A>> for BTreeMap<K, V, A>where K: PartialOrd<K>, V: PartialOrd<V>, A: Allocator + Clone,

1.41.0 · source§

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

source§

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

1.36.0 · source§

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

source§

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

source§

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

source§

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

Implements comparison of vectors lexicographically.

source§

impl<T> PartialOrd<(T,)> for (T₁, T₂, …, Tₙ)where T: PartialOrd<T> + ?Sized,

This trait is implemented for tuples up to twelve items long.

1.10.0 · source§

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

1.10.0 · source§

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

source§

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

1.20.0 · source§

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

1.74.0 · source§

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

source§

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

1.25.0 · source§

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

1.19.0 · source§

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

source§

impl<T, A1, A2> PartialOrd<Vec<T, A2>> for Vec<T, A1>where T: PartialOrd<T>, A1: Allocator, A2: Allocator,

Implements comparison of vectors, lexicographically.

source§

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

source§

impl<T, A> PartialOrd<BTreeSet<T, A>> for BTreeSet<T, A>where T: PartialOrd<T>, A: Allocator + Clone,

source§

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

source§

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

source§

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

source§

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

source§

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

source§

impl<T, const LANES: usize> PartialOrd<Mask<T, LANES>> for Mask<T, LANES>where T: MaskElement + PartialOrd<T>, LaneCount<LANES>: SupportedLaneCount,

source§

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

source§

impl<T, const N: usize> PartialOrd<Simd<T, N>> for Simd<T, N>where LaneCount<N>: SupportedLaneCount, T: SimdElement + PartialOrd<T>,

source§

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