Safe Haskell	None
Language	Haskell98

Data.GADT.Compare.TH

Documentation

class DeriveGEQ t where #

Minimal complete definition

Methods

Instances

Minimal complete definition

Methods

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 # liftA2 :: (a -> b -> c) -> GComparing k a b a -> GComparing k a b b -> GComparing k a b c # (>) :: 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 #

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

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