Language.Haskell.TH.TypeGraph.TypeTraversal

Build a directed graph whose nodes are arity zero types and whose edges represent the hops in the path graph.

Documentation

class DsMonad m => HasVisitedMap m where

Minimal complete definition

unvisited

Methods

unvisited :: Type -> m () -> m ()

doType :: HasTypeTraversal m => Type -> m ()

class Monad m => HasTypeParameters m where

Minimal complete definition

pushParam, withParams

Methods

pushParam :: Type -> m a -> m a

withParams :: ([Type] -> m ()) -> m ()

withBindings :: (HasTypeParameters m, Data a) => ((a -> a) -> m ()) -> [TyVarBndr] -> m ()

Input is a list of type variable bindings (such as those appearing in a Dec) and the current stack of type parameters applied by AppT. Builds a function that expands a type using those bindings and pass it to an action.

class (DsMonad m, HasVisitedMap m) => HasTypeTraversal m where

Minimal complete definition

prepType, doTypeInternal, doListT, doTupleT, doField, doVarT

Methods

prepType :: Type -> m Type

Normally just return, this can modify the types during the traversal.

doTypeInternal :: Type -> m ()

This is passed every type that is encountered. The methods below are called from doApply.

doListT :: Type -> Type -> m ()

When a ListT type is encountered this is passed the type and the element type

doTupleT :: Type -> Type -> Int -> m ()

When a TupleT type is encountered this is called once for each element, with the type, element type, and element position.

doField :: Type -> (Type -> Type) -> FieldInfo -> m ()

When a field is encountered this is called with all the field info - type name, constructor countpositionname, field countpositiontype/maybe name.

doVarT :: Type -> Name -> m ()

Called when a type variable is encountered.

doApply :: (HasTypeTraversal m, HasTypeParameters m, DsMonad m) => Type -> Type -> m ()

data FieldInfo

Constructors

FieldInfo

Fields

• _typeName :: Name
• _constrCount :: Int
• _constrIndex :: Int
• _constrName :: Name
• _fieldCount :: Int
• _fieldIndex :: Int
• _fieldName :: Maybe Name
• _fieldType :: Type

Instances

Show FieldInfo

Methods

showsPrec :: Int -> FieldInfo -> ShowS

show :: FieldInfo -> String

showList :: [FieldInfo] -> ShowS

expandType :: DsMonad m => Type -> m Type

pprint1 :: (Ppr a, Data a) => a -> [Char]

Pretty print a Ppr value on a single line with each block of white space (newlines, tabs, etc.) converted to a single space, and all the module qualifiers removed from the names. (If the data type has no Name values the friendlyNames function has no effect.)

pprint1' :: Ppr a => a -> [Char]

pprintW :: (Ppr a, Data a) => Int -> a -> [Char]

Pretty print with friendly names and wide lines

pprintW' :: Ppr a => Int -> a -> [Char]

class ToName a where

Copied from haskell-src-meta

Minimal complete definition

toName

Methods

toName :: a -> Name

Instances

ToName TyVarBndr

Methods

toName :: TyVarBndr -> Name

ToName Con

Methods

toName :: Con -> Name

ToName VarStrictType

Methods

toName :: VarStrictType -> Name

class HasMessageInfo a where

Minimal complete definition

verbosity', prefix'

Methods

verbosity' :: Lens' a Int

prefix' :: Lens' a String

message :: (Quasi m, MonadReader s m, HasMessageInfo s) => Int -> String -> m ()

Output a verbosity controlled error message with the current indentation.

indent :: String -> String -> String

Indent the lines of a message.