Control.CP.SearchTree

Documentation

data Tree s a where

Constructors

Fail :: Tree s a

Return :: a -> Tree s a

Try :: Tree s a -> Tree s a -> Tree s a

Add :: Constraint s -> Tree s a -> Tree s a

NewVar :: Term s t => (t -> Tree s a) -> Tree s a

Label :: s (Tree s a) -> Tree s a

Instances

Solver s => Monad (Tree s)

Solver s => Functor (Tree s)

Solver solver => MonadTree (Tree solver)

Show (Tree s a)

ModelExprClass (Tree DummySolver ())

CompilableModel (Tree (FDInstance (GecodeWrappedSolver CodegenGecodeSolver)) ModelCol)

transformTree :: Solver s => Mixin (Tree s a -> Tree s a)

bindTree :: Solver s => Tree s a -> (a -> Tree s b) -> Tree s b

insertTree :: Solver s => Tree s a -> Tree s () -> Tree s a

(/\) :: MonadTree tree => tree a -> tree b -> tree b

true :: MonadTree tree => tree ()

disj :: MonadTree tree => [tree a] -> tree a

conj :: MonadTree tree => [tree ()] -> tree ()

disj2 :: MonadTree tree => [tree a] -> tree a

prim :: MonadTree tree => TreeSolver tree a -> tree a

addC :: MonadTree tree => Constraint (TreeSolver tree) -> tree ()

addT :: MonadTree tree => Constraint (TreeSolver tree) -> tree Bool

exist :: (MonadTree tree, Term (TreeSolver tree) t) => Int -> ([t] -> tree a) -> tree a

forall :: (MonadTree tree, Term (TreeSolver tree) t) => [t] -> (t -> tree ()) -> tree ()

indent :: Int -> String

show

showTree :: (Show (Constraint s), Show a, Solver s) => Int -> Tree s a -> s String

mapTree :: (Solver s1, Solver s2, MonadTree m, TreeSolver m ~ s2) => (forall t. s1 t -> s2 t) -> Tree s1 a -> m a

class (Monad m, Solver (TreeSolver m)) => MonadTree m where

Generalization of the search tree data type, allowing monad transformer decoration.

Associated Types

type TreeSolver m :: * -> *

Methods

addTo :: Constraint (TreeSolver m) -> m a -> m a

false :: m a

(\/) :: m a -> m a -> m a

exists :: Term (TreeSolver m) t => (t -> m a) -> m a

label :: TreeSolver m (m a) -> m a

Instances

Solver solver => MonadTree (Tree solver)

(MonadTree m, Solver (TreeSolver m)) => MonadTree (ContT r m)

MonadTree t => MonadTree (ReaderT env t)

MonadTree t => MonadTree (StateT s t)

(Monoid w, MonadTree t) => MonadTree (WriterT w t)

untree :: Solver s => v -> Tree s v -> s v