File tree 1 file changed +2
-2
lines changed
1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -495,7 +495,7 @@ impl<T: Ord> Ord for Reverse<T> {
495
495
///
496
496
/// An order is a total order if it is (for all `a`, `b` and `c`):
497
497
///
498
- /// - total and antisymmetric : exactly one of `a < b`, `a == b` or `a > b` is true; and
498
+ /// - total and asymmetric : exactly one of `a < b`, `a == b` or `a > b` is true; and
499
499
/// - transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
500
500
///
501
501
/// ## Derivable
@@ -674,7 +674,7 @@ impl PartialOrd for Ordering {
674
674
///
675
675
/// The comparison must satisfy, for all `a`, `b` and `c`:
676
676
///
677
- /// - antisymmetry : if `a < b` then `!(a > b)`, as well as `a > b` implying `!(a < b)`; and
677
+ /// - asymmetry : if `a < b` then `!(a > b)`, as well as `a > b` implying `!(a < b)`; and
678
678
/// - transitivity: `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
679
679
///
680
680
/// Note that these requirements mean that the trait itself must be implemented symmetrically and
You can’t perform that action at this time.
0 commit comments