File tree 1 file changed +4
-4
lines changed
1 file changed +4
-4
lines changed Original file line number Diff line number Diff line change @@ -165,9 +165,8 @@ impl Ordering {
165
165
/// - total and antisymmetric: exactly one of `a < b`, `a == b` or `a > b` is true; and
166
166
/// - transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
167
167
///
168
- /// When this trait is `derive`d, it produces a lexicographic ordering.
169
- ///
170
- /// This trait can be used with `#[derive]`.
168
+ /// This trait can be used with `#[derive]`. When `derive`d, it will produce a lexicographic
169
+ /// ordering based on the top-to-bottom declaration order of the struct's members.
171
170
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
172
171
pub trait Ord : Eq + PartialOrd < Self > {
173
172
/// This method returns an `Ordering` between `self` and `other`.
@@ -225,7 +224,8 @@ impl PartialOrd for Ordering {
225
224
/// total order. For example, for floating point numbers, `NaN < 0 == false` and `NaN >= 0 ==
226
225
/// false` (cf. IEEE 754-2008 section 5.11).
227
226
///
228
- /// This trait can be used with `#[derive]`.
227
+ /// This trait can be used with `#[derive]`. When `derive`d, it will produce an ordering
228
+ /// based on the top-to-bottom declaration order of the struct's members.
229
229
#[ lang = "ord" ]
230
230
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
231
231
pub trait PartialOrd < Rhs : ?Sized = Self > : PartialEq < Rhs > {
You can’t perform that action at this time.
0 commit comments