| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Language.Haskell.TH.TypeGraph.TypeGraph
Description
Abstract operations on Maps containing graph edges.
- data TypeGraph
- graph :: Lens' TypeGraph (Graph, Vertex -> ((), TGV', [TGV']), TGV' -> Maybe Vertex)
- gsimple :: Lens' TypeGraph (Graph, Vertex -> ((), TGVSimple', [TGVSimple']), TGVSimple' -> Maybe Vertex)
- stack :: Lens' TypeGraph [StackElement]
- makeTypeGraph :: MonadReaders TypeInfo m => GraphEdges TGV' -> m TypeGraph
- graphFromMap :: forall key. Ord key => GraphEdges key -> (Graph, Vertex -> ((), key, [key]), key -> Maybe Vertex)
- class HasTGV a where
- class HasTGVSimple a where
- simplify :: (MonadReaders TypeGraph m, HasTGV t) => t -> m TGVSimple
- allPathNodes :: forall m. (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Set TGV)
- allPathStarts :: forall m. (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Set TGVSimple)
- lensKeys :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => TGVSimple -> m (Set TGV)
- allLensKeys :: forall m. (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Map TGVSimple (Set TGV))
- tgv :: MonadReaders TypeGraph m => Maybe Field -> TGVSimple -> m TGV
- tgvSimple :: (MonadStates ExpandMap m, DsMonad m, MonadReaders TypeInfo m, MonadReaders TypeGraph m) => Type -> m (Maybe TGVSimple)
- tgvSimple' :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => Type -> m TGVSimple
- pathKeys :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => TGVSimple -> m (Set TGVSimple)
- pathKeys' :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => TGV -> m (Set TGVSimple)
- allPathKeys :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Map TGVSimple (Set TGVSimple))
- reachableFrom :: forall m. (DsMonad m, MonadReaders TypeGraph m) => TGV -> m (Set TGV)
- reachableFromSimple :: forall m. (DsMonad m, MonadReaders TypeGraph m) => TGVSimple -> m (Set TGVSimple)
- goalReachableFull :: (Functor m, DsMonad m, MonadReaders TypeGraph m, HasTGV t) => t -> t -> m Bool
- goalReachableSimple :: (Functor m, DsMonad m, MonadReaders TypeGraph m, HasTGVSimple s) => s -> s -> m Bool
- goalReachableSimple' :: (Functor m, DsMonad m, MonadReaders TypeGraph m, HasTGV t) => t -> t -> m Bool
- data VertexStatus typ
- typeGraphVertex :: (MonadReaders TypeInfo m, MonadStates ExpandMap m, DsMonad m) => Type -> m TGV'
- typeGraphVertexOfField :: (MonadReaders TypeInfo m, MonadStates ExpandMap m, DsMonad m) => Field -> Type -> m TGV'
Documentation
Instances
| Ppr TypeGraph Source # | |
| MonadReaders TypeInfo m => MonadReaders TypeInfo (ReaderT * TypeGraph m) Source # | |
| (Monad m, MonadReaders [StackElement] m) => MonadReaders [StackElement] (ReaderT * TypeGraph m) Source # | |
gsimple :: Lens' TypeGraph (Graph, Vertex -> ((), TGVSimple', [TGVSimple']), TGVSimple' -> Maybe Vertex) Source #
makeTypeGraph :: MonadReaders TypeInfo m => GraphEdges TGV' -> m TypeGraph Source #
Build a TypeGraph given a set of edges and the TypeInfo environment
graphFromMap :: forall key. Ord key => GraphEdges key -> (Graph, Vertex -> ((), key, [key]), key -> Maybe Vertex) Source #
Build a graph from the result of typeGraphEdges, each edge goes from a type to one of the types it contains. Thus, each edge represents a primitive lens, and each path in the graph is a composition of lenses.
Minimal complete definition
class HasTGVSimple a where Source #
Minimal complete definition
Methods
asTGVSimple :: a -> TGVSimple' Source #
Instances
TypeGraph queries
allPathNodes :: forall m. (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Set TGV) Source #
All the nodes in the TGV (unsimplified) graph, where each field of a record is a distinct node.
allPathStarts :: forall m. (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Set TGVSimple) Source #
All the nodes in the TGVSimple graph, where each field representa a different type.
lensKeys :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => TGVSimple -> m (Set TGV) Source #
Return the nodes adjacent to x in the lens graph.
allLensKeys :: forall m. (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Map TGVSimple (Set TGV)) Source #
Each lens represents a single step in a path. The start point is a simplified vertex and the endpoint is an unsimplified vertex.
tgv :: MonadReaders TypeGraph m => Maybe Field -> TGVSimple -> m TGV Source #
Find the node corresponding to the given simple graph node in the full graph.
tgvSimple :: (MonadStates ExpandMap m, DsMonad m, MonadReaders TypeInfo m, MonadReaders TypeGraph m) => Type -> m (Maybe TGVSimple) Source #
Find the simple graph node corresponding to the given type
tgvSimple' :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => Type -> m TGVSimple Source #
pathKeys :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => TGVSimple -> m (Set TGVSimple) Source #
Return the nodes reachable from x in the path graph.
pathKeys' :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => TGV -> m (Set TGVSimple) Source #
Return the nodes reachable from x in the path graph.
allPathKeys :: (DsMonad m, MonadStates ExpandMap m, MonadReaders TypeGraph m, MonadReaders TypeInfo m) => m (Map TGVSimple (Set TGVSimple)) Source #
Paths go between simple types.
reachableFrom :: forall m. (DsMonad m, MonadReaders TypeGraph m) => TGV -> m (Set TGV) Source #
reachableFromSimple :: forall m. (DsMonad m, MonadReaders TypeGraph m) => TGVSimple -> m (Set TGVSimple) Source #
goalReachableFull :: (Functor m, DsMonad m, MonadReaders TypeGraph m, HasTGV t) => t -> t -> m Bool Source #
Can we reach the goal type from the start type in this key?
goalReachableSimple :: (Functor m, DsMonad m, MonadReaders TypeGraph m, HasTGVSimple s) => s -> s -> m Bool Source #
Can we reach the goal type in the simplified graph?
goalReachableSimple' :: (Functor m, DsMonad m, MonadReaders TypeGraph m, HasTGV t) => t -> t -> m Bool Source #
Version of goalReachableSimple that first simplifies its argument nodes
data VertexStatus typ Source #
When a VertexStatus value is associated with a Type it describes alterations in the type graph from the usual default.
Constructors
| Vertex | normal case |
| Sink | out degree zero - don't create any outgoing edges |
| Divert typ | replace all outgoing edges with an edge to an alternate type |
| Extra typ | add an extra outgoing edge to the given type |
Instances
| Show typ => Show (VertexStatus typ) Source # | |
| Default (VertexStatus typ) Source # | |
typeGraphVertex :: (MonadReaders TypeInfo m, MonadStates ExpandMap m, DsMonad m) => Type -> m TGV' Source #
Return the TGV associated with a particular type, with no field specified.
typeGraphVertexOfField :: (MonadReaders TypeInfo m, MonadStates ExpandMap m, DsMonad m) => Field -> Type -> m TGV' Source #
Return the TGV associated with a particular type and field.