Downhill.Internal.Graph.OpenGraph

Documentation

data OpenEdge a v where

Constructors

OpenEdge :: BackFun u v -> OpenEndpoint a u -> OpenEdge a v

data OpenEndpoint a v where

Constructors

OpenSourceNode :: OpenEndpoint a a

OpenInnerNode :: OpenKey v -> OpenEndpoint a v

data OpenNode a v

Constructors

BasicVector v => OpenNode [OpenEdge a v]

data OpenGraph a z

Computational graph under construction. Open refers to the set of the nodes – new nodes can be added to this graph. Once the graph is complete the set of nodes will be frozen and the type of the graph will become Graph (Downhill.Internal.Graph module).

Constructors

OpenGraph (OpenNode a z) (OpenMap (OpenNode a))

recoverSharing :: forall a z. BasicVector z => [Term a z] -> IO (OpenGraph a z)

Collects duplicate nodes in Expr tree and converts it to a graph.