Modulenumeric-prelude-0.4.4Haskell98

Algebra.Indexable

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.

1 type
1 class
4 values

Packagenumeric-prelude-0.4.4
Exports6
LanguageHaskell98
LicenceBSD-3-Clause
SourceIndexable.hs

classclass Eq a => C a where

Definition of an alternative ordering of objects independent from a notion of magnitude. For an application see MathObj.PartialFraction.

Methods

compare :: a -> a -> Ordering

Instances7C, …

C IntegerDefined in numeric-prelude-0.4.4 · Algebra.Indexable
C TDefined in numeric-prelude-0.4.4 · Number.Peano
C a => C (T a)Defined in numeric-prelude-0.4.4 · Number.Complex
C a => C [a]Defined in numeric-prelude-0.4.4 · Algebra.Indexable
(Ord a, C a) => C (T a)Defined in numeric-prelude-0.4.4 · Number.Ratio
(C a, C a) => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.Polynomial
(C a, C b) => C (a, b)Defined in numeric-prelude-0.4.4 · Algebra.Indexable

valueordCompare :: Ord a => a -> a -> Ordering

If the type has already an Ord instance it is certainly the most easiest to define compare to be equal to Ord's compare.

valueliftCompare :: C b => (a -> b) -> a -> a -> Ordering

Lift compare implementation from a wrapped object.

newtypenewtype ToOrd a

Wrap an indexable object such that it can be used in Data.Map and Data.Set.

Instances3Eq, Ord, Show

Eq a => Eq (ToOrd a)Defined in numeric-prelude-0.4.4 · Algebra.Indexable
C a => Ord (ToOrd a)Defined in numeric-prelude-0.4.4 · Algebra.Indexable
Show a => Show (ToOrd a)Defined in numeric-prelude-0.4.4 · Algebra.Indexable

valuetoOrd :: a -> ToOrd a

valuefromOrd :: ToOrd a -> a