Data.GADT.Compare.TH

Documentation

class DeriveGEQ t where

Minimal complete definition

deriveGEq

Methods

deriveGEq :: t -> Q [Dec]

Instances

DeriveGEQ Dec

Methods

deriveGEq :: Dec -> Q [Dec]

DeriveGEQ Name

Methods

deriveGEq :: Name -> Q [Dec]

DeriveGEQ t => DeriveGEQ [t]

Methods

deriveGEq :: [t] -> Q [Dec]

DeriveGEQ t => DeriveGEQ (Q t)

Methods

deriveGEq :: Q t -> Q [Dec]

class DeriveGCompare t where

Minimal complete definition

deriveGCompare

Methods

deriveGCompare :: t -> Q [Dec]

Instances

DeriveGCompare Dec

Methods

deriveGCompare :: Dec -> Q [Dec]

DeriveGCompare Name

Methods

deriveGCompare :: Name -> Q [Dec]

DeriveGCompare t => DeriveGCompare [t]

Methods

deriveGCompare :: [t] -> Q [Dec]

DeriveGCompare t => DeriveGCompare (Q t)

Methods

deriveGCompare :: Q t -> Q [Dec]

data GComparing a b t

Instances

Monad (GComparing k a b)

Methods

(>>=) :: GComparing k a b a -> (a -> GComparing k a b b) -> GComparing k a b b

(>>) :: GComparing k a b a -> GComparing k a b b -> GComparing k a b b

return :: a -> GComparing k a b a

fail :: String -> GComparing k a b a

Functor (GComparing k a b)

Methods

fmap :: (a -> b) -> GComparing k a b a -> GComparing k a b b

(<$) :: a -> GComparing k a b b -> GComparing k a b a

Applicative (GComparing k a b)

Methods

pure :: a -> GComparing k a b a

(<*>) :: GComparing k a b (a -> b) -> GComparing k a b a -> GComparing k a b b

(*>) :: GComparing k a b a -> GComparing k a b b -> GComparing k a b b

(<*) :: GComparing k a b a -> GComparing k a b b -> GComparing k a b a

runGComparing :: GComparing k t1 t (GOrdering k t1 t) -> GOrdering k t1 t

geq' :: GCompare t => t a -> t b -> GComparing x y (a := b)

compare' :: Ord a1 => a1 -> a1 -> GComparing k a b ()