Control.CP.FD.Interface

Documentation

class (Solver s, Term s (FDIntTerm s), Term s (FDBoolTerm s), Eq (FDBoolSpecType s), Ord (FDBoolSpecType s), Enum (FDBoolSpecType s), Bounded (FDBoolSpecType s), Show (FDBoolSpecType s), Eq (FDIntSpecType s), Ord (FDIntSpecType s), Enum (FDIntSpecType s), Bounded (FDIntSpecType s), Show (FDIntSpecType s), Eq (FDColSpecType s), Ord (FDColSpecType s), Enum (FDColSpecType s), Bounded (FDColSpecType s), Show (FDColSpecType s), Show (FDIntSpec s), Show (FDColSpec s), Show (FDBoolSpec s)) => FDSolver s

A solver needs to be an instance of this FDSolver class in order to create an FDInstance around it.

Minimal complete definition

fdIntSpec_const, fdBoolSpec_const, fdColSpec_const, fdColSpec_list, fdIntSpec_term, fdBoolSpec_term, fdColSpec_size, fdIntVarSpec, fdBoolVarSpec, fdColInspect, fdProcess, fdEqualBool, fdEqualInt, fdEqualCol, fdConstrainIntTerm, fdSplitIntDomain, fdSplitBoolDomain

data FDSolver s => FDInstance s a

definition of FDInstance, a Solver wrapper that adds power to post boolean expressions as constraints

Instances

Monad s => Monad (FDInstance s)

Methods

(>>=) :: FDInstance s a -> (a -> FDInstance s b) -> FDInstance s b

(>>) :: FDInstance s a -> FDInstance s b -> FDInstance s b

return :: a -> FDInstance s a

fail :: String -> FDInstance s a

Functor s => Functor (FDInstance s)

Methods

fmap :: (a -> b) -> FDInstance s a -> FDInstance s b

(<$) :: a -> FDInstance s b -> FDInstance s a

Monad s => Applicative (FDInstance s)

Methods

pure :: a -> FDInstance s a

(<*>) :: FDInstance s (a -> b) -> FDInstance s a -> FDInstance s b

liftA2 :: (a -> b -> c) -> FDInstance s a -> FDInstance s b -> FDInstance s c

(*>) :: FDInstance s a -> FDInstance s b -> FDInstance s b

(<*) :: FDInstance s a -> FDInstance s b -> FDInstance s a

FDSolver s => Solver (FDInstance s)

Associated Types

type Constraint (FDInstance s :: * -> *) :: *

type Label (FDInstance s :: * -> *) :: *

Methods

add :: Constraint (FDInstance s) -> FDInstance s Bool

run :: FDInstance s a -> a

mark :: FDInstance s (Label (FDInstance s))

markn :: Int -> FDInstance s (Label (FDInstance s))

goto :: Label (FDInstance s) -> FDInstance s ()

FDSolver s => Term (FDInstance s) ModelCol

Associated Types

type Help (FDInstance s :: * -> *) ModelCol :: *

Methods

newvar :: FDInstance s ModelCol

help :: FDInstance s () -> ModelCol -> Help (FDInstance s) ModelCol

FDSolver s => Term (FDInstance s) ModelBool

Associated Types

type Help (FDInstance s :: * -> *) ModelBool :: *

Methods

newvar :: FDInstance s ModelBool

help :: FDInstance s () -> ModelBool -> Help (FDInstance s) ModelBool

FDSolver s => Term (FDInstance s) ModelInt

Associated Types

type Help (FDInstance s :: * -> *) ModelInt :: *

Methods

newvar :: FDInstance s ModelInt

help :: FDInstance s () -> ModelInt -> Help (FDInstance s) ModelInt

(FDSolver s, EnumTerm s (FDBoolTerm s)) => EnumTerm (FDInstance s) ModelBool

Associated Types

type TermBaseType (FDInstance s :: * -> *) ModelBool :: *

Methods

getDomainSize :: ModelBool -> FDInstance s Int

getDomain :: ModelBool -> FDInstance s [TermBaseType (FDInstance s) ModelBool]

setValue :: ModelBool -> TermBaseType (FDInstance s) ModelBool -> FDInstance s [Constraint (FDInstance s)]

splitDomain :: ModelBool -> FDInstance s ([[Constraint (FDInstance s)]], Bool)

splitDomains :: [ModelBool] -> FDInstance s ([[Constraint (FDInstance s)]], [ModelBool])

getValue :: ModelBool -> FDInstance s (Maybe (TermBaseType (FDInstance s) ModelBool))

defaultOrder :: [ModelBool] -> FDInstance s [ModelBool]

enumerator :: (MonadTree m, ((* -> *) ~ TreeSolver m) (FDInstance s)) => Maybe ([ModelBool] -> m ())

(FDSolver s, EnumTerm s (FDIntTerm s)) => EnumTerm (FDInstance s) ModelInt

Associated Types

type TermBaseType (FDInstance s :: * -> *) ModelInt :: *

Methods

getDomainSize :: ModelInt -> FDInstance s Int

getDomain :: ModelInt -> FDInstance s [TermBaseType (FDInstance s) ModelInt]

setValue :: ModelInt -> TermBaseType (FDInstance s) ModelInt -> FDInstance s [Constraint (FDInstance s)]

splitDomain :: ModelInt -> FDInstance s ([[Constraint (FDInstance s)]], Bool)

splitDomains :: [ModelInt] -> FDInstance s ([[Constraint (FDInstance s)]], [ModelInt])

getValue :: ModelInt -> FDInstance s (Maybe (TermBaseType (FDInstance s) ModelInt))

defaultOrder :: [ModelInt] -> FDInstance s [ModelInt]

enumerator :: (MonadTree m, ((* -> *) ~ TreeSolver m) (FDInstance s)) => Maybe ([ModelInt] -> m ())

type Constraint (FDInstance s)

type Constraint (FDInstance s) = Either Model (Constraint s)

type Label (FDInstance s)

type Label (FDInstance s)

type Help (FDInstance s) ModelCol

type Help (FDInstance s) ModelCol = ()

type Help (FDInstance s) ModelBool

type Help (FDInstance s) ModelBool = ()

type Help (FDInstance s) ModelInt

type Help (FDInstance s) ModelInt = ()

type TermBaseType (FDInstance s) ModelBool

type TermBaseType (FDInstance s) ModelBool = TermBaseType s (FDBoolTerm s)

type TermBaseType (FDInstance s) ModelInt

type TermBaseType (FDInstance s) ModelInt = TermBaseType s (FDIntTerm s)

(@+) :: (Eq t, Eq c, Eq b, ToExpr t c b p, ToExpr t c b q) => p -> q -> Expr t c b infixl 6

integer operators/functions | --

(@-) :: (Eq t, Eq c, Eq b, ToExpr t c b p, ToExpr t c b q) => p -> q -> Expr t c b infixl 6

(@*) :: (Eq t, Eq c, Eq b, ToExpr t c b p, ToExpr t c b q) => p -> q -> Expr t c b infixl 7

(@/) :: (Eq t, Eq c, Eq b, ToExpr t c b p, ToExpr t c b q) => p -> q -> Expr t c b infixl 7

(@%) :: (Eq t, Eq c, Eq b, ToExpr t c b p, ToExpr t c b q) => p -> q -> Expr t c b infixl 7

(!) :: (Eq t, Eq c, Eq b) => ColExpr t c b -> Expr t c b -> Expr t c b infix 9

list operators/functions | --

(@!!) :: (Eq t, Eq c, Eq b) => ColExpr t c b -> Integer -> Expr t c b infix 9

(@..) :: (Eq t, Eq c, Eq b) => Expr t c b -> Expr t c b -> ColExpr t c b infix 9

(@++) :: (Eq t, Eq c, Eq b) => ColExpr t c b -> ColExpr t c b -> ColExpr t c b infixr 5

size :: (Eq t, Eq c, Eq b) => ColExpr t c b -> Expr t c b

xfold :: (Eq t, Eq c, Eq b) => (Expr t c b -> Expr t c b -> Expr t c b) -> Expr t c b -> ColExpr t c b -> Expr t c b

xsum :: (Num (Expr t c b), Eq t, Eq c, Eq b) => ColExpr t c b -> Expr t c b

xhead :: (Eq t, Eq c, Eq b, ToColExpr t c b p) => p -> Expr t c b

xtail :: (Eq t, Eq c, Eq b, ToColExpr t c b p) => p -> ColExpr t c b

list :: (Eq t, Eq c, Eq b) => [Expr t c b] -> ColExpr t c b

slice :: (Eq t, Eq c, Eq b) => ColExpr t c b -> ColExpr t c b -> ColExpr t c b

xmap :: (Eq t, Eq c, Eq b) => (Expr t c b -> Expr t c b) -> ColExpr t c b -> ColExpr t c b

cte :: Integral a => a -> ModelInt

(@||) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => Tree DummySolver () -> Tree DummySolver () -> m () infixr 2

(@&&) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => Tree DummySolver () -> Tree DummySolver () -> m () infixr 3

inv :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => Tree DummySolver () -> m ()

(@=) :: (ModelExprClass a, Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => a -> a -> m () infix 4

(@/=) :: (ModelExprClass a, Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => a -> a -> m () infix 4

(@<) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelInt -> ModelInt -> m () infix 4

(@>) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelInt -> ModelInt -> m () infix 4

(@<=) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelInt -> ModelInt -> m () infix 4

(@>=) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelInt -> ModelInt -> m () infix 4

(@:) :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s, ExprRange ModelIntArg ModelColArg ModelBoolArg r, Term s ModelInt, Term s ModelBool, Term s ModelCol) => ModelInt -> r -> m () infix 5

(@?) :: Tree DummySolver () -> (Expr (ModelIntTerm ModelFunctions) (ModelColTerm ModelFunctions) (ModelBoolTerm ModelFunctions), Expr (ModelIntTerm ModelFunctions) (ModelColTerm ModelFunctions) (ModelBoolTerm ModelFunctions)) -> Expr (ModelIntTerm ModelFunctions) (ModelColTerm ModelFunctions) (ModelBoolTerm ModelFunctions) infix 4

(@??) :: ((~#) * * (Constraint (TreeSolver m)) (Either Model q), MonadTree m) => Tree DummySolver () -> (Tree DummySolver (), Tree DummySolver ()) -> m () infix 4

channel :: Tree DummySolver () -> ModelInt

val :: Tree DummySolver () -> ModelInt

sorted :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> m ()

sSorted :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> m ()

forall :: (Term s ModelInt, Term s ModelBool, Term s ModelCol, Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> (ModelInt -> Tree DummySolver ()) -> m ()

forany :: (Term s ModelInt, Term s ModelBool, Term s ModelCol, Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> (ModelInt -> Tree DummySolver ()) -> m ()

loopall :: (Term s ModelInt, Term s ModelBool, Term s ModelCol, Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => (ModelInt, ModelInt) -> (ModelInt -> Tree DummySolver ()) -> m ()

allDiff :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> m ()

allDiffD :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> m ()

loopany :: (Term s ModelInt, Term s ModelBool, Term s ModelCol, Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => (ModelInt, ModelInt) -> (ModelInt -> Tree DummySolver ()) -> m ()

allin :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s, ExprRange ModelIntArg ModelColArg ModelBoolArg r, Term s ModelInt, Term s ModelBool, Term s ModelCol) => ModelCol -> r -> m ()

asExpr :: ToModelInt t => t -> ModelInt

asCol :: ToModelCol t => t -> ModelCol

asBool :: (FDSolver s, MonadTree m, TreeSolver m ~ FDInstance s, ToModelBool t) => t -> m ()

colList :: (Constraint s ~ Either Model q, MonadTree m, TreeSolver m ~ s) => ModelCol -> Int -> m [ModelInt]

labelCol :: (FDSolver s, MonadTree m, TreeSolver m ~ FDInstance s, EnumTerm s (FDIntTerm s)) => ModelCol -> m [TermBaseType s (FDIntTerm s)]

type ModelInt = ModelIntExpr ModelFunctions

type ModelCol = ModelColExpr ModelFunctions

type ModelBool = ModelBoolExpr ModelFunctions

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

true :: MonadTree tree => tree ()

false :: MonadTree m => m a