|
Algebra.Indexable | Portability | portable | Stability | provisional | Maintainer | numericprelude@henning-thielemann.de |
|
|
|
Description |
An alternative type class for Ord
which allows an ordering for dictionaries like Data.Map and Data.Set
independently from the ordering with respect to a magnitude.
|
|
Synopsis |
|
|
|
Documentation |
|
|
Definition of an alternative ordering of objects
independent from a notion of magnitude.
For an application see MathObj.PartialFraction.
| | Methods | | | Instances | |
|
|
|
If the type has already an Ord instance
it is certainly the most easiest to define compare
to be equal to Ord's compare.
|
|
|
Lift compare implementation from a wrapped object.
|
|
|
Wrap an indexable object such that it can be used in Data.Map and Data.Set.
| Instances | |
|
|
|
|
|
|
Produced by Haddock version 2.4.2 |