Language.Haskell.TH.TypeGraph.Prelude

Documentation

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.)

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

Pretty print with friendly names and wide lines

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

Pretty print with friendly names in left mode

class OverTypes t where

Perform a fold over the Type and Info values embedded in t

Minimal complete definition

overTypes

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> t -> m a

Instances

OverTypes Type

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> Type -> m a

OverTypes Dec

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> Dec -> m a

OverTypes Con

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> Con -> m a

OverTypes Info

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> Info -> m a

OverTypes StrictType

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> StrictType -> m a

OverTypes VarStrictType

Methods

overTypes :: Quasi m => (a -> Either Info Type -> m a) -> a -> VarStrictType -> m a

unlifted :: (OverTypes t, Quasi m) => t -> m Bool

Does the type or the declaration to which it refers contain a primitive (aka unlifted) type? This will traverse down any Dec to the named types, and then check whether any of their Info records are PrimTyConI values.

constructorName :: Con -> Name

declarationName :: Dec -> Maybe Name

declarationType :: Dec -> Maybe Type

unReify :: Data a => a -> a

unReifyName :: Name -> Name

adjacent' :: forall node key. (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex) -> (Vertex, key) -> [(Vertex, key)]

Return a key's list of adjacent keys

reachable' :: forall node key. (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex) -> (Vertex, key) -> [(Vertex, key)]

Return a key's list of reachable keys

friendlyNames :: Data a => a -> a

Make a template haskell value more human reader friendly. The result almost certainly won't be compilable. That's ok, though, because the input is usually uncompilable - it imports hidden modules, uses infix operators in invalid positions, puts module qualifiers in places where they are not allowed, and maybe other things.

Orphan instances

Ppr ()

Methods

ppr :: () -> Doc

ppr_list :: [()] -> Doc