Control.Lens.Internal.TH

Documentation

appsT :: TypeQ -> [TypeQ] -> TypeQ

Apply arguments to a type constructor

appsE1 :: ExpQ -> [ExpQ] -> ExpQ

Apply arguments to a function

toTupleT :: [TypeQ] -> TypeQ

Construct a tuple type given a list of types.

toTupleE :: [ExpQ] -> ExpQ

Construct a tuple value given a list of expressions.

toTupleP :: [PatQ] -> PatQ

Construct a tuple pattern given a list of patterns.

conAppsT :: Name -> [Type] -> Type

Apply arguments to a type constructor.

newNames

Arguments

:: String

base name

-> Int

count

-> Q [Name]

Generate many new names from a given base name.

unfoldType :: Type -> (Type, [Type])

Decompose an applied type into its individual components. For example, this:

Either Int Char

would be unfolded to this:

(ConT ''Either, [ConT ''Int, ConT ''Char])

This function ignores explicit parentheses and visible kind applications.

datatypeTypeKinded :: DatatypeInfo -> Type

dropSigsIfNonDataFam :: DatatypeInfo -> [Type] -> [Type]

In an effort to prevent users from having to enable KindSignatures every time that they use lens' TH functionality, we strip off reified kind annotations from when:

1. The kind of a type does not contain any kind variables. If it *does* contain kind variables, we want to preserve them so that we can generate type signatures that preserve the dependency order of kind and type variables. (The data types in test/T917.hs contain examples where this is important.) This will require enabling PolyKinds, but since PolyKinds implies KindSignatures, we can at least accomplish two things at once.
2. The data type is not an instance of a data family. We make an exception for data family instances, since the presence or absence of a kind annotation can be the difference between typechecking or not. (See T917DataFam in tests/T917.hs for an example.) Moreover, the TypeFamilies extension implies KindSignatures.

quantifyType :: Cxt -> Type -> Type

Template Haskell wants type variables declared in a forall, so we find all free type variables in a given type and declare them.

quantifyType' :: Set Name -> Cxt -> Type -> Type

This function works like quantifyType except that it takes a list of variables to exclude from quantification.

tvbToType :: TyVarBndr_ flag -> Type

Convert a TyVarBndr into its corresponding Type.

unSigT :: Type -> Type

Peel off a kind signature from a Type (if it has one).

isDataFamily :: DatatypeVariant -> Bool

traversalTypeName :: Name

traversal'TypeName :: Name

lensTypeName :: Name

lens'TypeName :: Name

isoTypeName :: Name

iso'TypeName :: Name

getterTypeName :: Name

foldTypeName :: Name

prismTypeName :: Name

prism'TypeName :: Name

reviewTypeName :: Name

wrappedTypeName :: Name

unwrappedTypeName :: Name

rewrappedTypeName :: Name

_wrapped'ValName :: Name

isoValName :: Name

prismValName :: Name

untoValName :: Name

phantomValName :: Name

phantom2 :: (Functor f, Contravariant f) => f a -> f b

composeValName :: Name

idValName :: Name

fmapValName :: Name

pureValName :: Name

apValName :: Name

rightDataName :: Name

leftDataName :: Name

inlinePragma :: Name -> [DecQ]

type TyVarBndrVis = TyVarBndr_ BndrVis

A TyVarBndr with a BndrVis flag. This is used for TyVarBndrs in type-level declarations (e.g., the binders in data D @k (a :: k)).

bndrReq :: BndrVis