Data.Comp.Ordering

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

Documentation

class EqF f => OrdF f where

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

Minimal complete definition

compareF

Methods

compareF :: Ord a => f a -> f a -> Ordering

Instances

OrdF []

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a => [a] -> [a] -> Ordering

OrdF Maybe

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a => Maybe a -> Maybe a -> Ordering

Ord a => OrdF ((,) a)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, a0) -> (a, a0) -> Ordering

(Ord a, Ord b) => OrdF ((,,) a b)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, a0) -> (a, b, a0) -> Ordering

OrdF f => OrdF (Cxt h f)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a => Cxt h f a -> Cxt h f a -> Ordering

(Ord a, Ord b, Ord c) => OrdF ((,,,) a b c)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, a0) -> (a, b, c, a0) -> Ordering

(OrdF f, OrdF g) => OrdF (f :+: g)

OrdF is propagated through sums.

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a => (f :+: g) a -> (f :+: g) a -> Ordering

(Ord a, Ord b, Ord c, Ord d) => OrdF ((,,,,) a b c d)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, d, a0) -> (a, b, c, d, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e) => OrdF ((,,,,,) a b c d e)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, d, e, a0) -> (a, b, c, d, e, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => OrdF ((,,,,,,) a b c d e f)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, a0) -> (a, b, c, d, e, f, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => OrdF ((,,,,,,,) a b c d e f g)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, g, a0) -> (a, b, c, d, e, f, g, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => OrdF ((,,,,,,,,) a b c d e f g h)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, g, h, a0) -> (a, b, c, d, e, f, g, h, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => OrdF ((,,,,,,,,,) a b c d e f g h i)

Defined in Data.Comp.Ordering

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, g, h, i, a0) -> (a, b, c, d, e, f, g, h, i, a0) -> Ordering

Orphan instances

OrdF []

Methods

compareF :: Ord a => [a] -> [a] -> Ordering

OrdF Maybe

Methods

compareF :: Ord a => Maybe a -> Maybe a -> Ordering

Ord a => OrdF ((,) a)

Methods

compareF :: Ord a0 => (a, a0) -> (a, a0) -> Ordering

(Ord a, Ord b) => OrdF ((,,) a b)

Methods

compareF :: Ord a0 => (a, b, a0) -> (a, b, a0) -> Ordering

OrdF f => OrdF (Cxt h f)

Methods

compareF :: Ord a => Cxt h f a -> Cxt h f a -> Ordering

(OrdF f, Ord a) => Ord (Cxt h f a)

From an OrdF functor an Ord instance of the corresponding term type can be derived.

Methods

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

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

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

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

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

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

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

(Ord a, Ord b, Ord c) => OrdF ((,,,) a b c)

Methods

compareF :: Ord a0 => (a, b, c, a0) -> (a, b, c, a0) -> Ordering

(OrdF f, OrdF g) => OrdF (f :+: g)

OrdF is propagated through sums.

Methods

compareF :: Ord a => (f :+: g) a -> (f :+: g) a -> Ordering

(Ord a, Ord b, Ord c, Ord d) => OrdF ((,,,,) a b c d)

Methods

compareF :: Ord a0 => (a, b, c, d, a0) -> (a, b, c, d, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e) => OrdF ((,,,,,) a b c d e)

Methods

compareF :: Ord a0 => (a, b, c, d, e, a0) -> (a, b, c, d, e, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => OrdF ((,,,,,,) a b c d e f)

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, a0) -> (a, b, c, d, e, f, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => OrdF ((,,,,,,,) a b c d e f g)

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, g, a0) -> (a, b, c, d, e, f, g, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => OrdF ((,,,,,,,,) a b c d e f g h)

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, g, h, a0) -> (a, b, c, d, e, f, g, h, a0) -> Ordering

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => OrdF ((,,,,,,,,,) a b c d e f g h i)

Methods

compareF :: Ord a0 => (a, b, c, d, e, f, g, h, i, a0) -> (a, b, c, d, e, f, g, h, i, a0) -> Ordering