Trait kvarn::prelude::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§

source§

impl PartialOrd for Action

1.7.0 · source§

impl PartialOrd for IpAddr

1.0.0 · source§

impl PartialOrd for SocketAddr

source§

impl PartialOrd for log::Level

source§

impl PartialOrd for log::LevelFilter

source§

impl PartialOrd for Direction

source§

impl PartialOrd for RequestParseStage

source§

impl PartialOrd for AsciiChar

1.0.0 · source§

impl PartialOrd for Ordering

1.34.0 · source§

impl PartialOrd for Infallible

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

source§

impl PartialOrd for Id

§

impl PartialOrd for OffsetDateTime

1.64.0 · source§

impl PartialOrd for CString

1.0.0 · source§

impl PartialOrd for String

1.0.0 · source§

impl PartialOrd for OsStr

1.0.0 · source§

impl PartialOrd for OsString

1.8.0 · source§

impl PartialOrd for SystemTime

source§

impl PartialOrd for FixedBitSet

source§

impl PartialOrd for petgraph::visit::dfsvisit::Time

source§

impl PartialOrd for ATerm

source§

impl PartialOrd for B0

source§

impl PartialOrd for B1

source§

impl PartialOrd for Z0

source§

impl PartialOrd for Equal

source§

impl PartialOrd for Greater

source§

impl PartialOrd for Less

source§

impl PartialOrd for UTerm

source§

impl PartialOrd for Braced

source§

impl PartialOrd for Hyphenated

source§

impl PartialOrd for Simple

source§

impl PartialOrd for Urn

source§

impl PartialOrd for Uuid

source§

impl PartialOrd for Mime

§

impl PartialOrd for Bytes

§

impl PartialOrd for BytesMut

§

impl PartialOrd for CompactString

1.3.0 · source§

impl PartialOrd for kvarn::prelude::Duration

§

impl PartialOrd for HeaderValue

1.8.0 · source§

impl PartialOrd for kvarn::prelude::Instant

1.0.0 · source§

impl PartialOrd for Path

1.0.0 · source§

impl PartialOrd for PathBuf

§

impl PartialOrd for StatusCode

§

impl PartialOrd for Version

1.0.0 · source§

impl PartialOrd for TypeId

1.27.0 · source§

impl PartialOrd for CpuidResult

1.0.0 · source§

impl PartialOrd for CStr

1.33.0 · source§

impl PartialOrd for PhantomPinned

source§

impl PartialOrd for Alignment

1.0.0 · source§

impl PartialOrd for Error

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

§

impl PartialOrd for Authority

Case-insensitive ordering

§Examples

let authority: Authority = "DEF.com".parse().unwrap();
assert!(authority < "ghi.com");
assert!(authority > "abc.com");
§

impl PartialOrd for PathAndQuery

§

impl PartialOrd for AnyDelimiterCodec

§

impl PartialOrd for BigEndian

§

impl PartialOrd for BytesCodec

§

impl PartialOrd for ConnectionHandle

§

impl PartialOrd for ConnectionId

§

impl PartialOrd for Date

§

impl PartialOrd for Dir

§

impl PartialOrd for Duration

§

impl PartialOrd for EventMask

§

impl PartialOrd for FileTime

§

impl PartialOrd for Flags

§

impl PartialOrd for FsyncFlags

§

impl PartialOrd for IdleTimeout

§

impl PartialOrd for Instant

§

impl PartialOrd for Instant

§

impl PartialOrd for Interest

§

impl PartialOrd for Level

§

impl PartialOrd for LevelFilter

§

impl PartialOrd for LinesCodec

§

impl PartialOrd for LittleEndian

§

impl PartialOrd for Null

§

impl PartialOrd for PacketDecodeError

§

impl PartialOrd for PrimitiveDateTime

§

impl PartialOrd for ReadError

§

impl PartialOrd for ReadableError

§

impl PartialOrd for Ready

§

impl PartialOrd for RecursiveMode

§

impl PartialOrd for SendDatagramError

§

impl PartialOrd for Side

§

impl PartialOrd for StreamId

§

impl PartialOrd for StreamId

§

impl PartialOrd for TagPropagation

§

impl PartialOrd for Time

§

impl PartialOrd for TimeoutFlags

§

impl PartialOrd for Token

§

impl PartialOrd for UnixTime

§

impl PartialOrd for UtcOffset

§

impl PartialOrd for VarInt

§

impl PartialOrd for WatchDescriptor

§

impl PartialOrd for WatchMask

§

impl PartialOrd for WriteError

1.16.0 · source§

impl PartialOrd<IpAddr> for Ipv4Addr

1.16.0 · source§

impl PartialOrd<IpAddr> for Ipv6Addr

source§

impl PartialOrd<Level> for log::LevelFilter

source§

impl PartialOrd<LevelFilter> for log::Level

1.0.0 · source§

impl PartialOrd<str> for OsStr

1.0.0 · source§

impl PartialOrd<str> for OsString

§

impl PartialOrd<str> for Bytes

§

impl PartialOrd<str> for BytesMut

§

impl PartialOrd<str> for HeaderValue

§

impl PartialOrd<str> for Authority

§

impl PartialOrd<str> for PathAndQuery

§

impl PartialOrd<OffsetDateTime> for SystemTime

Available on crate feature std only.
§

impl PartialOrd<String> for Bytes

§

impl PartialOrd<String> for BytesMut

§

impl PartialOrd<String> for HeaderValue

§

impl PartialOrd<String> for Authority

§

impl PartialOrd<String> for PathAndQuery

§

impl PartialOrd<Vec<u8>> for Bytes

§

impl PartialOrd<Vec<u8>> for BytesMut

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

§

impl PartialOrd<SystemTime> for OffsetDateTime

Available on crate feature std only.
§

impl PartialOrd<Bytes> for &str

§

impl PartialOrd<Bytes> for &[u8]

§

impl PartialOrd<Bytes> for str

§

impl PartialOrd<Bytes> for String

§

impl PartialOrd<Bytes> for Vec<u8>

§

impl PartialOrd<Bytes> for [u8]

§

impl PartialOrd<BytesMut> for &str

§

impl PartialOrd<BytesMut> for &[u8]

§

impl PartialOrd<BytesMut> for str

§

impl PartialOrd<BytesMut> for String

§

impl PartialOrd<BytesMut> for Vec<u8>

§

impl PartialOrd<BytesMut> for [u8]

§

impl PartialOrd<Duration> for Duration

§

impl PartialOrd<HeaderValue> for str

§

impl PartialOrd<HeaderValue> for String

§

impl PartialOrd<HeaderValue> for [u8]

§

impl PartialOrd<Instant> for Instant

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.16.0 · source§

impl PartialOrd<Ipv4Addr> for IpAddr

1.16.0 · source§

impl PartialOrd<Ipv6Addr> for IpAddr

§

impl PartialOrd<Authority> for str

§

impl PartialOrd<Authority> for String

§

impl PartialOrd<PathAndQuery> for str

§

impl PartialOrd<PathAndQuery> for String

§

impl PartialOrd<Duration> for kvarn::prelude::Duration

§

impl PartialOrd<Instant> for kvarn::prelude::Instant

§

impl PartialOrd<Level> for LevelFilter

§

impl PartialOrd<LevelFilter> for Level

§

impl PartialOrd<[u8]> for Bytes

§

impl PartialOrd<[u8]> for BytesMut

§

impl PartialOrd<[u8]> for HeaderValue

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

1.0.0 · source§

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

source§

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

source§

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

source§

impl<'a> PartialOrd for Name<'a>

1.10.0 · source§

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

§

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

§

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

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>

§

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

§

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

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>

§

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

§

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

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,

source§

impl<'a, E, Ix> PartialOrd for EdgeReference<'a, E, Ix>

§

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

§

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

§

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

source§

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

§

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

§

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

§

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

§

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

§

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

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,

§

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

§

impl<H, T> PartialOrd for HeaderSlice<HeaderWithLength<H>, T>
where H: PartialOrd, T: PartialOrd + ?Sized,

§

impl<H, T> PartialOrd for ThinArc<H, T>
where H: PartialOrd, T: PartialOrd,

source§

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

source§

impl<Ix> PartialOrd for petgraph::graph_impl::EdgeIndex<Ix>
where Ix: PartialOrd,

source§

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

§

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

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

§

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

1.36.0 · source§

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

1.0.0 · source§

impl<T> PartialOrd for Option<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.

source§

impl<T> PartialOrd for Ascii<T>
where T: AsRef<str>,

Available on __unicase__iter_cmp only.
source§

impl<T> PartialOrd for UniCase<T>
where T: AsRef<str>,

Available on __unicase__iter_cmp only.
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.19.0 · source§

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

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,

§

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

§

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

§

impl<T> PartialOrd for Slice<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 LinkedList<T, A>
where T: PartialOrd, A: Allocator,

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 kvarn::prelude::Arc<T, A>
where T: PartialOrd + ?Sized, A: Allocator,

1.0.0 · source§

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

§

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

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>

§

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

§

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

source§

impl<U> PartialOrd for NInt<U>

source§

impl<U> PartialOrd for PInt<U>

source§

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

source§

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

source§

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

§

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

§

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