Data.Comp.Multi.Ordering

This module defines ordering of signatures, which lifts to ordering of terms and contexts.

Documentation

class KEq f => KOrd f where

Minimal complete definition

kcompare

Methods

kcompare :: f i -> f j -> Ordering

Instances

Ord a => KOrd (K a)

Methods

kcompare :: K a i -> K a j -> Ordering

(HFunctor f, OrdHF f, KOrd a) => KOrd (Cxt h f a)

Methods

kcompare :: Cxt h f a i -> Cxt h f a j -> Ordering

class EqHF f => OrdHF f where

Signature ordering. An instance OrdHF f gives rise to an instance Ord (Term f).

Minimal complete definition

compareHF

Methods

compareHF :: KOrd a => f a i -> f a j -> Ordering

Instances

(HFunctor f, OrdHF f) => OrdHF (Cxt h f)

From an OrdHF difunctor an Ord instance of the corresponding term type can be derived.

Methods

compareHF :: KOrd a => Cxt h f a i -> Cxt h f a j -> Ordering

(OrdHF f, OrdHF g) => OrdHF ((:+:) * f g)

OrdHF is propagated through sums.

Methods

compareHF :: KOrd a => (* :+: f) g a i -> (* :+: f) g a j -> Ordering

Orphan instances

KOrd f => Ord (E f)

Methods

compare :: E f -> E f -> Ordering

(<) :: E f -> E f -> Bool

(<=) :: E f -> E f -> Bool

(>) :: E f -> E f -> Bool

(>=) :: E f -> E f -> Bool

max :: E f -> E f -> E f

min :: E f -> E f -> E f

(HFunctor f, OrdHF f, KOrd a) => Ord (Cxt h f a i)

Ordering of terms.

Methods

compare :: Cxt h f a i -> Cxt h f a i -> Ordering

(<) :: Cxt h f a i -> Cxt h f a i -> Bool

(<=) :: Cxt h f a i -> Cxt h f a i -> Bool

(>) :: Cxt h f a i -> Cxt h f a i -> Bool

(>=) :: Cxt h f a i -> Cxt h f a i -> Bool

max :: Cxt h f a i -> Cxt h f a i -> Cxt h f a i

min :: Cxt h f a i -> Cxt h f a i -> Cxt h f a i