Language.Haskell.TH.TypeGraph.TypeInfo

Type and builders

data TypeInfo

Information collected about the graph implied by the structure of one or more Type values.

Instances

Eq TypeInfo

Methods

(==) :: TypeInfo -> TypeInfo -> Bool

(/=) :: TypeInfo -> TypeInfo -> Bool

Ord TypeInfo

Methods

compare :: TypeInfo -> TypeInfo -> Ordering

(<) :: TypeInfo -> TypeInfo -> Bool

(<=) :: TypeInfo -> TypeInfo -> Bool

(>) :: TypeInfo -> TypeInfo -> Bool

(>=) :: TypeInfo -> TypeInfo -> Bool

max :: TypeInfo -> TypeInfo -> TypeInfo

min :: TypeInfo -> TypeInfo -> TypeInfo

Show TypeInfo

Methods

showsPrec :: Int -> TypeInfo -> ShowS

show :: TypeInfo -> String

showList :: [TypeInfo] -> ShowS

Lift TypeInfo

Methods

lift :: TypeInfo -> Q Exp

Ppr TypeInfo

Methods

ppr :: TypeInfo -> Doc

ppr_list :: [TypeInfo] -> Doc

Monad m => MonadStates ExpandMap (StateT TypeInfo m)

Methods

getPoly :: StateT TypeInfo m ExpandMap

putPoly :: ExpandMap -> StateT TypeInfo m ()

statePoly :: (ExpandMap -> (a, ExpandMap)) -> StateT TypeInfo m a

MonadReaders TypeInfo m => MonadReaders TypeInfo (ReaderT * TypeStack m)

Methods

askPoly :: ReaderT * TypeStack m TypeInfo

localPoly :: (TypeInfo -> TypeInfo) -> ReaderT * TypeStack m a -> ReaderT * TypeStack m a

readerPoly :: (TypeInfo -> a) -> ReaderT * TypeStack m a

MonadReaders TypeInfo m => MonadReaders TypeInfo (ReaderT * TypeGraph m)

Methods

askPoly :: ReaderT * TypeGraph m TypeInfo

localPoly :: (TypeInfo -> TypeInfo) -> ReaderT * TypeGraph m a -> ReaderT * TypeGraph m a

readerPoly :: (TypeInfo -> a) -> ReaderT * TypeGraph m a

startTypes :: Lens' TypeInfo [Type]

fields :: Lens' TypeInfo (Map (E Type) (Set Field))

infoMap :: Lens' TypeInfo (Map Name Info)

synonyms :: Lens' TypeInfo (Map (E Type) (Set Name))

typeSet :: Lens' TypeInfo (Set Type)

makeTypeInfo :: forall m. DsMonad m => (Type -> m (Set Type)) -> [Type] -> m TypeInfo

Build a TypeInfo value by scanning the supplied types

Update

typeVertex :: MonadReaders TypeInfo m => E Type -> m TGVSimple'

Build a vertex from the given Type and optional Field. vertex :: forall m. (DsMonad m, MonadReaders TypeInfo m) => Maybe Field -> E Type -> m TypeGraphVertex vertex fld etyp = maybe (typeVertex etyp) (fieldVertex etyp) fld

Build a non-field vertex

typeVertex' :: MonadReaders TypeInfo m => E Type -> m TGV'

fieldVertex :: MonadReaders TypeInfo m => Field -> E Type -> m TGV'

Build a vertex associated with a field

Query

fieldVertices :: MonadReaders TypeInfo m => TGVSimple' -> m (Set TGV')

Find the vertices that involve a particular type - if the field is specified it return s singleton, otherwise it returns a set containing a vertex one for the type on its own, and one for each field containing that type.

allVertices :: (Functor m, DsMonad m, MonadReaders TypeInfo m) => Maybe Field -> E Type -> m (Set TGV')