Language.Haskell.TH.Syntax
| Safe Haskell | Trustworthy |
|---|---|
| Language | Haskell2010 |
class Monad m => Quote (m :: Type -> Type) where Source
The Quote class implements the minimal interface which is necessary for desugaring quotations.
- The
Monad msuperclass is needed to stitch together the different AST fragments. -
newNameis used when desugaring binding structures such as lambdas to generate fresh names.
Therefore the type of an untyped quotation in GHC is `Quote m => m Exp`
For many years the type of a quotation was fixed to be `Q Exp` but by more precisely specifying the minimal interface it enables the Exp to be extracted purely from the quotation without interacting with Q.
Methods
newName :: String -> m Name Source
Generate a fresh name, which cannot be captured.
For example, this:
f = $(do
nm1 <- newName "x"
let nm2 = mkName "x"
return (LamE [VarP nm1] (LamE [VarP nm2] (VarE nm1)))
)
will produce the splice
f = \x0 -> \x -> x0
In particular, the occurrence VarE nm1 refers to the binding VarP nm1, and is not captured by the binding VarP nm2.
Although names generated by newName cannot be captured, they can capture other names. For example, this:
g = $(do nm1 <- newName "x" let nm2 = mkName "x" return (LamE [VarP nm2] (LamE [VarP nm1] (VarE nm2))) )
will produce the splice
g = \x -> \x0 -> x0
since the occurrence VarE nm2 is captured by the innermost binding of x, namely VarP nm1.
Instances
A Haskell expression.
Constructors
| VarE Name | { x } |
| ConE Name | data T1 = C1 t1 t2; p = {C1} e1 e2 |
| LitE Lit | { 5 or 'c'} |
| AppE Exp Exp | { f x } |
| AppTypeE Exp Type | { f @Int } |
| InfixE (Maybe Exp) Exp (Maybe Exp) | {x + y} or {(x+)} or {(+ x)} or {(+)} |
| UInfixE Exp Exp Exp |
{x + y}
|
| ParensE Exp |
{ (e) }
|
| LamE [Pat] Exp | { \ p1 p2 -> e } |
| LamCaseE [Match] | { \case m1; m2 } |
| LamCasesE [Clause] | { \cases m1; m2 } |
| TupE [Maybe Exp] |
{ (e1,e2) }
The (1,) translates to TupE [Just (LitE (IntegerL 1)),Nothing] |
| UnboxedTupE [Maybe Exp] |
{ (# e1,e2 #) }
The (# 'c', #) translates to UnboxedTupE [Just (LitE (CharL 'c')),Nothing] |
| UnboxedSumE Exp SumAlt SumArity | { (#|e|#) } |
| CondE Exp Exp Exp | { if e1 then e2 else e3 } |
| MultiIfE [(Guard, Exp)] | { if | g1 -> e1 | g2 -> e2 } |
| LetE [Dec] Exp | { let { x=e1; y=e2 } in e3 } |
| CaseE Exp [Match] | { case e of m1; m2 } |
| DoE (Maybe ModName) [Stmt] |
|
| MDoE (Maybe ModName) [Stmt] |
|
| CompE [Stmt] |
{ [ (x,y) | x <- xs, y <- ys ] }
The result expression of the comprehension is the last of the E.g. translation: [ f x | x <- xs ] CompE [BindS (VarP x) (VarE xs), NoBindS (AppE (VarE f) (VarE x))] |
| ArithSeqE Range | { [ 1 ,2 .. 10 ] } |
| ListE [Exp] | { [1,2,3] } |
| SigE Exp Type | { e :: t } |
| RecConE Name [FieldExp] | { T { x = y, z = w } } |
| RecUpdE Exp [FieldExp] | { (f x) { z = w } } |
| StaticE Exp | { static e } |
| UnboundVarE Name |
{ _x }
This is used for holes or unresolved identifiers in AST quotes. Note that it could either have a variable name or constructor name. |
| LabelE String |
|
| ImplicitParamVarE String |
|
| GetFieldE Exp String |
|
| ProjectionE (NonEmpty String) |
|
| TypedBracketE Exp | [|| e ||] |
| TypedSpliceE Exp | $$e |
| TypeE Type | { type t } |
| ForallE [TyVarBndr Specificity] Exp | forall <vars>. <expr> |
| ForallVisE [TyVarBndr ()] Exp | forall <vars> -> <expr> |
| ConstrainedE [Exp] Exp | <ctxt> => <expr> |
Instances
A case-alternative
Instances
| Ppr Match Source | |||||
| Eq Match Source | |||||
| Ord Match Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Match Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Match -> c Match Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Match Source toConstr :: Match -> Constr Source dataTypeOf :: Match -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Match) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Match) Source gmapT :: (forall b. Data b => b -> b) -> Match -> Match Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Match -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Match -> r Source gmapQ :: (forall d. Data d => d -> u) -> Match -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Match -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Match -> m Match Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Match -> m Match Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Match -> m Match Source | |||||
| Generic Match Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Match Source | |||||
| Lift Match Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Match Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Match = D1 ('MetaData "Match" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Match" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Body) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dec])))) | |||||
A clause consists of patterns, guards, a body expression, and a list of declarations under a where. Clauses are seen in equations for function definitions, case-experssions, explicitly-bidirectional pattern synonyms, etc.
Instances
| Ppr Clause Source | |||||
| Eq Clause Source | |||||
| Ord Clause Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Clause Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Clause -> c Clause Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Clause Source toConstr :: Clause -> Constr Source dataTypeOf :: Clause -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Clause) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Clause) Source gmapT :: (forall b. Data b => b -> b) -> Clause -> Clause Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Clause -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Clause -> r Source gmapQ :: (forall d. Data d => d -> u) -> Clause -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Clause -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Clause -> m Clause Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Clause -> m Clause Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Clause -> m Clause Source | |||||
| Generic Clause Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Clause Source | |||||
| Lift Clause Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Clause Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Clause = D1 ('MetaData "Clause" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Clause" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Body) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dec])))) | |||||
In short, Q provides the Quasi operations in one neat monad for the user.
The longer story, is that Q wraps an arbitrary Quasi-able monad. The perceptive reader notices that Quasi has only two instances, Q itself and IO, neither of which have concrete implementations.Q plays the trick of dependency inversion, providing an abstract interface for the user which is later concretely fufilled by an concrete Quasi instance, internal to GHC.
Instances
| Applicative Q Source | |
| Functor Q Source | |
| Monad Q Source | |
| MonadFail Q Source | |
Defined in GHC.Internal.TH.Syntax Methodsfail :: HasCallStack => String -> Q a Source | |
| MonadFix Q Source |
If the function passed to Since: ghc-internal-2.17.0.0 |
Defined in GHC.Internal.TH.Syntax | |
| MonadIO Q Source | |
Defined in GHC.Internal.TH.Syntax | |
| Quasi Q Source | |
Defined in GHC.Internal.TH.Syntax MethodsqNewName :: String -> Q Name Source qReport :: Bool -> String -> Q () Source qRecover :: Q a -> Q a -> Q a Source qLookupName :: Bool -> String -> Q (Maybe Name) Source qReify :: Name -> Q Info Source qReifyFixity :: Name -> Q (Maybe Fixity) Source qReifyType :: Name -> Q Type Source qReifyInstances :: Name -> [Type] -> Q [Dec] Source qReifyRoles :: Name -> Q [Role] Source qReifyAnnotations :: Data a => AnnLookup -> Q [a] Source qReifyModule :: Module -> Q ModuleInfo Source qReifyConStrictness :: Name -> Q [DecidedStrictness] Source qGetPackageRoot :: Q FilePath Source qAddDependentFile :: FilePath -> Q () Source qAddTempFile :: String -> Q FilePath Source qAddTopDecls :: [Dec] -> Q () Source qAddForeignFilePath :: ForeignSrcLang -> String -> Q () Source qAddModFinalizer :: Q () -> Q () Source qAddCorePlugin :: String -> Q () Source qGetQ :: Typeable a => Q (Maybe a) Source qPutQ :: Typeable a => a -> Q () Source qIsExtEnabled :: Extension -> Q Bool Source qExtsEnabled :: Q [Extension] Source | |
| Quote Q Source | |
| Monoid a => Monoid (Q a) Source | Since: ghc-internal-2.17.0.0 |
| Semigroup a => Semigroup (Q a) Source | Since: ghc-internal-2.17.0.0 |
Pattern in Haskell given in {}
Constructors
| LitP Lit | { 5 or 'c' } |
| VarP Name | { x } |
| TupP [Pat] | { (p1,p2) } |
| UnboxedTupP [Pat] | { (# p1,p2 #) } |
| UnboxedSumP Pat SumAlt SumArity | { (#|p|#) } |
| ConP Name [Type] [Pat] | data T1 = C1 t1 t2; {C1 @ty1 p1 p2} = e |
| InfixP Pat Name Pat | foo ({x :+ y}) = e |
| UInfixP Pat Name Pat |
foo ({x :+ y}) = e
|
| ParensP Pat |
{(p)}
|
| TildeP Pat | { ~p } |
| BangP Pat | { !p } |
| AsP Name Pat | { x @ p } |
| WildP | { _ } |
| RecP Name [FieldPat] | f (Pt { pointx = x }) = g x |
| ListP [Pat] | { [1,2,3] } |
| SigP Pat Type | { p :: t } |
| ViewP Exp Pat | { e -> p } |
| TypeP Type | { type p } |
| InvisP Type |
|
| OrP (NonEmpty Pat) | { p1; p2 } |
Instances
| Ppr Pat Source | |||||
| Eq Pat Source | |||||
| Ord Pat Source | |||||
| Data Pat Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pat -> c Pat Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Pat Source toConstr :: Pat -> Constr Source dataTypeOf :: Pat -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Pat) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Pat) Source gmapT :: (forall b. Data b => b -> b) -> Pat -> Pat Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pat -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pat -> r Source gmapQ :: (forall d. Data d => d -> u) -> Pat -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Pat -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pat -> m Pat Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pat -> m Pat Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pat -> m Pat Source | |||||
| Generic Pat Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Pat Source | |||||
| Lift Pat Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Pat Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Pat = D1 ('MetaData "Pat" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((((C1 ('MetaCons "LitP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Lit)) :+: C1 ('MetaCons "VarP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))) :+: (C1 ('MetaCons "TupP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat])) :+: (C1 ('MetaCons "UnboxedTupP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat])) :+: C1 ('MetaCons "UnboxedSumP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SumAlt) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SumArity)))))) :+: ((C1 ('MetaCons "ConP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat]))) :+: C1 ('MetaCons "InfixP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat)))) :+: (C1 ('MetaCons "UInfixP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat))) :+: (C1 ('MetaCons "ParensP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat)) :+: C1 ('MetaCons "TildeP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat)))))) :+: (((C1 ('MetaCons "BangP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat)) :+: C1 ('MetaCons "AsP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat))) :+: (C1 ('MetaCons "WildP" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "RecP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FieldPat])) :+: C1 ('MetaCons "ListP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat]))))) :+: ((C1 ('MetaCons "SigP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "ViewP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat))) :+: (C1 ('MetaCons "TypeP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: (C1 ('MetaCons "InvisP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "OrP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty Pat)))))))) | |||||
A single statement, as in do-notation.
Constructors
| BindS Pat Exp | p <- e |
| LetS [Dec] | { let { x=e1; y=e2 } } |
| NoBindS Exp | e |
| ParS [[Stmt]] |
|
| RecS [Stmt] | rec { s1; s2 } |
Instances
| Ppr Stmt Source | |||||
| Eq Stmt Source | |||||
| Ord Stmt Source | |||||
| Data Stmt Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Stmt -> c Stmt Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Stmt Source toConstr :: Stmt -> Constr Source dataTypeOf :: Stmt -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Stmt) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Stmt) Source gmapT :: (forall b. Data b => b -> b) -> Stmt -> Stmt Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Stmt -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Stmt -> r Source gmapQ :: (forall d. Data d => d -> u) -> Stmt -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Stmt -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Stmt -> m Stmt Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Stmt -> m Stmt Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Stmt -> m Stmt Source | |||||
| Generic Stmt Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Stmt Source | |||||
| Lift Stmt Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Stmt Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Stmt = D1 ('MetaData "Stmt" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "BindS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp)) :+: C1 ('MetaCons "LetS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dec]))) :+: (C1 ('MetaCons "NoBindS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp)) :+: (C1 ('MetaCons "ParS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [[Stmt]])) :+: C1 ('MetaCons "RecS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt]))))) | |||||
A data constructor.
The constructors for Con can roughly be divided up into two categories: those for constructors with "vanilla" syntax (NormalC, RecC, and InfixC), and those for constructors with GADT syntax (GadtC and RecGadtC). The ForallC constructor, which quantifies additional type variables and class contexts, can surround either variety of constructor. However, the type variables that it quantifies are different depending on what constructor syntax is used:
- If a
ForallCsurrounds a constructor with vanilla syntax, then theForallCwill only quantify existential type variables. For example:
data Foo a = forall b. MkFoo a b
In MkFoo, ForallC will quantify b, but not a.
- If a
ForallCsurrounds a constructor with GADT syntax, then theForallCwill quantify all type variables used in the constructor. For example:
data Bar a b where
MkBar :: (a ~ b) => c -> MkBar a b
In MkBar, ForallC will quantify a, b, and c.
Multiplicity annotations for data types are currently not supported in Template Haskell (i.e. all fields represented by Template Haskell will be linear).
Constructors
| NormalC Name [BangType] | C Int a |
| RecC Name [VarBangType] | C { v :: Int, w :: a } |
| InfixC BangType Name BangType | Int :+ a |
| ForallC [TyVarBndr Specificity] Cxt Con | forall a. Eq a => C [a] |
| GadtC | |
| RecGadtC | C :: { v :: Int } -> T b Int |
Fields
| |
Instances
| Ppr Con Source | |||||
| Eq Con Source | |||||
| Ord Con Source | |||||
| Data Con Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Con -> c Con Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Con Source toConstr :: Con -> Constr Source dataTypeOf :: Con -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Con) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Con) Source gmapT :: (forall b. Data b => b -> b) -> Con -> Con Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Con -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Con -> r Source gmapQ :: (forall d. Data d => d -> u) -> Con -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Con -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Con -> m Con Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Con -> m Con Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Con -> m Con Source | |||||
| Generic Con Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Con Source | |||||
| Lift Con Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Con Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Con = D1 ('MetaData "Con" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "NormalC" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [BangType])) :+: (C1 ('MetaCons "RecC" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [VarBangType])) :+: C1 ('MetaCons "InfixC" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BangType) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BangType))))) :+: (C1 ('MetaCons "ForallC" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr Specificity]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Con))) :+: (C1 ('MetaCons "GadtC" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [BangType]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "RecGadtC" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [VarBangType]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))))) | |||||
A Haskell type.
Constructors
| ForallT [TyVarBndr Specificity] Cxt Type | forall <vars>. <ctxt> => <type> |
| ForallVisT [TyVarBndr ()] Type | forall <vars> -> <type> |
| AppT Type Type | T a b |
| AppKindT Type Kind | T @k t |
| SigT Type Kind | t :: k |
| VarT Name | a |
| ConT Name | T |
| PromotedT Name | 'T |
| InfixT Type Name Type | T + T |
| UInfixT Type Name Type |
T + T |
| PromotedInfixT Type Name Type | T :+: T |
| PromotedUInfixT Type Name Type |
T :+: T |
| ParensT Type | (T) |
| TupleT Int |
|
| UnboxedTupleT Int |
|
| UnboxedSumT SumArity |
|
| ArrowT | -> |
| MulArrowT |
%n -> Generalised arrow type with multiplicity argument |
| EqualityT | ~ |
| ListT | [] |
| PromotedTupleT Int |
|
| PromotedNilT | '[] |
| PromotedConsT | '(:) |
| StarT | * |
| ConstraintT | Constraint |
| LitT TyLit |
|
| WildCardT | _ |
| ImplicitParamT String Type | ?x :: t |
Instances
| Ppr Type Source | |||||
| Eq Type Source | |||||
| Ord Type Source | |||||
| Data Type Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Type -> c Type Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Type Source toConstr :: Type -> Constr Source dataTypeOf :: Type -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Type) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Type) Source gmapT :: (forall b. Data b => b -> b) -> Type -> Type Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r Source gmapQ :: (forall d. Data d => d -> u) -> Type -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Type -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type -> m Type Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type Source | |||||
| Generic Type Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Type Source | |||||
| Lift Type Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Type Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Type = D1 ('MetaData "Type" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((((C1 ('MetaCons "ForallT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr Specificity]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "ForallVisT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr ()]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "AppT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: ((C1 ('MetaCons "AppKindT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Kind)) :+: C1 ('MetaCons "SigT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Kind))) :+: (C1 ('MetaCons "VarT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "ConT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))))) :+: ((C1 ('MetaCons "PromotedT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: (C1 ('MetaCons "InfixT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "UInfixT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))) :+: ((C1 ('MetaCons "PromotedInfixT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "PromotedUInfixT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: (C1 ('MetaCons "ParensT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "TupleT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))))) :+: (((C1 ('MetaCons "UnboxedTupleT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: (C1 ('MetaCons "UnboxedSumT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SumArity)) :+: C1 ('MetaCons "ArrowT" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "MulArrowT" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EqualityT" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ListT" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PromotedTupleT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))))) :+: ((C1 ('MetaCons "PromotedNilT" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PromotedConsT" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StarT" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ConstraintT" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LitT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyLit))) :+: (C1 ('MetaCons "WildCardT" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImplicitParamT" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))))) | |||||
A single declaration.
Constructors
| FunD Name [Clause] | { f p1 p2 = b where decs } |
| ValD Pat Body [Dec] | { p = b where decs } |
| DataD Cxt Name [TyVarBndr BndrVis] (Maybe Kind) [Con] [DerivClause] | { data Cxt x => T x = A x | B (T x)
deriving (Z,W)
deriving stock Eq } |
| NewtypeD Cxt Name [TyVarBndr BndrVis] (Maybe Kind) Con [DerivClause] | { newtype Cxt x => T x = A (B x)
deriving (Z,W Q)
deriving stock Eq } |
| TypeDataD Name [TyVarBndr BndrVis] (Maybe Kind) [Con] | { type data T x = A x | B (T x) } |
| TySynD Name [TyVarBndr BndrVis] Type | { type T x = (x,x) } |
| ClassD Cxt Name [TyVarBndr BndrVis] [FunDep] [Dec] | { class Eq a => Ord a where ds } |
| InstanceD (Maybe Overlap) Cxt Type [Dec] | { instance {-# OVERLAPS #-}
Show w => Show [w] where ds } |
| SigD Name Type | { length :: [a] -> Int } |
| KiSigD Name Kind | { type TypeRep :: k -> Type } |
| ForeignD Foreign | { foreign import ... }
{ foreign export ... } |
| InfixD Fixity NamespaceSpecifier Name | { infix 3 data foo } |
| DefaultD [Type] | { default (Integer, Double) } |
| PragmaD | pragmas |
Fields
| |
| DataFamilyD | data families (may also appear in [Dec] of |
| DataInstD Cxt (Maybe [TyVarBndr ()]) Type (Maybe Kind) [Con] [DerivClause] | { data instance Cxt x => T [x]
= A x | B (T x)
deriving (Z,W)
deriving stock Eq } |
| NewtypeInstD Cxt (Maybe [TyVarBndr ()]) Type (Maybe Kind) Con [DerivClause] | { newtype instance Cxt x => T [x]
= A (B x)
deriving (Z,W)
deriving stock Eq } |
| TySynInstD TySynEqn | { type instance ... } |
| OpenTypeFamilyD | open type families (may also appear in [Dec] of |
Fields
| |
| ClosedTypeFamilyD TypeFamilyHead [TySynEqn] | { type family F a b = (r :: *) | r -> a where ... } |
| RoleAnnotD Name [Role] | { type role T nominal representational } |
| StandaloneDerivD (Maybe DerivStrategy) Cxt Type | { deriving stock instance Ord a => Ord (Foo a) } |
| DefaultSigD Name Type | { default size :: Data a => a -> Int } |
| PatSynD | Pattern Synonyms |
Fields
| |
| PatSynSigD Name PatSynType | A pattern synonym's type signature. |
| ImplicitParamBindD String Exp |
{ ?x = expr }
Implicit parameter binding declaration. Can only be used in let and where clauses which consist entirely of implicit bindings. |
Instances
| Ppr Dec Source | |||||
| Eq Dec Source | |||||
| Ord Dec Source | |||||
| Data Dec Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Dec -> c Dec Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Dec Source toConstr :: Dec -> Constr Source dataTypeOf :: Dec -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Dec) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Dec) Source gmapT :: (forall b. Data b => b -> b) -> Dec -> Dec Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Dec -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Dec -> r Source gmapQ :: (forall d. Data d => d -> u) -> Dec -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Dec -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Dec -> m Dec Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Dec -> m Dec Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Dec -> m Dec Source | |||||
| Generic Dec Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Dec Source | |||||
| Lift Dec Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Dec Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Dec = D1 ('MetaData "Dec" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((((C1 ('MetaCons "FunD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause])) :+: (C1 ('MetaCons "ValD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Body) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dec]))) :+: C1 ('MetaCons "DataD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Kind)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Con]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [DerivClause])))))) :+: (C1 ('MetaCons "NewtypeD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Kind)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Con) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [DerivClause])))) :+: (C1 ('MetaCons "TypeDataD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Kind)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Con]))) :+: C1 ('MetaCons "TySynD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))))) :+: ((C1 ('MetaCons "ClassD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FunDep]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dec])))) :+: (C1 ('MetaCons "InstanceD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Overlap)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dec]))) :+: C1 ('MetaCons "SigD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: ((C1 ('MetaCons "KiSigD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Kind)) :+: C1 ('MetaCons "ForeignD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Foreign))) :+: (C1 ('MetaCons "InfixD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Fixity) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NamespaceSpecifier) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))) :+: C1 ('MetaCons "DefaultD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type])))))) :+: (((C1 ('MetaCons "PragmaD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pragma)) :+: (C1 ('MetaCons "DataFamilyD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Kind)))) :+: C1 ('MetaCons "DataInstD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBndr ()])) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Kind)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Con]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [DerivClause])))))) :+: (C1 ('MetaCons "NewtypeInstD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBndr ()])) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Kind)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Con) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [DerivClause])))) :+: (C1 ('MetaCons "TySynInstD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TySynEqn)) :+: C1 ('MetaCons "OpenTypeFamilyD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TypeFamilyHead))))) :+: ((C1 ('MetaCons "ClosedTypeFamilyD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TypeFamilyHead) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TySynEqn])) :+: (C1 ('MetaCons "RoleAnnotD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Role])) :+: C1 ('MetaCons "StandaloneDerivD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe DerivStrategy)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))) :+: ((C1 ('MetaCons "DefaultSigD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "PatSynD" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PatSynArgs)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PatSynDir) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pat)))) :+: (C1 ('MetaCons "PatSynSigD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PatSynType)) :+: C1 ('MetaCons "ImplicitParamBindD" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp))))))) | |||||
type BangType = (Bang, Type) Source
A type with a strictness annotation, as in data constructors. See Con.
type VarBangType = (Name, Bang, Type) Source
BangType, but for record fields. See Con.
type FieldExp = (Name, Exp) Source
A (field name, expression) pair. See RecConE and RecUpdE.
type FieldPat = (Name, Pat) Source
A (field name, pattern) pair. See RecP.
An abstract type representing names in the syntax tree.
Names can be constructed in several ways, which come with different name-capture guarantees (see Language.Haskell.TH.Syntax for an explanation of name capture):
- the built-in syntax
'fand''Tcan be used to construct names, The expression'fgives aNamewhich refers to the valuefcurrently in scope, and''Tgives aNamewhich refers to the typeTcurrently in scope. These names can never be captured. -
lookupValueNameandlookupTypeNameare similar to'fand''Trespectively, but theNames are looked up at the point where the current splice is being run. These names can never be captured. -
newNamemonadically generates a new name, which can never be captured. -
mkNamegenerates a capturable name.
Names constructed using newName and mkName may be used in bindings (such as let x = ... or x -> ...), but names constructed using lookupValueName, lookupTypeName, 'f, ''T may not.
Constructors
| Name OccName NameFlavour |
Instances
| Ppr Name Source | |||||
| Eq Name Source | |||||
| Ord Name Source | |||||
| Data Name Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name -> c Name Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Name Source toConstr :: Name -> Constr Source dataTypeOf :: Name -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Name) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Name) Source gmapT :: (forall b. Data b => b -> b) -> Name -> Name Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r Source gmapQ :: (forall d. Data d => d -> u) -> Name -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Name -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name -> m Name Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name Source | |||||
| Generic Name Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Name Source | |||||
| Lift Name Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Name Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Name = D1 ('MetaData "Name" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Name" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 OccName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NameFlavour))) | |||||
Functional dependency syntax, as in a class declaration.
Instances
| Ppr FunDep Source | |||||
| Eq FunDep Source | |||||
| Ord FunDep Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data FunDep Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunDep -> c FunDep Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FunDep Source toConstr :: FunDep -> Constr Source dataTypeOf :: FunDep -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FunDep) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FunDep) Source gmapT :: (forall b. Data b => b -> b) -> FunDep -> FunDep Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunDep -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunDep -> r Source gmapQ :: (forall d. Data d => d -> u) -> FunDep -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> FunDep -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunDep -> m FunDep Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunDep -> m FunDep Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunDep -> m FunDep Source | |||||
| Generic FunDep Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show FunDep Source | |||||
| Lift FunDep Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep FunDep Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep FunDep = D1 ('MetaData "FunDep" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "FunDep" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]))) | |||||
Since the advent of ConstraintKinds, constraints are really just types. Equality constraints use the EqualityT constructor. Constraints may also be tuples of other constraints.
A binder found in the forall of a RULES pragma.
Constructors
| RuleVar Name | forall {a} ... . |
| TypedRuleVar Name Type | forall {(a :: t)} ... . |
Instances
| Ppr RuleBndr Source | |||||
| Eq RuleBndr Source | |||||
| Ord RuleBndr Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data RuleBndr Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RuleBndr -> c RuleBndr Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RuleBndr Source toConstr :: RuleBndr -> Constr Source dataTypeOf :: RuleBndr -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RuleBndr) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RuleBndr) Source gmapT :: (forall b. Data b => b -> b) -> RuleBndr -> RuleBndr Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RuleBndr -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RuleBndr -> r Source gmapQ :: (forall d. Data d => d -> u) -> RuleBndr -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> RuleBndr -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> RuleBndr -> m RuleBndr Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleBndr -> m RuleBndr Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleBndr -> m RuleBndr Source | |||||
| Generic RuleBndr Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show RuleBndr Source | |||||
| Lift RuleBndr Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep RuleBndr Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep RuleBndr = D1 ('MetaData "RuleBndr" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "RuleVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "TypedRuleVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) | |||||
One equation of a type family instance or closed type family. The arguments are the left-hand-side type and the right-hand-side result.
For instance, if you had the following type family:
type family Foo (a :: k) :: k where forall k (a :: k). Foo @k a = a
The Foo @k a = a equation would be represented as follows:
TySynEqn (Just [PlainTV k, KindedTV a (VarT k)]) (AppT (AppKindT (ConT ''Foo) (VarT k)) (VarT a)) (VarT a)
Instances
| Eq TySynEqn Source | |||||
| Ord TySynEqn Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data TySynEqn Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TySynEqn -> c TySynEqn Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TySynEqn Source toConstr :: TySynEqn -> Constr Source dataTypeOf :: TySynEqn -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TySynEqn) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TySynEqn) Source gmapT :: (forall b. Data b => b -> b) -> TySynEqn -> TySynEqn Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TySynEqn -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TySynEqn -> r Source gmapQ :: (forall d. Data d => d -> u) -> TySynEqn -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> TySynEqn -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> TySynEqn -> m TySynEqn Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TySynEqn -> m TySynEqn Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TySynEqn -> m TySynEqn Source | |||||
| Generic TySynEqn Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show TySynEqn Source | |||||
| Lift TySynEqn Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep TySynEqn Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep TySynEqn = D1 ('MetaData "TySynEqn" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "TySynEqn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBndr ()])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) | |||||
data InjectivityAnn Source
Injectivity annotation as in an injective type family
Constructors
| InjectivityAnn Name [Name] |
Instances
| Ppr InjectivityAnn Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq InjectivityAnn Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: InjectivityAnn -> InjectivityAnn -> Bool Source (/=) :: InjectivityAnn -> InjectivityAnn -> Bool Source | |||||
| Ord InjectivityAnn Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: InjectivityAnn -> InjectivityAnn -> Ordering Source (<) :: InjectivityAnn -> InjectivityAnn -> Bool Source (<=) :: InjectivityAnn -> InjectivityAnn -> Bool Source (>) :: InjectivityAnn -> InjectivityAnn -> Bool Source (>=) :: InjectivityAnn -> InjectivityAnn -> Bool Source max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn Source min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn Source | |||||
| Data InjectivityAnn Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InjectivityAnn -> c InjectivityAnn Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c InjectivityAnn Source toConstr :: InjectivityAnn -> Constr Source dataTypeOf :: InjectivityAnn -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c InjectivityAnn) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c InjectivityAnn) Source gmapT :: (forall b. Data b => b -> b) -> InjectivityAnn -> InjectivityAnn Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InjectivityAnn -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InjectivityAnn -> r Source gmapQ :: (forall d. Data d => d -> u) -> InjectivityAnn -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> InjectivityAnn -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> InjectivityAnn -> m InjectivityAnn Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InjectivityAnn -> m InjectivityAnn Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InjectivityAnn -> m InjectivityAnn Source | |||||
| Generic InjectivityAnn Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: InjectivityAnn -> Rep InjectivityAnn x Source to :: Rep InjectivityAnn x -> InjectivityAnn Source | |||||
| Show InjectivityAnn Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> InjectivityAnn -> ShowS Source show :: InjectivityAnn -> String Source showList :: [InjectivityAnn] -> ShowS Source | |||||
| Lift InjectivityAnn Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => InjectivityAnn -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => InjectivityAnn -> Code m InjectivityAnn Source | |||||
| type Rep InjectivityAnn Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep InjectivityAnn = D1 ('MetaData "InjectivityAnn" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "InjectivityAnn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]))) | |||||
To avoid duplication between kinds and types, they are defined to be the same. Naturally, you would never have a type be StarT and you would never have a kind be SigT, but many of the other constructors are shared. Note that the kind Bool is denoted with ConT, not PromotedT. Similarly, tuple kinds are made with TupleT, not PromotedTupleT.
Varieties of allowed instance overlap.
Constructors
| Overlappable | May be overlapped by more specific instances |
| Overlapping | May overlap a more general instance |
| Overlaps | Both |
| Incoherent | Both |
Instances
| Eq Overlap Source | |||||
| Ord Overlap Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Overlap Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Overlap -> c Overlap Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Overlap Source toConstr :: Overlap -> Constr Source dataTypeOf :: Overlap -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Overlap) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Overlap) Source gmapT :: (forall b. Data b => b -> b) -> Overlap -> Overlap Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Overlap -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Overlap -> r Source gmapQ :: (forall d. Data d => d -> u) -> Overlap -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Overlap -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Overlap -> m Overlap Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Overlap -> m Overlap Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Overlap -> m Overlap Source | |||||
| Generic Overlap Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Overlap Source | |||||
| Lift Overlap Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Overlap Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Overlap = D1 ('MetaData "Overlap" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "Overlappable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Overlapping" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Overlaps" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Incoherent" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
data DerivClause Source
A single deriving clause at the end of a datatype declaration.
Constructors
| DerivClause (Maybe DerivStrategy) Cxt | { deriving stock (Eq, Ord) } |
Instances
| Eq DerivClause Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: DerivClause -> DerivClause -> Bool Source (/=) :: DerivClause -> DerivClause -> Bool Source | |||||
| Ord DerivClause Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: DerivClause -> DerivClause -> Ordering Source (<) :: DerivClause -> DerivClause -> Bool Source (<=) :: DerivClause -> DerivClause -> Bool Source (>) :: DerivClause -> DerivClause -> Bool Source (>=) :: DerivClause -> DerivClause -> Bool Source max :: DerivClause -> DerivClause -> DerivClause Source min :: DerivClause -> DerivClause -> DerivClause Source | |||||
| Data DerivClause Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DerivClause -> c DerivClause Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DerivClause Source toConstr :: DerivClause -> Constr Source dataTypeOf :: DerivClause -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DerivClause) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DerivClause) Source gmapT :: (forall b. Data b => b -> b) -> DerivClause -> DerivClause Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DerivClause -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DerivClause -> r Source gmapQ :: (forall d. Data d => d -> u) -> DerivClause -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> DerivClause -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> DerivClause -> m DerivClause Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivClause -> m DerivClause Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivClause -> m DerivClause Source | |||||
| Generic DerivClause Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: DerivClause -> Rep DerivClause x Source to :: Rep DerivClause x -> DerivClause Source | |||||
| Show DerivClause Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> DerivClause -> ShowS Source show :: DerivClause -> String Source showList :: [DerivClause] -> ShowS Source | |||||
| Lift DerivClause Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => DerivClause -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => DerivClause -> Code m DerivClause Source | |||||
| type Rep DerivClause Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep DerivClause = D1 ('MetaData "DerivClause" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "DerivClause" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe DerivStrategy)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cxt))) | |||||
data DerivStrategy Source
What the user explicitly requests when deriving an instance with -XDerivingStrategies.
Constructors
| StockStrategy | deriving {stock} C |
| AnyclassStrategy |
|
| NewtypeStrategy |
|
| ViaStrategy Type |
|
Instances
| Eq DerivStrategy Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: DerivStrategy -> DerivStrategy -> Bool Source (/=) :: DerivStrategy -> DerivStrategy -> Bool Source | |||||
| Ord DerivStrategy Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: DerivStrategy -> DerivStrategy -> Ordering Source (<) :: DerivStrategy -> DerivStrategy -> Bool Source (<=) :: DerivStrategy -> DerivStrategy -> Bool Source (>) :: DerivStrategy -> DerivStrategy -> Bool Source (>=) :: DerivStrategy -> DerivStrategy -> Bool Source max :: DerivStrategy -> DerivStrategy -> DerivStrategy Source min :: DerivStrategy -> DerivStrategy -> DerivStrategy Source | |||||
| Data DerivStrategy Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DerivStrategy -> c DerivStrategy Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DerivStrategy Source toConstr :: DerivStrategy -> Constr Source dataTypeOf :: DerivStrategy -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DerivStrategy) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DerivStrategy) Source gmapT :: (forall b. Data b => b -> b) -> DerivStrategy -> DerivStrategy Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DerivStrategy -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DerivStrategy -> r Source gmapQ :: (forall d. Data d => d -> u) -> DerivStrategy -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> DerivStrategy -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> DerivStrategy -> m DerivStrategy Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivStrategy -> m DerivStrategy Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivStrategy -> m DerivStrategy Source | |||||
| Generic DerivStrategy Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: DerivStrategy -> Rep DerivStrategy x Source to :: Rep DerivStrategy x -> DerivStrategy Source | |||||
| Show DerivStrategy Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> DerivStrategy -> ShowS Source show :: DerivStrategy -> String Source showList :: [DerivStrategy] -> ShowS Source | |||||
| Lift DerivStrategy Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => DerivStrategy -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => DerivStrategy -> Code m DerivStrategy Source | |||||
| type Rep DerivStrategy Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep DerivStrategy = D1 ('MetaData "DerivStrategy" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "StockStrategy" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AnyclassStrategy" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NewtypeStrategy" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ViaStrategy" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) | |||||
newtype Code (m :: Type -> Type) (a :: TYPE r) Source
Represents an expression which has type a, built in monadic context m. Built on top of TExp, typed expressions allow for type-safe splicing via:
- typed quotes, written as
[|| ... ||]where...is an expression; if that expression has typea, then the quotation has typeQuote m => Code m a - typed splices inside of typed quotes, written as
$$(...)where...is an arbitrary expression of typeQuote m => Code m a
Traditional expression quotes and splices let us construct ill-typed expressions:
>>> fmap ppr $ runQ (unTypeCode [| True == $( [| "foo" |] ) |])
GHC.Internal.Types.True GHC.Internal.Classes.== "foo"
>>> GHC.Internal.Types.True GHC.Internal.Classes.== "foo"
<interactive> error:
• Couldn't match expected type ‘Bool’ with actual type ‘[Char]’
• In the second argument of ‘(==)’, namely ‘"foo"’
In the expression: True == "foo"
In an equation for ‘it’: it = True == "foo"
With typed expressions, the type error occurs when constructing the Template Haskell expression:
>>> fmap ppr $ runQ (unTypeCode [|| True == $$( [|| "foo" ||] ) ||])
<interactive> error:
• Couldn't match type ‘[Char]’ with ‘Bool’
Expected type: Code Q Bool
Actual type: Code Q [Char]
• In the Template Haskell quotation [|| "foo" ||]
In the expression: [|| "foo" ||]
In the Template Haskell splice $$([|| "foo" ||])
Constructors
| Code | |
Fields
| |
The name of a module.
Instances
| Eq ModName Source | |||||
| Ord ModName Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data ModName Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModName -> c ModName Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModName Source toConstr :: ModName -> Constr Source dataTypeOf :: ModName -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModName) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModName) Source gmapT :: (forall b. Data b => b -> b) -> ModName -> ModName Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModName -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModName -> r Source gmapQ :: (forall d. Data d => d -> u) -> ModName -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> ModName -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModName -> m ModName Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModName -> m ModName Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModName -> m ModName Source | |||||
| Generic ModName Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show ModName Source | |||||
| Lift ModName Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep ModName Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
addCorePlugin :: String -> Q () Source
Adds a core plugin to the compilation pipeline.
addCorePlugin m has almost the same effect as passing -fplugin=m to ghc in the command line. The major difference is that the plugin module m must not belong to the current package. When TH executes, it is too late to tell the compiler that we needed to compile first a plugin module in the current package.
addDependentFile :: FilePath -> Q () Source
Record external files that runIO is using (dependent upon). The compiler can then recognize that it should re-compile the Haskell file when an external file changes.
Expects an absolute file path.
Notes:
- ghc -M does not know about these dependencies - it does not execute TH.
- The dependency is based on file content, not a modification time
addForeignFile :: ForeignSrcLang -> String -> Q () Source
Deprecated: Use addForeignSource instead
addForeignFilePath :: ForeignSrcLang -> FilePath -> Q () Source
Same as addForeignSource, but expects to receive a path pointing to the foreign file instead of a String of its contents. Consider using this in conjunction with addTempFile.
This is a good alternative to addForeignSource when you are trying to directly link in an object file.
addForeignSource :: ForeignSrcLang -> String -> Q () Source
Emit a foreign file which will be compiled and linked to the object for the current module. Currently only languages that can be compiled with the C compiler are supported, and the flags passed as part of -optc will be also applied to the C compiler invocation that will compile them.
Note that for non-C languages (for example C++) extern C directives must be used to get symbols that we can access from Haskell.
To get better errors, it is recommended to use #line pragmas when emitting C files, e.g.
{-# LANGUAGE CPP #-}
...
addForeignSource LangC $ unlines
[ "#line " ++ show (865 + 1) ++ " " ++ show "libraries/ghc-internal/src/GHC/Internal/TH/Syntax.hs"
, ...
]
addModFinalizer :: Q () -> Q () Source
Add a finalizer that will run in the Q monad after the current module has been type checked. This only makes sense when run within a top-level splice.
The finalizer is given the local type environment at the splice point. Thus reify is able to find the local definitions when executed inside the finalizer.
addTempFile :: String -> Q FilePath Source
Obtain a temporary file path with the given suffix. The compiler will delete this file after compilation.
addTopDecls :: [Dec] -> Q () Source
Add additional top-level declarations. The added declarations will be type checked along with the current declaration group.
badIO :: String -> IO a Source
bindCode :: Monad m => m a -> (a -> Code m b) -> Code m b Source
Variant of (>>=) which allows effectful computations to be injected into code generation.
bindCode_ :: Monad m => m a -> Code m b -> Code m b Source
Variant of (>>) which allows effectful computations to be injected into code generation.
cmpEq :: Ordering -> Bool Source
Internal helper function.
compareBytes :: Bytes -> Bytes -> Ordering Source
defaultFixity :: Fixity Source
Default fixity: infixl 9
eqBytes :: Bytes -> Bytes -> Bool Source
extsEnabled :: Q [Extension] Source
List all enabled language extensions.
getDoc :: DocLoc -> Q (Maybe String) Source
Retrieves the Haddock documentation at the specified location, if one exists. It can be used to read documentation on things defined outside of the current module, provided that those modules were compiled with the -haddock flag.
getPackageRoot :: Q FilePath Source
Get the package root for the current package which is being compiled. This can be set explicitly with the -package-root flag but is normally just the current working directory.
The motivation for this flag is to provide a principled means to remove the assumption from splices that they will be executed in the directory where the cabal file resides. Projects such as haskell-language-server can't and don't change directory when compiling files but instead set the -package-root flag appropriately.
getQ :: Typeable a => Q (Maybe a) Source
Get state from the Q monad. Note that the state is local to the Haskell module in which the Template Haskell expression is executed.
get_cons_names :: Con -> [Name] Source
Internal helper function.
hoistCode :: Monad m => (forall x. m x -> n x) -> Code m a -> Code n a Source
Modify the ambient monad used during code generation. For example, you can use hoistCode to handle a state effect:
handleState :: Code (StateT Int Q) a -> Code Q a
handleState = hoistCode (flip runState 0)
isExtEnabled :: Extension -> Q Bool Source
Determine whether the given language extension is enabled in the Q monad.
isInstance :: Name -> [Type] -> Q Bool Source
Is the list of instances returned by reifyInstances nonempty?
If you're confused by an instance not being visible despite being defined in the same module and above the splice in question, see the docs for newDeclarationGroup for a possible explanation.
joinCode :: Monad m => m (Code m a) -> Code m a Source
A useful combinator for embedding monadic actions into Code
myCode :: ... => Code m a
myCode = joinCode $ do
x <- someSideEffect
return (makeCodeWith x)
liftCode :: forall a m. m (TExp a) -> Code m a Source
Lift a monadic action producing code into the typed Code representation
The location at which this computation is spliced.
lookupName :: Bool -> String -> Q (Maybe Name) Source
lookupTypeName :: String -> Q (Maybe Name) Source
Look up the given name in the (type namespace of the) current splice's scope. See Language.Haskell.TH.Syntax for more details.
lookupValueName :: String -> Q (Maybe Name) Source
Look up the given name in the (value namespace of the) current splice's scope. See Language.Haskell.TH.Syntax for more details.
Synonym for 'Many, from ghc-internal.
Highest allowed operator precedence for Fixity constructor (answer: 9)
memcmp :: Ptr a -> Ptr b -> CSize -> IO CInt Source
mkNameG :: NameSpace -> String -> String -> String -> Name Source
Used for 'x etc, but not available to the programmer
mkNameU :: String -> Uniq -> Name Source
Only used internally
mkOccName :: String -> OccName Source
Smart constructor for OccName
mkPkgName :: String -> PkgName Source
Smart constructor for PkgName
mk_tup_name :: Int -> NameSpace -> Bool -> Name Source
mkName :: String -> Name Source
Generate a capturable name. Occurrences of such names will be resolved according to the Haskell scoping rules at the occurrence site.
For example:
f = [| pi + $(varE (mkName "pi")) |] ... g = let pi = 3 in $f
In this case, g is desugared to
g = Prelude.pi + 3
Note that mkName may be used with qualified names:
mkName "Prelude.pi"
See also dyn for a useful combinator. The above example could be rewritten using dyn as
f = [| pi + $(dyn "pi") |]
mkNameG_v :: String -> String -> String -> Name Source
mkNameG_d :: String -> String -> String -> Name Source
mkNameG_tc :: String -> String -> String -> Name Source
mkNameL :: String -> Uniq -> Name Source
Only used internally
mkNameS :: String -> Name Source
unTypeCode :: forall a m. Quote m => Code m a -> m Exp Source
Extract the untyped representation from the typed representation
mkModName :: String -> ModName Source
Smart constructor for ModName
unsafeCodeCoerce :: forall a m. Quote m => m Exp -> Code m a Source
Unsafely convert an untyped code representation into a typed code representation.
mkNameQ :: String -> String -> Name Source
Only used internally
Arguments
| :: String | package |
| -> String | module |
| -> String | parent (first constructor of parent type) |
| -> String | field name |
| -> Name |
modString :: ModName -> String Source
Accessor for ModName
nameBase :: Name -> String Source
The name without its module prefix.
Examples
>>> nameBase ''Data.Either.Either "Either" >>> nameBase (mkName "foo") "foo" >>> nameBase (mkName "Module.foo") "foo"
nameModule :: Name -> Maybe String Source
Module prefix of a name, if it exists.
Examples
>>> nameModule ''Data.Either.Either Just "Data.Either" >>> nameModule (mkName "foo") Nothing >>> nameModule (mkName "Module.foo") Just "Module"
namePackage :: Name -> Maybe String Source
A name's package, if it exists.
Examples
>>> namePackage ''Data.Either.Either Just "base" >>> namePackage (mkName "foo") Nothing >>> namePackage (mkName "Module.foo") Nothing
nameSpace :: Name -> Maybe NameSpace Source
Returns whether a name represents an occurrence of a top-level variable (VarName), data constructor (DataName), type constructor, or type class (TcClsName). If we can't be sure, it returns Nothing.
Examples
>>> nameSpace 'Prelude.id Just VarName >>> nameSpace (mkName "id") Nothing -- only works for top-level variable names >>> nameSpace 'Data.Maybe.Just Just DataName >>> nameSpace ''Data.Maybe.Maybe Just TcClsName >>> nameSpace ''Data.Ord.Ord Just TcClsName
newDeclarationGroup :: Q [Dec] Source
Template Haskell is capable of reifying information about types and terms defined in previous declaration groups. Top-level declaration splices break up declaration groups.
For an example, consider this code block. We define a datatype X and then try to call reify on the datatype.
module Check where
data X = X
deriving Eq
$(do
info <- reify ''X
runIO $ print info
)
This code fails to compile, noting that X is not available for reification at the site of reify. We can fix this by creating a new declaration group using an empty top-level splice:
data X = X
deriving Eq
$(pure [])
$(do
info <- reify ''X
runIO $ print info
)
We provide newDeclarationGroup as a means of documenting this behavior and providing a name for the pattern.
Since top level splices infer the presence of the $( ... ) brackets, we can also write:
data X = X
deriving Eq
newDeclarationGroup
$(do
info <- reify ''X
runIO $ print info
)
newNameIO :: String -> IO Name Source
occString :: OccName -> String Source
Accessor for OccName
Synonym for 'One, from ghc-internal.
pkgString :: PkgName -> String Source
Accessor for PkgName
putDoc :: DocLoc -> String -> Q () Source
Add Haddock documentation to the specified location. This will overwrite any documentation at the location if it already exists. This will reify the specified name, so it must be in scope when you call it. If you want to add documentation to something that you are currently splicing, you can use addModFinalizer e.g.
do let nm = mkName "x" addModFinalizer $ putDoc (DeclDoc nm) "Hello" [d| $(varP nm) = 42 |]
The helper functions withDecDoc and withDecsDoc will do this for you, as will the funD_doc and other _doc combinators. You most likely want to have the -haddock flag turned on when using this. Adding documentation to anything outside of the current module will cause an error.
putQ :: Typeable a => a -> Q () Source
Replace the state in the Q monad. Note that the state is local to the Haskell module in which the Template Haskell expression is executed.
Recover from errors raised by reportError or fail.
reify :: Name -> Q Info Source
reify looks up information about the Name. It will fail with a compile error if the Name is not visible. A Name is visible if it is imported or defined in a prior top-level declaration group. See the documentation for newDeclarationGroup for more details.
It is sometimes useful to construct the argument name using lookupTypeName or lookupValueName to ensure that we are reifying from the right namespace. For instance, in this context:
data D = D
which D does reify (mkName "D") return information about? (Answer: D-the-type, but don't rely on it.) To ensure we get information about D-the-value, use lookupValueName:
do Just nm <- lookupValueName "D" reify nm
and to get information about D-the-type, use lookupTypeName.
reifyAnnotations :: Data a => AnnLookup -> Q [a] Source
reifyAnnotations target returns the list of annotations associated with target. Only the annotations that are appropriately typed is returned. So if you have Int and String annotations for the same target, you have to call this function twice.
reifyConStrictness :: Name -> Q [DecidedStrictness] Source
reifyConStrictness nm looks up the strictness information for the fields of the constructor with the name nm. Note that the strictness information that reifyConStrictness returns may not correspond to what is written in the source code. For example, in the following data declaration:
data Pair a = Pair a a
reifyConStrictness would return [DecidedLazy, DecidedLazy] under most circumstances, but it would return [DecidedStrict, DecidedStrict] if the -XStrictData language extension was enabled.
reifyFixity :: Name -> Q (Maybe Fixity) Source
reifyFixity nm attempts to find a fixity declaration for nm. For example, if the function foo has the fixity declaration infixr 7 foo, then reifyFixity 'foo would return Just (Fixity 7 InfixR). If the function bar does not have a fixity declaration, then reifyFixity 'bar returns Nothing, so you may assume bar has defaultFixity.
reifyInstances :: Name -> [Type] -> Q [InstanceDec] Source
reifyInstances nm tys returns a list of all visible instances (see below for "visible") of nm tys. That is, if nm is the name of a type class, then all instances of this class at the types tys are returned. Alternatively, if nm is the name of a data family or type family, all instances of this family at the types tys are returned.
Note that this is a "shallow" test; the declarations returned merely have instance heads which unify with nm tys, they need not actually be satisfiable.
-
reifyInstances ''Eq [ TupleT 2 `AppT` ConT ''A `AppT` ConT ''B ]contains theinstance (Eq a, Eq b) => Eq (a, b)regardless of whetherAandBthemselves implementEq -
reifyInstances ''Show [ VarT (mkName "a") ]produces every available instance ofShow
There is one edge case: reifyInstances ''Typeable tys currently always produces an empty list (no matter what tys are given).
In principle, the *visible* instances are * all instances defined in a prior top-level declaration group (see docs on newDeclarationGroup), or * all instances defined in any module transitively imported by the module being compiled
However, actually searching all modules transitively below the one being compiled is unreasonably expensive, so reifyInstances will report only the instance for modules that GHC has had some cause to visit during this compilation. This is a shortcoming: reifyInstances might fail to report instances for a type that is otherwise unusued, or instances defined in a different component. You can work around this shortcoming by explicitly importing the modules whose instances you want to be visible. GHC issue #20529 has some discussion around this.
reifyModule :: Module -> Q ModuleInfo Source
reifyModule mod looks up information about module mod. To look up the current module, call this function with the return value of thisModule.
reifyRoles :: Name -> Q [Role] Source
reifyRoles nm returns the list of roles associated with the parameters (both visible and invisible) of the tycon nm. Fails if nm cannot be found or is not a tycon. The returned list should never contain InferR.
An invisible parameter to a tycon is often a kind parameter. For example, if we have
type Proxy :: forall k. k -> Type data Proxy a = MkProxy
and reifyRoles Proxy, we will get [NominalR, PhantomR]. The NominalR is the role of the invisible k parameter. Kind parameters are always nominal.
reifyType :: Name -> Q Type Source
reifyType nm attempts to find the type or kind of nm. For example, reifyType 'not returns Bool -> Bool, and reifyType ''Bool returns Type. This works even if there's no explicit signature and the type or kind is inferred.
report :: Bool -> String -> Q () Source
Deprecated: Use reportError or reportWarning instead
Report an error (True) or warning (False), but carry on; use fail to stop.
reportError :: String -> Q () Source
Report an error to the user, but allow the current splice's computation to carry on. To abort the computation, use fail.
reportWarning :: String -> Q () Source
Report a warning to the user, and carry on.
The runIO function lets you run an I/O computation in the Q monad. Take care: you are guaranteed the ordering of calls to runIO within a single Q computation, but not about the order in which splices are run.
Note: for various murky reasons, stdout and stderr handles are not necessarily flushed when the compiler finishes running, so you should flush them yourself.
sequenceQ :: Monad m => forall a. [m a] -> m [a] Source
This function is only used in Quote when desugaring brackets. This is not necessary for the user, who can use the ordinary return and (>>=) operations.
runQ :: Quasi m => Q a -> m a Source
"Runs" the Q monad. Normal users of Template Haskell should not need this function, as the splice brackets $( ... ) are the usual way of running a Q computation.
This function is primarily used in GHC internals, and for debugging splices by running them in IO.
Note that many functions in Q, such as reify and other compiler queries, are not supported when running Q in IO; these operations simply fail at runtime. Indeed, the only operations guaranteed to succeed are newName, runIO, reportError and reportWarning.
showName :: Name -> String Source
showName' :: NameIs -> Name -> String Source
thenCmp :: Ordering -> Ordering -> Ordering Source
Internal helper function.
tupleDataName :: Int -> Name Source
Tuple data constructor
tupleTypeName :: Int -> Name Source
Tuple type constructor
unTypeQ :: forall a m. Quote m => m (TExp a) -> m Exp Source
Discard the type annotation and produce a plain Template Haskell expression
Representation-polymorphic since template-haskell-2.16.0.0.
unboxedSumDataName :: SumAlt -> SumArity -> Name Source
Unboxed sum data constructor
unboxedSumTypeName :: SumArity -> Name Source
Unboxed sum type constructor
unboxedTupleDataName :: Int -> Name Source
Unboxed tuple data constructor
unboxedTupleTypeName :: Int -> Name Source
Unboxed tuple type constructor
unsafeTExpCoerce :: forall a m. Quote m => m Exp -> m (TExp a) Source
Annotate the Template Haskell expression with a type
This is unsafe because GHC cannot check for you that the expression really does have the type you claim it has.
Representation-polymorphic since template-haskell-2.16.0.0.
data ForeignSrcLang Source
Foreign formats supported by GHC via TH
Constructors
| LangC | C |
| LangCxx | C++ |
| LangObjc | Objective C |
| LangObjcxx | Objective C++ |
| LangAsm | Assembly language (.s) |
| LangJs | JavaScript |
| RawObject | Object (.o) |
Instances
| Eq ForeignSrcLang Source | |||||
Defined in GHC.Internal.ForeignSrcLang Methods(==) :: ForeignSrcLang -> ForeignSrcLang -> Bool Source (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool Source | |||||
| Generic ForeignSrcLang Source | |||||
Defined in GHC.Internal.ForeignSrcLang Associated Types
Methodsfrom :: ForeignSrcLang -> Rep ForeignSrcLang x Source to :: Rep ForeignSrcLang x -> ForeignSrcLang Source | |||||
| Show ForeignSrcLang Source | |||||
Defined in GHC.Internal.ForeignSrcLang MethodsshowsPrec :: Int -> ForeignSrcLang -> ShowS Source show :: ForeignSrcLang -> String Source showList :: [ForeignSrcLang] -> ShowS Source | |||||
| Lift ForeignSrcLang Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => ForeignSrcLang -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => ForeignSrcLang -> Code m ForeignSrcLang Source | |||||
| type Rep ForeignSrcLang Source | |||||
Defined in GHC.Internal.ForeignSrcLang type Rep ForeignSrcLang = D1 ('MetaData "ForeignSrcLang" "GHC.Internal.ForeignSrcLang" "ghc-internal" 'False) ((C1 ('MetaCons "LangC" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "LangCxx" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LangObjc" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "LangObjcxx" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LangAsm" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LangJs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RawObject" 'PrefixI 'False) (U1 :: Type -> Type)))) | |||||
The language extensions known to GHC.
Note that there is an orphan Binary instance for this type supplied by the GHC.LanguageExtensions module provided by ghc-boot. We can't provide here as this would require adding transitive dependencies to the template-haskell package, which must have a minimal dependency set.
Constructors
| Cpp | |
| OverlappingInstances | |
| UndecidableInstances | |
| IncoherentInstances | |
| UndecidableSuperClasses | |
| MonomorphismRestriction | |
| MonoLocalBinds | |
| DeepSubsumption | |
| RelaxedPolyRec | |
| ExtendedDefaultRules | |
| NamedDefaults | |
| ForeignFunctionInterface | |
| UnliftedFFITypes | |
| InterruptibleFFI | |
| CApiFFI | |
| GHCForeignImportPrim | |
| JavaScriptFFI | |
| ParallelArrays | |
| Arrows | |
| TemplateHaskell | |
| TemplateHaskellQuotes | |
| QualifiedDo | |
| QuasiQuotes | |
| ImplicitParams | |
| ImplicitPrelude | |
| ScopedTypeVariables | |
| AllowAmbiguousTypes | |
| UnboxedTuples | |
| UnboxedSums | |
| UnliftedNewtypes | |
| UnliftedDatatypes | |
| BangPatterns | |
| TypeFamilies | |
| TypeFamilyDependencies | |
| TypeInType | |
| OverloadedStrings | |
| OverloadedLists | |
| NumDecimals | |
| DisambiguateRecordFields | |
| RecordWildCards | |
| NamedFieldPuns | |
| ViewPatterns | |
| OrPatterns | |
| GADTs | |
| GADTSyntax | |
| NPlusKPatterns | |
| DoAndIfThenElse | |
| BlockArguments | |
| RebindableSyntax | |
| ConstraintKinds | |
| PolyKinds | |
| DataKinds | |
| TypeData | |
| InstanceSigs | |
| ApplicativeDo | |
| LinearTypes | |
| RequiredTypeArguments | |
| StandaloneDeriving | |
| DeriveDataTypeable | |
| AutoDeriveTypeable | |
| DeriveFunctor | |
| DeriveTraversable | |
| DeriveFoldable | |
| DeriveGeneric | |
| DefaultSignatures | |
| DeriveAnyClass | |
| DeriveLift | |
| DerivingStrategies | |
| DerivingVia | |
| TypeSynonymInstances | |
| FlexibleContexts | |
| FlexibleInstances | |
| ConstrainedClassMethods | |
| MultiParamTypeClasses | |
| NullaryTypeClasses | |
| FunctionalDependencies | |
| UnicodeSyntax | |
| ExistentialQuantification | |
| MagicHash | |
| EmptyDataDecls | |
| KindSignatures | |
| RoleAnnotations | |
| ParallelListComp | |
| TransformListComp | |
| MonadComprehensions | |
| GeneralizedNewtypeDeriving | |
| RecursiveDo | |
| PostfixOperators | |
| TupleSections | |
| PatternGuards | |
| LiberalTypeSynonyms | |
| RankNTypes | |
| ImpredicativeTypes | |
| TypeOperators | |
| ExplicitNamespaces | |
| PackageImports | |
| ExplicitForAll | |
| AlternativeLayoutRule | |
| AlternativeLayoutRuleTransitional | |
| DatatypeContexts | |
| NondecreasingIndentation | |
| RelaxedLayout | |
| TraditionalRecordSyntax | |
| LambdaCase | |
| MultiWayIf | |
| BinaryLiterals | |
| NegativeLiterals | |
| HexFloatLiterals | |
| DuplicateRecordFields | |
| OverloadedLabels | |
| EmptyCase | |
| PatternSynonyms | |
| PartialTypeSignatures | |
| NamedWildCards | |
| StaticPointers | |
| TypeApplications | |
| Strict | |
| StrictData | |
| EmptyDataDeriving | |
| NumericUnderscores | |
| QuantifiedConstraints | |
| StarIsType | |
| ImportQualifiedPost | |
| CUSKs | |
| StandaloneKindSignatures | |
| LexicalNegation | |
| FieldSelectors | |
| OverloadedRecordDot | |
| OverloadedRecordUpdate | |
| TypeAbstractions | |
| ExtendedLiterals | |
| ListTuplePuns | |
| MultilineStrings | |
| ExplicitLevelImports | |
| ImplicitStagePersistence |
Instances
| Eq Extension Source | |||||
| Ord Extension Source | |||||
Defined in GHC.Internal.LanguageExtensions | |||||
| Bounded Extension Source | |||||
| Enum Extension Source | |||||
Defined in GHC.Internal.LanguageExtensions Methodssucc :: Extension -> Extension Source pred :: Extension -> Extension Source toEnum :: Int -> Extension Source fromEnum :: Extension -> Int Source enumFrom :: Extension -> [Extension] Source enumFromThen :: Extension -> Extension -> [Extension] Source enumFromTo :: Extension -> Extension -> [Extension] Source enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] Source | |||||
| Generic Extension Source | |||||
Defined in GHC.Internal.LanguageExtensions Associated Types
| |||||
| Show Extension Source | |||||
| Lift Extension Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Extension Source | |||||
Defined in GHC.Internal.LanguageExtensions type Rep Extension = D1 ('MetaData "Extension" "GHC.Internal.LanguageExtensions" "ghc-internal" 'False) (((((((C1 ('MetaCons "Cpp" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverlappingInstances" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "UndecidableInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IncoherentInstances" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UndecidableSuperClasses" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MonomorphismRestriction" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "MonoLocalBinds" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeepSubsumption" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "RelaxedPolyRec" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExtendedDefaultRules" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NamedDefaults" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ForeignFunctionInterface" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UnliftedFFITypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InterruptibleFFI" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CApiFFI" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GHCForeignImportPrim" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "JavaScriptFFI" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ParallelArrays" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Arrows" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TemplateHaskell" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TemplateHaskellQuotes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "QualifiedDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "QuasiQuotes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImplicitParams" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "ImplicitPrelude" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ScopedTypeVariables" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "AllowAmbiguousTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnboxedTuples" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UnboxedSums" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnliftedNewtypes" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "UnliftedDatatypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "BangPatterns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeFamilies" 'PrefixI 'False) (U1 :: Type -> Type))))))) :+: (((((C1 ('MetaCons "TypeFamilyDependencies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeInType" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "OverloadedStrings" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverloadedLists" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "NumDecimals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DisambiguateRecordFields" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "RecordWildCards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NamedFieldPuns" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "ViewPatterns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OrPatterns" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "GADTs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GADTSyntax" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "NPlusKPatterns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DoAndIfThenElse" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "BlockArguments" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "RebindableSyntax" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ConstraintKinds" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: ((((C1 ('MetaCons "PolyKinds" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DataKinds" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeData" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InstanceSigs" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ApplicativeDo" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LinearTypes" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "RequiredTypeArguments" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StandaloneDeriving" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "DeriveDataTypeable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AutoDeriveTypeable" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DeriveFunctor" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveTraversable" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "DeriveFoldable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveGeneric" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DefaultSignatures" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DeriveAnyClass" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveLift" 'PrefixI 'False) (U1 :: Type -> Type)))))))) :+: ((((((C1 ('MetaCons "DerivingStrategies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DerivingVia" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeSynonymInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FlexibleContexts" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "FlexibleInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ConstrainedClassMethods" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "MultiParamTypeClasses" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NullaryTypeClasses" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "FunctionalDependencies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnicodeSyntax" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ExistentialQuantification" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MagicHash" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "EmptyDataDecls" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "KindSignatures" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "RoleAnnotations" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ParallelListComp" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TransformListComp" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: ((((C1 ('MetaCons "MonadComprehensions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GeneralizedNewtypeDeriving" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "RecursiveDo" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PostfixOperators" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TupleSections" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PatternGuards" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LiberalTypeSynonyms" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RankNTypes" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "ImpredicativeTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeOperators" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ExplicitNamespaces" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PackageImports" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ExplicitForAll" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AlternativeLayoutRule" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "AlternativeLayoutRuleTransitional" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DatatypeContexts" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NondecreasingIndentation" 'PrefixI 'False) (U1 :: Type -> Type))))))) :+: (((((C1 ('MetaCons "RelaxedLayout" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TraditionalRecordSyntax" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LambdaCase" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MultiWayIf" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "BinaryLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NegativeLiterals" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "HexFloatLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DuplicateRecordFields" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "OverloadedLabels" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EmptyCase" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PatternSynonyms" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PartialTypeSignatures" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "NamedWildCards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StaticPointers" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeApplications" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Strict" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StrictData" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: ((((C1 ('MetaCons "EmptyDataDeriving" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NumericUnderscores" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "QuantifiedConstraints" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StarIsType" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ImportQualifiedPost" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CUSKs" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "StandaloneKindSignatures" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LexicalNegation" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "FieldSelectors" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverloadedRecordDot" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "OverloadedRecordUpdate" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeAbstractions" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ExtendedLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ListTuplePuns" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "MultilineStrings" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ExplicitLevelImports" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImplicitStagePersistence" 'PrefixI 'False) (U1 :: Type -> Type))))))))) | |||||
Annotation target for reifyAnnotations
Constructors
| AnnLookupModule Module | |
| AnnLookupName Name |
Instances
| Eq AnnLookup Source | |||||
| Ord AnnLookup Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data AnnLookup Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnLookup -> c AnnLookup Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnLookup Source toConstr :: AnnLookup -> Constr Source dataTypeOf :: AnnLookup -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnLookup) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnLookup) Source gmapT :: (forall b. Data b => b -> b) -> AnnLookup -> AnnLookup Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnLookup -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnLookup -> r Source gmapQ :: (forall d. Data d => d -> u) -> AnnLookup -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnLookup -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnLookup -> m AnnLookup Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnLookup -> m AnnLookup Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnLookup -> m AnnLookup Source | |||||
| Generic AnnLookup Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show AnnLookup Source | |||||
| Lift AnnLookup Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep AnnLookup Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep AnnLookup = D1 ('MetaData "AnnLookup" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "AnnLookupModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Module)) :+: C1 ('MetaCons "AnnLookupName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))) | |||||
The target of an ANN pragma
Constructors
| ModuleAnnotation | {-# ANN {module} ... #-} |
| TypeAnnotation Name | {-# ANN type {name} ... #-} |
| ValueAnnotation Name | {-# ANN {name} ... #-} |
Instances
| Eq AnnTarget Source | |||||
| Ord AnnTarget Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data AnnTarget Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnTarget -> c AnnTarget Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnTarget Source toConstr :: AnnTarget -> Constr Source dataTypeOf :: AnnTarget -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnTarget) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnTarget) Source gmapT :: (forall b. Data b => b -> b) -> AnnTarget -> AnnTarget Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnTarget -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnTarget -> r Source gmapQ :: (forall d. Data d => d -> u) -> AnnTarget -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnTarget -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnTarget -> m AnnTarget Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnTarget -> m AnnTarget Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnTarget -> m AnnTarget Source | |||||
| Generic AnnTarget Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show AnnTarget Source | |||||
| Lift AnnTarget Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep AnnTarget Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep AnnTarget = D1 ('MetaData "AnnTarget" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "ModuleAnnotation" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "TypeAnnotation" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "ValueAnnotation" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)))) | |||||
In PrimTyConI, arity of the type constructor
Strictness information in a data constructor's argument.
Constructors
| Bang SourceUnpackedness SourceStrictness | C { {-# UNPACK #-} !}a |
Instances
| Ppr Bang Source | |||||
| Eq Bang Source | |||||
| Ord Bang Source | |||||
| Data Bang Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bang -> c Bang Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bang Source toConstr :: Bang -> Constr Source dataTypeOf :: Bang -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bang) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bang) Source gmapT :: (forall b. Data b => b -> b) -> Bang -> Bang Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bang -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bang -> r Source gmapQ :: (forall d. Data d => d -> u) -> Bang -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Bang -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bang -> m Bang Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bang -> m Bang Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bang -> m Bang Source | |||||
| Generic Bang Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Bang Source | |||||
| Lift Bang Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Bang Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Bang = D1 ('MetaData "Bang" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Bang" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SourceUnpackedness) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SourceStrictness))) | |||||
Visibility of a type variable. See Inferred vs. specified type variables.
Instances
| PprFlag BndrVis Source | |
Defined in GHC.Boot.TH.Ppr MethodspprTyVarBndr :: TyVarBndr BndrVis -> Doc Source | |
| Eq BndrVis Source | |
| Ord BndrVis Source | |
Defined in GHC.Internal.TH.Syntax | |
| Data BndrVis Source | |
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BndrVis -> c BndrVis Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BndrVis Source toConstr :: BndrVis -> Constr Source dataTypeOf :: BndrVis -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BndrVis) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BndrVis) Source gmapT :: (forall b. Data b => b -> b) -> BndrVis -> BndrVis Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BndrVis -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BndrVis -> r Source gmapQ :: (forall d. Data d => d -> u) -> BndrVis -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> BndrVis -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> BndrVis -> m BndrVis Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BndrVis -> m BndrVis Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BndrVis -> m BndrVis Source | |
| Generic BndrVis Source | |
Defined in GHC.Internal.TH.Syntax | |
| Show BndrVis Source | |
| DefaultBndrFlag BndrVis Source | |
Defined in Language.Haskell.TH.Lib Methods | |
| Lift BndrVis Source | Since: template-haskell-2.22.1.0 |
| type Rep BndrVis Source | |
A potentially guarded expression, as in function definitions or case alternatives.
Constructors
| GuardedB [(Guard, Exp)] | f p { | e1 = e2
| e3 = e4 }
where ds |
| NormalB Exp | f p { = e } where ds |
Instances
| Eq Body Source | |||||
| Ord Body Source | |||||
| Data Body Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Body -> c Body Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Body Source toConstr :: Body -> Constr Source dataTypeOf :: Body -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Body) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Body) Source gmapT :: (forall b. Data b => b -> b) -> Body -> Body Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Body -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Body -> r Source gmapQ :: (forall d. Data d => d -> u) -> Body -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Body -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Body -> m Body Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Body -> m Body Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Body -> m Body Source | |||||
| Generic Body Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Body Source | |||||
| Lift Body Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Body Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Body = D1 ('MetaData "Body" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "GuardedB" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Guard, Exp)])) :+: C1 ('MetaCons "NormalB" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp))) | |||||
Raw bytes embedded into the binary.
Avoid using Bytes constructor directly as it is likely to change in the future. Use helpers such as mkBytes in Language.Haskell.TH.Lib instead.
Constructors
| Bytes | |
Fields
| |
Instances
| Eq Bytes Source | |||||
| Ord Bytes Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Bytes Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bytes -> c Bytes Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bytes Source toConstr :: Bytes -> Constr Source dataTypeOf :: Bytes -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bytes) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bytes) Source gmapT :: (forall b. Data b => b -> b) -> Bytes -> Bytes Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bytes -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bytes -> r Source gmapQ :: (forall d. Data d => d -> u) -> Bytes -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Bytes -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bytes -> m Bytes Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bytes -> m Bytes Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bytes -> m Bytes Source | |||||
| Generic Bytes Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Bytes Source | |||||
| Lift Bytes Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Bytes Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Bytes = D1 ('MetaData "Bytes" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Bytes" 'PrefixI 'True) (S1 ('MetaSel ('Just "bytesPtr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ForeignPtr Word8)) :*: (S1 ('MetaSel ('Just "bytesOffset") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Word) :*: S1 ('MetaSel ('Just "bytesSize") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Word)))) | |||||
A calling convention identifier, as in a Foreign declaration.
Constructors
| CCall | |
| StdCall | |
| CApi | |
| Prim | |
| JavaScript |
Instances
| Eq Callconv Source | |||||
| Ord Callconv Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Callconv Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Callconv -> c Callconv Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Callconv Source toConstr :: Callconv -> Constr Source dataTypeOf :: Callconv -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Callconv) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Callconv) Source gmapT :: (forall b. Data b => b -> b) -> Callconv -> Callconv Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Callconv -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Callconv -> r Source gmapQ :: (forall d. Data d => d -> u) -> Callconv -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Callconv -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Callconv -> m Callconv Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Callconv -> m Callconv Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Callconv -> m Callconv Source | |||||
| Generic Callconv Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Callconv Source | |||||
| Lift Callconv Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Callconv Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Callconv = D1 ('MetaData "Callconv" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "CCall" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StdCall" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CApi" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Prim" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "JavaScript" 'PrefixI 'False) (U1 :: Type -> Type)))) | |||||
Arguments
| = [Pred] | (Eq a, Ord b) |
A context, as found on the left side of a => in a type.
data DecidedStrictness Source
Unlike SourceStrictness and SourceUnpackedness, DecidedStrictness refers to the strictness annotations that the compiler chooses for a data constructor field, which may be different from what is written in source code.
Note that non-unpacked strict fields are assigned DecidedLazy when a bang would be inappropriate, such as the field of a newtype constructor and fields that have an unlifted type.
See reifyConStrictness for more information.
Constructors
| DecidedLazy | Field inferred to not have a bang. |
| DecidedStrict | Field inferred to have a bang. |
| DecidedUnpack | Field inferred to be unpacked. |
Instances
| Ppr DecidedStrictness Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq DecidedStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: DecidedStrictness -> DecidedStrictness -> Bool Source (/=) :: DecidedStrictness -> DecidedStrictness -> Bool Source | |||||
| Ord DecidedStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: DecidedStrictness -> DecidedStrictness -> Ordering Source (<) :: DecidedStrictness -> DecidedStrictness -> Bool Source (<=) :: DecidedStrictness -> DecidedStrictness -> Bool Source (>) :: DecidedStrictness -> DecidedStrictness -> Bool Source (>=) :: DecidedStrictness -> DecidedStrictness -> Bool Source max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness Source min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness Source | |||||
| Data DecidedStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DecidedStrictness -> c DecidedStrictness Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DecidedStrictness Source toConstr :: DecidedStrictness -> Constr Source dataTypeOf :: DecidedStrictness -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DecidedStrictness) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DecidedStrictness) Source gmapT :: (forall b. Data b => b -> b) -> DecidedStrictness -> DecidedStrictness Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DecidedStrictness -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DecidedStrictness -> r Source gmapQ :: (forall d. Data d => d -> u) -> DecidedStrictness -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> DecidedStrictness -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> DecidedStrictness -> m DecidedStrictness Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DecidedStrictness -> m DecidedStrictness Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DecidedStrictness -> m DecidedStrictness Source | |||||
| Generic DecidedStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: DecidedStrictness -> Rep DecidedStrictness x Source to :: Rep DecidedStrictness x -> DecidedStrictness Source | |||||
| Show DecidedStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> DecidedStrictness -> ShowS Source show :: DecidedStrictness -> String Source showList :: [DecidedStrictness] -> ShowS Source | |||||
| Lift DecidedStrictness Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => DecidedStrictness -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => DecidedStrictness -> Code m DecidedStrictness Source | |||||
| type Rep DecidedStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep DecidedStrictness = D1 ('MetaData "DecidedStrictness" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "DecidedLazy" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DecidedStrict" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DecidedUnpack" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
A location at which to attach Haddock documentation. Note that adding documentation to a Name defined oustide of the current module will cause an error.
Constructors
| ModuleDoc | At the current module's header. |
| DeclDoc Name | At a declaration, not necessarily top level. |
| ArgDoc Name Int | At a specific argument of a function, indexed by its position. |
| InstDoc Type | At a class or family instance. |
Instances
| Eq DocLoc Source | |||||
| Ord DocLoc Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data DocLoc Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DocLoc -> c DocLoc Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DocLoc Source toConstr :: DocLoc -> Constr Source dataTypeOf :: DocLoc -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DocLoc) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DocLoc) Source gmapT :: (forall b. Data b => b -> b) -> DocLoc -> DocLoc Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DocLoc -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DocLoc -> r Source gmapQ :: (forall d. Data d => d -> u) -> DocLoc -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> DocLoc -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> DocLoc -> m DocLoc Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DocLoc -> m DocLoc Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DocLoc -> m DocLoc Source | |||||
| Generic DocLoc Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show DocLoc Source | |||||
| Lift DocLoc Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep DocLoc Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep DocLoc = D1 ('MetaData "DocLoc" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "ModuleDoc" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeclDoc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))) :+: (C1 ('MetaCons "ArgDoc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: C1 ('MetaCons "InstDoc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) | |||||
data FamilyResultSig Source
Type family result signature
Instances
| Ppr FamilyResultSig Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq FamilyResultSig Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: FamilyResultSig -> FamilyResultSig -> Bool Source (/=) :: FamilyResultSig -> FamilyResultSig -> Bool Source | |||||
| Ord FamilyResultSig Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: FamilyResultSig -> FamilyResultSig -> Ordering Source (<) :: FamilyResultSig -> FamilyResultSig -> Bool Source (<=) :: FamilyResultSig -> FamilyResultSig -> Bool Source (>) :: FamilyResultSig -> FamilyResultSig -> Bool Source (>=) :: FamilyResultSig -> FamilyResultSig -> Bool Source max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig Source min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig Source | |||||
| Data FamilyResultSig Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FamilyResultSig -> c FamilyResultSig Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FamilyResultSig Source toConstr :: FamilyResultSig -> Constr Source dataTypeOf :: FamilyResultSig -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FamilyResultSig) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FamilyResultSig) Source gmapT :: (forall b. Data b => b -> b) -> FamilyResultSig -> FamilyResultSig Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FamilyResultSig -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FamilyResultSig -> r Source gmapQ :: (forall d. Data d => d -> u) -> FamilyResultSig -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> FamilyResultSig -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> FamilyResultSig -> m FamilyResultSig Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FamilyResultSig -> m FamilyResultSig Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FamilyResultSig -> m FamilyResultSig Source | |||||
| Generic FamilyResultSig Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: FamilyResultSig -> Rep FamilyResultSig x Source to :: Rep FamilyResultSig x -> FamilyResultSig Source | |||||
| Show FamilyResultSig Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> FamilyResultSig -> ShowS Source show :: FamilyResultSig -> String Source showList :: [FamilyResultSig] -> ShowS Source | |||||
| Lift FamilyResultSig Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => FamilyResultSig -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => FamilyResultSig -> Code m FamilyResultSig Source | |||||
| type Rep FamilyResultSig Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep FamilyResultSig = D1 ('MetaData "FamilyResultSig" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "NoSig" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "KindSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Kind)) :+: C1 ('MetaCons "TyVarSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TyVarBndr ()))))) | |||||
Fixity, as specified in a infix[lr] n declaration.
Constructors
| Fixity Int FixityDirection |
Instances
| Eq Fixity Source | |||||
| Ord Fixity Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Fixity Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Fixity -> c Fixity Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Fixity Source toConstr :: Fixity -> Constr Source dataTypeOf :: Fixity -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Fixity) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Fixity) Source gmapT :: (forall b. Data b => b -> b) -> Fixity -> Fixity Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r Source gmapQ :: (forall d. Data d => d -> u) -> Fixity -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Fixity -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity Source | |||||
| Generic Fixity Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Fixity Source | |||||
| Lift Fixity Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Fixity Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Fixity = D1 ('MetaData "Fixity" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Fixity" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FixityDirection))) | |||||
data FixityDirection Source
The associativity of an operator, as in an infix declaration.
Instances
| Eq FixityDirection Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: FixityDirection -> FixityDirection -> Bool Source (/=) :: FixityDirection -> FixityDirection -> Bool Source | |||||
| Ord FixityDirection Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: FixityDirection -> FixityDirection -> Ordering Source (<) :: FixityDirection -> FixityDirection -> Bool Source (<=) :: FixityDirection -> FixityDirection -> Bool Source (>) :: FixityDirection -> FixityDirection -> Bool Source (>=) :: FixityDirection -> FixityDirection -> Bool Source max :: FixityDirection -> FixityDirection -> FixityDirection Source min :: FixityDirection -> FixityDirection -> FixityDirection Source | |||||
| Data FixityDirection Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FixityDirection -> c FixityDirection Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FixityDirection Source toConstr :: FixityDirection -> Constr Source dataTypeOf :: FixityDirection -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FixityDirection) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FixityDirection) Source gmapT :: (forall b. Data b => b -> b) -> FixityDirection -> FixityDirection Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FixityDirection -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FixityDirection -> r Source gmapQ :: (forall d. Data d => d -> u) -> FixityDirection -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> FixityDirection -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection Source | |||||
| Generic FixityDirection Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: FixityDirection -> Rep FixityDirection x Source to :: Rep FixityDirection x -> FixityDirection Source | |||||
| Show FixityDirection Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> FixityDirection -> ShowS Source show :: FixityDirection -> String Source showList :: [FixityDirection] -> ShowS Source | |||||
| Lift FixityDirection Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => FixityDirection -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => FixityDirection -> Code m FixityDirection Source | |||||
| type Rep FixityDirection Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep FixityDirection = D1 ('MetaData "FixityDirection" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "InfixL" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "InfixR" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InfixN" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
A foreign declaration.
Constructors
| ImportF Callconv Safety String Name Type | foreign import callconv safety "foreign_name" haskellName :: type |
| ExportF Callconv String Name Type | foreign export callconv "foreign_name" haskellName :: type |
Instances
| Ppr Foreign Source | |||||
| Eq Foreign Source | |||||
| Ord Foreign Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Foreign Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Foreign -> c Foreign Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Foreign Source toConstr :: Foreign -> Constr Source dataTypeOf :: Foreign -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Foreign) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Foreign) Source gmapT :: (forall b. Data b => b -> b) -> Foreign -> Foreign Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Foreign -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Foreign -> r Source gmapQ :: (forall d. Data d => d -> u) -> Foreign -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Foreign -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Foreign -> m Foreign Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Foreign -> m Foreign Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Foreign -> m Foreign Source | |||||
| Generic Foreign Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Foreign Source | |||||
| Lift Foreign Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Foreign Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Foreign = D1 ('MetaData "Foreign" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "ImportF" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Callconv) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Safety)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: C1 ('MetaCons "ExportF" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Callconv) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) | |||||
A single guard.
Instances
| Eq Guard Source | |||||
| Ord Guard Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Guard Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Guard -> c Guard Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Guard Source toConstr :: Guard -> Constr Source dataTypeOf :: Guard -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Guard) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Guard) Source gmapT :: (forall b. Data b => b -> b) -> Guard -> Guard Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Guard -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Guard -> r Source gmapQ :: (forall d. Data d => d -> u) -> Guard -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Guard -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Guard -> m Guard Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Guard -> m Guard Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Guard -> m Guard Source | |||||
| Generic Guard Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Guard Source | |||||
| Lift Guard Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Guard Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Guard = D1 ('MetaData "Guard" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "NormalG" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp)) :+: C1 ('MetaCons "PatG" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt]))) | |||||
Obtained from reify in the Q Monad.
Constructors
| ClassI Dec [InstanceDec] | A class, with a list of its visible instances |
| ClassOpI Name Type ParentName | A class method |
| TyConI Dec | A "plain" type constructor. "Fancier" type constructors are returned using |
| FamilyI Dec [InstanceDec] | A type or data family, with a list of its visible instances. A closed type family is returned with 0 instances. |
| PrimTyConI Name Arity Unlifted | A "primitive" type constructor, which can't be expressed with a |
| DataConI Name Type ParentName | A data constructor |
| PatSynI Name PatSynType | A pattern synonym |
| VarI Name Type (Maybe Dec) |
A "value" variable (as opposed to a type variable, see The At present, this value is always |
| TyVarI Name Type |
A type variable. The |
Instances
| Ppr Info Source | |||||
| Eq Info Source | |||||
| Ord Info Source | |||||
| Data Info Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Info -> c Info Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Info Source toConstr :: Info -> Constr Source dataTypeOf :: Info -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Info) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Info) Source gmapT :: (forall b. Data b => b -> b) -> Info -> Info Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Info -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Info -> r Source gmapQ :: (forall d. Data d => d -> u) -> Info -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Info -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Info -> m Info Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Info -> m Info Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Info -> m Info Source | |||||
| Generic Info Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Info Source | |||||
| Lift Info Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Info Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Info = D1 ('MetaData "Info" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (((C1 ('MetaCons "ClassI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Dec) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [InstanceDec])) :+: C1 ('MetaCons "ClassOpI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ParentName)))) :+: (C1 ('MetaCons "TyConI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Dec)) :+: C1 ('MetaCons "FamilyI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Dec) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [InstanceDec])))) :+: ((C1 ('MetaCons "PrimTyConI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Arity) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Unlifted))) :+: C1 ('MetaCons "DataConI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ParentName)))) :+: (C1 ('MetaCons "PatSynI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PatSynType)) :+: (C1 ('MetaCons "VarI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Dec)))) :+: C1 ('MetaCons "TyVarI" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))))) | |||||
An inline pragma.
Constructors
| NoInline | { {-# NOINLINE ... #-} } |
| Inline | { {-# INLINE ... #-} } |
| Inlinable | { {-# INLINABLE ... #-} } |
Instances
| Ppr Inline Source | |||||
| Eq Inline Source | |||||
| Ord Inline Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Inline Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Inline -> c Inline Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Inline Source toConstr :: Inline -> Constr Source dataTypeOf :: Inline -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Inline) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Inline) Source gmapT :: (forall b. Data b => b -> b) -> Inline -> Inline Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Inline -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Inline -> r Source gmapQ :: (forall d. Data d => d -> u) -> Inline -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Inline -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Inline -> m Inline Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Inline -> m Inline Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Inline -> m Inline Source | |||||
| Generic Inline Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Inline Source | |||||
| Lift Inline Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Inline Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
type InstanceDec = Dec Source
InstanceDec describes a single instance of a class or type function. It is just a Dec, but guaranteed to be one of the following:
-
InstanceD(with empty[Dec]) -
DataInstDorNewtypeInstD(with empty derived[Name]) TySynInstD
A Haskell literal. Note that the numeric types are all in terms of either Integer or Rational, regardless of the type they represent. The extra precision reflects the textual representation in source code.
Constructors
| CharL Char | 'c' |
| StringL String | "string" |
| IntegerL Integer |
|
| RationalL Rational |
|
| IntPrimL Integer | 123# |
| WordPrimL Integer | 123## |
| FloatPrimL Rational | 1.23# |
| DoublePrimL Rational | 1.23## |
| StringPrimL [Word8] |
|
| BytesPrimL Bytes | Some raw bytes, type |
| CharPrimL Char | 'c'# |
Instances
| Ppr Lit Source | |||||
| Eq Lit Source | |||||
| Ord Lit Source | |||||
| Data Lit Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Lit -> c Lit Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Lit Source toConstr :: Lit -> Constr Source dataTypeOf :: Lit -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Lit) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Lit) Source gmapT :: (forall b. Data b => b -> b) -> Lit -> Lit Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Lit -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Lit -> r Source gmapQ :: (forall d. Data d => d -> u) -> Lit -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Lit -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Lit -> m Lit Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Lit -> m Lit Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Lit -> m Lit Source | |||||
| Generic Lit Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Lit Source | |||||
| Lift Lit Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Lit Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Lit = D1 ('MetaData "Lit" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (((C1 ('MetaCons "CharL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Char)) :+: C1 ('MetaCons "StringL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "IntegerL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer)) :+: (C1 ('MetaCons "RationalL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Rational)) :+: C1 ('MetaCons "IntPrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer))))) :+: ((C1 ('MetaCons "WordPrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer)) :+: (C1 ('MetaCons "FloatPrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Rational)) :+: C1 ('MetaCons "DoublePrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Rational)))) :+: (C1 ('MetaCons "StringPrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Word8])) :+: (C1 ('MetaCons "BytesPrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bytes)) :+: C1 ('MetaCons "CharPrimL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Char)))))) | |||||
A location within a source file.
Constructors
| Loc | |
Fields
| |
Instances
| Ppr Loc Source | |||||
| Eq Loc Source | |||||
| Ord Loc Source | |||||
| Data Loc Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Loc -> c Loc Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Loc Source toConstr :: Loc -> Constr Source dataTypeOf :: Loc -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Loc) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Loc) Source gmapT :: (forall b. Data b => b -> b) -> Loc -> Loc Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Loc -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Loc -> r Source gmapQ :: (forall d. Data d => d -> u) -> Loc -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Loc -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Loc -> m Loc Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Loc -> m Loc Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Loc -> m Loc Source | |||||
| Generic Loc Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Loc Source | |||||
| Lift Loc Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Loc Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Loc = D1 ('MetaData "Loc" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Loc" 'PrefixI 'True) ((S1 ('MetaSel ('Just "loc_filename") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Just "loc_package") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :*: (S1 ('MetaSel ('Just "loc_module") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Just "loc_start") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CharPos) :*: S1 ('MetaSel ('Just "loc_end") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CharPos))))) | |||||
Obtained from reifyModule and thisModule.
Instances
| Ppr Module Source | |||||
| Eq Module Source | |||||
| Ord Module Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Module Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Module -> c Module Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Module Source toConstr :: Module -> Constr Source dataTypeOf :: Module -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Module) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Module) Source gmapT :: (forall b. Data b => b -> b) -> Module -> Module Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module -> r Source gmapQ :: (forall d. Data d => d -> u) -> Module -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Module -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Module -> m Module Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Module -> m Module Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Module -> m Module Source | |||||
| Generic Module Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Module Source | |||||
| Lift Module Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Module Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Module = D1 ('MetaData "Module" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Module" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PkgName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModName))) | |||||
data ModuleInfo Source
Obtained from reifyModule in the Q Monad.
Constructors
| ModuleInfo [Module] | Contains the import list of the module. |
Instances
| Ppr ModuleInfo Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq ModuleInfo Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: ModuleInfo -> ModuleInfo -> Bool Source (/=) :: ModuleInfo -> ModuleInfo -> Bool Source | |||||
| Ord ModuleInfo Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: ModuleInfo -> ModuleInfo -> Ordering Source (<) :: ModuleInfo -> ModuleInfo -> Bool Source (<=) :: ModuleInfo -> ModuleInfo -> Bool Source (>) :: ModuleInfo -> ModuleInfo -> Bool Source (>=) :: ModuleInfo -> ModuleInfo -> Bool Source max :: ModuleInfo -> ModuleInfo -> ModuleInfo Source min :: ModuleInfo -> ModuleInfo -> ModuleInfo Source | |||||
| Data ModuleInfo Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModuleInfo -> c ModuleInfo Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModuleInfo Source toConstr :: ModuleInfo -> Constr Source dataTypeOf :: ModuleInfo -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModuleInfo) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModuleInfo) Source gmapT :: (forall b. Data b => b -> b) -> ModuleInfo -> ModuleInfo Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleInfo -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleInfo -> r Source gmapQ :: (forall d. Data d => d -> u) -> ModuleInfo -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleInfo -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleInfo -> m ModuleInfo Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleInfo -> m ModuleInfo Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleInfo -> m ModuleInfo Source | |||||
| Generic ModuleInfo Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show ModuleInfo Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> ModuleInfo -> ShowS Source show :: ModuleInfo -> String Source showList :: [ModuleInfo] -> ShowS Source | |||||
| type Rep ModuleInfo Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep ModuleInfo = D1 ('MetaData "ModuleInfo" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "ModuleInfo" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Module]))) | |||||
data NameFlavour Source
Constructors
| NameS | An unqualified name; dynamically bound |
| NameQ ModName | A qualified name; dynamically bound |
| NameU !Uniq | A unique local name |
| NameL !Uniq | Local name bound outside of the TH AST |
| NameG NameSpace PkgName ModName | Global name bound outside of the TH AST: An original name (occurrences only, not binders) Need the namespace too to be sure which thing we are naming |
Instances
| Eq NameFlavour Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: NameFlavour -> NameFlavour -> Bool Source (/=) :: NameFlavour -> NameFlavour -> Bool Source | |||||
| Ord NameFlavour Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: NameFlavour -> NameFlavour -> Ordering Source (<) :: NameFlavour -> NameFlavour -> Bool Source (<=) :: NameFlavour -> NameFlavour -> Bool Source (>) :: NameFlavour -> NameFlavour -> Bool Source (>=) :: NameFlavour -> NameFlavour -> Bool Source max :: NameFlavour -> NameFlavour -> NameFlavour Source min :: NameFlavour -> NameFlavour -> NameFlavour Source | |||||
| Data NameFlavour Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NameFlavour -> c NameFlavour Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NameFlavour Source toConstr :: NameFlavour -> Constr Source dataTypeOf :: NameFlavour -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NameFlavour) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NameFlavour) Source gmapT :: (forall b. Data b => b -> b) -> NameFlavour -> NameFlavour Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NameFlavour -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NameFlavour -> r Source gmapQ :: (forall d. Data d => d -> u) -> NameFlavour -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> NameFlavour -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> NameFlavour -> m NameFlavour Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NameFlavour -> m NameFlavour Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NameFlavour -> m NameFlavour Source | |||||
| Generic NameFlavour Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: NameFlavour -> Rep NameFlavour x Source to :: Rep NameFlavour x -> NameFlavour Source | |||||
| Show NameFlavour Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> NameFlavour -> ShowS Source show :: NameFlavour -> String Source showList :: [NameFlavour] -> ShowS Source | |||||
| Lift NameFlavour Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => NameFlavour -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => NameFlavour -> Code m NameFlavour Source | |||||
| type Rep NameFlavour Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep NameFlavour = D1 ('MetaData "NameFlavour" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "NameS" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NameQ" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModName))) :+: (C1 ('MetaCons "NameU" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Uniq)) :+: (C1 ('MetaCons "NameL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Uniq)) :+: C1 ('MetaCons "NameG" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NameSpace) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PkgName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModName)))))) | |||||
Instances
Constructors
| VarName | Variables |
| DataName | Data constructors |
| TcClsName | Type constructors and classes; Haskell has them in the same name space for now. |
| FldName | |
Instances
| Eq NameSpace Source | |||||
| Ord NameSpace Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data NameSpace Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NameSpace -> c NameSpace Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NameSpace Source toConstr :: NameSpace -> Constr Source dataTypeOf :: NameSpace -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NameSpace) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NameSpace) Source gmapT :: (forall b. Data b => b -> b) -> NameSpace -> NameSpace Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NameSpace -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NameSpace -> r Source gmapQ :: (forall d. Data d => d -> u) -> NameSpace -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> NameSpace -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> NameSpace -> m NameSpace Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NameSpace -> m NameSpace Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NameSpace -> m NameSpace Source | |||||
| Generic NameSpace Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show NameSpace Source | |||||
| Lift NameSpace Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep NameSpace Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep NameSpace = D1 ('MetaData "NameSpace" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "VarName" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DataName" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TcClsName" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FldName" 'PrefixI 'True) (S1 ('MetaSel ('Just "fldParent") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 String)))) | |||||
data NamespaceSpecifier Source
A way to specify a namespace to look in when GHC needs to find a name's source
Constructors
| NoNamespaceSpecifier | Name may be everything; If there are two names in different namespaces, then consider both |
| TypeNamespaceSpecifier | Name should be a type-level entity, such as a data type, type alias, type family, type class, or type variable |
| DataNamespaceSpecifier | Name should be a term-level entity, such as a function, data constructor, or pattern synonym |
Instances
| Eq NamespaceSpecifier Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source (/=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source | |||||
| Ord NamespaceSpecifier Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: NamespaceSpecifier -> NamespaceSpecifier -> Ordering Source (<) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source (<=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source (>) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source (>=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source max :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier Source min :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier Source | |||||
| Data NamespaceSpecifier Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NamespaceSpecifier -> c NamespaceSpecifier Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NamespaceSpecifier Source toConstr :: NamespaceSpecifier -> Constr Source dataTypeOf :: NamespaceSpecifier -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NamespaceSpecifier) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NamespaceSpecifier) Source gmapT :: (forall b. Data b => b -> b) -> NamespaceSpecifier -> NamespaceSpecifier Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NamespaceSpecifier -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NamespaceSpecifier -> r Source gmapQ :: (forall d. Data d => d -> u) -> NamespaceSpecifier -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> NamespaceSpecifier -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> NamespaceSpecifier -> m NamespaceSpecifier Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NamespaceSpecifier -> m NamespaceSpecifier Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NamespaceSpecifier -> m NamespaceSpecifier Source | |||||
| Generic NamespaceSpecifier Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: NamespaceSpecifier -> Rep NamespaceSpecifier x Source to :: Rep NamespaceSpecifier x -> NamespaceSpecifier Source | |||||
| Show NamespaceSpecifier Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> NamespaceSpecifier -> ShowS Source show :: NamespaceSpecifier -> String Source showList :: [NamespaceSpecifier] -> ShowS Source | |||||
| Lift NamespaceSpecifier Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => NamespaceSpecifier -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => NamespaceSpecifier -> Code m NamespaceSpecifier Source | |||||
| type Rep NamespaceSpecifier Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep NamespaceSpecifier = D1 ('MetaData "NamespaceSpecifier" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "NoNamespaceSpecifier" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "TypeNamespaceSpecifier" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DataNamespaceSpecifier" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
An "Occurence Name".
Instances
| Eq OccName Source | |||||
| Ord OccName Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data OccName Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OccName -> c OccName Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OccName Source toConstr :: OccName -> Constr Source dataTypeOf :: OccName -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OccName) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OccName) Source gmapT :: (forall b. Data b => b -> b) -> OccName -> OccName Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r Source gmapQ :: (forall d. Data d => d -> u) -> OccName -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> OccName -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> OccName -> m OccName Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName Source | |||||
| Generic OccName Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show OccName Source | |||||
| Lift OccName Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep OccName Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
type ParentName = Name Source
In ClassOpI and DataConI, name of the parent class or type
data PatSynArgs Source
A pattern synonym's argument type.
Constructors
| PrefixPatSyn [Name] | pattern P {x y z} = p |
| InfixPatSyn Name Name | pattern {x P y} = p |
| RecordPatSyn [Name] | pattern P { {x,y,z} } = p |
Instances
| Ppr PatSynArgs Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq PatSynArgs Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: PatSynArgs -> PatSynArgs -> Bool Source (/=) :: PatSynArgs -> PatSynArgs -> Bool Source | |||||
| Ord PatSynArgs Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: PatSynArgs -> PatSynArgs -> Ordering Source (<) :: PatSynArgs -> PatSynArgs -> Bool Source (<=) :: PatSynArgs -> PatSynArgs -> Bool Source (>) :: PatSynArgs -> PatSynArgs -> Bool Source (>=) :: PatSynArgs -> PatSynArgs -> Bool Source max :: PatSynArgs -> PatSynArgs -> PatSynArgs Source min :: PatSynArgs -> PatSynArgs -> PatSynArgs Source | |||||
| Data PatSynArgs Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PatSynArgs -> c PatSynArgs Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PatSynArgs Source toConstr :: PatSynArgs -> Constr Source dataTypeOf :: PatSynArgs -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PatSynArgs) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PatSynArgs) Source gmapT :: (forall b. Data b => b -> b) -> PatSynArgs -> PatSynArgs Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatSynArgs -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatSynArgs -> r Source gmapQ :: (forall d. Data d => d -> u) -> PatSynArgs -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> PatSynArgs -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatSynArgs -> m PatSynArgs Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatSynArgs -> m PatSynArgs Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatSynArgs -> m PatSynArgs Source | |||||
| Generic PatSynArgs Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show PatSynArgs Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> PatSynArgs -> ShowS Source show :: PatSynArgs -> String Source showList :: [PatSynArgs] -> ShowS Source | |||||
| Lift PatSynArgs Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => PatSynArgs -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => PatSynArgs -> Code m PatSynArgs Source | |||||
| type Rep PatSynArgs Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep PatSynArgs = D1 ('MetaData "PatSynArgs" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "PrefixPatSyn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])) :+: (C1 ('MetaCons "InfixPatSyn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "RecordPatSyn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])))) | |||||
A pattern synonym's directionality.
Constructors
| Unidir | pattern P x {<-} p |
| ImplBidir | pattern P x {=} p |
| ExplBidir [Clause] | pattern P x {<-} p where P x = e |
Instances
| Ppr PatSynDir Source | |||||
| Eq PatSynDir Source | |||||
| Ord PatSynDir Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data PatSynDir Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PatSynDir -> c PatSynDir Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PatSynDir Source toConstr :: PatSynDir -> Constr Source dataTypeOf :: PatSynDir -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PatSynDir) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PatSynDir) Source gmapT :: (forall b. Data b => b -> b) -> PatSynDir -> PatSynDir Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatSynDir -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatSynDir -> r Source gmapQ :: (forall d. Data d => d -> u) -> PatSynDir -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> PatSynDir -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatSynDir -> m PatSynDir Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatSynDir -> m PatSynDir Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatSynDir -> m PatSynDir Source | |||||
| Generic PatSynDir Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show PatSynDir Source | |||||
| Lift PatSynDir Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep PatSynDir Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep PatSynDir = D1 ('MetaData "PatSynDir" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "Unidir" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ImplBidir" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExplBidir" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause])))) | |||||
type PatSynType = Type Source
A pattern synonym's type. Note that a pattern synonym's fully specified type has a peculiar shape coming with two forall quantifiers and two constraint contexts. For example, consider the pattern synonym
pattern P x1 x2 ... xn = <some-pattern>
P's complete type is of the following form
pattern P :: forall universals. required constraints
=> forall existentials. provided constraints
=> t1 -> t2 -> ... -> tn -> t
consisting of four parts:
- the (possibly empty lists of) universally quantified type variables and required constraints on them.
- the (possibly empty lists of) existentially quantified type variables and the provided constraints on them.
- the types
t1,t2, ..,tnofx1,x2, ..,xn, respectively - the type
tof<some-pattern>, mentioning only universals.
Pattern synonym types interact with TH when (a) reifying a pattern synonym, (b) pretty printing, or (c) specifying a pattern synonym's type signature explicitly:
- Reification always returns a pattern synonym's fully specified type in abstract syntax.
- Pretty printing via
pprPatSynTypeabbreviates a pattern synonym's type unambiguously in concrete syntax: The rule of thumb is to print initial empty universals and the required context as() =>, if existentials and a provided context follow. If only universals and their required context, but no existentials are specified, only the universals and their required context are printed. If both or none are specified, so both (or none) are printed. - When specifying a pattern synonym's type explicitly with
PatSynSigDeither one of the universals, the existentials, or their contexts may be left empty.
See the GHC user's guide for more information on pattern synonyms and their types: https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#pattern-synonyms.
Phase control syntax.
Constructors
| AllPhases | The default when unspecified |
| FromPhase Int | [n] |
| BeforePhase Int | [~n] |
Instances
| Ppr Phases Source | |||||
| Eq Phases Source | |||||
| Ord Phases Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Phases Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Phases -> c Phases Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Phases Source toConstr :: Phases -> Constr Source dataTypeOf :: Phases -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Phases) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Phases) Source gmapT :: (forall b. Data b => b -> b) -> Phases -> Phases Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Phases -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Phases -> r Source gmapQ :: (forall d. Data d => d -> u) -> Phases -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Phases -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Phases -> m Phases Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Phases -> m Phases Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Phases -> m Phases Source | |||||
| Generic Phases Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Phases Source | |||||
| Lift Phases Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Phases Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Phases = D1 ('MetaData "Phases" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "AllPhases" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "FromPhase" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: C1 ('MetaCons "BeforePhase" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))) | |||||
The name of a package.
Instances
| Eq PkgName Source | |||||
| Ord PkgName Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data PkgName Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PkgName -> c PkgName Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PkgName Source toConstr :: PkgName -> Constr Source dataTypeOf :: PkgName -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PkgName) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PkgName) Source gmapT :: (forall b. Data b => b -> b) -> PkgName -> PkgName Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PkgName -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PkgName -> r Source gmapQ :: (forall d. Data d => d -> u) -> PkgName -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> PkgName -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> PkgName -> m PkgName Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PkgName -> m PkgName Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PkgName -> m PkgName Source | |||||
| Generic PkgName Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show PkgName Source | |||||
| Lift PkgName Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep PkgName Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
Constructors
| InlineP Name Inline RuleMatch Phases |
|
| OpaqueP Name | { {-# OPAQUE T #-} } |
| SpecialiseEP (Maybe [TyVarBndr ()]) [RuleBndr] Exp (Maybe Inline) Phases | { {-# SPECIALISE [forall t_1 ... t_i]. [forall b_1 ... b_j] [INLINE] [phases] exp #-} } |
| SpecialiseInstP Type | { {-# SPECIALISE instance I #-} } |
| RuleP String (Maybe [TyVarBndr ()]) [RuleBndr] Exp Exp Phases | { {-# RULES "name" [phases] [forall t_1 ... t_i]. [forall b_1 ... b_j] rules... e_1 = e_2 #-} } |
| AnnP AnnTarget Exp | { {-# ANN target exp #-} } |
| LineP Int String | { {-# LINE n "file name" #-} } |
| CompleteP [Name] (Maybe Name) | { {-# COMPLETE C_1, ..., C_i [ :: T ] #-} } |
| SCCP Name (Maybe String) | { {-# SCC fun "optional_name" #-} } |
Bundled Patterns
| pattern SpecialiseP :: Name -> Type -> Maybe Inline -> Phases -> Pragma |
Old-form specialise pragma Subsumed by the more general |
Instances
| Ppr Pragma Source | |||||
| Eq Pragma Source | |||||
| Ord Pragma Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Pragma Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pragma -> c Pragma Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Pragma Source toConstr :: Pragma -> Constr Source dataTypeOf :: Pragma -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Pragma) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Pragma) Source gmapT :: (forall b. Data b => b -> b) -> Pragma -> Pragma Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pragma -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pragma -> r Source gmapQ :: (forall d. Data d => d -> u) -> Pragma -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Pragma -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pragma -> m Pragma Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pragma -> m Pragma Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pragma -> m Pragma Source | |||||
| Generic Pragma Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Pragma Source | |||||
| Lift Pragma Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Pragma Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Pragma = D1 ('MetaData "Pragma" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (((C1 ('MetaCons "InlineP" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Inline)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RuleMatch) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Phases))) :+: C1 ('MetaCons "OpaqueP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))) :+: (C1 ('MetaCons "SpecialiseEP" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBndr ()])) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [RuleBndr])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Inline)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Phases)))) :+: C1 ('MetaCons "SpecialiseInstP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: ((C1 ('MetaCons "RuleP" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBndr ()])) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [RuleBndr]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Phases)))) :+: C1 ('MetaCons "AnnP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AnnTarget) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp))) :+: (C1 ('MetaCons "LineP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: (C1 ('MetaCons "CompleteP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Name))) :+: C1 ('MetaCons "SCCP" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe String))))))) | |||||
class (MonadIO m, MonadFail m) => Quasi (m :: Type -> Type) where Source
Minimal complete definition
qNewName, qReport, qRecover, qLookupName, qReify, qReifyFixity, qReifyType, qReifyInstances, qReifyRoles, qReifyAnnotations, qReifyModule, qReifyConStrictness, qLocation, qGetPackageRoot, qAddDependentFile, qAddTempFile, qAddTopDecls, qAddForeignFilePath, qAddModFinalizer, qAddCorePlugin, qGetQ, qPutQ, qIsExtEnabled, qExtsEnabled, qPutDoc, qGetDoc
Methods
qNewName :: String -> m Name Source
Fresh names. See newName.
qReport :: Bool -> String -> m () Source
Report an error (True) or warning (False) ...but carry on; use fail to stop. See report.
Arguments
| :: m a | the error handler |
| -> m a | action which may fail |
| -> m a | Recover from the monadic |
See recover.
qLookupName :: Bool -> String -> m (Maybe Name) Source
True = type namespace, False = value namespace. See lookupName.
qReify :: Name -> m Info Source
See reify.
qReifyFixity :: Name -> m (Maybe Fixity) Source
See reifyFixity.
qReifyType :: Name -> m Type Source
See reifyType.
qReifyInstances :: Name -> [Type] -> m [Dec] Source
Is (n tys) an instance? Returns list of matching instance Decs (with empty sub-Decs) Works for classes and type functions. See reifyInstances.
qReifyRoles :: Name -> m [Role] Source
See reifyRoles.
qReifyAnnotations :: Data a => AnnLookup -> m [a] Source
See reifyAnnotations.
qReifyModule :: Module -> m ModuleInfo Source
See reifyModule.
qReifyConStrictness :: Name -> m [DecidedStrictness] Source
See reifyConStrictness.
See location.
Input/output (dangerous). See runIO.
qGetPackageRoot :: m FilePath Source
See getPackageRoot.
qAddDependentFile :: FilePath -> m () Source
See addDependentFile.
qAddTempFile :: String -> m FilePath Source
See addTempFile.
qAddTopDecls :: [Dec] -> m () Source
See addTopDecls.
qAddForeignFilePath :: ForeignSrcLang -> String -> m () Source
See addForeignFilePath.
qAddModFinalizer :: Q () -> m () Source
See addModFinalizer.
qAddCorePlugin :: String -> m () Source
See addCorePlugin.
qGetQ :: Typeable a => m (Maybe a) Source
See getQ.
qPutQ :: Typeable a => a -> m () Source
See putQ.
qIsExtEnabled :: Extension -> m Bool Source
See isExtEnabled.
qExtsEnabled :: m [Extension] Source
See extsEnabled.
qPutDoc :: DocLoc -> String -> m () Source
See putDoc.
qGetDoc :: DocLoc -> m (Maybe String) Source
See getDoc.
Instances
| Quasi Q Source | |
Defined in GHC.Internal.TH.Syntax MethodsqNewName :: String -> Q Name Source qReport :: Bool -> String -> Q () Source qRecover :: Q a -> Q a -> Q a Source qLookupName :: Bool -> String -> Q (Maybe Name) Source qReify :: Name -> Q Info Source qReifyFixity :: Name -> Q (Maybe Fixity) Source qReifyType :: Name -> Q Type Source qReifyInstances :: Name -> [Type] -> Q [Dec] Source qReifyRoles :: Name -> Q [Role] Source qReifyAnnotations :: Data a => AnnLookup -> Q [a] Source qReifyModule :: Module -> Q ModuleInfo Source qReifyConStrictness :: Name -> Q [DecidedStrictness] Source qGetPackageRoot :: Q FilePath Source qAddDependentFile :: FilePath -> Q () Source qAddTempFile :: String -> Q FilePath Source qAddTopDecls :: [Dec] -> Q () Source qAddForeignFilePath :: ForeignSrcLang -> String -> Q () Source qAddModFinalizer :: Q () -> Q () Source qAddCorePlugin :: String -> Q () Source qGetQ :: Typeable a => Q (Maybe a) Source qPutQ :: Typeable a => a -> Q () Source qIsExtEnabled :: Extension -> Q Bool Source qExtsEnabled :: Q [Extension] Source | |
| Quasi IO Source | |
Defined in GHC.Internal.TH.Syntax MethodsqNewName :: String -> IO Name Source qReport :: Bool -> String -> IO () Source qRecover :: IO a -> IO a -> IO a Source qLookupName :: Bool -> String -> IO (Maybe Name) Source qReify :: Name -> IO Info Source qReifyFixity :: Name -> IO (Maybe Fixity) Source qReifyType :: Name -> IO Type Source qReifyInstances :: Name -> [Type] -> IO [Dec] Source qReifyRoles :: Name -> IO [Role] Source qReifyAnnotations :: Data a => AnnLookup -> IO [a] Source qReifyModule :: Module -> IO ModuleInfo Source qReifyConStrictness :: Name -> IO [DecidedStrictness] Source qGetPackageRoot :: IO FilePath Source qAddDependentFile :: FilePath -> IO () Source qAddTempFile :: String -> IO FilePath Source qAddTopDecls :: [Dec] -> IO () Source qAddForeignFilePath :: ForeignSrcLang -> String -> IO () Source qAddModFinalizer :: Q () -> IO () Source qAddCorePlugin :: String -> IO () Source qGetQ :: Typeable a => IO (Maybe a) Source qPutQ :: Typeable a => a -> IO () Source qIsExtEnabled :: Extension -> IO Bool Source qExtsEnabled :: IO [Extension] Source | |
A list/enum range expression.
Constructors
| FromR Exp | [n ..] |
| FromThenR Exp Exp | [n, m ..] |
| FromToR Exp Exp | [n .. m] |
| FromThenToR Exp Exp Exp | [n, m .. k] |
Instances
| Ppr Range Source | |||||
| Eq Range Source | |||||
| Ord Range Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Range Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Range -> c Range Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Range Source toConstr :: Range -> Constr Source dataTypeOf :: Range -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Range) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Range) Source gmapT :: (forall b. Data b => b -> b) -> Range -> Range Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Range -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Range -> r Source gmapQ :: (forall d. Data d => d -> u) -> Range -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Range -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Range -> m Range Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Range -> m Range Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Range -> m Range Source | |||||
| Generic Range Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Range Source | |||||
| Lift Range Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Range Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Range = D1 ('MetaData "Range" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "FromR" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp)) :+: C1 ('MetaCons "FromThenR" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp))) :+: (C1 ('MetaCons "FromToR" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp)) :+: C1 ('MetaCons "FromThenToR" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exp))))) | |||||
Role annotations
Constructors
| NominalR | nominal |
| RepresentationalR | representational |
| PhantomR | phantom |
| InferR | _ |
Instances
| Ppr Role Source | |||||
| Eq Role Source | |||||
| Ord Role Source | |||||
| Data Role Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Role -> c Role Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Role Source toConstr :: Role -> Constr Source dataTypeOf :: Role -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Role) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Role) Source gmapT :: (forall b. Data b => b -> b) -> Role -> Role Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r Source gmapQ :: (forall d. Data d => d -> u) -> Role -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Role -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role -> m Role Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role Source | |||||
| Generic Role Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Role Source | |||||
| Lift Role Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Role Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep Role = D1 ('MetaData "Role" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) ((C1 ('MetaCons "NominalR" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RepresentationalR" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PhantomR" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InferR" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
A CONLIKE modifier, as in one of the various inline pragmas, or lack thereof (FunLike).
Instances
| Ppr RuleMatch Source | |
| Eq RuleMatch Source | |
| Ord RuleMatch Source | |
Defined in GHC.Internal.TH.Syntax | |
| Data RuleMatch Source | |
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RuleMatch -> c RuleMatch Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RuleMatch Source toConstr :: RuleMatch -> Constr Source dataTypeOf :: RuleMatch -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RuleMatch) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RuleMatch) Source gmapT :: (forall b. Data b => b -> b) -> RuleMatch -> RuleMatch Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RuleMatch -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RuleMatch -> r Source gmapQ :: (forall d. Data d => d -> u) -> RuleMatch -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> RuleMatch -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> RuleMatch -> m RuleMatch Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleMatch -> m RuleMatch Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleMatch -> m RuleMatch Source | |
| Generic RuleMatch Source | |
Defined in GHC.Internal.TH.Syntax | |
| Show RuleMatch Source | |
| Lift RuleMatch Source | Since: template-haskell-2.22.1.0 |
| type Rep RuleMatch Source | |
A safety level, as in a Foreign declaration.
Constructors
| Unsafe | |
| Safe | |
| Interruptible |
Instances
| Eq Safety Source | |||||
| Ord Safety Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data Safety Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Safety -> c Safety Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Safety Source toConstr :: Safety -> Constr Source dataTypeOf :: Safety -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Safety) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Safety) Source gmapT :: (forall b. Data b => b -> b) -> Safety -> Safety Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Safety -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Safety -> r Source gmapQ :: (forall d. Data d => d -> u) -> Safety -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Safety -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Safety -> m Safety Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Safety -> m Safety Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Safety -> m Safety Source | |||||
| Generic Safety Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show Safety Source | |||||
| Lift Safety Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep Safety Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
data SourceStrictness Source
SourceStrictness corresponds to strictness annotations found in the source code.
This may not agree with the annotations returned by reifyConStrictness. See reifyConStrictness for more information.
Constructors
| NoSourceStrictness | C a |
| SourceLazy | C {~}a |
| SourceStrict | C {!}a |
Instances
| Ppr SourceStrictness Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq SourceStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: SourceStrictness -> SourceStrictness -> Bool Source (/=) :: SourceStrictness -> SourceStrictness -> Bool Source | |||||
| Ord SourceStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: SourceStrictness -> SourceStrictness -> Ordering Source (<) :: SourceStrictness -> SourceStrictness -> Bool Source (<=) :: SourceStrictness -> SourceStrictness -> Bool Source (>) :: SourceStrictness -> SourceStrictness -> Bool Source (>=) :: SourceStrictness -> SourceStrictness -> Bool Source max :: SourceStrictness -> SourceStrictness -> SourceStrictness Source min :: SourceStrictness -> SourceStrictness -> SourceStrictness Source | |||||
| Data SourceStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SourceStrictness -> c SourceStrictness Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SourceStrictness Source toConstr :: SourceStrictness -> Constr Source dataTypeOf :: SourceStrictness -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SourceStrictness) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SourceStrictness) Source gmapT :: (forall b. Data b => b -> b) -> SourceStrictness -> SourceStrictness Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SourceStrictness -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SourceStrictness -> r Source gmapQ :: (forall d. Data d => d -> u) -> SourceStrictness -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> SourceStrictness -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> SourceStrictness -> m SourceStrictness Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceStrictness -> m SourceStrictness Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceStrictness -> m SourceStrictness Source | |||||
| Generic SourceStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: SourceStrictness -> Rep SourceStrictness x Source to :: Rep SourceStrictness x -> SourceStrictness Source | |||||
| Show SourceStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> SourceStrictness -> ShowS Source show :: SourceStrictness -> String Source showList :: [SourceStrictness] -> ShowS Source | |||||
| Lift SourceStrictness Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => SourceStrictness -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => SourceStrictness -> Code m SourceStrictness Source | |||||
| type Rep SourceStrictness Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep SourceStrictness = D1 ('MetaData "SourceStrictness" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "NoSourceStrictness" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "SourceLazy" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SourceStrict" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
data SourceUnpackedness Source
SourceUnpackedness corresponds to unpack annotations found in the source code.
This may not agree with the annotations returned by reifyConStrictness. See reifyConStrictness for more information.
Constructors
| NoSourceUnpackedness | C a |
| SourceNoUnpack | C { {-# NOUNPACK #-} } a |
| SourceUnpack | C { {-# UNPACK #-} } a |
Instances
| Ppr SourceUnpackedness Source | |||||
Defined in GHC.Boot.TH.Ppr | |||||
| Eq SourceUnpackedness Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source | |||||
| Ord SourceUnpackedness Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: SourceUnpackedness -> SourceUnpackedness -> Ordering Source (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness Source min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness Source | |||||
| Data SourceUnpackedness Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SourceUnpackedness -> c SourceUnpackedness Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SourceUnpackedness Source toConstr :: SourceUnpackedness -> Constr Source dataTypeOf :: SourceUnpackedness -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SourceUnpackedness) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SourceUnpackedness) Source gmapT :: (forall b. Data b => b -> b) -> SourceUnpackedness -> SourceUnpackedness Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SourceUnpackedness -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SourceUnpackedness -> r Source gmapQ :: (forall d. Data d => d -> u) -> SourceUnpackedness -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> SourceUnpackedness -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> SourceUnpackedness -> m SourceUnpackedness Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceUnpackedness -> m SourceUnpackedness Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceUnpackedness -> m SourceUnpackedness Source | |||||
| Generic SourceUnpackedness Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: SourceUnpackedness -> Rep SourceUnpackedness x Source to :: Rep SourceUnpackedness x -> SourceUnpackedness Source | |||||
| Show SourceUnpackedness Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> SourceUnpackedness -> ShowS Source show :: SourceUnpackedness -> String Source showList :: [SourceUnpackedness] -> ShowS Source | |||||
| Lift SourceUnpackedness Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => SourceUnpackedness -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => SourceUnpackedness -> Code m SourceUnpackedness Source | |||||
| type Rep SourceUnpackedness Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep SourceUnpackedness = D1 ('MetaData "SourceUnpackedness" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "NoSourceUnpackedness" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "SourceNoUnpack" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SourceUnpack" 'PrefixI 'False) (U1 :: Type -> Type))) | |||||
data Specificity Source
The specificity of a type variable in a forall ....
Constructors
| SpecifiedSpec | a |
| InferredSpec | {a} |
Instances
| PprFlag Specificity Source | |||||
Defined in GHC.Boot.TH.Ppr Methods | |||||
| Eq Specificity Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: Specificity -> Specificity -> Bool Source (/=) :: Specificity -> Specificity -> Bool Source | |||||
| Ord Specificity Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: Specificity -> Specificity -> Ordering Source (<) :: Specificity -> Specificity -> Bool Source (<=) :: Specificity -> Specificity -> Bool Source (>) :: Specificity -> Specificity -> Bool Source (>=) :: Specificity -> Specificity -> Bool Source max :: Specificity -> Specificity -> Specificity Source min :: Specificity -> Specificity -> Specificity Source | |||||
| Data Specificity Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Specificity -> c Specificity Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Specificity Source toConstr :: Specificity -> Constr Source dataTypeOf :: Specificity -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Specificity) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Specificity) Source gmapT :: (forall b. Data b => b -> b) -> Specificity -> Specificity Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r Source gmapQ :: (forall d. Data d => d -> u) -> Specificity -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Specificity -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity Source | |||||
| Generic Specificity Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: Specificity -> Rep Specificity x Source to :: Rep Specificity x -> Specificity Source | |||||
| Show Specificity Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> Specificity -> ShowS Source show :: Specificity -> String Source showList :: [Specificity] -> ShowS Source | |||||
| DefaultBndrFlag Specificity Source | |||||
Defined in Language.Haskell.TH.Lib Methods | |||||
| Lift Specificity Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => Specificity -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => Specificity -> Code m Specificity Source | |||||
| type Rep Specificity Source | |||||
As of template-haskell-2.11.0.0, Strict has been replaced by Bang.
type StrictType = BangType Source
As of template-haskell-2.11.0.0, StrictType has been replaced by BangType.
In UnboxedSumE and UnboxedSumP, the number associated with a particular data constructor. SumAlts are one-indexed and should never exceed the value of its corresponding SumArity. For example:
-
(#_|#)hasSumAlt1 (out of a totalSumArityof 2) -
(#|_#)hasSumAlt2 (out of a totalSumArityof 2)
In UnboxedSumE, UnboxedSumT, and UnboxedSumP, the total number of SumAlts. For example, (#|#) has a SumArity of 2.
newtype TExp (a :: TYPE r) Source
Typed wrapper around an Exp.
This is the typed representation of terms produced by typed quotes.
Representation-polymorphic since template-haskell-2.16.0.0.
Instances
Type-level literals.
Instances
| Ppr TyLit Source | |||||
| Eq TyLit Source | |||||
| Ord TyLit Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Data TyLit Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyLit -> c TyLit Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TyLit Source toConstr :: TyLit -> Constr Source dataTypeOf :: TyLit -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TyLit) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TyLit) Source gmapT :: (forall b. Data b => b -> b) -> TyLit -> TyLit Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyLit -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyLit -> r Source gmapQ :: (forall d. Data d => d -> u) -> TyLit -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> TyLit -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyLit -> m TyLit Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyLit -> m TyLit Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyLit -> m TyLit Source | |||||
| Generic TyLit Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show TyLit Source | |||||
| Lift TyLit Source | Since: template-haskell-2.22.1.0 |
||||
| type Rep TyLit Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep TyLit = D1 ('MetaData "TyLit" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "NumTyLit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer)) :+: (C1 ('MetaCons "StrTyLit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "CharTyLit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Char)))) | |||||
The flag type parameter is instantiated to one of the following types:
-
Specificity(examples:ForallC,ForallT) -
BndrVis(examples:DataD,ClassD, etc.) -
(), a catch-all type for other forms of binders, includingForallVisT,DataInstD,RuleP, andTyVarSig
Instances
| Functor TyVarBndr Source | |||||
| Foldable TyVarBndr Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsfold :: Monoid m => TyVarBndr m -> m Source foldMap :: Monoid m => (a -> m) -> TyVarBndr a -> m Source foldMap' :: Monoid m => (a -> m) -> TyVarBndr a -> m Source foldr :: (a -> b -> b) -> b -> TyVarBndr a -> b Source foldr' :: (a -> b -> b) -> b -> TyVarBndr a -> b Source foldl :: (b -> a -> b) -> b -> TyVarBndr a -> b Source foldl' :: (b -> a -> b) -> b -> TyVarBndr a -> b Source foldr1 :: (a -> a -> a) -> TyVarBndr a -> a Source foldl1 :: (a -> a -> a) -> TyVarBndr a -> a Source toList :: TyVarBndr a -> [a] Source null :: TyVarBndr a -> Bool Source length :: TyVarBndr a -> Int Source elem :: Eq a => a -> TyVarBndr a -> Bool Source maximum :: Ord a => TyVarBndr a -> a Source minimum :: Ord a => TyVarBndr a -> a Source | |||||
| Traversable TyVarBndr Source | |||||
Defined in GHC.Internal.TH.Syntax | |||||
| Lift a => Lift (TyVarBndr a :: Type) Source | Since: template-haskell-2.22.1.0 |
||||
| PprFlag flag => Ppr (TyVarBndr flag) Source | |||||
| Eq flag => Eq (TyVarBndr flag) Source | |||||
| Ord flag => Ord (TyVarBndr flag) Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: TyVarBndr flag -> TyVarBndr flag -> Ordering Source (<) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source (<=) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source (>) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source (>=) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source max :: TyVarBndr flag -> TyVarBndr flag -> TyVarBndr flag Source min :: TyVarBndr flag -> TyVarBndr flag -> TyVarBndr flag Source | |||||
| Data flag => Data (TyVarBndr flag) Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyVarBndr flag -> c (TyVarBndr flag) Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (TyVarBndr flag) Source toConstr :: TyVarBndr flag -> Constr Source dataTypeOf :: TyVarBndr flag -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (TyVarBndr flag)) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TyVarBndr flag)) Source gmapT :: (forall b. Data b => b -> b) -> TyVarBndr flag -> TyVarBndr flag Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyVarBndr flag -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyVarBndr flag -> r Source gmapQ :: (forall d. Data d => d -> u) -> TyVarBndr flag -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> TyVarBndr flag -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyVarBndr flag -> m (TyVarBndr flag) Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyVarBndr flag -> m (TyVarBndr flag) Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyVarBndr flag -> m (TyVarBndr flag) Source | |||||
| Generic (TyVarBndr flag) Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
| |||||
| Show flag => Show (TyVarBndr flag) Source | |||||
| type Rep (TyVarBndr flag) Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep (TyVarBndr flag) = D1 ('MetaData "TyVarBndr" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "PlainTV" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 flag)) :+: C1 ('MetaCons "KindedTV" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 flag) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Kind)))) | |||||
data TypeFamilyHead Source
Common elements of OpenTypeFamilyD and ClosedTypeFamilyD. By analogy with "head" for type classes and type class instances as defined in Type classes: an exploration of the design space, the TypeFamilyHead is defined to be the elements of the declaration between type family and where.
Constructors
| TypeFamilyHead Name [TyVarBndr BndrVis] FamilyResultSig (Maybe InjectivityAnn) |
Instances
| Eq TypeFamilyHead Source | |||||
Defined in GHC.Internal.TH.Syntax Methods(==) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source | |||||
| Ord TypeFamilyHead Source | |||||
Defined in GHC.Internal.TH.Syntax Methodscompare :: TypeFamilyHead -> TypeFamilyHead -> Ordering Source (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead Source min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead Source | |||||
| Data TypeFamilyHead Source | |||||
Defined in GHC.Internal.TH.Syntax Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TypeFamilyHead -> c TypeFamilyHead Source gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TypeFamilyHead Source toConstr :: TypeFamilyHead -> Constr Source dataTypeOf :: TypeFamilyHead -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TypeFamilyHead) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeFamilyHead) Source gmapT :: (forall b. Data b => b -> b) -> TypeFamilyHead -> TypeFamilyHead Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeFamilyHead -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeFamilyHead -> r Source gmapQ :: (forall d. Data d => d -> u) -> TypeFamilyHead -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeFamilyHead -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeFamilyHead -> m TypeFamilyHead Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeFamilyHead -> m TypeFamilyHead Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeFamilyHead -> m TypeFamilyHead Source | |||||
| Generic TypeFamilyHead Source | |||||
Defined in GHC.Internal.TH.Syntax Associated Types
Methodsfrom :: TypeFamilyHead -> Rep TypeFamilyHead x Source to :: Rep TypeFamilyHead x -> TypeFamilyHead Source | |||||
| Show TypeFamilyHead Source | |||||
Defined in GHC.Internal.TH.Syntax MethodsshowsPrec :: Int -> TypeFamilyHead -> ShowS Source show :: TypeFamilyHead -> String Source showList :: [TypeFamilyHead] -> ShowS Source | |||||
| Lift TypeFamilyHead Source | Since: template-haskell-2.22.1.0 |
||||
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => TypeFamilyHead -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => TypeFamilyHead -> Code m TypeFamilyHead Source | |||||
| type Rep TypeFamilyHead Source | |||||
Defined in GHC.Internal.TH.Syntax type Rep TypeFamilyHead = D1 ('MetaData "TypeFamilyHead" "GHC.Internal.TH.Syntax" "ghc-internal" 'False) (C1 ('MetaCons "TypeFamilyHead" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TyVarBndr BndrVis])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FamilyResultSig) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe InjectivityAnn))))) | |||||
Uniq is used by GHC to distinguish names from each other.
In PrimTyConI, is the type constructor unlifted?
type VarStrictType = VarBangType Source
As of template-haskell-2.11.0.0, VarStrictType has been replaced by VarBangType.
makeRelativeToProject :: FilePath -> Q FilePath Source
The input is a filepath, which if relative is offset by the package root.
liftString :: Quote m => String -> m Exp Source
class Lift (t :: TYPE r) where Source
A Lift instance can have any of its values turned into a Template Haskell expression. This is needed when a value used within a Template Haskell quotation is bound outside the Oxford brackets ([| ... |] or [|| ... ||]) but not at the top level. As an example:
add1 :: Int -> Code Q Int add1 x = [|| x + 1 ||]
Template Haskell has no way of knowing what value x will take on at splice-time, so it requires the type of x to be an instance of Lift.
A Lift instance must satisfy $(lift x) ≡ x and $$(liftTyped x) ≡ x for all x, where $(...) and $$(...) are Template Haskell splices. It is additionally expected that lift x ≡ unTypeCode (liftTyped x).
Lift instances can be derived automatically by use of the -XDeriveLift GHC language extension:
{-# LANGUAGE DeriveLift #-}
module Foo where
import Language.Haskell.TH.Syntax
data Bar a = Bar1 a (Bar a) | Bar2 String
deriving Lift
Representation-polymorphic since template-haskell-2.16.0.0.
This is exposed both from the template-haskell-lift and template-haskell packages. Consider importing it from the more stable template-haskell-lift if you don't need the full breadth of the template-haskell interface.
Minimal complete definition
Methods
lift :: Quote m => t -> m Exp Source
Turn a value into a Template Haskell expression, suitable for use in a splice.
liftTyped :: forall (m :: Type -> Type). Quote m => t -> Code m t Source
Turn a value into a Template Haskell typed expression, suitable for use in a typed splice.
Since: template-haskell-2.16.0.0
Instances
| Lift Addr# Source |
Produces an Since: template-haskell-2.16.0.0 |
| Lift Double# Source | Since: template-haskell-2.16.0.0 |
| Lift Float# Source | Since: template-haskell-2.16.0.0 |
| Lift Int# Source | Since: template-haskell-2.16.0.0 |
| Lift ByteArray Source | |
| Lift Void Source | Since: template-haskell-2.15.0.0 |
| Lift ForeignSrcLang Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => ForeignSrcLang -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => ForeignSrcLang -> Code m ForeignSrcLang Source | |
| Lift Int16 Source | |
| Lift Int32 Source | |
| Lift Int64 Source | |
| Lift Int8 Source | |
| Lift Extension Source | Since: template-haskell-2.22.1.0 |
| Lift AnnLookup Source | Since: template-haskell-2.22.1.0 |
| Lift AnnTarget Source | Since: template-haskell-2.22.1.0 |
| Lift Bang Source | Since: template-haskell-2.22.1.0 |
| Lift BndrVis Source | Since: template-haskell-2.22.1.0 |
| Lift Body Source | Since: template-haskell-2.22.1.0 |
| Lift Bytes Source | Since: template-haskell-2.22.1.0 |
| Lift Callconv Source | Since: template-haskell-2.22.1.0 |
| Lift Clause Source | Since: template-haskell-2.22.1.0 |
| Lift Con Source | Since: template-haskell-2.22.1.0 |
| Lift Dec Source | Since: template-haskell-2.22.1.0 |
| Lift DecidedStrictness Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => DecidedStrictness -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => DecidedStrictness -> Code m DecidedStrictness Source | |
| Lift DerivClause Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => DerivClause -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => DerivClause -> Code m DerivClause Source | |
| Lift DerivStrategy Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => DerivStrategy -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => DerivStrategy -> Code m DerivStrategy Source | |
| Lift DocLoc Source | Since: template-haskell-2.22.1.0 |
| Lift Exp Source | Since: template-haskell-2.22.1.0 |
| Lift FamilyResultSig Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => FamilyResultSig -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => FamilyResultSig -> Code m FamilyResultSig Source | |
| Lift Fixity Source | Since: template-haskell-2.22.1.0 |
| Lift FixityDirection Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => FixityDirection -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => FixityDirection -> Code m FixityDirection Source | |
| Lift Foreign Source | Since: template-haskell-2.22.1.0 |
| Lift FunDep Source | Since: template-haskell-2.22.1.0 |
| Lift Guard Source | Since: template-haskell-2.22.1.0 |
| Lift Info Source | Since: template-haskell-2.22.1.0 |
| Lift InjectivityAnn Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => InjectivityAnn -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => InjectivityAnn -> Code m InjectivityAnn Source | |
| Lift Inline Source | Since: template-haskell-2.22.1.0 |
| Lift Lit Source | Since: template-haskell-2.22.1.0 |
| Lift Loc Source | Since: template-haskell-2.22.1.0 |
| Lift Match Source | Since: template-haskell-2.22.1.0 |
| Lift ModName Source | Since: template-haskell-2.22.1.0 |
| Lift Module Source | Since: template-haskell-2.22.1.0 |
| Lift Name Source | Since: template-haskell-2.22.1.0 |
| Lift NameFlavour Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => NameFlavour -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => NameFlavour -> Code m NameFlavour Source | |
| Lift NameIs Source | Since: template-haskell-2.22.1.0 |
| Lift NameSpace Source | Since: template-haskell-2.22.1.0 |
| Lift NamespaceSpecifier Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => NamespaceSpecifier -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => NamespaceSpecifier -> Code m NamespaceSpecifier Source | |
| Lift OccName Source | Since: template-haskell-2.22.1.0 |
| Lift Overlap Source | Since: template-haskell-2.22.1.0 |
| Lift Pat Source | Since: template-haskell-2.22.1.0 |
| Lift PatSynArgs Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => PatSynArgs -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => PatSynArgs -> Code m PatSynArgs Source | |
| Lift PatSynDir Source | Since: template-haskell-2.22.1.0 |
| Lift Phases Source | Since: template-haskell-2.22.1.0 |
| Lift PkgName Source | Since: template-haskell-2.22.1.0 |
| Lift Pragma Source | Since: template-haskell-2.22.1.0 |
| Lift Range Source | Since: template-haskell-2.22.1.0 |
| Lift Role Source | Since: template-haskell-2.22.1.0 |
| Lift RuleBndr Source | Since: template-haskell-2.22.1.0 |
| Lift RuleMatch Source | Since: template-haskell-2.22.1.0 |
| Lift Safety Source | Since: template-haskell-2.22.1.0 |
| Lift SourceStrictness Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => SourceStrictness -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => SourceStrictness -> Code m SourceStrictness Source | |
| Lift SourceUnpackedness Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => SourceUnpackedness -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => SourceUnpackedness -> Code m SourceUnpackedness Source | |
| Lift Specificity Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => Specificity -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => Specificity -> Code m Specificity Source | |
| Lift Stmt Source | Since: template-haskell-2.22.1.0 |
| Lift TyLit Source | Since: template-haskell-2.22.1.0 |
| Lift TySynEqn Source | Since: template-haskell-2.22.1.0 |
| Lift Type Source | Since: template-haskell-2.22.1.0 |
| Lift TypeFamilyHead Source | Since: template-haskell-2.22.1.0 |
Defined in GHC.Internal.TH.Lift Methodslift :: Quote m => TypeFamilyHead -> m Exp Source liftTyped :: forall (m :: Type -> Type). Quote m => TypeFamilyHead -> Code m TypeFamilyHead Source | |
| Lift Word16 Source | |
| Lift Word32 Source | |
| Lift Word64 Source | |
| Lift Word8 Source | |
| Lift Integer Source | |
| Lift Natural Source | |
| Lift () Source | |
| Lift Bool Source | |
| Lift Char Source | |
| Lift Double Source | |
| Lift Float Source | |
| Lift Int Source | |
| Lift Word Source | |
| Lift Char# Source | Since: template-haskell-2.16.0.0 |
| Lift Word# Source | Since: template-haskell-2.16.0.0 |
| Lift (# #) Source | Since: template-haskell-2.16.0.0 |
| Lift a => Lift (NonEmpty a :: Type) Source | Since: template-haskell-2.15.0.0 |
| Integral a => Lift (Ratio a :: Type) Source | |
| Lift a => Lift (TyVarBndr a :: Type) Source | Since: template-haskell-2.22.1.0 |
| Lift a => Lift (Maybe a :: Type) Source | |
| Lift a => Lift ([a] :: Type) Source | |
| Lift (Fixed a :: Type) Source | Since: base-4.21.0.0 |
| (Lift a, Lift b) => Lift (Either a b :: Type) Source | |
| Lift (TExp a :: Type) Source | Since: template-haskell-2.22.1.0 |
| (Lift a, Lift b) => Lift ((a, b) :: Type) Source | |
| (Lift a, Lift b, Lift c) => Lift ((a, b, c) :: Type) Source | |
| (Lift a, Lift b, Lift c, Lift d) => Lift ((a, b, c, d) :: Type) Source | |
| (Lift a, Lift b, Lift c, Lift d, Lift e) => Lift ((a, b, c, d, e) :: Type) Source | |
| (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f) => Lift ((a, b, c, d, e, f) :: Type) Source | |
| (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f, Lift g) => Lift ((a, b, c, d, e, f, g) :: Type) Source | |
| Lift a => Lift ((# a #) :: TYPE ('TupleRep '[LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b) => Lift ((# a | b #) :: TYPE ('SumRep '[LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b) => Lift ((# a, b #) :: TYPE ('TupleRep '[LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c) => Lift ((# a | b | c #) :: TYPE ('SumRep '[LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c) => Lift ((# a, b, c #) :: TYPE ('TupleRep '[LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d) => Lift ((# a | b | c | d #) :: TYPE ('SumRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d) => Lift ((# a, b, c, d #) :: TYPE ('TupleRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d, Lift e) => Lift ((# a | b | c | d | e #) :: TYPE ('SumRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d, Lift e) => Lift ((# a, b, c, d, e #) :: TYPE ('TupleRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f) => Lift ((# a | b | c | d | e | f #) :: TYPE ('SumRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f) => Lift ((# a, b, c, d, e, f #) :: TYPE ('TupleRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f, Lift g) => Lift ((# a | b | c | d | e | f | g #) :: TYPE ('SumRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
| (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f, Lift g) => Lift ((# a, b, c, d, e, f, g #) :: TYPE ('TupleRep '[LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep, LiftedRep])) Source | Since: template-haskell-2.16.0.0 |
dataToCodeQ :: forall (m :: Type -> Type) a. (Quote m, Data a) => (forall b. Data b => b -> Maybe (Code m b)) -> a -> Code m a Source
A typed variant of dataToExpQ.
dataToExpQ :: (Quote m, Data a) => (forall b. Data b => b -> Maybe (m Exp)) -> a -> m Exp Source
dataToExpQ converts a value to a Exp representation of the same value, in the SYB style. It is generalized to take a function override type-specific cases; see liftData for a more commonly used variant.
dataToPatQ :: (Quote m, Data a) => (forall b. Data b => b -> Maybe (m Pat)) -> a -> m Pat Source
dataToPatQ converts a value to a Pat representation of the same value, in the SYB style. It takes a function to handle type-specific cases, alternatively, pass const Nothing to get default behavior.
dataToQa :: (Quote m, Data a) => (Name -> k) -> (Lit -> m q) -> (k -> [m q] -> m q) -> (forall b. Data b => b -> Maybe (m q)) -> a -> m q Source
dataToQa is an internal utility function for constructing generic conversion functions from types with Data instances to various quasi-quoting representations. See the source of dataToExpQ and dataToPatQ for two example usages: mkCon, mkLit and appQ are overloadable to account for different syntax for expressions and patterns; antiQ allows you to override type-specific cases, a common usage is just const Nothing, which results in no overloading.
liftData :: (Quote m, Data a) => a -> m Exp Source
liftData is a variant of lift in the Lift type class which works for any type with a Data instance.
liftDataTyped :: forall (m :: Type -> Type) a. (Quote m, Data a) => a -> Code m a Source
A typed variant of liftData.
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).
https://downloads.haskell.org/~ghc/9.14.1/docs/libraries/template-haskell-2.24.0.0-7769/Language-Haskell-TH-Syntax.html