Safe Haskell	None
Language	Haskell2010

Rel8.Internal.Order

Synopsis

Documentation

An ordering expression for a. Primitive orderings are defined with asc and desc, and you can combine Order via its various instances.

A common pattern is to use <> to combine multiple orderings in sequence, and >$< to select individual columns.

Constructors

Order (Order a)

Instances details

Contravariant Order Source #
Instance details Defined in Rel8.Internal.Order Methods contramap :: (a' -> a) -> Order a -> Order a' # (>$) :: b -> Order b -> Order a #
Decidable Order Source #
Instance details Defined in Rel8.Internal.Order Methods lose :: (a -> Void) -> Order a choose :: (a -> Either b c) -> Order b -> Order c -> Order a
Divisible Order Source #
Instance details Defined in Rel8.Internal.Order Methods divide :: (a -> (b, c)) -> Order b -> Order c -> Order a conquer :: Order a
Monoid (Order a) Source #
Instance details Defined in Rel8.Internal.Order Methods mempty :: Order a # mappend :: Order a -> Order a -> Order a # mconcat :: [Order a] -> Order a #
Semigroup (Order a) Source #
Instance details Defined in Rel8.Internal.Order Methods (<>) :: Order a -> Order a -> Order a # sconcat :: NonEmpty (Order a) -> Order a # stimes :: Integral b => b -> Order a -> Order a #