Safe Haskell	Safe-Inferred
Language	Haskell2010

Tokstyle.Analysis.Dataflow

Synopsis

data Dataflow node edge state = Dataflow {
- transfer :: node -> state -> state
- edgeTransfer :: node -> edge -> state -> state
- merge :: state -> state -> state
- initial :: state
}
solve :: (Ord node, Eq state) => node -> Map node [(edge, node)] -> Dataflow node edge state -> Map node state
solveBackward :: (Ord node, Eq state) => [node] -> Map node [(edge, node)] -> Dataflow node edge state -> Map node state

Documentation

data Dataflow node edge state Source #

A generic dataflow problem definition.

Constructors

Dataflow
Fields transfer :: node -> state -> state How a node changes the state edgeTransfer :: node -> edge -> state -> state How an edge changes the state merge :: state -> state -> state How to combine states from two paths initial :: state Starting state for Entry node (forward) or Exit node (backward)

Arguments

Solves the forward dataflow problem using a worklist algorithm.

Arguments

Solves the backward dataflow problem using a worklist algorithm.