Details
Types conforming to Comparable implement infix== and infix<. These to operations describe a strict total order all instances of the conforming type. A strict total order on a type T is a binary relation that satisfies the following for all instances a, b, and c:
- a < a is always false (irreflexivity)
- if a < b then b < a is false (asymmetry)
- if a < b and b < b then a < c (transitivity)
- if a == b is false then either a < b or b < a (totality)
Making T conform to Comparable automatically equips T with members infix>, infix>=, and infix<=, which may be overridden for T.