| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Language.Haskell.TH.TypeGraph.Prelude
- pprint' :: Ppr a => a -> [Char]
- unlifted :: (IsUnlifted t, Quasi m) => t -> m Bool
- constructorName :: Con -> Name
- declarationName :: Dec -> Maybe Name
- declarationType :: Dec -> Maybe Type
- class HasSet a m where
- unReify :: Data a => a -> a
- unReifyName :: Name -> Name
- adjacent' :: forall node key. (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex) -> key -> [key]
- reachable' :: forall node key. (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex) -> key -> [key]
- newtype L a = L a
Documentation
pprint' :: Ppr a => a -> [Char] Source
Pretty print a Ppr value on a single line with each block of
white space (newlines, tabs, etc.) converted to a single space.
constructorName :: Con -> Name Source
declarationName :: Dec -> Maybe Name Source
declarationType :: Dec -> Maybe Type Source
unReifyName :: Name -> Name Source
adjacent' :: forall node key. (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex) -> key -> [key] Source
Return a key's list of adjacent keys