1 //! Functionality for ordering and comparison.
3 //! This module contains various tools for ordering and comparing values. In
6 //! * [`Eq`] and [`PartialEq`] are traits that allow you to define total and
7 //! partial equality between values, respectively. Implementing them overloads
8 //! the `==` and `!=` operators.
9 //! * [`Ord`] and [`PartialOrd`] are traits that allow you to define total and
10 //! partial orderings between values, respectively. Implementing them overloads
11 //! the `<`, `<=`, `>`, and `>=` operators.
12 //! * [`Ordering`] is an enum returned by the main functions of [`Ord`] and
13 //! [`PartialOrd`], and describes an ordering.
14 //! * [`Reverse`] is a struct that allows you to easily reverse an ordering.
15 //! * [`max`] and [`min`] are functions that build off of [`Ord`] and allow you
16 //! to find the maximum or minimum of two values.
18 //! For more details, see the respective documentation of each item in the list.
20 //! [`Eq`]: trait.Eq.html
21 //! [`PartialEq`]: trait.PartialEq.html
22 //! [`Ord`]: trait.Ord.html
23 //! [`PartialOrd`]: trait.PartialOrd.html
24 //! [`Ordering`]: enum.Ordering.html
25 //! [`Reverse`]: struct.Reverse.html
26 //! [`max`]: fn.max.html
27 //! [`min`]: fn.min.html
29 #![stable(feature = "rust1", since = "1.0.0")]
31 use self::Ordering::*;
33 /// Trait for equality comparisons which are [partial equivalence
34 /// relations](http://en.wikipedia.org/wiki/Partial_equivalence_relation).
36 /// This trait allows for partial equality, for types that do not have a full
37 /// equivalence relation. For example, in floating point numbers `NaN != NaN`,
38 /// so floating point types implement `PartialEq` but not `Eq`.
40 /// Formally, the equality must be (for all `a`, `b` and `c`):
42 /// - symmetric: `a == b` implies `b == a`; and
43 /// - transitive: `a == b` and `b == c` implies `a == c`.
45 /// Note that these requirements mean that the trait itself must be implemented
46 /// symmetrically and transitively: if `T: PartialEq<U>` and `U: PartialEq<V>`
47 /// then `U: PartialEq<T>` and `T: PartialEq<V>`.
51 /// This trait can be used with `#[derive]`. When `derive`d on structs, two
52 /// instances are equal if all fields are equal, and not equal if any fields
53 /// are not equal. When `derive`d on enums, each variant is equal to itself
54 /// and not equal to the other variants.
56 /// ## How can I implement `PartialEq`?
58 /// PartialEq only requires the `eq` method to be implemented; `ne` is defined
59 /// in terms of it by default. Any manual implementation of `ne` *must* respect
60 /// the rule that `eq` is a strict inverse of `ne`; that is, `!(a == b)` if and
63 /// Implementations of `PartialEq`, `PartialOrd`, and `Ord` *must* agree with
64 /// each other. It's easy to accidentally make them disagree by deriving some
65 /// of the traits and manually implementing others.
67 /// An example implementation for a domain in which two books are considered
68 /// the same book if their ISBN matches, even if the formats differ:
79 /// format: BookFormat,
82 /// impl PartialEq for Book {
83 /// fn eq(&self, other: &Self) -> bool {
84 /// self.isbn == other.isbn
88 /// let b1 = Book { isbn: 3, format: BookFormat::Paperback };
89 /// let b2 = Book { isbn: 3, format: BookFormat::Ebook };
90 /// let b3 = Book { isbn: 10, format: BookFormat::Paperback };
92 /// assert!(b1 == b2);
93 /// assert!(b1 != b3);
96 /// ## How can I compare two different types?
98 /// The type you can compare with is controlled by `PartialEq`'s type parameter.
99 /// For example, let's tweak our previous code a bit:
102 /// // The derive implements <BookFormat> == <BookFormat> comparisons
103 /// #[derive(PartialEq)]
104 /// enum BookFormat {
112 /// format: BookFormat,
115 /// // Implement <Book> == <BookFormat> comparisons
116 /// impl PartialEq<BookFormat> for Book {
117 /// fn eq(&self, other: &BookFormat) -> bool {
118 /// self.format == *other
122 /// // Implement <BookFormat> == <Book> comparisons
123 /// impl PartialEq<Book> for BookFormat {
124 /// fn eq(&self, other: &Book) -> bool {
125 /// *self == other.format
129 /// let b1 = Book { isbn: 3, format: BookFormat::Paperback };
131 /// assert!(b1 == BookFormat::Paperback);
132 /// assert!(BookFormat::Ebook != b1);
135 /// By changing `impl PartialEq for Book` to `impl PartialEq<BookFormat> for Book`,
136 /// we allow `BookFormat`s to be compared with `Book`s.
138 /// A comparison like the one above, which ignores some fields of the struct,
139 /// can be dangerous. It can easily lead to an unintended violation of the
140 /// requirements for a partial equivalence relation. For example, if we kept
141 /// the above implementation of `PartialEq<Book>` for `BookFormat` and added an
142 /// implementation of `PartialEq<Book>` for `Book` (either via a `#[derive]` or
143 /// via the manual implementation from the first example) then the result would
144 /// violate transitivity:
147 /// #[derive(PartialEq)]
148 /// enum BookFormat {
154 /// #[derive(PartialEq)]
157 /// format: BookFormat,
160 /// impl PartialEq<BookFormat> for Book {
161 /// fn eq(&self, other: &BookFormat) -> bool {
162 /// self.format == *other
166 /// impl PartialEq<Book> for BookFormat {
167 /// fn eq(&self, other: &Book) -> bool {
168 /// *self == other.format
173 /// let b1 = Book { isbn: 1, format: BookFormat::Paperback };
174 /// let b2 = Book { isbn: 2, format: BookFormat::Paperback };
176 /// assert!(b1 == BookFormat::Paperback);
177 /// assert!(BookFormat::Paperback == b2);
179 /// // The following should hold by transitivity but doesn't.
180 /// assert!(b1 == b2); // <-- PANICS
190 /// assert_eq!(x == y, false);
191 /// assert_eq!(x.eq(&y), false);
194 #[stable(feature = "rust1", since = "1.0.0")]
197 #[rustc_on_unimplemented(
198 message = "can't compare `{Self}` with `{Rhs}`",
199 label = "no implementation for `{Self} == {Rhs}`"
201 pub trait PartialEq<Rhs: ?Sized = Self> {
202 /// This method tests for `self` and `other` values to be equal, and is used
205 #[stable(feature = "rust1", since = "1.0.0")]
206 fn eq(&self, other: &Rhs) -> bool;
208 /// This method tests for `!=`.
211 #[stable(feature = "rust1", since = "1.0.0")]
212 fn ne(&self, other: &Rhs) -> bool {
217 /// Derive macro generating an impl of the trait `PartialEq`.
218 #[rustc_builtin_macro]
219 #[stable(feature = "builtin_macro_prelude", since = "1.38.0")]
220 #[allow_internal_unstable(core_intrinsics, structural_match)]
221 pub macro PartialEq($item:item) {
222 /* compiler built-in */
225 /// Trait for equality comparisons which are [equivalence relations](
226 /// https://en.wikipedia.org/wiki/Equivalence_relation).
228 /// This means, that in addition to `a == b` and `a != b` being strict inverses, the equality must
229 /// be (for all `a`, `b` and `c`):
231 /// - reflexive: `a == a`;
232 /// - symmetric: `a == b` implies `b == a`; and
233 /// - transitive: `a == b` and `b == c` implies `a == c`.
235 /// This property cannot be checked by the compiler, and therefore `Eq` implies
236 /// `PartialEq`, and has no extra methods.
240 /// This trait can be used with `#[derive]`. When `derive`d, because `Eq` has
241 /// no extra methods, it is only informing the compiler that this is an
242 /// equivalence relation rather than a partial equivalence relation. Note that
243 /// the `derive` strategy requires all fields are `Eq`, which isn't
246 /// ## How can I implement `Eq`?
248 /// If you cannot use the `derive` strategy, specify that your type implements
249 /// `Eq`, which has no methods:
252 /// enum BookFormat { Paperback, Hardback, Ebook }
255 /// format: BookFormat,
257 /// impl PartialEq for Book {
258 /// fn eq(&self, other: &Self) -> bool {
259 /// self.isbn == other.isbn
262 /// impl Eq for Book {}
266 #[stable(feature = "rust1", since = "1.0.0")]
267 pub trait Eq: PartialEq<Self> {
268 // this method is used solely by #[deriving] to assert
269 // that every component of a type implements #[deriving]
270 // itself, the current deriving infrastructure means doing this
271 // assertion without using a method on this trait is nearly
274 // This should never be implemented by hand.
277 #[stable(feature = "rust1", since = "1.0.0")]
278 fn assert_receiver_is_total_eq(&self) {}
281 /// Derive macro generating an impl of the trait `Eq`.
282 #[rustc_builtin_macro]
283 #[stable(feature = "builtin_macro_prelude", since = "1.38.0")]
284 #[allow_internal_unstable(core_intrinsics, derive_eq, structural_match)]
285 pub macro Eq($item:item) {
286 /* compiler built-in */
289 // FIXME: this struct is used solely by #[derive] to
290 // assert that every component of a type implements Eq.
292 // This struct should never appear in user code.
294 #[allow(missing_debug_implementations)]
295 #[unstable(feature = "derive_eq", reason = "deriving hack, should not be public", issue = "none")]
296 pub struct AssertParamIsEq<T: Eq + ?Sized> {
297 _field: crate::marker::PhantomData<T>,
300 /// An `Ordering` is the result of a comparison between two values.
305 /// use std::cmp::Ordering;
307 /// let result = 1.cmp(&2);
308 /// assert_eq!(Ordering::Less, result);
310 /// let result = 1.cmp(&1);
311 /// assert_eq!(Ordering::Equal, result);
313 /// let result = 2.cmp(&1);
314 /// assert_eq!(Ordering::Greater, result);
316 #[derive(Clone, Copy, PartialEq, Debug, Hash)]
317 #[stable(feature = "rust1", since = "1.0.0")]
319 /// An ordering where a compared value is less than another.
320 #[stable(feature = "rust1", since = "1.0.0")]
322 /// An ordering where a compared value is equal to another.
323 #[stable(feature = "rust1", since = "1.0.0")]
325 /// An ordering where a compared value is greater than another.
326 #[stable(feature = "rust1", since = "1.0.0")]
331 /// Reverses the `Ordering`.
333 /// * `Less` becomes `Greater`.
334 /// * `Greater` becomes `Less`.
335 /// * `Equal` becomes `Equal`.
342 /// use std::cmp::Ordering;
344 /// assert_eq!(Ordering::Less.reverse(), Ordering::Greater);
345 /// assert_eq!(Ordering::Equal.reverse(), Ordering::Equal);
346 /// assert_eq!(Ordering::Greater.reverse(), Ordering::Less);
349 /// This method can be used to reverse a comparison:
352 /// let data: &mut [_] = &mut [2, 10, 5, 8];
354 /// // sort the array from largest to smallest.
355 /// data.sort_by(|a, b| a.cmp(b).reverse());
357 /// let b: &mut [_] = &mut [10, 8, 5, 2];
358 /// assert!(data == b);
361 #[stable(feature = "rust1", since = "1.0.0")]
362 pub fn reverse(self) -> Ordering {
370 /// Chains two orderings.
372 /// Returns `self` when it's not `Equal`. Otherwise returns `other`.
376 /// use std::cmp::Ordering;
378 /// let result = Ordering::Equal.then(Ordering::Less);
379 /// assert_eq!(result, Ordering::Less);
381 /// let result = Ordering::Less.then(Ordering::Equal);
382 /// assert_eq!(result, Ordering::Less);
384 /// let result = Ordering::Less.then(Ordering::Greater);
385 /// assert_eq!(result, Ordering::Less);
387 /// let result = Ordering::Equal.then(Ordering::Equal);
388 /// assert_eq!(result, Ordering::Equal);
390 /// let x: (i64, i64, i64) = (1, 2, 7);
391 /// let y: (i64, i64, i64) = (1, 5, 3);
392 /// let result = x.0.cmp(&y.0).then(x.1.cmp(&y.1)).then(x.2.cmp(&y.2));
394 /// assert_eq!(result, Ordering::Less);
397 #[stable(feature = "ordering_chaining", since = "1.17.0")]
398 pub fn then(self, other: Ordering) -> Ordering {
405 /// Chains the ordering with the given function.
407 /// Returns `self` when it's not `Equal`. Otherwise calls `f` and returns
413 /// use std::cmp::Ordering;
415 /// let result = Ordering::Equal.then_with(|| Ordering::Less);
416 /// assert_eq!(result, Ordering::Less);
418 /// let result = Ordering::Less.then_with(|| Ordering::Equal);
419 /// assert_eq!(result, Ordering::Less);
421 /// let result = Ordering::Less.then_with(|| Ordering::Greater);
422 /// assert_eq!(result, Ordering::Less);
424 /// let result = Ordering::Equal.then_with(|| Ordering::Equal);
425 /// assert_eq!(result, Ordering::Equal);
427 /// let x: (i64, i64, i64) = (1, 2, 7);
428 /// let y: (i64, i64, i64) = (1, 5, 3);
429 /// let result = x.0.cmp(&y.0).then_with(|| x.1.cmp(&y.1)).then_with(|| x.2.cmp(&y.2));
431 /// assert_eq!(result, Ordering::Less);
434 #[stable(feature = "ordering_chaining", since = "1.17.0")]
435 pub fn then_with<F: FnOnce() -> Ordering>(self, f: F) -> Ordering {
443 /// A helper struct for reverse ordering.
445 /// This struct is a helper to be used with functions like `Vec::sort_by_key` and
446 /// can be used to reverse order a part of a key.
451 /// use std::cmp::Reverse;
453 /// let mut v = vec![1, 2, 3, 4, 5, 6];
454 /// v.sort_by_key(|&num| (num > 3, Reverse(num)));
455 /// assert_eq!(v, vec![3, 2, 1, 6, 5, 4]);
457 #[derive(PartialEq, Eq, Debug, Copy, Clone, Default, Hash)]
458 #[stable(feature = "reverse_cmp_key", since = "1.19.0")]
459 pub struct Reverse<T>(#[stable(feature = "reverse_cmp_key", since = "1.19.0")] pub T);
461 #[stable(feature = "reverse_cmp_key", since = "1.19.0")]
462 impl<T: PartialOrd> PartialOrd for Reverse<T> {
464 fn partial_cmp(&self, other: &Reverse<T>) -> Option<Ordering> {
465 other.0.partial_cmp(&self.0)
469 fn lt(&self, other: &Self) -> bool {
473 fn le(&self, other: &Self) -> bool {
477 fn gt(&self, other: &Self) -> bool {
481 fn ge(&self, other: &Self) -> bool {
486 #[stable(feature = "reverse_cmp_key", since = "1.19.0")]
487 impl<T: Ord> Ord for Reverse<T> {
489 fn cmp(&self, other: &Reverse<T>) -> Ordering {
494 /// Trait for types that form a [total order](https://en.wikipedia.org/wiki/Total_order).
496 /// An order is a total order if it is (for all `a`, `b` and `c`):
498 /// - total and asymmetric: exactly one of `a < b`, `a == b` or `a > b` is true; and
499 /// - transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
503 /// This trait can be used with `#[derive]`. When `derive`d on structs, it will produce a
504 /// lexicographic ordering based on the top-to-bottom declaration order of the struct's members.
505 /// When `derive`d on enums, variants are ordered by their top-to-bottom declaration order.
507 /// ## How can I implement `Ord`?
509 /// `Ord` requires that the type also be `PartialOrd` and `Eq` (which requires `PartialEq`).
511 /// Then you must define an implementation for `cmp()`. You may find it useful to use
512 /// `cmp()` on your type's fields.
514 /// Implementations of `PartialEq`, `PartialOrd`, and `Ord` *must*
515 /// agree with each other. That is, `a.cmp(b) == Ordering::Equal` if
516 /// and only if `a == b` and `Some(a.cmp(b)) == a.partial_cmp(b)` for
517 /// all `a` and `b`. It's easy to accidentally make them disagree by
518 /// deriving some of the traits and manually implementing others.
520 /// Here's an example where you want to sort people by height only, disregarding `id`
524 /// use std::cmp::Ordering;
533 /// impl Ord for Person {
534 /// fn cmp(&self, other: &Self) -> Ordering {
535 /// self.height.cmp(&other.height)
539 /// impl PartialOrd for Person {
540 /// fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
541 /// Some(self.cmp(other))
545 /// impl PartialEq for Person {
546 /// fn eq(&self, other: &Self) -> bool {
547 /// self.height == other.height
555 #[stable(feature = "rust1", since = "1.0.0")]
556 pub trait Ord: Eq + PartialOrd<Self> {
557 /// This method returns an `Ordering` between `self` and `other`.
559 /// By convention, `self.cmp(&other)` returns the ordering matching the expression
560 /// `self <operator> other` if true.
565 /// use std::cmp::Ordering;
567 /// assert_eq!(5.cmp(&10), Ordering::Less);
568 /// assert_eq!(10.cmp(&5), Ordering::Greater);
569 /// assert_eq!(5.cmp(&5), Ordering::Equal);
571 #[stable(feature = "rust1", since = "1.0.0")]
572 fn cmp(&self, other: &Self) -> Ordering;
574 /// Compares and returns the maximum of two values.
576 /// Returns the second argument if the comparison determines them to be equal.
581 /// assert_eq!(2, 1.max(2));
582 /// assert_eq!(2, 2.max(2));
584 #[stable(feature = "ord_max_min", since = "1.21.0")]
586 fn max(self, other: Self) -> Self
590 max_by(self, other, Ord::cmp)
593 /// Compares and returns the minimum of two values.
595 /// Returns the first argument if the comparison determines them to be equal.
600 /// assert_eq!(1, 1.min(2));
601 /// assert_eq!(2, 2.min(2));
603 #[stable(feature = "ord_max_min", since = "1.21.0")]
605 fn min(self, other: Self) -> Self
609 min_by(self, other, Ord::cmp)
612 /// Restrict a value to a certain interval.
614 /// Returns `max` if `self` is greater than `max`, and `min` if `self` is
615 /// less than `min`. Otherwise this returns `self`.
619 /// Panics if `min > max`.
624 /// #![feature(clamp)]
626 /// assert!((-3).clamp(-2, 1) == -2);
627 /// assert!(0.clamp(-2, 1) == 0);
628 /// assert!(2.clamp(-2, 1) == 1);
630 #[unstable(feature = "clamp", issue = "44095")]
631 fn clamp(self, min: Self, max: Self) -> Self
638 } else if self > max {
646 /// Derive macro generating an impl of the trait `Ord`.
647 #[rustc_builtin_macro]
648 #[stable(feature = "builtin_macro_prelude", since = "1.38.0")]
649 #[allow_internal_unstable(core_intrinsics)]
650 pub macro Ord($item:item) {
651 /* compiler built-in */
654 #[stable(feature = "rust1", since = "1.0.0")]
655 impl Eq for Ordering {}
657 #[stable(feature = "rust1", since = "1.0.0")]
658 impl Ord for Ordering {
660 fn cmp(&self, other: &Ordering) -> Ordering {
661 (*self as i32).cmp(&(*other as i32))
665 #[stable(feature = "rust1", since = "1.0.0")]
666 impl PartialOrd for Ordering {
668 fn partial_cmp(&self, other: &Ordering) -> Option<Ordering> {
669 (*self as i32).partial_cmp(&(*other as i32))
673 /// Trait for values that can be compared for a sort-order.
675 /// The comparison must satisfy, for all `a`, `b` and `c`:
677 /// - asymmetry: if `a < b` then `!(a > b)`, as well as `a > b` implying `!(a < b)`; and
678 /// - transitivity: `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
680 /// Note that these requirements mean that the trait itself must be implemented symmetrically and
681 /// transitively: if `T: PartialOrd<U>` and `U: PartialOrd<V>` then `U: PartialOrd<T>` and `T:
686 /// This trait can be used with `#[derive]`. When `derive`d on structs, it will produce a
687 /// lexicographic ordering based on the top-to-bottom declaration order of the struct's members.
688 /// When `derive`d on enums, variants are ordered by their top-to-bottom declaration order.
690 /// ## How can I implement `PartialOrd`?
692 /// `PartialOrd` only requires implementation of the `partial_cmp` method, with the others
693 /// generated from default implementations.
695 /// However it remains possible to implement the others separately for types which do not have a
696 /// total order. For example, for floating point numbers, `NaN < 0 == false` and `NaN >= 0 ==
697 /// false` (cf. IEEE 754-2008 section 5.11).
699 /// `PartialOrd` requires your type to be `PartialEq`.
701 /// Implementations of `PartialEq`, `PartialOrd`, and `Ord` *must* agree with each other. It's
702 /// easy to accidentally make them disagree by deriving some of the traits and manually
703 /// implementing others.
705 /// If your type is `Ord`, you can implement `partial_cmp()` by using `cmp()`:
708 /// use std::cmp::Ordering;
717 /// impl PartialOrd for Person {
718 /// fn partial_cmp(&self, other: &Person) -> Option<Ordering> {
719 /// Some(self.cmp(other))
723 /// impl Ord for Person {
724 /// fn cmp(&self, other: &Person) -> Ordering {
725 /// self.height.cmp(&other.height)
729 /// impl PartialEq for Person {
730 /// fn eq(&self, other: &Person) -> bool {
731 /// self.height == other.height
736 /// You may also find it useful to use `partial_cmp()` on your type's fields. Here
737 /// is an example of `Person` types who have a floating-point `height` field that
738 /// is the only field to be used for sorting:
741 /// use std::cmp::Ordering;
749 /// impl PartialOrd for Person {
750 /// fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
751 /// self.height.partial_cmp(&other.height)
755 /// impl PartialEq for Person {
756 /// fn eq(&self, other: &Self) -> bool {
757 /// self.height == other.height
768 /// assert_eq!(x < y, true);
769 /// assert_eq!(x.lt(&y), true);
771 #[lang = "partial_ord"]
772 #[stable(feature = "rust1", since = "1.0.0")]
777 #[rustc_on_unimplemented(
778 message = "can't compare `{Self}` with `{Rhs}`",
779 label = "no implementation for `{Self} < {Rhs}` and `{Self} > {Rhs}`"
781 pub trait PartialOrd<Rhs: ?Sized = Self>: PartialEq<Rhs> {
782 /// This method returns an ordering between `self` and `other` values if one exists.
787 /// use std::cmp::Ordering;
789 /// let result = 1.0.partial_cmp(&2.0);
790 /// assert_eq!(result, Some(Ordering::Less));
792 /// let result = 1.0.partial_cmp(&1.0);
793 /// assert_eq!(result, Some(Ordering::Equal));
795 /// let result = 2.0.partial_cmp(&1.0);
796 /// assert_eq!(result, Some(Ordering::Greater));
799 /// When comparison is impossible:
802 /// let result = std::f64::NAN.partial_cmp(&1.0);
803 /// assert_eq!(result, None);
806 #[stable(feature = "rust1", since = "1.0.0")]
807 fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>;
809 /// This method tests less than (for `self` and `other`) and is used by the `<` operator.
814 /// let result = 1.0 < 2.0;
815 /// assert_eq!(result, true);
817 /// let result = 2.0 < 1.0;
818 /// assert_eq!(result, false);
822 #[stable(feature = "rust1", since = "1.0.0")]
823 fn lt(&self, other: &Rhs) -> bool {
824 match self.partial_cmp(other) {
830 /// This method tests less than or equal to (for `self` and `other`) and is used by the `<=`
836 /// let result = 1.0 <= 2.0;
837 /// assert_eq!(result, true);
839 /// let result = 2.0 <= 2.0;
840 /// assert_eq!(result, true);
844 #[stable(feature = "rust1", since = "1.0.0")]
845 fn le(&self, other: &Rhs) -> bool {
846 match self.partial_cmp(other) {
847 Some(Less) | Some(Equal) => true,
852 /// This method tests greater than (for `self` and `other`) and is used by the `>` operator.
857 /// let result = 1.0 > 2.0;
858 /// assert_eq!(result, false);
860 /// let result = 2.0 > 2.0;
861 /// assert_eq!(result, false);
865 #[stable(feature = "rust1", since = "1.0.0")]
866 fn gt(&self, other: &Rhs) -> bool {
867 match self.partial_cmp(other) {
868 Some(Greater) => true,
873 /// This method tests greater than or equal to (for `self` and `other`) and is used by the `>=`
879 /// let result = 2.0 >= 1.0;
880 /// assert_eq!(result, true);
882 /// let result = 2.0 >= 2.0;
883 /// assert_eq!(result, true);
887 #[stable(feature = "rust1", since = "1.0.0")]
888 fn ge(&self, other: &Rhs) -> bool {
889 match self.partial_cmp(other) {
890 Some(Greater) | Some(Equal) => true,
896 /// Derive macro generating an impl of the trait `PartialOrd`.
897 #[rustc_builtin_macro]
898 #[stable(feature = "builtin_macro_prelude", since = "1.38.0")]
899 #[allow_internal_unstable(core_intrinsics)]
900 pub macro PartialOrd($item:item) {
901 /* compiler built-in */
904 /// Compares and returns the minimum of two values.
906 /// Returns the first argument if the comparison determines them to be equal.
908 /// Internally uses an alias to `Ord::min`.
915 /// assert_eq!(1, cmp::min(1, 2));
916 /// assert_eq!(2, cmp::min(2, 2));
919 #[stable(feature = "rust1", since = "1.0.0")]
920 pub fn min<T: Ord>(v1: T, v2: T) -> T {
924 /// Returns the minimum of two values with respect to the specified comparison function.
926 /// Returns the first argument if the comparison determines them to be equal.
931 /// #![feature(cmp_min_max_by)]
935 /// assert_eq!(cmp::min_by(-2, 1, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), 1);
936 /// assert_eq!(cmp::min_by(-2, 2, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), -2);
939 #[unstable(feature = "cmp_min_max_by", issue = "64460")]
940 pub fn min_by<T, F: FnOnce(&T, &T) -> Ordering>(v1: T, v2: T, compare: F) -> T {
941 match compare(&v1, &v2) {
942 Ordering::Less | Ordering::Equal => v1,
943 Ordering::Greater => v2,
947 /// Returns the element that gives the minimum value from the specified function.
949 /// Returns the first argument if the comparison determines them to be equal.
954 /// #![feature(cmp_min_max_by)]
958 /// assert_eq!(cmp::min_by_key(-2, 1, |x: &i32| x.abs()), 1);
959 /// assert_eq!(cmp::min_by_key(-2, 2, |x: &i32| x.abs()), -2);
962 #[unstable(feature = "cmp_min_max_by", issue = "64460")]
963 pub fn min_by_key<T, F: FnMut(&T) -> K, K: Ord>(v1: T, v2: T, mut f: F) -> T {
964 min_by(v1, v2, |v1, v2| f(v1).cmp(&f(v2)))
967 /// Compares and returns the maximum of two values.
969 /// Returns the second argument if the comparison determines them to be equal.
971 /// Internally uses an alias to `Ord::max`.
978 /// assert_eq!(2, cmp::max(1, 2));
979 /// assert_eq!(2, cmp::max(2, 2));
982 #[stable(feature = "rust1", since = "1.0.0")]
983 pub fn max<T: Ord>(v1: T, v2: T) -> T {
987 /// Returns the maximum of two values with respect to the specified comparison function.
989 /// Returns the second argument if the comparison determines them to be equal.
994 /// #![feature(cmp_min_max_by)]
998 /// assert_eq!(cmp::max_by(-2, 1, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), -2);
999 /// assert_eq!(cmp::max_by(-2, 2, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), 2);
1002 #[unstable(feature = "cmp_min_max_by", issue = "64460")]
1003 pub fn max_by<T, F: FnOnce(&T, &T) -> Ordering>(v1: T, v2: T, compare: F) -> T {
1004 match compare(&v1, &v2) {
1005 Ordering::Less | Ordering::Equal => v2,
1006 Ordering::Greater => v1,
1010 /// Returns the element that gives the maximum value from the specified function.
1012 /// Returns the second argument if the comparison determines them to be equal.
1017 /// #![feature(cmp_min_max_by)]
1021 /// assert_eq!(cmp::max_by_key(-2, 1, |x: &i32| x.abs()), -2);
1022 /// assert_eq!(cmp::max_by_key(-2, 2, |x: &i32| x.abs()), 2);
1025 #[unstable(feature = "cmp_min_max_by", issue = "64460")]
1026 pub fn max_by_key<T, F: FnMut(&T) -> K, K: Ord>(v1: T, v2: T, mut f: F) -> T {
1027 max_by(v1, v2, |v1, v2| f(v1).cmp(&f(v2)))
1030 // Implementation of PartialEq, Eq, PartialOrd and Ord for primitive types
1032 use crate::cmp::Ordering::{self, Equal, Greater, Less};
1033 use crate::hint::unreachable_unchecked;
1035 macro_rules! partial_eq_impl {
1037 #[stable(feature = "rust1", since = "1.0.0")]
1038 impl PartialEq for $t {
1040 fn eq(&self, other: &$t) -> bool { (*self) == (*other) }
1042 fn ne(&self, other: &$t) -> bool { (*self) != (*other) }
1047 #[stable(feature = "rust1", since = "1.0.0")]
1048 impl PartialEq for () {
1050 fn eq(&self, _other: &()) -> bool {
1054 fn ne(&self, _other: &()) -> bool {
1060 bool char usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 f32 f64
1063 macro_rules! eq_impl {
1065 #[stable(feature = "rust1", since = "1.0.0")]
1070 eq_impl! { () bool char usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 }
1072 macro_rules! partial_ord_impl {
1074 #[stable(feature = "rust1", since = "1.0.0")]
1075 impl PartialOrd for $t {
1077 fn partial_cmp(&self, other: &$t) -> Option<Ordering> {
1078 match (self <= other, self >= other) {
1079 (false, false) => None,
1080 (false, true) => Some(Greater),
1081 (true, false) => Some(Less),
1082 (true, true) => Some(Equal),
1086 fn lt(&self, other: &$t) -> bool { (*self) < (*other) }
1088 fn le(&self, other: &$t) -> bool { (*self) <= (*other) }
1090 fn ge(&self, other: &$t) -> bool { (*self) >= (*other) }
1092 fn gt(&self, other: &$t) -> bool { (*self) > (*other) }
1097 #[stable(feature = "rust1", since = "1.0.0")]
1098 impl PartialOrd for () {
1100 fn partial_cmp(&self, _: &()) -> Option<Ordering> {
1105 #[stable(feature = "rust1", since = "1.0.0")]
1106 impl PartialOrd for bool {
1108 fn partial_cmp(&self, other: &bool) -> Option<Ordering> {
1109 (*self as u8).partial_cmp(&(*other as u8))
1113 partial_ord_impl! { f32 f64 }
1115 macro_rules! ord_impl {
1117 #[stable(feature = "rust1", since = "1.0.0")]
1118 impl PartialOrd for $t {
1120 fn partial_cmp(&self, other: &$t) -> Option<Ordering> {
1121 Some(self.cmp(other))
1124 fn lt(&self, other: &$t) -> bool { (*self) < (*other) }
1126 fn le(&self, other: &$t) -> bool { (*self) <= (*other) }
1128 fn ge(&self, other: &$t) -> bool { (*self) >= (*other) }
1130 fn gt(&self, other: &$t) -> bool { (*self) > (*other) }
1133 #[stable(feature = "rust1", since = "1.0.0")]
1136 fn cmp(&self, other: &$t) -> Ordering {
1137 // The order here is important to generate more optimal assembly.
1138 // See <https://github.com/rust-lang/rust/issues/63758> for more info.
1139 if *self < *other { Less }
1140 else if *self == *other { Equal }
1147 #[stable(feature = "rust1", since = "1.0.0")]
1150 fn cmp(&self, _other: &()) -> Ordering {
1155 #[stable(feature = "rust1", since = "1.0.0")]
1158 fn cmp(&self, other: &bool) -> Ordering {
1159 // Casting to i8's and converting the difference to an Ordering generates
1160 // more optimal assembly.
1161 // See <https://github.com/rust-lang/rust/issues/66780> for more info.
1162 match (*self as i8) - (*other as i8) {
1166 // SAFETY: bool as i8 returns 0 or 1, so the difference can't be anything else
1167 _ => unsafe { unreachable_unchecked() },
1172 ord_impl! { char usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 }
1174 #[unstable(feature = "never_type", issue = "35121")]
1175 impl PartialEq for ! {
1176 fn eq(&self, _: &!) -> bool {
1181 #[unstable(feature = "never_type", issue = "35121")]
1184 #[unstable(feature = "never_type", issue = "35121")]
1185 impl PartialOrd for ! {
1186 fn partial_cmp(&self, _: &!) -> Option<Ordering> {
1191 #[unstable(feature = "never_type", issue = "35121")]
1193 fn cmp(&self, _: &!) -> Ordering {
1200 #[stable(feature = "rust1", since = "1.0.0")]
1201 impl<A: ?Sized, B: ?Sized> PartialEq<&B> for &A
1206 fn eq(&self, other: &&B) -> bool {
1207 PartialEq::eq(*self, *other)
1210 fn ne(&self, other: &&B) -> bool {
1211 PartialEq::ne(*self, *other)
1214 #[stable(feature = "rust1", since = "1.0.0")]
1215 impl<A: ?Sized, B: ?Sized> PartialOrd<&B> for &A
1220 fn partial_cmp(&self, other: &&B) -> Option<Ordering> {
1221 PartialOrd::partial_cmp(*self, *other)
1224 fn lt(&self, other: &&B) -> bool {
1225 PartialOrd::lt(*self, *other)
1228 fn le(&self, other: &&B) -> bool {
1229 PartialOrd::le(*self, *other)
1232 fn gt(&self, other: &&B) -> bool {
1233 PartialOrd::gt(*self, *other)
1236 fn ge(&self, other: &&B) -> bool {
1237 PartialOrd::ge(*self, *other)
1240 #[stable(feature = "rust1", since = "1.0.0")]
1241 impl<A: ?Sized> Ord for &A
1246 fn cmp(&self, other: &Self) -> Ordering {
1247 Ord::cmp(*self, *other)
1250 #[stable(feature = "rust1", since = "1.0.0")]
1251 impl<A: ?Sized> Eq for &A where A: Eq {}
1255 #[stable(feature = "rust1", since = "1.0.0")]
1256 impl<A: ?Sized, B: ?Sized> PartialEq<&mut B> for &mut A
1261 fn eq(&self, other: &&mut B) -> bool {
1262 PartialEq::eq(*self, *other)
1265 fn ne(&self, other: &&mut B) -> bool {
1266 PartialEq::ne(*self, *other)
1269 #[stable(feature = "rust1", since = "1.0.0")]
1270 impl<A: ?Sized, B: ?Sized> PartialOrd<&mut B> for &mut A
1275 fn partial_cmp(&self, other: &&mut B) -> Option<Ordering> {
1276 PartialOrd::partial_cmp(*self, *other)
1279 fn lt(&self, other: &&mut B) -> bool {
1280 PartialOrd::lt(*self, *other)
1283 fn le(&self, other: &&mut B) -> bool {
1284 PartialOrd::le(*self, *other)
1287 fn gt(&self, other: &&mut B) -> bool {
1288 PartialOrd::gt(*self, *other)
1291 fn ge(&self, other: &&mut B) -> bool {
1292 PartialOrd::ge(*self, *other)
1295 #[stable(feature = "rust1", since = "1.0.0")]
1296 impl<A: ?Sized> Ord for &mut A
1301 fn cmp(&self, other: &Self) -> Ordering {
1302 Ord::cmp(*self, *other)
1305 #[stable(feature = "rust1", since = "1.0.0")]
1306 impl<A: ?Sized> Eq for &mut A where A: Eq {}
1308 #[stable(feature = "rust1", since = "1.0.0")]
1309 impl<A: ?Sized, B: ?Sized> PartialEq<&mut B> for &A
1314 fn eq(&self, other: &&mut B) -> bool {
1315 PartialEq::eq(*self, *other)
1318 fn ne(&self, other: &&mut B) -> bool {
1319 PartialEq::ne(*self, *other)
1323 #[stable(feature = "rust1", since = "1.0.0")]
1324 impl<A: ?Sized, B: ?Sized> PartialEq<&B> for &mut A
1329 fn eq(&self, other: &&B) -> bool {
1330 PartialEq::eq(*self, *other)
1333 fn ne(&self, other: &&B) -> bool {
1334 PartialEq::ne(*self, *other)