The Ord and Eq comparison traits
This module contains the definition of both Ord and Eq which define the common interfaces for doing comparison. Both are language items that the compiler uses to implement the comparison operators. Rust code may implement Ord to overload the <, <=, >, and >= operators, and Eq to overload the == and != operators.
OrderingApproxEq - Trait for testing approximate equalityEq - Trait for values that can be compared for equality and inequality.Equiv - The equivalence relationOrd - Trait for values that can be compared for a sort-order.TotalEq - Trait for equality comparisons where a == b and a != b are strict inverses.TotalOrd - Trait for types that form a total orderof TotalEq for boolof TotalEq for u8of TotalEq for u16of TotalEq for u32of TotalEq for u64of TotalEq for i8of TotalEq for i16of TotalEq for i32of TotalEq for i64of TotalEq for intof TotalEq for uintof TotalEq for charof ::std::clone::Clone for Ordering - Automatically derived.of ::std::cmp::Eq for Ordering - Automatically derived.of TotalOrd for Orderingof Ord for Orderingof TotalOrd for u8of TotalOrd for u16of TotalOrd for u32of TotalOrd for u64of TotalOrd for i8of TotalOrd for i16of TotalOrd for i32of TotalOrd for i64of TotalOrd for intof TotalOrd for uintof TotalOrd for charcmp2 - Compares (a1, b1) against (a2, b2), where the a values are more significant.lexical_ordering - Return o1 if it is not Equal, otherwise o2maxminOrderingLess = -1
Equal = 0
Greater = 1
ApproxEqTrait for testing approximate equality
approx_epsilonfn approx_epsilon() -> Epsapprox_eqfn approx_eq(&self, other: &Self) -> boolapprox_eq_epsfn approx_eq_eps(&self, other: &Self, approx_epsilon: &Eps) -> boolEqTrait for values that can be compared for equality and inequality.
This trait allows partial equality, where types can be unordered instead of strictly equal or unequal. For example, with the built-in floating-point types a == b and a != b will both evaluate to false if either a or b is NaN (cf. IEEE 754-2008 section 5.11).
Eventually, this will be implemented by default for types that implement TotalEq.
eqfn eq(&self, other: &Self) -> boolnefn ne(&self, other: &Self) -> boolEquivThe equivalence relation. Two values may be equivalent even if they are of different types. The most common use case for this relation is container types; e.g. it is often desirable to be able to use &str values to look up entries in a container with ~str keys.
equivfn equiv(&self, other: &T) -> boolOrdTrait for values that can be compared for a sort-order.
Eventually this may be simplified to only require an le method, with the others generated from default implementations. However it should remain possible to implement the others separately, for compatibility with floating-point NaN semantics (cf. IEEE 754-2008 section 5.11).
ltfn lt(&self, other: &Self) -> boollefn le(&self, other: &Self) -> boolgefn ge(&self, other: &Self) -> boolgtfn gt(&self, other: &Self) -> boolTotalEqTrait for equality comparisons where a == b and a != b are strict inverses.
equalsfn equals(&self, other: &Self) -> boolTotalOrdTrait for types that form a total order
cmpfn cmp(&self, other: &Self) -> OrderingTotalEq for boolequalsfn equals(&self, other: &bool) -> boolTotalEq for u8equalsfn equals(&self, other: &u8) -> boolTotalEq for u16equalsfn equals(&self, other: &u16) -> boolTotalEq for u32equalsfn equals(&self, other: &u32) -> boolTotalEq for u64equalsfn equals(&self, other: &u64) -> boolTotalEq for i8equalsfn equals(&self, other: &i8) -> boolTotalEq for i16equalsfn equals(&self, other: &i16) -> boolTotalEq for i32equalsfn equals(&self, other: &i32) -> boolTotalEq for i64equalsfn equals(&self, other: &i64) -> boolTotalEq for intequalsfn equals(&self, other: &int) -> boolTotalEq for uintequalsfn equals(&self, other: &uint) -> boolTotalEq for charequalsfn equals(&self, other: &char) -> bool::std::clone::Clone for OrderingAutomatically derived.
clonefn clone(&self) -> Ordering::std::cmp::Eq for OrderingAutomatically derived.
eqfn eq(&self, __arg_0: &Ordering) -> ::boolnefn ne(&self, __arg_0: &Ordering) -> ::boolTotalOrd for Orderingcmpfn cmp(&self, other: &Ordering) -> OrderingOrd for Orderingltfn lt(&self, other: &Ordering) -> boollefn le(&self, other: &Ordering) -> boolgtfn gt(&self, other: &Ordering) -> boolgefn ge(&self, other: &Ordering) -> boolTotalOrd for u8cmpfn cmp(&self, other: &u8) -> OrderingTotalOrd for u16cmpfn cmp(&self, other: &u16) -> OrderingTotalOrd for u32cmpfn cmp(&self, other: &u32) -> OrderingTotalOrd for u64cmpfn cmp(&self, other: &u64) -> OrderingTotalOrd for i8cmpfn cmp(&self, other: &i8) -> OrderingTotalOrd for i16cmpfn cmp(&self, other: &i16) -> OrderingTotalOrd for i32cmpfn cmp(&self, other: &i32) -> OrderingTotalOrd for i64cmpfn cmp(&self, other: &i64) -> OrderingTotalOrd for intcmpfn cmp(&self, other: &int) -> OrderingTotalOrd for uintcmpfn cmp(&self, other: &uint) -> OrderingTotalOrd for charcmpfn cmp(&self, other: &char) -> Orderingcmp2fn cmp2<A: TotalOrd, B: TotalOrd>(a1: &A, b1: &B, a2: &A, b2: &B) -> OrderingCompares (a1, b1) against (a2, b2), where the a values are more significant.
lexical_orderingfn lexical_ordering(o1: Ordering, o2: Ordering) -> OrderingReturn o1 if it is not Equal, otherwise o2. Simulates the lexical ordering on a type (int, int).
maxfn max<T: Ord>(v1: T, v2: T) -> Tminfn min<T: Ord>(v1: T, v2: T) -> T