Data.GADT.Compare.TH

Documentation

class DeriveGEQ t where

Methods

deriveGEq :: t -> Q [Dec]

Instances

DeriveGEQ Dec

Defined in Data.GADT.Compare.TH

Methods

deriveGEq :: Dec -> Q [Dec]

DeriveGEQ Name

Defined in Data.GADT.Compare.TH

Methods

deriveGEq :: Name -> Q [Dec]

DeriveGEQ t => DeriveGEQ (Q t)

Defined in Data.GADT.Compare.TH

Methods

deriveGEq :: Q t -> Q [Dec]

DeriveGEQ t => DeriveGEQ [t]

Defined in Data.GADT.Compare.TH

Methods

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

class DeriveGCompare t where

Methods

deriveGCompare :: t -> Q [Dec]

Instances

DeriveGCompare Dec

Defined in Data.GADT.Compare.TH

Methods

deriveGCompare :: Dec -> Q [Dec]

DeriveGCompare Name

Defined in Data.GADT.Compare.TH

Methods

deriveGCompare :: Name -> Q [Dec]

DeriveGCompare t => DeriveGCompare (Q t)

Defined in Data.GADT.Compare.TH

Methods

deriveGCompare :: Q t -> Q [Dec]

DeriveGCompare t => DeriveGCompare [t]

Defined in Data.GADT.Compare.TH

Methods

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

data GComparing a b t

Instances

Applicative (GComparing a b)

Defined in Data.GADT.Compare.Monad

Methods

pure :: a0 -> GComparing a b a0

(<*>) :: GComparing a b (a0 -> b0) -> GComparing a b a0 -> GComparing a b b0

liftA2 :: (a0 -> b0 -> c) -> GComparing a b a0 -> GComparing a b b0 -> GComparing a b c

(*>) :: GComparing a b a0 -> GComparing a b b0 -> GComparing a b b0

(<*) :: GComparing a b a0 -> GComparing a b b0 -> GComparing a b a0

Functor (GComparing a b)

Defined in Data.GADT.Compare.Monad

Methods

fmap :: (a0 -> b0) -> GComparing a b a0 -> GComparing a b b0

(<$) :: a0 -> GComparing a b b0 -> GComparing a b a0

Monad (GComparing a b)

Defined in Data.GADT.Compare.Monad

Methods

(>>=) :: GComparing a b a0 -> (a0 -> GComparing a b b0) -> GComparing a b b0

(>>) :: GComparing a b a0 -> GComparing a b b0 -> GComparing a b b0

return :: a0 -> GComparing a b a0

runGComparing :: forall {k} {a :: k} {b :: k}. GComparing a b (GOrdering a b) -> GOrdering a b

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

compare' :: forall {k} {a} {a :: k} {b :: k}. Ord a => a -> a -> GComparing a b ()