Trait scale_info::prelude::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:
a == b
if and only ifpartial_cmp(a, b) == Some(Equal)
.a < b
if and only ifpartial_cmp(a, b) == Some(Less)
a > b
if and only ifpartial_cmp(a, b) == Some(Greater)
a <= b
if and only ifa < b || a == b
a >= b
if and only ifa > b || a == b
a != b
if and only if!(a == b)
.
Conditions 2–5 above are ensured by the default implementation.
Condition 6 is already ensured by PartialEq
.
If Ord
is also implemented for Self
and Rhs
, it must also be consistent with
partial_cmp
(see the documentation of that trait for the exact requirements). It’s
easy to accidentally make them disagree by deriving some of the traits and manually
implementing others.
The comparison must satisfy, for all a
, b
and c
:
- transitivity:
a < b
andb < c
impliesa < c
. The same must hold for both==
and>
. - duality:
a < b
if and only ifb > a
.
Note that these requirements mean that the trait itself must be implemented symmetrically and
transitively: if T: PartialOrd<U>
and U: PartialOrd<V>
then U: PartialOrd<T>
and T: PartialOrd<V>
.
Corollaries
The following corollaries follow from the above requirements:
- irreflexivity of
<
and>
:!(a < a)
,!(a > a)
- transitivity of
>
: ifa > b
andb > c
thena > c
- duality of
partial_cmp
:partial_cmp(a, b) == partial_cmp(b, a).map(Ordering::reverse)
Derivable
This trait can be used with #[derive]
.
When 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, 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§
sourcefn partial_cmp(&self, other: &Rhs) -> Option<Ordering>
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§
sourcefn lt(&self, other: &Rhs) -> bool
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);
sourcefn le(&self, other: &Rhs) -> bool
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);
Implementors§
impl PartialOrd<TypeDefPrimitive> for TypeDefPrimitive
impl PartialOrd<MetaForm> for MetaForm
impl PartialOrd<PortableForm> for PortableForm
impl PartialOrd<Ordering> for Ordering
impl PartialOrd<AsciiChar> for AsciiChar
impl PartialOrd<Infallible> for Infallible
impl PartialOrd<Which> for Which
impl PartialOrd<IpAddr> for IpAddr
impl PartialOrd<IpAddr> for Ipv4Addr
impl PartialOrd<IpAddr> for Ipv6Addr
impl PartialOrd<SocketAddr> for SocketAddr
impl PartialOrd<ErrorKind> for ErrorKind
impl PartialOrd<bool> for bool
impl PartialOrd<char> for char
impl PartialOrd<f32> for f32
impl PartialOrd<f64> for f64
impl PartialOrd<i8> for i8
impl PartialOrd<i16> for i16
impl PartialOrd<i32> for i32
impl PartialOrd<i64> for i64
impl PartialOrd<i128> for i128
impl PartialOrd<isize> for isize
impl PartialOrd<!> for !
impl PartialOrd<str> for str
Implements comparison operations on strings.
Strings are compared lexicographically by their byte values. This compares Unicode code
points based on their positions in the code charts. This is not necessarily the same as
“alphabetical” order, which varies by language and locale. Comparing strings according to
culturally-accepted standards requires locale-specific data that is outside the scope of
the str
type.
impl PartialOrd<str> for Bytes
impl PartialOrd<str> for BytesMut
impl PartialOrd<str> for OsStr
impl PartialOrd<str> for OsString
impl PartialOrd<u8> for u8
impl PartialOrd<u16> for u16
impl PartialOrd<u32> for u32
impl PartialOrd<u64> for u64
impl PartialOrd<u128> for u128
impl PartialOrd<()> for ()
impl PartialOrd<usize> for usize
impl PartialOrd<Lsb0> for Lsb0
impl PartialOrd<Msb0> for Msb0
impl PartialOrd<Bytes> for &str
impl PartialOrd<Bytes> for &[u8]
impl PartialOrd<Bytes> for str
impl PartialOrd<Bytes> for Bytes
impl PartialOrd<Bytes> for String
impl PartialOrd<Bytes> for Vec<u8, Global>
impl PartialOrd<Bytes> for [u8]
impl PartialOrd<BytesMut> for &str
impl PartialOrd<BytesMut> for &[u8]
impl PartialOrd<BytesMut> for str
impl PartialOrd<BytesMut> for BytesMut
impl PartialOrd<BytesMut> for String
impl PartialOrd<BytesMut> for Vec<u8, Global>
impl PartialOrd<BytesMut> for [u8]
impl PartialOrd<Const> for Const
impl PartialOrd<Mut> for Mut
impl PartialOrd<NullPtrError> for NullPtrError
impl PartialOrd<MetaType> for MetaType
impl PartialOrd<TypeId> for TypeId
impl PartialOrd<Error> for Error
impl PartialOrd<PhantomPinned> for PhantomPinned
impl PartialOrd<NonZeroI8> for NonZeroI8
impl PartialOrd<NonZeroI16> for NonZeroI16
impl PartialOrd<NonZeroI32> for NonZeroI32
impl PartialOrd<NonZeroI64> for NonZeroI64
impl PartialOrd<NonZeroI128> for NonZeroI128
impl PartialOrd<NonZeroIsize> for NonZeroIsize
impl PartialOrd<NonZeroU8> for NonZeroU8
impl PartialOrd<NonZeroU16> for NonZeroU16
impl PartialOrd<NonZeroU32> for NonZeroU32
impl PartialOrd<NonZeroU64> for NonZeroU64
impl PartialOrd<NonZeroU128> for NonZeroU128
impl PartialOrd<NonZeroUsize> for NonZeroUsize
impl PartialOrd<String> for Bytes
impl PartialOrd<String> for BytesMut
impl PartialOrd<String> for String
impl PartialOrd<Vec<u8, Global>> for Bytes
impl PartialOrd<Vec<u8, Global>> for BytesMut
impl PartialOrd<CString> for CString
impl PartialOrd<CStr> for CStr
impl PartialOrd<Ipv4Addr> for IpAddr
impl PartialOrd<Ipv4Addr> for Ipv4Addr
impl PartialOrd<Ipv6Addr> for IpAddr
impl PartialOrd<Ipv6Addr> for Ipv6Addr
impl PartialOrd<SocketAddrV4> for SocketAddrV4
impl PartialOrd<SocketAddrV6> for SocketAddrV6
impl PartialOrd<Alignment> for Alignment
impl PartialOrd<Duration> for Duration
impl PartialOrd<OsStr> for OsStr
impl PartialOrd<OsStr> for std::path::Path
impl PartialOrd<OsStr> for PathBuf
impl PartialOrd<OsString> for OsString
impl PartialOrd<OsString> for std::path::Path
impl PartialOrd<OsString> for PathBuf
impl PartialOrd<Path> for OsStr
impl PartialOrd<Path> for OsString
impl PartialOrd<Path> for std::path::Path
impl PartialOrd<Path> for PathBuf
impl PartialOrd<PathBuf> for OsStr
impl PartialOrd<PathBuf> for OsString
impl PartialOrd<PathBuf> for std::path::Path
impl PartialOrd<PathBuf> for PathBuf
impl PartialOrd<Instant> for Instant
impl PartialOrd<SystemTime> for SystemTime
impl PartialOrd<[u8]> for Bytes
impl PartialOrd<[u8]> for BytesMut
impl<'a> PartialOrd<&'a OsStr> for std::path::Path
impl<'a> PartialOrd<&'a OsStr> for PathBuf
impl<'a> PartialOrd<&'a Path> for OsStr
impl<'a> PartialOrd<&'a Path> for OsString
impl<'a> PartialOrd<&'a Path> for PathBuf
impl<'a> PartialOrd<Cow<'a, OsStr>> for std::path::Path
impl<'a> PartialOrd<Cow<'a, OsStr>> for PathBuf
impl<'a> PartialOrd<Cow<'a, Path>> for OsStr
impl<'a> PartialOrd<Cow<'a, Path>> for OsString
impl<'a> PartialOrd<Cow<'a, Path>> for std::path::Path
impl<'a> PartialOrd<Cow<'a, Path>> for PathBuf
impl<'a> PartialOrd<Component<'a>> for Component<'a>
impl<'a> PartialOrd<Prefix<'a>> for Prefix<'a>
impl<'a> PartialOrd<Location<'a>> for Location<'a>
impl<'a> PartialOrd<OsStr> for &'a std::path::Path
impl<'a> PartialOrd<OsStr> for Cow<'a, Path>
impl<'a> PartialOrd<OsString> for &'a std::path::Path
impl<'a> PartialOrd<OsString> for Cow<'a, Path>
impl<'a> PartialOrd<Components<'a>> for Components<'a>
impl<'a> PartialOrd<Path> for &'a OsStr
impl<'a> PartialOrd<Path> for Cow<'a, OsStr>
impl<'a> PartialOrd<Path> for Cow<'a, Path>
impl<'a> PartialOrd<PathBuf> for &'a OsStr
impl<'a> PartialOrd<PathBuf> for &'a std::path::Path
impl<'a> PartialOrd<PathBuf> for Cow<'a, OsStr>
impl<'a> PartialOrd<PathBuf> for Cow<'a, Path>
impl<'a> PartialOrd<PrefixComponent<'a>> for PrefixComponent<'a>
impl<'a, 'b> PartialOrd<&'a OsStr> for OsString
impl<'a, 'b> PartialOrd<&'a Path> for Cow<'b, OsStr>
impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, OsStr>
impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, Path>
impl<'a, 'b> PartialOrd<&'b Path> for Cow<'a, Path>
impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for &'b OsStr
impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsStr
impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsString
impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b OsStr
impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b std::path::Path
impl<'a, 'b> PartialOrd<Cow<'b, OsStr>> for &'a std::path::Path
impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, OsStr>
impl<'a, 'b> PartialOrd<OsStr> for OsString
impl<'a, 'b> PartialOrd<OsString> for &'a OsStr
impl<'a, 'b> PartialOrd<OsString> for Cow<'a, OsStr>
impl<'a, 'b> PartialOrd<OsString> for OsStr
impl<'a, B> PartialOrd<Cow<'a, B>> for Cow<'a, B>where B: PartialOrd<B> + ToOwned + ?Sized,
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, 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, T> PartialOrd<&'a T> for Byteswhere Bytes: PartialOrd<T>, T: ?Sized,
impl<'a, T> PartialOrd<&'a T> for BytesMutwhere BytesMut: PartialOrd<T>, T: ?Sized,
impl<'a, T, O> PartialOrd<IterOnes<'a, T, O>> for IterOnes<'a, T, O>where T: PartialOrd<T> + 'a + BitStore, O: PartialOrd<O> + BitOrder,
impl<'a, T, O> PartialOrd<IterZeros<'a, T, O>> for IterZeros<'a, T, O>where T: PartialOrd<T> + 'a + BitStore, O: PartialOrd<O> + BitOrder,
impl<'a, T: PartialOrd> PartialOrd<Symbol<'a, T>> for Symbol<'a, T>
impl<A, B> PartialOrd<&B> for &Awhere A: PartialOrd<B> + ?Sized, B: ?Sized,
impl<A, B> PartialOrd<&mut B> for &mut Awhere A: PartialOrd<B> + ?Sized, B: ?Sized,
impl<A, O, Rhs> PartialOrd<Rhs> for BitArray<A, O>where A: BitViewSized, O: BitOrder, BitSlice<<A as BitView>::Store, O>: PartialOrd<Rhs>, Rhs: ?Sized,
impl<A, T, O> PartialOrd<BitArray<A, O>> for BitSlice<T, O>where A: BitViewSized, T: BitStore, O: BitOrder,
impl<Dyn> PartialOrd<DynMetadata<Dyn>> for DynMetadata<Dyn>where Dyn: ?Sized,
impl<F> PartialOrd<F> for Fwhere F: FnPtr,
impl<Inner> PartialOrd<Frozen<Inner>> for Frozen<Inner>where Inner: PartialOrd<Inner> + Mutability,
impl<K, V, A> PartialOrd<BTreeMap<K, V, A>> for BTreeMap<K, V, A>where K: PartialOrd<K>, V: PartialOrd<V>, A: Allocator + Clone,
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> PartialOrd<Address<M2, T2>> for Address<M1, T1>where M1: Mutability, M2: Mutability,
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<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<O1, O2, T1, T2> PartialOrd<BitBox<T2, O2>> for BitSlice<T1, O1>where O1: BitOrder, O2: BitOrder, T1: BitStore, T2: BitStore,
impl<P, Q> PartialOrd<Pin<Q>> for Pin<P>where P: Deref, Q: Deref, <P as Deref>::Target: PartialOrd<<Q as Deref>::Target>,
impl<R> PartialOrd<BitEnd<R>> for BitEnd<R>where R: PartialOrd<R> + BitRegister,
impl<R> PartialOrd<BitIdx<R>> for BitIdx<R>where R: PartialOrd<R> + BitRegister,
impl<R> PartialOrd<BitIdxError<R>> for BitIdxError<R>where R: PartialOrd<R> + BitRegister,
impl<R> PartialOrd<BitMask<R>> for BitMask<R>where R: PartialOrd<R> + BitRegister,
impl<R> PartialOrd<BitPos<R>> for BitPos<R>where R: PartialOrd<R> + BitRegister,
impl<R> PartialOrd<BitSel<R>> for BitSel<R>where R: PartialOrd<R> + BitRegister,
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,
Compares two BitSlice
s by semantic — not representational — ordering.
The comparison sorts by testing at each index if one slice has a high bit where the other has a low. At the first index where the slices differ, the slice with the high bit is greater. If the slices are equal until at least one terminates, then they are compared by length.
impl<T1, T2, O1, O2> PartialOrd<BitVec<T2, O2>> for BitSlice<T1, O1>where T1: BitStore, T2: BitStore, O1: BitOrder, O2: BitOrder,
impl<T> PartialOrd<BitPtrError<T>> for BitPtrError<T>where T: PartialOrd<T> + BitStore,
impl<T> PartialOrd<BitSpanError<T>> for BitSpanError<T>where T: PartialOrd<T> + BitStore,
impl<T> PartialOrd<Option<T>> for Option<T>where T: PartialOrd<T>,
impl<T> PartialOrd<Poll<T>> for Poll<T>where T: PartialOrd<T>,
impl<T> PartialOrd<*const T> for *const Twhere T: ?Sized,
impl<T> PartialOrd<*mut T> for *mut Twhere T: ?Sized,
impl<T> PartialOrd<[T]> for [T]where T: PartialOrd<T>,
Implements comparison of vectors lexicographically.
impl<T> PartialOrd<(T,)> for (T₁, T₂, …, Tₙ)where T: PartialOrd<T> + ?Sized,
This trait is implemented for tuples up to twelve items long.
impl<T> PartialOrd<CapacityError<T>> for CapacityError<T>where T: PartialOrd<T>,
impl<T> PartialOrd<MisalignError<T>> for MisalignError<T>where T: PartialOrd<T>,
impl<T> PartialOrd<Compact<T>> for Compact<T>where T: PartialOrd<T>,
impl<T> PartialOrd<PhantomData<T>> for PhantomData<T>where T: ?Sized,
impl<T> PartialOrd<ManuallyDrop<T>> for ManuallyDrop<T>where T: PartialOrd<T> + ?Sized,
impl<T> PartialOrd<Saturating<T>> for Saturating<T>where T: PartialOrd<T>,
impl<T> PartialOrd<Wrapping<T>> for Wrapping<T>where T: PartialOrd<T>,
impl<T> PartialOrd<Rc<T>> for Rc<T>where T: PartialOrd<T> + ?Sized,
impl<T> PartialOrd<Arc<T>> for Arc<T>where T: PartialOrd<T> + ?Sized,
impl<T> PartialOrd<Cell<T>> for Cell<T>where T: PartialOrd<T> + Copy,
impl<T> PartialOrd<RefCell<T>> for RefCell<T>where T: PartialOrd<T> + ?Sized,
impl<T> PartialOrd<NonNull<T>> for NonNull<T>where T: ?Sized,
impl<T> PartialOrd<Reverse<T>> for Reverse<T>where T: PartialOrd<T>,
impl<T, A> PartialOrd<Box<T, A>> for Box<T, A>where T: PartialOrd<T> + ?Sized, A: Allocator,
impl<T, A> PartialOrd<BTreeSet<T, A>> for BTreeSet<T, A>where T: PartialOrd<T>, A: Allocator + Clone,
impl<T, A> PartialOrd<LinkedList<T, A>> for LinkedList<T, A>where T: PartialOrd<T>, A: Allocator,
impl<T, A> PartialOrd<VecDeque<T, A>> for VecDeque<T, A>where T: PartialOrd<T>, A: Allocator,
impl<T, A> PartialOrd<Vec<T, A>> for Vec<T, A>where T: PartialOrd<T>, A: Allocator,
Implements comparison of vectors, lexicographically.