Copyright	(c) Sebastian Graf 2018
License	ISC
Maintainer	sgraf1337@gmail.com
Portability	portable
Safe Haskell	None
Language	Haskell2010

Datafix.ProblemBuilder

Description

Offers an instance for MonadDatafix based on NodeAllocator.

Synopsis

Documentation

data ProblemBuilder m a Source #

Constructs a build plan for a DataFlowProblem by tracking allocation of Nodes mapping to ChangeDetectors and transfer functions.

Instances

MonadDependency m => MonadDatafix m (ProblemBuilder m) Source #
Methods datafix :: ChangeDetector (Domain m) -> (LiftedFunc (Domain m) m -> ProblemBuilder m (a, LiftedFunc (Domain m) m)) -> ProblemBuilder m a Source #
Monad (ProblemBuilder m) Source #
Methods (>>=) :: ProblemBuilder m a -> (a -> ProblemBuilder m b) -> ProblemBuilder m b # (>>) :: ProblemBuilder m a -> ProblemBuilder m b -> ProblemBuilder m b # return :: a -> ProblemBuilder m a # fail :: String -> ProblemBuilder m a #
Functor (ProblemBuilder m) Source #
Methods fmap :: (a -> b) -> ProblemBuilder m a -> ProblemBuilder m b # (<$) :: a -> ProblemBuilder m b -> ProblemBuilder m a #
Applicative (ProblemBuilder m) Source #
Methods pure :: a -> ProblemBuilder m a # (<>) :: ProblemBuilder m (a -> b) -> ProblemBuilder m a -> ProblemBuilder m b # liftA2 :: (a -> b -> c) -> ProblemBuilder m a -> ProblemBuilder m b -> ProblemBuilder m c # (>) :: ProblemBuilder m a -> ProblemBuilder m b -> ProblemBuilder m b # (<*) :: ProblemBuilder m a -> ProblemBuilder m b -> ProblemBuilder m a #

buildProblem :: forall m. MonadDependency m => Currying (ParamTypes (Domain m)) (ReturnType (Domain m) -> ReturnType (Domain m) -> Bool) => ProblemBuilder m (LiftedFunc (Domain m) m) -> (Node, Node, DataFlowProblem m) Source #

(root, max, dfp) = buildProblem builder executes the build plan specified by builder and returns the resulting DataFlowProblem dfp, as well as the root Node denoting the transfer function returned by the ProblemBuilder action and the maximum node of the problem as a proof for its denseness.