Trait wasmtime_environ::__core::cmp::Ord
1.0.0 · source · pub trait Ord: Eq + PartialOrd<Self> {
// Required method
fn cmp(&self, other: &Self) -> Ordering;
// Provided methods
fn max(self, other: Self) -> Self
where Self: Sized { ... }
fn min(self, other: Self) -> Self
where Self: Sized { ... }
fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd<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§
sourcefn cmp(&self, other: &Self) -> Ordering
fn cmp(&self, other: &Self) -> Ordering
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§
1.21.0 · sourcefn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values.
Returns the second argument if the comparison determines them to be equal.
Examples
assert_eq!(1.max(2), 2);
assert_eq!(2.max(2), 2);
1.21.0 · sourcefn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the minimum of two values.
Returns the first argument if the comparison determines them to be equal.
Examples
assert_eq!(1.min(2), 1);
assert_eq!(2.min(2), 2);
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,
Implementors§
impl Ord for EntityIndex
impl Ord for AsciiChar
impl Ord for Infallible
impl Ord for IpAddr
impl Ord for SocketAddr
impl Ord for Which
impl Ord for Ordering
impl Ord for ErrorKind
impl Ord for gimli::common::SectionId
impl Ord for ColumnType
impl Ord for Level
impl Ord for LevelFilter
impl Ord for StandardSection
impl Ord for StandardSegment
impl Ord for bool
impl Ord for char
impl Ord for i8
impl Ord for i16
impl Ord for i32
impl Ord for i64
impl Ord for i128
impl Ord for isize
impl Ord for !
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.
impl Ord for u8
impl Ord for u16
impl Ord for u32
impl Ord for u64
impl Ord for u128
impl Ord for ()
impl Ord for usize
impl Ord for DataIndex
impl Ord for DefinedFuncIndex
impl Ord for DefinedGlobalIndex
impl Ord for DefinedMemoryIndex
impl Ord for DefinedTableIndex
impl Ord for ElemIndex
impl Ord for FuncIndex
impl Ord for FuncRefIndex
impl Ord for GlobalIndex
impl Ord for MemoryIndex
impl Ord for OwnedMemoryIndex
impl Ord for SignatureIndex
impl Ord for StaticModuleIndex
impl Ord for TableIndex
impl Ord for TagIndex
impl Ord for TypeIndex
impl Ord for ResourceId
impl Ord for TypeId
impl Ord for CpuidResult
impl Ord for CStr
impl Ord for Error
impl Ord for PhantomPinned
impl Ord for Ipv4Addr
impl Ord for Ipv6Addr
impl Ord for SocketAddrV4
impl Ord for SocketAddrV6
impl Ord for NonZeroI8
impl Ord for NonZeroI16
impl Ord for NonZeroI32
impl Ord for NonZeroI64
impl Ord for NonZeroI128
impl Ord for NonZeroIsize
impl Ord for NonZeroU8
impl Ord for NonZeroU16
impl Ord for NonZeroU32
impl Ord for NonZeroU64
impl Ord for NonZeroU128
impl Ord for NonZeroUsize
impl Ord for Alignment
impl Ord for Duration
impl Ord for CString
impl Ord for String
impl Ord for OsStr
impl Ord for OsString
impl Ord for Components<'_>
impl Ord for Path
impl Ord for PathBuf
impl Ord for PrefixComponent<'_>
impl Ord for Instant
impl Ord for SystemTime
impl Ord for Register
impl Ord for DwAccess
impl Ord for DwAddr
impl Ord for DwAt
impl Ord for DwAte
impl Ord for DwCc
impl Ord for DwCfa
impl Ord for DwChildren
impl Ord for DwDefaulted
impl Ord for DwDs
impl Ord for DwDsc
impl Ord for DwEhPe
impl Ord for DwEnd
impl Ord for DwForm
impl Ord for DwId
impl Ord for DwIdx
impl Ord for DwInl
impl Ord for DwLang
impl Ord for DwLle
impl Ord for DwLnct
impl Ord for DwLne
impl Ord for DwLns
impl Ord for DwMacro
impl Ord for DwOp
impl Ord for DwOrd
impl Ord for DwRle
impl Ord for DwSect
impl Ord for DwSectV2
impl Ord for DwTag
impl Ord for DwUt
impl Ord for DwVirtuality
impl Ord for DwVis
impl Ord for ArangeEntry
impl Ord for SectionIndex
impl Ord for SymbolIndex
impl Ord for ComdatId
impl Ord for object::write::SectionId
impl Ord for SymbolId
impl Ord for BuildMetadata
impl Ord for Prerelease
impl Ord for Version
impl<'a> Ord for Component<'a>
impl<'a> Ord for Prefix<'a>
impl<'a> Ord for Location<'a>
impl<'a> Ord for Metadata<'a>
impl<'a> Ord for MetadataBuilder<'a>
impl<A> Ord for &Awhere A: Ord + ?Sized,
impl<A> Ord for &mut Awhere A: Ord + ?Sized,
impl<B> Ord for Cow<'_, B>where B: Ord + ToOwned + ?Sized,
impl<Dyn> Ord for DynMetadata<Dyn>where Dyn: ?Sized,
impl<E> Ord for I16<E>where E: Ord + Endian,
impl<E> Ord for I32<E>where E: Ord + Endian,
impl<E> Ord for I64<E>where E: Ord + Endian,
impl<E> Ord for U16<E>where E: Ord + Endian,
impl<E> Ord for U32<E>where E: Ord + Endian,
impl<E> Ord for U64<E>where E: Ord + Endian,
impl<E> Ord for I16Bytes<E>where E: Ord + Endian,
impl<E> Ord for I32Bytes<E>where E: Ord + Endian,
impl<E> Ord for I64Bytes<E>where E: Ord + Endian,
impl<E> Ord for U16Bytes<E>where E: Ord + Endian,
impl<E> Ord for U32Bytes<E>where E: Ord + Endian,
impl<E> Ord for U64Bytes<E>where E: Ord + Endian,
impl<F> Ord for Fwhere F: FnPtr,
impl<K, V> Ord for indexmap::map::slice::Slice<K, V>where K: Ord, V: Ord,
impl<K, V, A> Ord for BTreeMap<K, V, A>where K: Ord, V: Ord, A: Allocator + Clone,
impl<P> Ord for Pin<P>where P: Deref, <P as Deref>::Target: Ord,
impl<T> Ord for Option<T>where T: Ord,
impl<T> Ord for Poll<T>where T: Ord,
impl<T> Ord for UnitSectionOffset<T>where T: Ord,
impl<T> Ord for *const Twhere T: ?Sized,
impl<T> Ord for *mut Twhere T: ?Sized,
impl<T> Ord for [T]where T: Ord,
Implements comparison of vectors lexicographically.
impl<T> Ord for (T₁, T₂, …, Tₙ)where T: Ord + ?Sized,
This trait is implemented for tuples up to twelve items long.
impl<T> Ord for PackedOption<T>where T: Ord + ReservedValue,
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 Saturating<T>where T: Ord,
impl<T> Ord for Wrapping<T>where T: Ord,
impl<T> Ord for NonNull<T>where T: ?Sized,
impl<T> Ord for DebugInfoOffset<T>where T: Ord,
impl<T> Ord for DebugTypesOffset<T>where T: Ord,
impl<T> Ord for UnitOffset<T>where T: Ord,
impl<T> Ord for indexmap::set::slice::Slice<T>where T: Ord,
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 BTreeSet<T, A>where T: Ord, A: Allocator + Clone,
impl<T, A> Ord for LinkedList<T, A>where T: Ord, A: Allocator,
impl<T, A> Ord for VecDeque<T, A>where T: Ord, A: Allocator,
impl<T, A> Ord for Rc<T, A>where T: Ord + ?Sized, A: Allocator,
impl<T, A> Ord for Arc<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.
impl<T, E> Ord for Result<T, E>where T: Ord, E: Ord,
impl<T, const N: usize> Ord for [T; N]where T: Ord,
Implements comparison of arrays lexicographically.