Control.CP.Transformers

Documentation

eval :: (Solver solver, Queue q, Elem q ~ (Label solver, Tree solver (ForResult t), TreeState t), Transformer t, ForSolver t ~ solver) => Tree solver (ForResult t) -> q -> t -> solver (Int, [ForResult t])

eval' :: SearchSig solver q t (ForResult t)

continue :: ContinueSig solver q t (ForResult t)

data NodeBoundedST (solver :: * -> *) a

Instances

Solver solver => Transformer (NodeBoundedST solver a)

Associated Types

type EvalState (NodeBoundedST solver a) :: *

type TreeState (NodeBoundedST solver a) :: *

type ForSolver (NodeBoundedST solver a) :: * -> *

type ForResult (NodeBoundedST solver a) :: *

Methods

leftT :: NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a)

rightT :: NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a)

nextT :: (Solver (ForSolver (NodeBoundedST solver a)), Queue q, Transformer (NodeBoundedST solver a), (* ~ Elem q) (Label (ForSolver (NodeBoundedST solver a)), Tree (ForSolver (NodeBoundedST solver a)) (ForResult (NodeBoundedST solver a)), TreeState (NodeBoundedST solver a)), ((* -> *) ~ ForSolver (NodeBoundedST solver a)) (ForSolver (NodeBoundedST solver a))) => Int -> Tree (ForSolver (NodeBoundedST solver a)) (ForResult (NodeBoundedST solver a)) -> q -> NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a) -> ForSolver (NodeBoundedST solver a) (Int, [ForResult (NodeBoundedST solver a)])

initT :: NodeBoundedST solver a -> Tree (ForSolver (NodeBoundedST solver a)) (ForResult (NodeBoundedST solver a)) -> ForSolver (NodeBoundedST solver a) (EvalState (NodeBoundedST solver a), TreeState (NodeBoundedST solver a))

returnT :: (Solver solver, Queue q, Transformer (NodeBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (NodeBoundedST solver a)), TreeState (NodeBoundedST solver a)), ((* -> *) ~ ForSolver (NodeBoundedST solver a)) solver) => Int -> q -> NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> solver (Int, [ForResult (NodeBoundedST solver a)])

endT :: (Solver solver, Queue q, Transformer (NodeBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (NodeBoundedST solver a)), TreeState (NodeBoundedST solver a)), ((* -> *) ~ ForSolver (NodeBoundedST solver a)) solver) => Int -> q -> NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> solver (Int, [ForResult (NodeBoundedST solver a)])

type EvalState (NodeBoundedST solver a)

type EvalState (NodeBoundedST solver a) = Int

type TreeState (NodeBoundedST solver a)

type TreeState (NodeBoundedST solver a) = ()

type ForSolver (NodeBoundedST solver a)

type ForSolver (NodeBoundedST solver a) = solver

type ForResult (NodeBoundedST solver a)

type ForResult (NodeBoundedST solver a) = a

data DepthBoundedST (solver :: * -> *) a

Instances

Solver solver => Transformer (DepthBoundedST solver a)

Associated Types

type EvalState (DepthBoundedST solver a) :: *

type TreeState (DepthBoundedST solver a) :: *

type ForSolver (DepthBoundedST solver a) :: * -> *

type ForResult (DepthBoundedST solver a) :: *

Methods

leftT :: DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a)

rightT :: DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a)

nextT :: (Solver (ForSolver (DepthBoundedST solver a)), Queue q, Transformer (DepthBoundedST solver a), (* ~ Elem q) (Label (ForSolver (DepthBoundedST solver a)), Tree (ForSolver (DepthBoundedST solver a)) (ForResult (DepthBoundedST solver a)), TreeState (DepthBoundedST solver a)), ((* -> *) ~ ForSolver (DepthBoundedST solver a)) (ForSolver (DepthBoundedST solver a))) => Int -> Tree (ForSolver (DepthBoundedST solver a)) (ForResult (DepthBoundedST solver a)) -> q -> DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a) -> ForSolver (DepthBoundedST solver a) (Int, [ForResult (DepthBoundedST solver a)])

initT :: DepthBoundedST solver a -> Tree (ForSolver (DepthBoundedST solver a)) (ForResult (DepthBoundedST solver a)) -> ForSolver (DepthBoundedST solver a) (EvalState (DepthBoundedST solver a), TreeState (DepthBoundedST solver a))

returnT :: (Solver solver, Queue q, Transformer (DepthBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (DepthBoundedST solver a)), TreeState (DepthBoundedST solver a)), ((* -> *) ~ ForSolver (DepthBoundedST solver a)) solver) => Int -> q -> DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> solver (Int, [ForResult (DepthBoundedST solver a)])

endT :: (Solver solver, Queue q, Transformer (DepthBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (DepthBoundedST solver a)), TreeState (DepthBoundedST solver a)), ((* -> *) ~ ForSolver (DepthBoundedST solver a)) solver) => Int -> q -> DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> solver (Int, [ForResult (DepthBoundedST solver a)])

type EvalState (DepthBoundedST solver a)

type EvalState (DepthBoundedST solver a) = ()

type TreeState (DepthBoundedST solver a)

type TreeState (DepthBoundedST solver a) = Int

type ForSolver (DepthBoundedST solver a)

type ForSolver (DepthBoundedST solver a) = solver

type ForResult (DepthBoundedST solver a)

type ForResult (DepthBoundedST solver a) = a

class Transformer t where

Minimal complete definition

initT

Associated Types

type EvalState t :: *

type TreeState t :: *

type ForSolver t :: * -> *

type ForResult t :: *

Methods

leftT, rightT :: t -> EvalState t -> TreeState t -> TreeState t

nextT :: SearchSig (ForSolver t) q t (ForResult t)

initT :: t -> Tree (ForSolver t) (ForResult t) -> ForSolver t (EvalState t, TreeState t)

returnT :: ContinueSig solver q t (ForResult t)

endT :: ContinueSig solver q t (ForResult t)

Instances

Solver solver => Transformer (NodeBoundedST solver a)

Associated Types

type EvalState (NodeBoundedST solver a) :: *

type TreeState (NodeBoundedST solver a) :: *

type ForSolver (NodeBoundedST solver a) :: * -> *

type ForResult (NodeBoundedST solver a) :: *

Methods

leftT :: NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a)

rightT :: NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a)

nextT :: (Solver (ForSolver (NodeBoundedST solver a)), Queue q, Transformer (NodeBoundedST solver a), (* ~ Elem q) (Label (ForSolver (NodeBoundedST solver a)), Tree (ForSolver (NodeBoundedST solver a)) (ForResult (NodeBoundedST solver a)), TreeState (NodeBoundedST solver a)), ((* -> *) ~ ForSolver (NodeBoundedST solver a)) (ForSolver (NodeBoundedST solver a))) => Int -> Tree (ForSolver (NodeBoundedST solver a)) (ForResult (NodeBoundedST solver a)) -> q -> NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> TreeState (NodeBoundedST solver a) -> ForSolver (NodeBoundedST solver a) (Int, [ForResult (NodeBoundedST solver a)])

initT :: NodeBoundedST solver a -> Tree (ForSolver (NodeBoundedST solver a)) (ForResult (NodeBoundedST solver a)) -> ForSolver (NodeBoundedST solver a) (EvalState (NodeBoundedST solver a), TreeState (NodeBoundedST solver a))

returnT :: (Solver solver, Queue q, Transformer (NodeBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (NodeBoundedST solver a)), TreeState (NodeBoundedST solver a)), ((* -> *) ~ ForSolver (NodeBoundedST solver a)) solver) => Int -> q -> NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> solver (Int, [ForResult (NodeBoundedST solver a)])

endT :: (Solver solver, Queue q, Transformer (NodeBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (NodeBoundedST solver a)), TreeState (NodeBoundedST solver a)), ((* -> *) ~ ForSolver (NodeBoundedST solver a)) solver) => Int -> q -> NodeBoundedST solver a -> EvalState (NodeBoundedST solver a) -> solver (Int, [ForResult (NodeBoundedST solver a)])

Solver solver => Transformer (DepthBoundedST solver a)

Associated Types

type EvalState (DepthBoundedST solver a) :: *

type TreeState (DepthBoundedST solver a) :: *

type ForSolver (DepthBoundedST solver a) :: * -> *

type ForResult (DepthBoundedST solver a) :: *

Methods

leftT :: DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a)

rightT :: DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a)

nextT :: (Solver (ForSolver (DepthBoundedST solver a)), Queue q, Transformer (DepthBoundedST solver a), (* ~ Elem q) (Label (ForSolver (DepthBoundedST solver a)), Tree (ForSolver (DepthBoundedST solver a)) (ForResult (DepthBoundedST solver a)), TreeState (DepthBoundedST solver a)), ((* -> *) ~ ForSolver (DepthBoundedST solver a)) (ForSolver (DepthBoundedST solver a))) => Int -> Tree (ForSolver (DepthBoundedST solver a)) (ForResult (DepthBoundedST solver a)) -> q -> DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> TreeState (DepthBoundedST solver a) -> ForSolver (DepthBoundedST solver a) (Int, [ForResult (DepthBoundedST solver a)])

initT :: DepthBoundedST solver a -> Tree (ForSolver (DepthBoundedST solver a)) (ForResult (DepthBoundedST solver a)) -> ForSolver (DepthBoundedST solver a) (EvalState (DepthBoundedST solver a), TreeState (DepthBoundedST solver a))

returnT :: (Solver solver, Queue q, Transformer (DepthBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (DepthBoundedST solver a)), TreeState (DepthBoundedST solver a)), ((* -> *) ~ ForSolver (DepthBoundedST solver a)) solver) => Int -> q -> DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> solver (Int, [ForResult (DepthBoundedST solver a)])

endT :: (Solver solver, Queue q, Transformer (DepthBoundedST solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (DepthBoundedST solver a)), TreeState (DepthBoundedST solver a)), ((* -> *) ~ ForSolver (DepthBoundedST solver a)) solver) => Int -> q -> DepthBoundedST solver a -> EvalState (DepthBoundedST solver a) -> solver (Int, [ForResult (DepthBoundedST solver a)])

Solver solver => Transformer (RestartST es ts solver a)

Associated Types

type EvalState (RestartST es ts solver a) :: *

type TreeState (RestartST es ts solver a) :: *

type ForSolver (RestartST es ts solver a) :: * -> *

type ForResult (RestartST es ts solver a) :: *

Methods

leftT :: RestartST es ts solver a -> EvalState (RestartST es ts solver a) -> TreeState (RestartST es ts solver a) -> TreeState (RestartST es ts solver a)

rightT :: RestartST es ts solver a -> EvalState (RestartST es ts solver a) -> TreeState (RestartST es ts solver a) -> TreeState (RestartST es ts solver a)

nextT :: (Solver (ForSolver (RestartST es ts solver a)), Queue q, Transformer (RestartST es ts solver a), (* ~ Elem q) (Label (ForSolver (RestartST es ts solver a)), Tree (ForSolver (RestartST es ts solver a)) (ForResult (RestartST es ts solver a)), TreeState (RestartST es ts solver a)), ((* -> *) ~ ForSolver (RestartST es ts solver a)) (ForSolver (RestartST es ts solver a))) => Int -> Tree (ForSolver (RestartST es ts solver a)) (ForResult (RestartST es ts solver a)) -> q -> RestartST es ts solver a -> EvalState (RestartST es ts solver a) -> TreeState (RestartST es ts solver a) -> ForSolver (RestartST es ts solver a) (Int, [ForResult (RestartST es ts solver a)])

initT :: RestartST es ts solver a -> Tree (ForSolver (RestartST es ts solver a)) (ForResult (RestartST es ts solver a)) -> ForSolver (RestartST es ts solver a) (EvalState (RestartST es ts solver a), TreeState (RestartST es ts solver a))

returnT :: (Solver solver, Queue q, Transformer (RestartST es ts solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (RestartST es ts solver a)), TreeState (RestartST es ts solver a)), ((* -> *) ~ ForSolver (RestartST es ts solver a)) solver) => Int -> q -> RestartST es ts solver a -> EvalState (RestartST es ts solver a) -> solver (Int, [ForResult (RestartST es ts solver a)])

endT :: (Solver solver, Queue q, Transformer (RestartST es ts solver a), (* ~ Elem q) (Label solver, Tree solver (ForResult (RestartST es ts solver a)), TreeState (RestartST es ts solver a)), ((* -> *) ~ ForSolver (RestartST es ts solver a)) solver) => Int -> q -> RestartST es ts solver a -> EvalState (RestartST es ts solver a) -> solver (Int, [ForResult (RestartST es ts solver a)])