Safe Haskell | None |
---|---|
Language | Haskell98 |
Data.GADT.Compare.TH
Documentation
class DeriveGEQ t where Source #
Instances
DeriveGEQ Dec Source # | |
Defined in Data.GADT.Compare.TH | |
DeriveGEQ Name Source # | |
Defined in Data.GADT.Compare.TH | |
DeriveGEQ t => DeriveGEQ [t] Source # | |
Defined in Data.GADT.Compare.TH | |
DeriveGEQ t => DeriveGEQ (Q t) Source # | |
Defined in Data.GADT.Compare.TH |
class DeriveGCompare t where Source #
Methods
deriveGCompare :: t -> Q [Dec] Source #
Instances
DeriveGCompare Dec Source # | |
Defined in Data.GADT.Compare.TH Methods deriveGCompare :: Dec -> Q [Dec] Source # | |
DeriveGCompare Name Source # | |
Defined in Data.GADT.Compare.TH Methods deriveGCompare :: Name -> Q [Dec] Source # | |
DeriveGCompare t => DeriveGCompare [t] Source # | |
Defined in Data.GADT.Compare.TH Methods deriveGCompare :: [t] -> Q [Dec] Source # | |
DeriveGCompare t => DeriveGCompare (Q t) Source # | |
Defined in Data.GADT.Compare.TH Methods deriveGCompare :: Q t -> Q [Dec] Source # |
data GComparing a b t Source #
Instances
Monad (GComparing a b) Source # | |
Defined in Data.GADT.Compare.TH 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 | |
Functor (GComparing a b) Source # | |
Defined in Data.GADT.Compare.TH Methods fmap :: (a0 -> b0) -> GComparing a b a0 -> GComparing a b b0 (<$) :: a0 -> GComparing a b b0 -> GComparing a b a0 | |
Applicative (GComparing a b) Source # | |
Defined in Data.GADT.Compare.TH 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 |
runGComparing :: forall k (a :: k) (b :: k). GComparing a b (GOrdering a b) -> GOrdering a b Source #
geq' :: GCompare t => t a -> t b -> GComparing x y (a :~: b) Source #
compare' :: forall k a1 (a2 :: k) (b :: k). Ord a1 => a1 -> a1 -> GComparing a2 b () Source #