Data.ECTA.Internal.ECTA.Operations

Traversal

pathsMatching :: (Node -> Bool) -> Node -> [Path]

Warning: Linear in number of paths, exponential in size of graph. Only use for very small graphs.

mapNodes :: (Node -> Node) -> Node -> Node

Precondition: For all i, f (Rec i) is either a Rec node meant to represent the enclosing Mu, or contains no Rec node not beneath another Mu.

crush :: forall m. Monoid m => (Node -> m) -> Node -> m

onNormalNodes :: Monoid m => (Node -> m) -> Node -> m

Unfolding

unfoldOuterRec :: Node -> Node

refold :: Node -> Node

nodeEdges :: Node -> [Edge]

unfoldBounded :: Int -> Node -> Node

Size operations

nodeCount :: Node -> Int

edgeCount :: Node -> Int

maxIndegree :: Node -> Int

Union

union :: [Node] -> Node

Membership

nodeRepresents :: Node -> Term -> Bool

edgeRepresents :: Edge -> Term -> Bool

Intersection

intersect :: Node -> Node -> Node

dropRedundantEdges :: [Edge] -> [Edge]

intersectEdge :: Edge -> Edge -> Maybe Edge

Path operations

requirePath :: Path -> Node -> Node

requirePathList :: Path -> [Node] -> [Node]

Reduction

withoutRedundantEdges :: Node -> Node

reducePartially :: Node -> Node

reduceEdgeIntersection :: EqConstraints -> Edge -> Edge

reduceEqConstraints :: EqConstraints -> EqConstraints -> [Node] -> [Node]

Debugging

getSubnodeById :: Node -> Id -> Maybe Node

Orphan instances

Pathable Node Node

Associated Types

type Emptyable Node

Methods

getPath :: Path -> Node -> Emptyable Node

getAllAtPath :: Path -> Node -> [Node]

modifyAtPath :: (Node -> Node) -> Path -> Node -> Node

Pathable [Node] Node

Associated Types

type Emptyable Node

Methods

getPath :: Path -> [Node] -> Emptyable Node

getAllAtPath :: Path -> [Node] -> [Node]

modifyAtPath :: (Node -> Node) -> Path -> [Node] -> [Node]