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

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

lensPackageKey :: String

mkLensName_tc :: String -> String -> Name

mkLensName_v :: String -> String -> Name

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]