| Safe Haskell | None |
|---|
Data.TReify
- class MuRef ty h where
- type DeRef h :: (* -> *) -> * -> *
- mapDeRef :: forall m v. Applicative m => (forall a. IsTyConstraint ty a => ty a -> h a -> m (v a)) -> forall a. IsTyConstraint ty a => ty a -> h a -> m (DeRef h v a)
- module Data.Reify.TGraph
- reifyGraph :: (IsTy ty, IsTyConstraint ty a, MuRef ty h) => ty a -> h a -> IO (Graph ty (DeRef h) a)
Documentation
Methods
mapDeRef :: forall m v. Applicative m => (forall a. IsTyConstraint ty a => ty a -> h a -> m (v a)) -> forall a. IsTyConstraint ty a => ty a -> h a -> m (DeRef h v a)Source
module Data.Reify.TGraph
reifyGraph :: (IsTy ty, IsTyConstraint ty a, MuRef ty h) => ty a -> h a -> IO (Graph ty (DeRef h) a)Source
reifyGraph takes a data structure that admits MuRef, and returns
a Graph that contains the dereferenced nodes, with their children as
Integer rather than recursive values.