Between tests whether a value is between a minimum (inclusive) and a maximum (exclusive).

Clamp clamps a value between a minimum and a maximum.

Contramap creates an ordering under a transformation function.

MakeOrd creates an instance of an Ord from a compare function.

FromStrictCompare implements the ordering based on the built in native order.

Geq tests whether one value is greater or equal than another.

* * Test whether one value is strictly greater than another */.

Leq Tests whether one value is less or equal than another.

Lt tests whether one value is strictly less than another.

MakeOrd creates an instance of an Ord.

Max takes the maximum of two values.

MaxSemigroup returns a semigroup where `concat` will return the maximum, based on the provided order.

Min takes the minimum of two values.

MaxSemigroup returns a semigroup where `concat` will return the minimum, based on the provided order.

Monoid implements a two level ordering such that - its `Concat(ord1, ord2)` operation will order first by `ord1`, and then by `ord2` - its `Empty` value is an `Ord` that always considers compared elements equal.

Reverse creates an inverted ordering.

Semigroup implements a two level ordering.

ToEq converts an [Ord] to [E.Eq].