hask.Data.Ord – The Data.Ord

Ordering

The ADT Ordering:

data Ordering = LT | EQ | GT deriving(Show, Eq, Ord, Bounded)

LT

EQ

GT

hask.Data.Ord.max(*args, **kwargs)

max :: a -> a -> a

Maximum function.

hask.Data.Ord.min(*args, **kwargs)

min :: a -> a -> a

Minumum function.

hask.Data.Ord.compare(*args, **kwargs)

compare :: a -> a -> Ordering

Comparison function.

hask.Data.Ord.comparing(*args, **kwargs)

comparing :: Ord a => (b -> a) -> b -> b -> Ordering

comparing(p, x, y) = compare(p(x), p(y))

Useful combinator for use in conjunction with the xxxBy family of functions from Data.List, for example:

... sortBy (comparing(fst)) ...