Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data Explorer programs m configs output
- execute :: (Eq c, Eq p, Eq o, Monad m, Monoid o) => p -> Explorer p m c o -> m (Explorer p m c o, o)
- executeAll :: (Eq c, Eq p, Eq o, Monad m, Monoid o) => [p] -> Explorer p m c o -> m (Explorer p m c o, o)
- revert :: Ref -> Explorer p m c o -> Maybe (Explorer p m c o)
- dynamicRevert :: Bool -> Ref -> Explorer p m c o -> Maybe (Explorer p m c o)
- toTree :: Explorer p m c o -> Tree (Ref, c)
- incomingEdges :: Ref -> Explorer p m c o -> [((Ref, c), (p, o), (Ref, c))]
- mkExplorerStack :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
- mkExplorerTree :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
- mkExplorerGraph :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
- mkExplorerGSS :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
- config :: Explorer programs m configs output -> configs
- execEnv :: Explorer programs m configs output -> Gr Ref (programs, output)
- currRef :: Explorer programs m configs output -> Ref
- initialRef :: Int
- leaves :: Explorer p m c o -> [(Ref, c)]
- type Ref = Int
- deref :: Explorer p m c o -> Ref -> Maybe c
- getTrace :: Explorer p m c o -> [((Ref, c), (p, o), (Ref, c))]
- getTraces :: Explorer p m c o -> [[((Ref, c), (p, o), (Ref, c))]]
- getPathsFromTo :: Explorer p m c o -> Ref -> Ref -> [[((Ref, c), (p, o), (Ref, c))]]
- getPathFromTo :: Explorer p m c o -> Ref -> Ref -> [((Ref, c), (p, o), (Ref, c))]
- executionGraph :: Explorer p m c o -> (Ref, [Ref], [((Ref, c), (p, o), (Ref, c))])
- toExport :: Explorer p m c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))])
- fromExport :: Explorer p m c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))]) -> Explorer p m c o
Documentation
execute :: (Eq c, Eq p, Eq o, Monad m, Monoid o) => p -> Explorer p m c o -> m (Explorer p m c o, o) Source #
executeAll :: (Eq c, Eq p, Eq o, Monad m, Monoid o) => [p] -> Explorer p m c o -> m (Explorer p m c o, o) Source #
mkExplorerStack :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o Source #
mkExplorerTree :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o Source #
mkExplorerGraph :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o Source #
mkExplorerGSS :: (Show a, Eq a, Eq b, Monad m, Monoid o) => (a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o Source #
initialRef :: Int Source #