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)

Show (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

(/\) :: Solver s => Tree s a -> Tree s b -> Tree s b

(\/) :: Solver s => Tree s a -> Tree s a -> Tree s a

false :: Tree s a

true :: Tree s ()

disj :: Solver s => [Tree s a] -> Tree s a

conj :: Solver s => [Tree s ()] -> Tree s ()

disj2 :: Solver s => [Tree s a] -> Tree s a

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

exist :: (Solver s, Term s t) => Int -> ([t] -> Tree s a) -> Tree s a

forall :: (Solver s, Term s t) => [t] -> (t -> Tree s ()) -> Tree s ()

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

prim :: Solver s => s a -> Tree s a

add :: Solver s => Constraint s -> Tree s ()