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

Orphan instances

OrdF []

Methods

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

OrdF Maybe

Methods

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

Ord a0 => OrdF ((,) a0)

Methods

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

(Ord a0, Ord b0) => OrdF ((,,) a0 b0)

Methods

compareF :: Ord a => (a0, b0, a) -> (a0, b0, a) -> 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 a0, Ord b0, Ord c0) => OrdF ((,,,) a0 b0 c0)

Methods

compareF :: Ord a => (a0, b0, c0, a) -> (a0, b0, c0, a) -> 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 a0, Ord b0, Ord c0, Ord d0) => OrdF ((,,,,) a0 b0 c0 d0)

Methods

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

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0) => OrdF ((,,,,,) a0 b0 c0 d0 e0)

Methods

compareF :: Ord a => (a0, b0, c0, d0, e0, a) -> (a0, b0, c0, d0, e0, a) -> Ordering

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0) => OrdF ((,,,,,,) a0 b0 c0 d0 e0 f0)

Methods

compareF :: Ord a => (a0, b0, c0, d0, e0, f0, a) -> (a0, b0, c0, d0, e0, f0, a) -> Ordering

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0, Ord g0) => OrdF ((,,,,,,,) a0 b0 c0 d0 e0 f0 g0)

Methods

compareF :: Ord a => (a0, b0, c0, d0, e0, f0, g0, a) -> (a0, b0, c0, d0, e0, f0, g0, a) -> Ordering

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0, Ord g0, Ord h0) => OrdF ((,,,,,,,,) a0 b0 c0 d0 e0 f0 g0 h0)

Methods

compareF :: Ord a => (a0, b0, c0, d0, e0, f0, g0, h0, a) -> (a0, b0, c0, d0, e0, f0, g0, h0, a) -> Ordering

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0, Ord g0, Ord h0, Ord i0) => OrdF ((,,,,,,,,,) a0 b0 c0 d0 e0 f0 g0 h0 i0)

Methods

compareF :: Ord a => (a0, b0, c0, d0, e0, f0, g0, h0, i0, a) -> (a0, b0, c0, d0, e0, f0, g0, h0, i0, a) -> Ordering