Trait sp_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 relations must satisfy the following conditions (for all a, b, c of type A, B, C):

  • Transitivity: if A: PartialOrd<B> and B: PartialOrd<C> and A: PartialOrd<C>, then a < b and b < c implies a < c. The same must hold for both == and >. This must also work for longer chains, such as when A: PartialOrd<B>, B: PartialOrd<C>, C: PartialOrd<D>, and A: PartialOrd<D> all exist.
  • Duality: if A: PartialOrd<B> and B: PartialOrd<A>, then a < b if and only if b > a.

Note that the B: PartialOrd<A> (dual) and A: PartialOrd<C> (transitive) impls are not forced to exist, but these requirements apply whenever they do exist.

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.

§Cross-crate considerations

Upholding the requirements stated above can become tricky when one crate implements PartialOrd for a type of another crate (i.e., to allow comparing one of its own types with a type from the standard library). The recommendation is to never implement this trait for a foreign type. In other words, such a crate should do impl PartialOrd<ForeignType> for LocalType, but it should not do impl PartialOrd<LocalType> for ForeignType.

This avoids the problem of transitive chains that criss-cross crate boundaries: for all local types T, you may assume that no other crate will add impls that allow comparing T < U. In other words, if other crates add impls that allow building longer transitive chains U1 < ... < T < V1 < ..., then all the types that appear to the right of T must be types that the crate defining T already knows about. This rules out transitive chains where downstream crates can add new impls that “stitch together” comparisons of foreign types in ways that violate transitivity.

Not having such foreign impls also avoids forward compatibility issues where one crate adding more PartialOrd implementations can cause build failures in downstream crates.

§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)

§Strict and non-strict partial orders

The < and > operators behave according to a strict partial order. However, <= and >= do not behave according to a non-strict partial order. That is because mathematically, a non-strict partial order would require reflexivity, i.e. a <= a would need to be true for every a. This isn’t always the case for types that implement PartialOrd, for example:

let a = f64::sqrt(-1.0);
assert_eq!(a <= a, false);

§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 primarily ordered by their discriminants. Secondarily, they are ordered by their fields. 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);

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

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

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

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

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§

1.0.0 · 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));

When comparison is impossible:

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

Provided Methods§

1.0.0 · 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);
1.0.0 · 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);
1.0.0 · 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);
1.0.0 · 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);

Implementors§

1.34.0 · source§

impl PartialOrd for Infallible

1.0.0 · source§

impl PartialOrd for Ordering

source§

impl PartialOrd for AsciiChar

1.7.0 · source§

impl PartialOrd for IpAddr

1.0.0 · source§

impl PartialOrd for SocketAddr

1.0.0 · source§

impl PartialOrd for ErrorKind

1.0.0 · source§

impl PartialOrd for bool

1.0.0 · source§

impl PartialOrd for char

1.0.0 · source§

impl PartialOrd for f16

1.0.0 · source§

impl PartialOrd for f32

1.0.0 · source§

impl PartialOrd for f64

1.0.0 · source§

impl PartialOrd for f128

1.0.0 · source§

impl PartialOrd for i8

1.0.0 · source§

impl PartialOrd for i16

1.0.0 · source§

impl PartialOrd for i32

1.0.0 · source§

impl PartialOrd for i64

1.0.0 · source§

impl PartialOrd for i128

1.0.0 · source§

impl PartialOrd for isize

source§

impl PartialOrd for !

1.0.0 · source§

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

1.0.0 · source§

impl PartialOrd for u8

1.0.0 · source§

impl PartialOrd for u16

1.0.0 · source§

impl PartialOrd for u32

1.0.0 · source§

impl PartialOrd for u64

1.0.0 · source§

impl PartialOrd for u128

1.0.0 · source§

impl PartialOrd for ()

1.0.0 · source§

impl PartialOrd for usize

1.0.0 · source§

impl PartialOrd for TypeId

1.0.0 · source§

impl PartialOrd for Error

1.33.0 · source§

impl PartialOrd for PhantomPinned

source§

impl PartialOrd for Alignment

1.3.0 · source§

impl PartialOrd for Duration

1.64.0 · source§

impl PartialOrd for CString

1.0.0 · source§

impl PartialOrd for String

1.27.0 · source§

impl PartialOrd for CpuidResult

1.0.0 · source§

impl PartialOrd for CStr

1.0.0 · source§

impl PartialOrd for Ipv4Addr

1.0.0 · source§

impl PartialOrd for Ipv6Addr

1.0.0 · source§

impl PartialOrd for SocketAddrV4

1.0.0 · source§

impl PartialOrd for SocketAddrV6

1.0.0 · source§

impl PartialOrd for OsStr

1.0.0 · source§

impl PartialOrd for OsString

1.0.0 · source§

impl PartialOrd for Path

1.0.0 · source§

impl PartialOrd for PathBuf

1.8.0 · source§

impl PartialOrd for Instant

1.8.0 · source§

impl PartialOrd for SystemTime

1.16.0 · source§

impl PartialOrd<IpAddr> for Ipv4Addr

1.16.0 · source§

impl PartialOrd<IpAddr> for Ipv6Addr

1.0.0 · source§

impl PartialOrd<str> for OsStr

1.0.0 · source§

impl PartialOrd<str> for OsString

1.16.0 · source§

impl PartialOrd<Ipv4Addr> for IpAddr

1.16.0 · source§

impl PartialOrd<Ipv6Addr> for IpAddr

1.8.0 · source§

impl PartialOrd<OsStr> for Path

1.8.0 · source§

impl PartialOrd<OsStr> for PathBuf

1.8.0 · source§

impl PartialOrd<OsString> for Path

1.8.0 · source§

impl PartialOrd<OsString> for PathBuf

1.8.0 · source§

impl PartialOrd<Path> for OsStr

1.8.0 · source§

impl PartialOrd<Path> for OsString

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

1.0.0 · source§

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

1.0.0 · source§

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

1.10.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

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

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

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

source§

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

1.4.0 · source§

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

1.0.0 · source§

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

1.41.0 · source§

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

1.0.0 · source§

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

1.36.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

Implements comparison of slices lexicographically.

1.0.0 · source§

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

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

1.10.0 · source§

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

1.10.0 · source§

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

1.0.0 · source§

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

1.20.0 · source§

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

1.28.0 · source§

impl<T> PartialOrd for NonZero<T>

1.74.0 · source§

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

1.0.0 · source§

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

1.25.0 · source§

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

1.19.0 · source§

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

1.0.0 · source§

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

Implements comparison of vectors, lexicographically.

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

Implements comparison of arrays lexicographically.

source§

impl<T, const N: usize> PartialOrd for Mask<T, N>

source§

impl<T, const N: usize> PartialOrd for Simd<T, N>

source§

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

impl PartialOrd for Error

impl<T: PartialOrd, A: Allocator> PartialOrd for Vec<T, A>

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

impl PartialOrd for Color

impl PartialOrd for Reset

impl PartialOrd for Style

impl<T, const CAP: usize> PartialOrd for ArrayVec<T, CAP>
where T: PartialOrd,

impl<const CAP: usize> PartialOrd for ArrayString<CAP>

impl<const CAP: usize> PartialOrd<str> for ArrayString<CAP>

impl<const CAP: usize> PartialOrd<ArrayString<CAP>> for str

impl PartialOrd for Hash

impl PartialOrd for Hash

impl PartialOrd for Hash

impl PartialOrd for Hash

impl PartialOrd for Hash

impl PartialOrd for Hash

impl PartialOrd for Hash

impl PartialOrd for Hash

impl<T: Tag> PartialOrd for Hash<T>

impl<T: PartialOrd + Hash> PartialOrd for Hmac<T>

impl PartialOrd for Lsb0

impl PartialOrd for Msb0

impl<'a, O1, O2, T1, T2> PartialOrd<BitBox<T2, O2>> for &'a BitSlice<T1, O1>
where O1: BitOrder, O2: BitOrder, T1: BitStore, T2: BitStore,

impl<'a, O1, O2, T1, T2> PartialOrd<BitBox<T2, O2>> for &'a mut BitSlice<T1, O1>
where O1: BitOrder, O2: BitOrder, T1: BitStore, T2: BitStore,

impl<'a, T, O> PartialOrd for IterOnes<'a, T, O>
where T: 'a + BitStore + PartialOrd, O: BitOrder + PartialOrd,

impl<'a, T, O> PartialOrd for IterZeros<'a, T, O>
where T: 'a + BitStore + PartialOrd, O: BitOrder + PartialOrd,

impl<'a, T1, T2, O1, O2> PartialOrd<BitVec<T2, O2>> for &'a BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<'a, T1, T2, O1, O2> PartialOrd<BitVec<T2, O2>> for &'a mut BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<A, O, Rhs> PartialOrd<Rhs> for BitArray<A, O>
where A: BitViewSized, O: BitOrder, Rhs: ?Sized, BitSlice<A::Store, O>: PartialOrd<Rhs>,

impl<A, T, O> PartialOrd<BitArray<A, O>> for BitSlice<T, O>
where A: BitViewSized, T: BitStore, O: BitOrder,

impl<M, T, O> PartialOrd<&bool> for BitRef<'_, M, T, O>
where M: Mutability, T: BitStore, O: BitOrder,

impl<M, T, O> PartialOrd<bool> for BitRef<'_, M, T, O>
where M: Mutability, T: BitStore, O: BitOrder,

impl<M1, M2, O1, O2, T1, T2> PartialOrd<BitRef<'_, M2, T2, O2>> for BitRef<'_, M1, T1, O1>
where M1: Mutability, M2: Mutability, T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<M1, M2, T1, T2, O> PartialOrd<BitPtr<M2, T2, O>> for BitPtr<M1, T1, O>
where M1: Mutability, M2: Mutability, T1: BitStore, T2: BitStore, O: BitOrder,

impl<O1, O2, T1, T2> PartialOrd<BitBox<T2, O2>> for BitSlice<T1, O1>
where O1: BitOrder, O2: BitOrder, T1: BitStore, T2: BitStore,

impl<R> PartialOrd for BitEnd<R>

impl<R> PartialOrd for BitIdx<R>

impl<R> PartialOrd for BitIdxError<R>

impl<R> PartialOrd for BitMask<R>

impl<R> PartialOrd for BitPos<R>

impl<R> PartialOrd for BitSel<R>

impl<T> PartialOrd for BitPtrError<T>
where T: BitStore + PartialOrd,

impl<T> PartialOrd for BitSpanError<T>
where T: BitStore + PartialOrd,

impl<T, O, Rhs> PartialOrd<Rhs> for BitBox<T, O>
where T: BitStore, O: BitOrder, Rhs: ?Sized + PartialOrd<BitSlice<T, O>>,

impl<T, O, Rhs> PartialOrd<Rhs> for BitVec<T, O>
where T: BitStore, O: BitOrder, Rhs: ?Sized + PartialOrd<BitSlice<T, O>>,

impl<T1, T2, O1, O2> PartialOrd<&BitSlice<T2, O2>> for &mut BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<&BitSlice<T2, O2>> for BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<&mut BitSlice<T2, O2>> for &BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<&mut BitSlice<T2, O2>> for BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<BitSlice<T2, O2>> for &BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<BitSlice<T2, O2>> for &mut BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<BitSlice<T2, O2>> for BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<T1, T2, O1, O2> PartialOrd<BitVec<T2, O2>> for BitSlice<T1, O1>
where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,

impl<'a, T, BoundSelf, BoundRhs> PartialOrd<BoundedSlice<'a, T, BoundRhs>> for BoundedSlice<'a, T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<'a, T, BoundSelf, BoundRhs> PartialOrd<BoundedSlice<'a, T, BoundRhs>> for BoundedVec<T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<'a, T, BoundSelf, BoundRhs> PartialOrd<BoundedSlice<'a, T, BoundRhs>> for WeakBoundedVec<T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<'a, T, BoundSelf, BoundRhs> PartialOrd<BoundedVec<T, BoundRhs>> for BoundedSlice<'a, T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<'a, T, BoundSelf, BoundRhs> PartialOrd<WeakBoundedVec<T, BoundRhs>> for BoundedSlice<'a, T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<K, V, S> PartialOrd for BoundedBTreeMap<K, V, S>
where BTreeMap<K, V>: PartialOrd, S: Get<u32>,

impl<T, BoundSelf, BoundRhs> PartialOrd<BoundedVec<T, BoundRhs>> for BoundedVec<T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<T, BoundSelf, BoundRhs> PartialOrd<BoundedVec<T, BoundRhs>> for WeakBoundedVec<T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<T, BoundSelf, BoundRhs> PartialOrd<WeakBoundedVec<T, BoundRhs>> for BoundedVec<T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<T, BoundSelf, BoundRhs> PartialOrd<WeakBoundedVec<T, BoundRhs>> for WeakBoundedVec<T, BoundSelf>
where T: PartialOrd, BoundSelf: Get<u32>, BoundRhs: Get<u32>,

impl<T, S> PartialOrd for BoundedBTreeSet<T, S>
where BTreeSet<T>: PartialOrd, S: Get<u32>,

impl<T: PartialOrd, const L: usize, const U: usize> PartialOrd for BoundedVec<T, L, U>

impl PartialOrd for Bytes

impl PartialOrd<str> for Bytes

impl PartialOrd<Bytes> for &str

impl PartialOrd<Bytes> for &[u8]

impl PartialOrd<Bytes> for str

impl PartialOrd<Bytes> for Vec<u8>

impl PartialOrd<Bytes> for [u8]

impl PartialOrd<BytesMut> for &[u8]

impl PartialOrd<BytesMut> for [u8]

impl PartialOrd<Vec<u8>> for Bytes

impl PartialOrd<[u8]> for Bytes

impl PartialOrd<[u8]> for BytesMut

impl<'a, T: ?Sized> PartialOrd<&'a T> for Bytes
where Bytes: PartialOrd<T>,

impl<'a, T: ?Sized> PartialOrd<&'a T> for BytesMut
where BytesMut: PartialOrd<T>,

impl PartialOrd for Func

impl PartialOrd for Abi

impl PartialOrd for Arch

impl PartialOrd for Env

impl PartialOrd for Os

impl PartialOrd for Panic

impl PartialOrd for Month

impl PartialOrd for Days

impl<Tz: TimeZone> PartialOrd for Date<Tz>

impl<Tz: TimeZone, Tz2: TimeZone> PartialOrd<DateTime<Tz2>> for DateTime<Tz>

impl<const S: usize> PartialOrd for Cid<S>

impl PartialOrd for Arg

impl PartialOrd for OsStr

impl PartialOrd for Str

impl PartialOrd for Id

impl<'s> PartialOrd for ParsedArg<'s>

impl PartialOrd for Error

impl PartialOrd for Block

impl PartialOrd for Inst

impl PartialOrd for Table

impl PartialOrd for Value

impl PartialOrd for Gpr

impl PartialOrd for Xmm

impl PartialOrd for Reg

impl PartialOrd for Heap

impl<'g, T: ?Sized + Pointable> PartialOrd for Shared<'g, T>

impl PartialOrd for Limb

impl<T: PartialOrd + Zero> PartialOrd for NonZero<T>

impl<const LIMBS: usize> PartialOrd for Uint<LIMBS>

impl PartialOrd for Class

impl PartialOrd for Tag

impl PartialOrd for Any

impl PartialOrd for Int

impl PartialOrd for Null

impl PartialOrd for Uint

impl<'a> PartialOrd for AnyRef<'a>

impl<'a> PartialOrd for BitStringRef<'a>

impl<'a> PartialOrd for Ia5StringRef<'a>

impl<'a> PartialOrd for IntRef<'a>

impl<'a> PartialOrd for OctetStringRef<'a>

impl<'a> PartialOrd for TeletexStringRef<'a>

impl<'a> PartialOrd for UintRef<'a>

impl<'a> PartialOrd for Utf8StringRef<'a>

impl<'a> PartialOrd for VideotexStringRef<'a>

impl<'a, T: PartialOrd> PartialOrd for ContextSpecificRef<'a, T>

impl<T> PartialOrd for SetOfVec<T>
where T: DerOrd + PartialOrd,

impl<T, const N: usize> PartialOrd for SetOf<T, N>
where T: DerOrd + PartialOrd,

impl<const MIN_A: i128, const MAX_A: i128, const MIN_B: i128, const MAX_B: i128> PartialOrd<OptionRangedI128<MIN_B, MAX_B>> for OptionRangedI128<MIN_A, MAX_A>

impl<const MIN_A: i128, const MAX_A: i128, const MIN_B: i128, const MAX_B: i128> PartialOrd<RangedI128<MIN_B, MAX_B>> for RangedI128<MIN_A, MAX_A>

impl<const MIN_A: i16, const MAX_A: i16, const MIN_B: i16, const MAX_B: i16> PartialOrd<OptionRangedI16<MIN_B, MAX_B>> for OptionRangedI16<MIN_A, MAX_A>

impl<const MIN_A: i16, const MAX_A: i16, const MIN_B: i16, const MAX_B: i16> PartialOrd<RangedI16<MIN_B, MAX_B>> for RangedI16<MIN_A, MAX_A>

impl<const MIN_A: i32, const MAX_A: i32, const MIN_B: i32, const MAX_B: i32> PartialOrd<OptionRangedI32<MIN_B, MAX_B>> for OptionRangedI32<MIN_A, MAX_A>

impl<const MIN_A: i32, const MAX_A: i32, const MIN_B: i32, const MAX_B: i32> PartialOrd<RangedI32<MIN_B, MAX_B>> for RangedI32<MIN_A, MAX_A>

impl<const MIN_A: i64, const MAX_A: i64, const MIN_B: i64, const MAX_B: i64> PartialOrd<OptionRangedI64<MIN_B, MAX_B>> for OptionRangedI64<MIN_A, MAX_A>

impl<const MIN_A: i64, const MAX_A: i64, const MIN_B: i64, const MAX_B: i64> PartialOrd<RangedI64<MIN_B, MAX_B>> for RangedI64<MIN_A, MAX_A>

impl<const MIN_A: i8, const MAX_A: i8, const MIN_B: i8, const MAX_B: i8> PartialOrd<OptionRangedI8<MIN_B, MAX_B>> for OptionRangedI8<MIN_A, MAX_A>

impl<const MIN_A: i8, const MAX_A: i8, const MIN_B: i8, const MAX_B: i8> PartialOrd<RangedI8<MIN_B, MAX_B>> for RangedI8<MIN_A, MAX_A>

impl<const MIN_A: isize, const MAX_A: isize, const MIN_B: isize, const MAX_B: isize> PartialOrd<OptionRangedIsize<MIN_B, MAX_B>> for OptionRangedIsize<MIN_A, MAX_A>

impl<const MIN_A: isize, const MAX_A: isize, const MIN_B: isize, const MAX_B: isize> PartialOrd<RangedIsize<MIN_B, MAX_B>> for RangedIsize<MIN_A, MAX_A>

impl<const MIN_A: u128, const MAX_A: u128, const MIN_B: u128, const MAX_B: u128> PartialOrd<OptionRangedU128<MIN_B, MAX_B>> for OptionRangedU128<MIN_A, MAX_A>

impl<const MIN_A: u128, const MAX_A: u128, const MIN_B: u128, const MAX_B: u128> PartialOrd<RangedU128<MIN_B, MAX_B>> for RangedU128<MIN_A, MAX_A>

impl<const MIN_A: u16, const MAX_A: u16, const MIN_B: u16, const MAX_B: u16> PartialOrd<OptionRangedU16<MIN_B, MAX_B>> for OptionRangedU16<MIN_A, MAX_A>

impl<const MIN_A: u16, const MAX_A: u16, const MIN_B: u16, const MAX_B: u16> PartialOrd<RangedU16<MIN_B, MAX_B>> for RangedU16<MIN_A, MAX_A>

impl<const MIN_A: u32, const MAX_A: u32, const MIN_B: u32, const MAX_B: u32> PartialOrd<OptionRangedU32<MIN_B, MAX_B>> for OptionRangedU32<MIN_A, MAX_A>

impl<const MIN_A: u32, const MAX_A: u32, const MIN_B: u32, const MAX_B: u32> PartialOrd<RangedU32<MIN_B, MAX_B>> for RangedU32<MIN_A, MAX_A>

impl<const MIN_A: u64, const MAX_A: u64, const MIN_B: u64, const MAX_B: u64> PartialOrd<OptionRangedU64<MIN_B, MAX_B>> for OptionRangedU64<MIN_A, MAX_A>

impl<const MIN_A: u64, const MAX_A: u64, const MIN_B: u64, const MAX_B: u64> PartialOrd<RangedU64<MIN_B, MAX_B>> for RangedU64<MIN_A, MAX_A>

impl<const MIN_A: u8, const MAX_A: u8, const MIN_B: u8, const MAX_B: u8> PartialOrd<OptionRangedU8<MIN_B, MAX_B>> for OptionRangedU8<MIN_A, MAX_A>

impl<const MIN_A: u8, const MAX_A: u8, const MIN_B: u8, const MAX_B: u8> PartialOrd<RangedU8<MIN_B, MAX_B>> for RangedU8<MIN_A, MAX_A>

impl<const MIN_A: usize, const MAX_A: usize, const MIN_B: usize, const MAX_B: usize> PartialOrd<OptionRangedUsize<MIN_B, MAX_B>> for OptionRangedUsize<MIN_A, MAX_A>

impl<const MIN_A: usize, const MAX_A: usize, const MIN_B: usize, const MAX_B: usize> PartialOrd<RangedUsize<MIN_B, MAX_B>> for RangedUsize<MIN_A, MAX_A>

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

impl<C> PartialOrd for ScalarPrimitive<C>
where C: Curve,

impl<T: PartialOrd> PartialOrd for Fragile<T>

impl<T: PartialOrd> PartialOrd for Sticky<T>

impl<AssetId: Ord> PartialOrd for NativeOrWithId<AssetId>

impl<T: PartialOrd, N> PartialOrd for GenericArray<T, N>
where N: ArrayLength<T>,

impl PartialOrd for DwAt

impl PartialOrd for DwAte

impl PartialOrd for DwCc

impl PartialOrd for DwCfa

impl PartialOrd for DwDs

impl PartialOrd for DwDsc

impl PartialOrd for DwEnd

impl PartialOrd for DwId

impl PartialOrd for DwIdx

impl PartialOrd for DwInl

impl PartialOrd for DwLle

impl PartialOrd for DwLne

impl PartialOrd for DwLns

impl PartialOrd for DwOp

impl PartialOrd for DwOrd

impl PartialOrd for DwRle

impl PartialOrd for DwTag

impl PartialOrd for DwUt

impl PartialOrd for DwVis

impl PartialOrd for Range

impl PartialOrd for Nanos

impl<K: Hash + Eq + PartialOrd, V: PartialOrd, S: BuildHasher> PartialOrd for LinkedHashMap<K, V, S>

impl PartialOrd for RData

impl PartialOrd for Label

impl PartialOrd for Name

impl PartialOrd for RrKey

impl<P> PartialOrd for NameServer<P>

impl<'a> PartialOrd<&'a str> for Authority

impl<'a> PartialOrd<&'a str> for PathAndQuery

impl<'a> PartialOrd<HeaderValue> for &'a str

impl<'a> PartialOrd<Authority> for &'a str

impl<'a> PartialOrd<PathAndQuery> for &'a str

impl<K: PartialOrd, V: PartialOrd> PartialOrd for Slice<K, V>

impl<T: PartialOrd> PartialOrd for Slice<T>

impl PartialOrd for IpNet

impl<'a> PartialOrd for Id<'a>

impl PartialOrd for Data

impl PartialOrd for Field

impl<K: Hash + Eq + PartialOrd, V: PartialOrd, S: BuildHasher> PartialOrd for LinkedHashMap<K, V, S>

impl<Storage: PartialOrd> PartialOrd for __BindgenBitfieldUnit<Storage>

impl PartialOrd for Level

impl<'a> PartialOrd for Metadata<'a>

impl<'a> PartialOrd for MetadataBuilder<'a>

impl PartialOrd for Token

impl PartialOrd for Delay

impl<const S: usize> PartialOrd for Multihash<S>

impl PartialOrd for Id

impl PartialOrd for OFlag

impl PartialOrd for Mode

impl PartialOrd for SFlag

impl PartialOrd for Pid

impl PartialOrd for Sign

impl<'a> PartialOrd for DecimalStr<'a>

impl<'a> PartialOrd for InfinityStr<'a>

impl<'a> PartialOrd for MinusSignStr<'a>

impl<'a> PartialOrd for NanStr<'a>

impl<'a> PartialOrd for PlusSignStr<'a>

impl<'a> PartialOrd for SeparatorStr<'a>

impl<T: PartialOrd + Float> PartialOrd for NotNan<T>

impl<T: Float> PartialOrd for OrderedFloat<T>

impl<Key: Ord, Value: Eq> PartialOrd for Operation<Key, Value>

impl<T: PartialOrd> PartialOrd for Compact<T>

impl<'a> PartialOrd for Ident<'a>

impl<'a> PartialOrd for Value<'a>

impl PartialOrd for Time

impl<'a, E: PartialOrd, Ix: PartialOrd + IndexType> PartialOrd for EdgeReference<'a, E, Ix>

impl<'b, T> PartialOrd for Ptr<'b, T>

impl<Ix> PartialOrd for EdgeIndex<Ix>
where Ix: IndexType + PartialOrd,

impl<Ix: PartialOrd> PartialOrd for EdgeIndex<Ix>

impl<Ix: PartialOrd> PartialOrd for NodeIndex<Ix>

impl PartialOrd for Id

impl PartialOrd for Gas

impl PartialOrd for Fd

impl<'a> PartialOrd for FdRef<'a>

impl<const LEFT_SIZE: usize, const RIGHT_SIZE: usize> PartialOrd<WriteBuffer<RIGHT_SIZE>> for WriteBuffer<LEFT_SIZE>

impl PartialOrd for H128

impl PartialOrd for H160

impl PartialOrd for H256

impl PartialOrd for H384

impl PartialOrd for H512

impl PartialOrd for H768

impl PartialOrd for U128

impl PartialOrd for U256

impl PartialOrd for U512

impl PartialOrd for Ident

impl PartialOrd for Block

impl PartialOrd for Inst

impl PartialOrd for PReg

impl PartialOrd for VReg

impl PartialOrd for Unit

impl PartialOrd for Span

impl PartialOrd for SetId

impl PartialOrd for Roles

impl PartialOrd for SeqID

impl<'a, T: PartialOrd + 'a> PartialOrd for Symbol<'a, T>

impl<T: PartialOrd + Form> PartialOrd for TypeDef<T>

impl<T: PartialOrd + Form> PartialOrd for Field<T>

impl<T: PartialOrd + Form> PartialOrd for Path<T>
where T::String: PartialOrd,

impl<T: PartialOrd + Form> PartialOrd for Type<T>
where T::String: PartialOrd,

impl<T: PartialOrd + Form> PartialOrd for Variant<T>
where T::String: PartialOrd,

impl<Size> PartialOrd for EncodedPoint<Size>
where Size: ModulusSize,

impl PartialOrd for All

impl PartialOrd for Error

impl<'buf> PartialOrd for AllPreallocated<'buf>

impl<'buf> PartialOrd for SignOnlyPreallocated<'buf>

impl<'buf> PartialOrd for VerifyOnlyPreallocated<'buf>

impl<Rhs> PartialOrd<Rhs> for ByteBuf
where Rhs: ?Sized + AsRef<[u8]>,

impl<Rhs> PartialOrd<Rhs> for Bytes
where Rhs: ?Sized + AsRef<[u8]>,

impl<Rhs, const N: usize> PartialOrd<Rhs> for ByteArray<N>
where Rhs: ?Sized + Borrow<[u8; N]>,

impl<const N: usize, const UPPERCASE: bool> PartialOrd for HexOrBin<N, UPPERCASE>

impl<const UPPERCASE: bool> PartialOrd for HexOrBin<UPPERCASE>

impl PartialOrd for SigId

impl<'s, T: PartialOrd + DiffableStr + ?Sized> PartialOrd for InlineChange<'s, T>

impl<T: PartialOrd> PartialOrd for Change<T>

impl<A: Array> PartialOrd for SmallVec<A>
where A::Item: PartialOrd,

impl PartialOrd for Data

impl<'a> PartialOrd for Incoming<'a>

impl<T: Into<u64> + Copy> PartialOrd<T> for Slot

impl PartialOrd for Bytes

impl<const N: usize, T> PartialOrd for CryptoBytes<N, T>

impl<T: PartialOrd, D: Get<T>> PartialOrd for TypeWithDefault<T, D>

impl<AccountId: PartialOrd, Balance: PartialOrd + HasCompact> PartialOrd for Exposure<AccountId, Balance>

impl<AccountId: PartialOrd, Balance: PartialOrd + HasCompact> PartialOrd for ExposurePage<AccountId, Balance>

impl<AccountId: PartialOrd, Balance: PartialOrd + HasCompact> PartialOrd for IndividualExposure<AccountId, Balance>

impl<T: Into<u64> + Copy> PartialOrd<T> for Timestamp

impl<Params: PartialOrd> PartialOrd for AlgorithmIdentifier<Params>

impl PartialOrd for Token

impl PartialOrd for Asset

impl<Interior: PartialOrd> PartialOrd for AncestorThen<Interior>

impl<Interior: PartialOrd> PartialOrd for AncestorThen<Interior>

impl<Interior: PartialOrd> PartialOrd for AncestorThen<Interior>

impl PartialOrd for Phase

impl PartialOrd for Width

impl PartialOrd for Date

impl PartialOrd for Time

impl<'s, T> PartialOrd for SliceVec<'s, T>
where T: PartialOrd,

impl<A: Array> PartialOrd for TinyVec<A>
where A::Item: PartialOrd,

impl<A: Array> PartialOrd for ArrayVec<A>
where A::Item: PartialOrd,

impl PartialOrd for Ready

impl<T: PartialOrd> PartialOrd for Spanned<T>

impl PartialOrd for Level

impl PartialOrd for Bytes

impl<'a> PartialOrd for NibbleSlice<'a>

impl PartialOrd for RData

impl PartialOrd for Label

impl PartialOrd for Name

impl PartialOrd for RrKey

impl<P> PartialOrd for NameServer<P>

impl PartialOrd for ATerm

impl PartialOrd for B0

impl PartialOrd for B1

impl PartialOrd for Z0

impl PartialOrd for Equal

impl PartialOrd for Less

impl PartialOrd for UTerm

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

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

impl PartialOrd for Level

impl PartialOrd for Url

impl<S: PartialOrd> PartialOrd for Host<S>

impl<T> PartialOrd<T> for Void

impl PartialOrd for Const

impl PartialOrd for Mut

impl<Inner> PartialOrd for Frozen<Inner>
where Inner: Mutability + PartialOrd,

impl<M1, M2, T1, T2> PartialOrd<Address<M2, T2>> for Address<M1, T1>
where M1: Mutability, M2: Mutability,

impl PartialOrd for PCBit

impl PartialOrd for Tag

impl<T, B> PartialOrd for Ref<B, [T]>

impl<T, B> PartialOrd for Ref<B, T>