A trait for representing partial orderings. It is important to
distinguish between a type that has a partial order and a representation
of partial ordering on some type. This trait is for representing the latter.
A partial ordering
is a binary relation on a type T that is also an equivalence
relation on values of type T. This relation is exposed as
the lteq method of the PartialOrdering trait.
This relation must be: