pub trait Ord: Eq + PartialOrd<Self> {
fn cmp(&self, other: &Self) -> Ordering;
fn max(self, other: Self) -> Self { ... }
fn min(self, other: Self) -> Self { ... }
fn clamp(self, min: Self, max: Self) -> Self { ... }
}
Expand description
Trait for types that form a total order.
Implementations must be consistent with the PartialOrd
implementation, and ensure
max
, min
, and clamp
are consistent with cmp
:
partial_cmp(a, b) == Some(cmp(a, b))
.max(a, b) == max_by(a, b, cmp)
(ensured by the default implementation).min(a, b) == min_by(a, b, cmp)
(ensured by the default implementation).- For
a.clamp(min, max)
, see the method docs (ensured by the default implementation).
It’s easy to accidentally make cmp
and partial_cmp
disagree by
deriving some of the traits and manually implementing others.
Corollaries
From the above and the requirements of PartialOrd
, it follows that <
defines a strict total order.
This means that for all a
, b
and c
:
- exactly one of
a < b
,a == b
ora > b
is true; and <
is transitive:a < b
andb < c
impliesa < c
. The same must hold for both==
and>
.
Derivable
This trait can be used with #[derive]
.
When derive
d on structs, it will produce a
lexicographic ordering
based on the top-to-bottom declaration order of the struct’s members.
When derive
d 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, Eq, PartialOrd, Ord)]
enum E {
Top,
Bottom,
}
assert!(E::Top < E::Bottom);
However, manually setting the discriminants can override this default behavior:
#[derive(PartialEq, Eq, PartialOrd, Ord)]
enum E {
Top = 2,
Bottom = 1,
}
assert!(E::Bottom < E::Top);
Lexicographical comparison
Lexicographical comparison is an operation with the following properties:
- Two sequences are compared element by element.
- The first mismatching element defines which sequence is lexicographically less or greater than the other.
- If one sequence is a prefix of another, the shorter sequence is lexicographically less than the other.
- If two sequence have equivalent elements and are of the same length, then the sequences are lexicographically equal.
- An empty sequence is lexicographically less than any non-empty sequence.
- Two empty sequences are lexicographically equal.
How can I implement Ord
?
Ord
requires that the type also be PartialOrd
and Eq
(which requires PartialEq
).
Then you must define an implementation for cmp
. You may find it useful to use
cmp
on your type’s fields.
Here’s an example where you want to sort people by height only, disregarding id
and name
:
use std::cmp::Ordering;
#[derive(Eq)]
struct Person {
id: u32,
name: String,
height: u32,
}
impl Ord for Person {
fn cmp(&self, other: &Self) -> Ordering {
self.height.cmp(&other.height)
}
}
impl PartialOrd for Person {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl PartialEq for Person {
fn eq(&self, other: &Self) -> bool {
self.height == other.height
}
}
Required methods
This method returns an Ordering
between self
and other
.
By convention, self.cmp(&other)
returns the ordering matching the expression
self <operator> other
if true.
Examples
use std::cmp::Ordering;
assert_eq!(5.cmp(&10), Ordering::Less);
assert_eq!(10.cmp(&5), Ordering::Greater);
assert_eq!(5.cmp(&5), Ordering::Equal);
Provided methods
Compares and returns the maximum of two values.
Returns the second argument if the comparison determines them to be equal.
Examples
assert_eq!(2, 1.max(2));
assert_eq!(2, 2.max(2));
Compares and returns the minimum of two values.
Returns the first argument if the comparison determines them to be equal.
Examples
assert_eq!(1, 1.min(2));
assert_eq!(2, 2.min(2));
Implementations on Foreign Types
1.8.0 · sourceimpl Ord for SystemTime
impl Ord for SystemTime
pub fn cmp(&self, other: &SystemTime) -> Ordering
sourceimpl Ord for Components<'_>
impl Ord for Components<'_>
pub fn cmp(&self, other: &Components<'_>) -> Ordering
sourceimpl Ord for PrefixComponent<'_>
impl Ord for PrefixComponent<'_>
pub fn cmp(&self, other: &PrefixComponent<'_>) -> Ordering
1.45.0 · sourceimpl Ord for SocketAddrV4
impl Ord for SocketAddrV4
pub fn cmp(&self, other: &SocketAddrV4) -> Ordering
sourceimpl Ord for SocketAddr
impl Ord for SocketAddr
pub fn cmp(&self, other: &SocketAddr) -> Ordering
1.45.0 · sourceimpl Ord for SocketAddrV6
impl Ord for SocketAddrV6
pub fn cmp(&self, other: &SocketAddrV6) -> Ordering
1.28.0 · sourceimpl Ord for NonZeroU64
impl Ord for NonZeroU64
pub fn cmp(&self, other: &NonZeroU64) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
1.34.0 · sourceimpl Ord for NonZeroI64
impl Ord for NonZeroI64
pub fn cmp(&self, other: &NonZeroI64) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
1.34.0 · sourceimpl Ord for NonZeroIsize
impl Ord for NonZeroIsize
pub fn cmp(&self, other: &NonZeroIsize) -> Ordering
sourceimpl<A, B, C, D, E, F, G> Ord for (A, B, C, D, E, F, G) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord + ?Sized,
impl<A, B, C, D, E, F, G> Ord for (A, B, C, D, E, F, G) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord + ?Sized,
sourceimpl<A, B, C, D, E, F, G, H, I> Ord for (A, B, C, D, E, F, G, H, I) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord + ?Sized,
impl<A, B, C, D, E, F, G, H, I> Ord for (A, B, C, D, E, F, G, H, I) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord + ?Sized,
sourceimpl Ord for str
impl Ord for str
Implements ordering of strings.
Strings are ordered lexicographically by their byte values. This orders Unicode code
points based on their positions in the code charts. This is not necessarily the same as
“alphabetical” order, which varies by language and locale. Sorting strings according to
culturally-accepted standards requires locale-specific data that is outside the scope of
the str
type.
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H> Ord for extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Ord for extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret
impl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
1.34.0 · sourceimpl Ord for NonZeroI32
impl Ord for NonZeroI32
pub fn cmp(&self, other: &NonZeroI32) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
1.28.0 · sourceimpl Ord for NonZeroU16
impl Ord for NonZeroU16
pub fn cmp(&self, other: &NonZeroU16) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
sourceimpl<A, B, C, D, E, F> Ord for (A, B, C, D, E, F) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord + ?Sized,
impl<A, B, C, D, E, F> Ord for (A, B, C, D, E, F) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord + ?Sized,
1.34.0 · sourceimpl Ord for NonZeroI16
impl Ord for NonZeroI16
pub fn cmp(&self, other: &NonZeroI16) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
sourceimpl<T> Ord for Saturating<T> where
T: Ord,
impl<T> Ord for Saturating<T> where
T: Ord,
pub fn cmp(&self, other: &Saturating<T>) -> Ordering
sourceimpl<A, B, C, D, E> Ord for (A, B, C, D, E) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord + ?Sized,
impl<A, B, C, D, E> Ord for (A, B, C, D, E) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord + ?Sized,
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
sourceimpl<T, const LANES: usize> Ord for Simd<T, LANES> where
T: SimdElement + Ord,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Ord for Simd<T, LANES> where
T: SimdElement + Ord,
LaneCount<LANES>: SupportedLaneCount,
1.27.0 · sourceimpl Ord for CpuidResult
impl Ord for CpuidResult
pub fn cmp(&self, other: &CpuidResult) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
sourceimpl<A, B, C, D, E, F, G, H, I, J, K> Ord for (A, B, C, D, E, F, G, H, I, J, K) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord,
J: Ord,
K: Ord + ?Sized,
impl<A, B, C, D, E, F, G, H, I, J, K> Ord for (A, B, C, D, E, F, G, H, I, J, K) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord,
J: Ord,
K: Ord + ?Sized,
1.28.0 · sourceimpl Ord for NonZeroU128
impl Ord for NonZeroU128
pub fn cmp(&self, other: &NonZeroU128) -> Ordering
sourceimpl<A, B, C, D, E, F, G, H> Ord for (A, B, C, D, E, F, G, H) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord + ?Sized,
impl<A, B, C, D, E, F, G, H> Ord for (A, B, C, D, E, F, G, H) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord + ?Sized,
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
1.28.0 · sourceimpl Ord for NonZeroU32
impl Ord for NonZeroU32
pub fn cmp(&self, other: &NonZeroU32) -> Ordering
sourceimpl<A, B, C, D, E, F, G, H, I, J> Ord for (A, B, C, D, E, F, G, H, I, J) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord,
J: Ord + ?Sized,
impl<A, B, C, D, E, F, G, H, I, J> Ord for (A, B, C, D, E, F, G, H, I, J) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord,
J: Ord + ?Sized,
sourceimpl<T, const N: usize> Ord for [T; N] where
T: Ord,
impl<T, const N: usize> Ord for [T; N] where
T: Ord,
Implements comparison of arrays lexicographically.
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F> Ord for unsafe extern "C" fn(A, B, C, D, E, F, ...) -> Ret
impl<Ret, A, B, C, D, E, F> Ord for unsafe extern "C" fn(A, B, C, D, E, F, ...) -> Ret
1.34.0 · sourceimpl Ord for NonZeroI128
impl Ord for NonZeroI128
pub fn cmp(&self, other: &NonZeroI128) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
1.28.0 · sourceimpl Ord for NonZeroUsize
impl Ord for NonZeroUsize
pub fn cmp(&self, other: &NonZeroUsize) -> Ordering
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H> Ord for extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Ord for extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
sourceimpl<A, B, C, D, E, F, G, H, I, J, K, L> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord,
J: Ord,
K: Ord,
L: Ord + ?Sized,
impl<A, B, C, D, E, F, G, H, I, J, K, L> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) where
A: Ord,
B: Ord,
C: Ord,
D: Ord,
E: Ord,
F: Ord,
G: Ord,
H: Ord,
I: Ord,
J: Ord,
K: Ord,
L: Ord + ?Sized,
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
1.4.0 · sourceimpl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
sourceimpl<T> Ord for LinkedList<T> where
T: Ord,
impl<T> Ord for LinkedList<T> where
T: Ord,
pub fn cmp(&self, other: &LinkedList<T>) -> Ordering
sourceimpl Ord for ArchivedIpv6Addr
impl Ord for ArchivedIpv6Addr
pub fn cmp(&self, other: &ArchivedIpv6Addr) -> Ordering
sourceimpl Ord for ArchivedString
impl Ord for ArchivedString
pub fn cmp(&self, other: &ArchivedString) -> Ordering
sourceimpl<T> Ord for ArchivedOptionBox<T> where
T: ArchivePointee + Ord + ?Sized,
impl<T> Ord for ArchivedOptionBox<T> where
T: ArchivePointee + Ord + ?Sized,
pub fn cmp(&self, other: &ArchivedOptionBox<T>) -> Ordering
sourceimpl<T, E> Ord for ArchivedResult<T, E> where
T: Ord,
E: Ord,
impl<T, E> Ord for ArchivedResult<T, E> where
T: Ord,
E: Ord,
pub fn cmp(&self, other: &ArchivedResult<T, E>) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroU32
impl Ord for ArchivedOptionNonZeroU32
pub fn cmp(&self, other: &ArchivedOptionNonZeroU32) -> Ordering
sourceimpl Ord for ArchivedSocketAddrV6
impl Ord for ArchivedSocketAddrV6
pub fn cmp(&self, other: &ArchivedSocketAddrV6) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroI8
impl Ord for ArchivedOptionNonZeroI8
pub fn cmp(&self, other: &ArchivedOptionNonZeroI8) -> Ordering
sourceimpl<T> Ord for RawArchivedVec<T> where
T: Ord,
impl<T> Ord for RawArchivedVec<T> where
T: Ord,
pub fn cmp(&self, other: &RawArchivedVec<T>) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroU128
impl Ord for ArchivedOptionNonZeroU128
pub fn cmp(&self, other: &ArchivedOptionNonZeroU128) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroI128
impl Ord for ArchivedOptionNonZeroI128
pub fn cmp(&self, other: &ArchivedOptionNonZeroI128) -> Ordering
sourceimpl<T> Ord for ArchivedVec<T> where
T: Ord,
impl<T> Ord for ArchivedVec<T> where
T: Ord,
pub fn cmp(&self, other: &ArchivedVec<T>) -> Ordering
sourceimpl Ord for ArchivedIpAddr
impl Ord for ArchivedIpAddr
pub fn cmp(&self, other: &ArchivedIpAddr) -> Ordering
sourceimpl Ord for ArchivedDuration
impl Ord for ArchivedDuration
pub fn cmp(&self, other: &ArchivedDuration) -> Ordering
sourceimpl<K, V> Ord for ArchivedBTreeMap<K, V> where
K: Ord,
V: Ord,
impl<K, V> Ord for ArchivedBTreeMap<K, V> where
K: Ord,
V: Ord,
pub fn cmp(&self, other: &ArchivedBTreeMap<K, V>) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroU8
impl Ord for ArchivedOptionNonZeroU8
pub fn cmp(&self, other: &ArchivedOptionNonZeroU8) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroU64
impl Ord for ArchivedOptionNonZeroU64
pub fn cmp(&self, other: &ArchivedOptionNonZeroU64) -> Ordering
sourceimpl<T> Ord for ArchivedBox<T> where
T: ArchivePointee + Ord + ?Sized,
impl<T> Ord for ArchivedBox<T> where
T: ArchivePointee + Ord + ?Sized,
pub fn cmp(&self, other: &ArchivedBox<T>) -> Ordering
sourceimpl Ord for ArchivedIpv4Addr
impl Ord for ArchivedIpv4Addr
pub fn cmp(&self, other: &ArchivedIpv4Addr) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroI64
impl Ord for ArchivedOptionNonZeroI64
pub fn cmp(&self, other: &ArchivedOptionNonZeroI64) -> Ordering
sourceimpl Ord for ArchivedSocketAddr
impl Ord for ArchivedSocketAddr
pub fn cmp(&self, other: &ArchivedSocketAddr) -> Ordering
sourceimpl Ord for ArchivedSocketAddrV4
impl Ord for ArchivedSocketAddrV4
pub fn cmp(&self, other: &ArchivedSocketAddrV4) -> Ordering
sourceimpl<K> Ord for ArchivedBTreeSet<K> where
K: Ord,
impl<K> Ord for ArchivedBTreeSet<K> where
K: Ord,
pub fn cmp(&self, other: &ArchivedBTreeSet<K>) -> Ordering
sourceimpl<T, F> Ord for ArchivedRc<T, F> where
T: ArchivePointee + Ord + ?Sized,
impl<T, F> Ord for ArchivedRc<T, F> where
T: ArchivePointee + Ord + ?Sized,
pub fn cmp(&self, other: &ArchivedRc<T, F>) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroI16
impl Ord for ArchivedOptionNonZeroI16
pub fn cmp(&self, other: &ArchivedOptionNonZeroI16) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroU16
impl Ord for ArchivedOptionNonZeroU16
pub fn cmp(&self, other: &ArchivedOptionNonZeroU16) -> Ordering
sourceimpl<T> Ord for ArchivedOption<T> where
T: Ord,
impl<T> Ord for ArchivedOption<T> where
T: Ord,
pub fn cmp(&self, other: &ArchivedOption<T>) -> Ordering
sourceimpl Ord for ArchivedOptionNonZeroI32
impl Ord for ArchivedOptionNonZeroI32
pub fn cmp(&self, other: &ArchivedOptionNonZeroI32) -> Ordering
sourceimpl Ord for ArchivedCString
impl Ord for ArchivedCString
pub fn cmp(&self, other: &ArchivedCString) -> Ordering
impl Ord for LittleEndian<NonZeroU128>
impl Ord for LittleEndian<NonZeroU128>
pub fn cmp(&self, other: &LittleEndian<NonZeroU128>) -> Ordering
impl Ord for BigEndian<NonZeroI32>
impl Ord for BigEndian<NonZeroI32>
pub fn cmp(&self, other: &BigEndian<NonZeroI32>) -> Ordering
impl Ord for BigEndian<NonZeroI128>
impl Ord for BigEndian<NonZeroI128>
pub fn cmp(&self, other: &BigEndian<NonZeroI128>) -> Ordering
impl Ord for NativeEndian<NonZeroI16>
impl Ord for NativeEndian<NonZeroI16>
pub fn cmp(&self, other: &NativeEndian<NonZeroI16>) -> Ordering
impl Ord for NativeEndian<NonZeroU32>
impl Ord for NativeEndian<NonZeroU32>
pub fn cmp(&self, other: &NativeEndian<NonZeroU32>) -> Ordering
impl Ord for NativeEndian<NonZeroU64>
impl Ord for NativeEndian<NonZeroU64>
pub fn cmp(&self, other: &NativeEndian<NonZeroU64>) -> Ordering
impl Ord for LittleEndian<NonZeroU32>
impl Ord for LittleEndian<NonZeroU32>
pub fn cmp(&self, other: &LittleEndian<NonZeroU32>) -> Ordering
impl Ord for NativeEndian<NonZeroI64>
impl Ord for NativeEndian<NonZeroI64>
pub fn cmp(&self, other: &NativeEndian<NonZeroI64>) -> Ordering
impl Ord for BigEndian<NonZeroU32>
impl Ord for BigEndian<NonZeroU32>
pub fn cmp(&self, other: &BigEndian<NonZeroU32>) -> Ordering
impl Ord for LittleEndian<NonZeroU16>
impl Ord for LittleEndian<NonZeroU16>
pub fn cmp(&self, other: &LittleEndian<NonZeroU16>) -> Ordering
impl Ord for BigEndian<NonZeroI16>
impl Ord for BigEndian<NonZeroI16>
pub fn cmp(&self, other: &BigEndian<NonZeroI16>) -> Ordering
impl Ord for LittleEndian<NonZeroI64>
impl Ord for LittleEndian<NonZeroI64>
pub fn cmp(&self, other: &LittleEndian<NonZeroI64>) -> Ordering
impl Ord for LittleEndian<NonZeroI128>
impl Ord for LittleEndian<NonZeroI128>
pub fn cmp(&self, other: &LittleEndian<NonZeroI128>) -> Ordering
impl Ord for BigEndian<NonZeroU64>
impl Ord for BigEndian<NonZeroU64>
pub fn cmp(&self, other: &BigEndian<NonZeroU64>) -> Ordering
impl Ord for LittleEndian<NonZeroI32>
impl Ord for LittleEndian<NonZeroI32>
pub fn cmp(&self, other: &LittleEndian<NonZeroI32>) -> Ordering
impl Ord for LittleEndian<NonZeroU64>
impl Ord for LittleEndian<NonZeroU64>
pub fn cmp(&self, other: &LittleEndian<NonZeroU64>) -> Ordering
impl Ord for NativeEndian<NonZeroU16>
impl Ord for NativeEndian<NonZeroU16>
pub fn cmp(&self, other: &NativeEndian<NonZeroU16>) -> Ordering
impl Ord for NativeEndian<NonZeroI32>
impl Ord for NativeEndian<NonZeroI32>
pub fn cmp(&self, other: &NativeEndian<NonZeroI32>) -> Ordering
impl Ord for NativeEndian<NonZeroI128>
impl Ord for NativeEndian<NonZeroI128>
pub fn cmp(&self, other: &NativeEndian<NonZeroI128>) -> Ordering
impl Ord for BigEndian<NonZeroI64>
impl Ord for BigEndian<NonZeroI64>
pub fn cmp(&self, other: &BigEndian<NonZeroI64>) -> Ordering
impl Ord for BigEndian<NonZeroU128>
impl Ord for BigEndian<NonZeroU128>
pub fn cmp(&self, other: &BigEndian<NonZeroU128>) -> Ordering
impl Ord for NativeEndian<NonZeroU128>
impl Ord for NativeEndian<NonZeroU128>
pub fn cmp(&self, other: &NativeEndian<NonZeroU128>) -> Ordering
impl Ord for BigEndian<NonZeroU16>
impl Ord for BigEndian<NonZeroU16>
pub fn cmp(&self, other: &BigEndian<NonZeroU16>) -> Ordering
impl Ord for LittleEndian<NonZeroI16>
impl Ord for LittleEndian<NonZeroI16>
pub fn cmp(&self, other: &LittleEndian<NonZeroI16>) -> Ordering
Implementors
impl Ord for ExportIndex
impl Ord for ImportIndex
impl Ord for Infallible
impl Ord for Ordering
impl Ord for Bytes
impl Ord for CustomSectionIndex
impl Ord for DataIndex
impl Ord for ElemIndex
impl Ord for FunctionIndex
impl Ord for GlobalIndex
impl Ord for LocalFunctionIndex
impl Ord for LocalGlobalIndex
impl Ord for LocalMemoryIndex
impl Ord for LocalTableIndex
impl Ord for MemoryIndex
impl Ord for Pages
impl Ord for SignatureIndex
impl Ord for TableIndex
impl Ord for TypeId
impl Ord for Error
impl Ord for PhantomPinned
impl Ord for String
impl<B> Ord for Cow<'_, B> where
B: Ord + ToOwned + ?Sized,
impl<Dyn> Ord for wasmer_types::lib::std::ptr::DynMetadata<Dyn> where
Dyn: ?Sized,
impl<T> Ord for Cell<T> where
T: Ord + Copy,
impl<T> Ord for RefCell<T> where
T: Ord + ?Sized,
impl<T> Ord for PhantomData<T> where
T: ?Sized,
impl<T> Ord for ManuallyDrop<T> where
T: Ord + ?Sized,
impl<T> Ord for NonNull<T> where
T: ?Sized,
impl<T> Ord for Rc<T> where
T: Ord + ?Sized,
impl<T> Ord for Arc<T> where
T: Ord + ?Sized,
impl<T> Ord for Reverse<T> where
T: Ord,
impl<T, A> Ord for Box<T, A> where
T: Ord + ?Sized,
A: Allocator,
impl<T, A> Ord for Vec<T, A> where
T: Ord,
A: Allocator,
Implements ordering of vectors, lexicographically.