module Language.Explorer.Pure
( Explorer
, execute
, executeAll
, revert
, dynamicRevert
, ExplorerM.toTree
, incomingEdges
, mkExplorerStack
, mkExplorerTree
, mkExplorerGraph
, mkExplorerGSS
, config
, currRef
, Ref
, ExplorerM.initialRef
, deref
, leaves
, getTrace
, getTraces
, getPathsFromTo
, getPathFromTo
, executionGraph
) where
import qualified Language.Explorer.Monadic as ExplorerM
import Control.Monad.Identity
import qualified Data.IntMap as IntMap
import Data.List
import Data.Foldable
type Ref = ExplorerM.Ref
type Explorer a b o = ExplorerM.Explorer a Identity b o
currRef :: Explorer a b o -> Ref
currRef :: Explorer a b o -> Ref
currRef = Explorer a b o -> Ref
forall programs (m :: * -> *) configs output.
Explorer programs m configs output -> Ref
ExplorerM.currRef
config :: Explorer a b o -> b
config :: Explorer a b o -> b
config = Explorer a b o -> b
forall programs (m :: * -> *) configs output.
Explorer programs m configs output -> configs
ExplorerM.config
deref :: Explorer p c o -> Ref -> Maybe c
deref :: Explorer p c o -> Ref -> Maybe c
deref = Explorer p c o -> Ref -> Maybe c
forall p (m :: * -> *) c o. Explorer p m c o -> Ref -> Maybe c
ExplorerM.deref
wrap :: (Monad m, Monoid o) => (a -> b -> (Maybe b,o)) -> a -> b -> m (Maybe b, o)
wrap :: (a -> b -> (Maybe b, o)) -> a -> b -> m (Maybe b, o)
wrap a -> b -> (Maybe b, o)
def a
p b
e = (Maybe b, o) -> m (Maybe b, o)
forall (m :: * -> *) a. Monad m => a -> m a
return ((Maybe b, o) -> m (Maybe b, o)) -> (Maybe b, o) -> m (Maybe b, o)
forall a b. (a -> b) -> a -> b
$ a -> b -> (Maybe b, o)
def a
p b
e
mkExplorerStack, mkExplorerTree, mkExplorerGraph, mkExplorerGSS:: (Show a, Eq a, Eq b, Monoid o) => (a -> b -> (Maybe b,o)) -> b -> Explorer a b o
mkExplorerStack :: (a -> b -> (Maybe b, o)) -> b -> Explorer a b o
mkExplorerStack a -> b -> (Maybe b, o)
definterp b
conf = (a -> b -> Identity (Maybe b, o)) -> b -> Explorer a b o
forall a b (m :: * -> *) o.
(Show a, Eq a, Eq b, Monad m, Monoid o) =>
(a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
ExplorerM.mkExplorerStack ((a -> b -> (Maybe b, o)) -> a -> b -> Identity (Maybe b, o)
forall (m :: * -> *) o a b.
(Monad m, Monoid o) =>
(a -> b -> (Maybe b, o)) -> a -> b -> m (Maybe b, o)
wrap a -> b -> (Maybe b, o)
definterp) b
conf
mkExplorerTree :: (a -> b -> (Maybe b, o)) -> b -> Explorer a b o
mkExplorerTree a -> b -> (Maybe b, o)
definterp b
conf = (a -> b -> Identity (Maybe b, o)) -> b -> Explorer a b o
forall a b (m :: * -> *) o.
(Show a, Eq a, Eq b, Monad m, Monoid o) =>
(a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
ExplorerM.mkExplorerTree ((a -> b -> (Maybe b, o)) -> a -> b -> Identity (Maybe b, o)
forall (m :: * -> *) o a b.
(Monad m, Monoid o) =>
(a -> b -> (Maybe b, o)) -> a -> b -> m (Maybe b, o)
wrap a -> b -> (Maybe b, o)
definterp) b
conf
mkExplorerGraph :: (a -> b -> (Maybe b, o)) -> b -> Explorer a b o
mkExplorerGraph a -> b -> (Maybe b, o)
definterp b
conf = (a -> b -> Identity (Maybe b, o)) -> b -> Explorer a b o
forall a b (m :: * -> *) o.
(Show a, Eq a, Eq b, Monad m, Monoid o) =>
(a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
ExplorerM.mkExplorerGraph ((a -> b -> (Maybe b, o)) -> a -> b -> Identity (Maybe b, o)
forall (m :: * -> *) o a b.
(Monad m, Monoid o) =>
(a -> b -> (Maybe b, o)) -> a -> b -> m (Maybe b, o)
wrap a -> b -> (Maybe b, o)
definterp) b
conf
mkExplorerGSS :: (a -> b -> (Maybe b, o)) -> b -> Explorer a b o
mkExplorerGSS a -> b -> (Maybe b, o)
definterp b
conf = (a -> b -> Identity (Maybe b, o)) -> b -> Explorer a b o
forall a b (m :: * -> *) o.
(Show a, Eq a, Eq b, Monad m, Monoid o) =>
(a -> b -> m (Maybe b, o)) -> b -> Explorer a m b o
ExplorerM.mkExplorerGSS ((a -> b -> (Maybe b, o)) -> a -> b -> Identity (Maybe b, o)
forall (m :: * -> *) o a b.
(Monad m, Monoid o) =>
(a -> b -> (Maybe b, o)) -> a -> b -> m (Maybe b, o)
wrap a -> b -> (Maybe b, o)
definterp) b
conf
execute :: (Eq c, Eq p, Eq o, Monoid o) => p -> Explorer p c o -> (Explorer p c o, o)
execute :: p -> Explorer p c o -> (Explorer p c o, o)
execute p
p Explorer p c o
e = Identity (Explorer p c o, o) -> (Explorer p c o, o)
forall a. Identity a -> a
runIdentity (Identity (Explorer p c o, o) -> (Explorer p c o, o))
-> Identity (Explorer p c o, o) -> (Explorer p c o, o)
forall a b. (a -> b) -> a -> b
$ p -> Explorer p c o -> Identity (Explorer p c o, o)
forall c p o (m :: * -> *).
(Eq c, Eq p, Eq o, Monad m, Monoid o) =>
p -> Explorer p m c o -> m (Explorer p m c o, o)
ExplorerM.execute p
p Explorer p c o
e
executeAll :: (Eq c, Eq p, Eq o, Monoid o) => [p] -> Explorer p c o -> (Explorer p c o, o)
executeAll :: [p] -> Explorer p c o -> (Explorer p c o, o)
executeAll [p]
p Explorer p c o
e = Identity (Explorer p c o, o) -> (Explorer p c o, o)
forall a. Identity a -> a
runIdentity (Identity (Explorer p c o, o) -> (Explorer p c o, o))
-> Identity (Explorer p c o, o) -> (Explorer p c o, o)
forall a b. (a -> b) -> a -> b
$ [p] -> Explorer p c o -> Identity (Explorer p c o, o)
forall c p o (m :: * -> *).
(Eq c, Eq p, Eq o, Monad m, Monoid o) =>
[p] -> Explorer p m c o -> m (Explorer p m c o, o)
ExplorerM.executeAll [p]
p Explorer p c o
e
dynamicRevert :: Bool -> Ref -> Explorer p c o -> Maybe (Explorer p c o)
dynamicRevert :: Bool -> Ref -> Explorer p c o -> Maybe (Explorer p c o)
dynamicRevert = Bool -> Ref -> Explorer p c o -> Maybe (Explorer p c o)
forall p (m :: * -> *) c o.
Bool -> Ref -> Explorer p m c o -> Maybe (Explorer p m c o)
ExplorerM.dynamicRevert
revert :: ExplorerM.Ref -> Explorer p c o -> Maybe (Explorer p c o)
revert :: Ref -> Explorer p c o -> Maybe (Explorer p c o)
revert = Ref -> Explorer p c o -> Maybe (Explorer p c o)
forall p (m :: * -> *) c o.
Ref -> Explorer p m c o -> Maybe (Explorer p m c o)
ExplorerM.revert
incomingEdges :: Ref -> Explorer p c o -> [((Ref, c), (p, o), (Ref, c))]
incomingEdges :: Ref -> Explorer p c o -> [((Ref, c), (p, o), (Ref, c))]
incomingEdges = Ref -> Explorer p c o -> [((Ref, c), (p, o), (Ref, c))]
forall p (m :: * -> *) c o.
Ref -> Explorer p m c o -> [((Ref, c), (p, o), (Ref, c))]
ExplorerM.incomingEdges
getTrace :: Explorer p c o -> [((Ref, c), (p, o), (Ref, c))]
getTrace :: Explorer p c o -> [((Ref, c), (p, o), (Ref, c))]
getTrace = Explorer p c o -> [((Ref, c), (p, o), (Ref, c))]
forall p (m :: * -> *) c o.
Explorer p m c o -> [((Ref, c), (p, o), (Ref, c))]
ExplorerM.getTrace
getTraces :: Explorer p c o -> [[((Ref, c), (p, o), (Ref, c))]]
getTraces :: Explorer p c o -> [[((Ref, c), (p, o), (Ref, c))]]
getTraces = Explorer p c o -> [[((Ref, c), (p, o), (Ref, c))]]
forall p (m :: * -> *) c o.
Explorer p m c o -> [[((Ref, c), (p, o), (Ref, c))]]
ExplorerM.getTraces
getPathsFromTo :: Explorer p c o -> Ref -> Ref -> [[((Ref, c), (p, o), (Ref, c))]]
getPathsFromTo :: Explorer p c o -> Ref -> Ref -> [[((Ref, c), (p, o), (Ref, c))]]
getPathsFromTo = Explorer p c o -> Ref -> Ref -> [[((Ref, c), (p, o), (Ref, c))]]
forall p (m :: * -> *) c o.
Explorer p m c o -> Ref -> Ref -> [[((Ref, c), (p, o), (Ref, c))]]
ExplorerM.getPathsFromTo
getPathFromTo :: Explorer p c o -> Ref -> Ref -> [((Ref, c), (p, o), (Ref, c))]
getPathFromTo :: Explorer p c o -> Ref -> Ref -> [((Ref, c), (p, o), (Ref, c))]
getPathFromTo = Explorer p c o -> Ref -> Ref -> [((Ref, c), (p, o), (Ref, c))]
forall p (m :: * -> *) c o.
Explorer p m c o -> Ref -> Ref -> [((Ref, c), (p, o), (Ref, c))]
ExplorerM.getPathFromTo
executionGraph :: Explorer p c o -> (Ref, [Ref], [((Ref, c), (p, o), (Ref, c))])
executionGraph :: Explorer p c o -> (Ref, [Ref], [((Ref, c), (p, o), (Ref, c))])
executionGraph = Explorer p c o -> (Ref, [Ref], [((Ref, c), (p, o), (Ref, c))])
forall p (m :: * -> *) c o.
Explorer p m c o -> (Ref, [Ref], [((Ref, c), (p, o), (Ref, c))])
ExplorerM.executionGraph
leaves :: Explorer p c o -> [(Ref, c)]
leaves :: Explorer p c o -> [(Ref, c)]
leaves = Explorer p c o -> [(Ref, c)]
forall p (m :: * -> *) c o. Explorer p m c o -> [(Ref, c)]
ExplorerM.leaves
toExport :: Explorer p c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))])
toExport :: Explorer p c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))])
toExport = Explorer p c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))])
forall p (m :: * -> *) c o.
Explorer p m c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))])
ExplorerM.toExport
fromExport :: Explorer p c o -> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))]) -> Explorer p c o
fromExport :: Explorer p c o
-> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))]) -> Explorer p c o
fromExport = Explorer p c o
-> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))]) -> Explorer p c o
forall p (m :: * -> *) c o.
Explorer p m c o
-> (Ref, [(Ref, c)], [(Ref, Ref, (p, o))]) -> Explorer p m c o
ExplorerM.fromExport