dependent-sum-template-0.0.0.5: Template Haskell code to generate instances of classes in dependent-sum package

Safe HaskellNone
LanguageHaskell98

Data.GADT.Compare.TH

Documentation

class DeriveGEQ t where Source #

Minimal complete definition

deriveGEq

Methods

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

Instances

DeriveGEQ Dec Source # 

Methods

deriveGEq :: Dec -> Q [Dec] Source #

DeriveGEQ Name Source # 

Methods

deriveGEq :: Name -> Q [Dec] Source #

DeriveGEQ t => DeriveGEQ [t] Source # 

Methods

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

DeriveGEQ t => DeriveGEQ (Q t) Source # 

Methods

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

class DeriveGCompare t where Source #

Minimal complete definition

deriveGCompare

Methods

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

Instances

data GComparing a b t Source #

Instances

Monad (GComparing k a b) Source # 

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) Source # 

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) Source # 

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 t t1 (GOrdering k t t1) -> GOrdering k t t1 Source #

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

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