Control.CP.FD.FD

Documentation

class (Show (FDTerm s), Eq (FDTerm s), Term s (FDTerm s)) => FDSolver s where

Associated Types

type FDTerm s :: *

Methods

specific_compile_constraint :: Mixin (FDConstraint s -> Tree s Bool)

specific_decompose :: Mixin (Expr (FDTerm s) -> Tree s (FDTerm s))

specific_fresh_var :: Mixin (Tree s (FDTerm s))

Instances

FDSolver CodegenSolver

FDSolver OvertonFD

fresh_var :: FDSolver s => Tree s (FDTerm s)

decompose :: FDSolver s => Expr (FDTerm s) -> Tree s (FDTerm s)

compile_constraint :: FDSolver s => FDConstraint s -> Tree s Bool

type FDExpr s = Expr (FDTerm s)

data Show (FDTerm s) => FDConstraint s

Constructors

Less (Expr (FDTerm s)) (Expr (FDTerm s))

Diff (Expr (FDTerm s)) (Expr (FDTerm s))

Same (Expr (FDTerm s)) (Expr (FDTerm s))

Dom (Expr (FDTerm s)) Integer Integer

AllDiff [Expr (FDTerm s)]

Sorted [Expr (FDTerm s)] Bool

Instances

Show (FDTerm s) => Show (FDConstraint s)

newtype FDWrapper s a

Constructors

FDWrapper

Fields

subFD :: s a

Instances

FDSolver s => Monad (FDWrapper s)

FDSolver s => Solver (FDWrapper s)

(t ~ Expr (FDTerm s), FDSolver s) => Term (FDWrapper s) t

(FDTerm s ~ t, FDSolver s, Eq t, EnumTerm s t, Integral (TermDomain s t)) => EnumTerm (FDWrapper s) (Expr t)

type FDTree s a = Tree (FDWrapper s) a

newtype FDLabel s

Constructors

FDLabel (Label s)

wrap :: forall s a. FDSolver s => Tree s a -> Tree (FDWrapper s) a

unwrap :: forall s a. FDSolver s => Tree (FDWrapper s) a -> Tree s a

(@:) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Integral t, Integral t1, Show (FDTerm s)) => Expr (FDTerm s) -> (t, t1) -> tree ()

(@<) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => Expr (FDTerm s) -> Expr (FDTerm s) -> tree ()

(@>) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => Expr (FDTerm s) -> Expr (FDTerm s) -> tree ()

(@<=) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Eq (FDTerm s), Show (FDTerm s)) => Expr (FDTerm s) -> Expr (FDTerm s) -> tree ()

(@>=) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Eq (FDTerm s), Show (FDTerm s)) => Expr (FDTerm s) -> Expr (FDTerm s) -> tree ()

(@=) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => Expr (FDTerm s) -> Expr (FDTerm s) -> tree ()

(@/=) :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => Expr (FDTerm s) -> Expr (FDTerm s) -> tree ()

(@+) :: (ToExpr tt t, ToExpr tt t1, Eq tt, Show tt) => t -> t1 -> Expr tt

(@-) :: (ToExpr tt t, ToExpr tt t1, Eq tt, Show tt) => t -> t1 -> Expr tt

(@*) :: (ToExpr tt t, ToExpr tt t1, Eq tt, Show tt) => t -> t1 -> Expr tt

(@/) :: (ToExpr tt t, ToExpr tt t1, Eq tt, Show tt) => t -> t1 -> Expr tt

(@%) :: (ToExpr tt t, ToExpr tt t1, Eq tt, Show tt) => t -> t1 -> Expr tt

cte :: (Num a, Integral a1) => a1 -> a

allDiff :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => [Expr (FDTerm s)] -> tree ()

sorted :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => [Expr (FDTerm s)] -> tree ()

sSorted :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Show (FDTerm s)) => [Expr (FDTerm s)] -> tree ()

allin :: (FDConstraint s ~ Constraint (TreeSolver tree), MonadTree tree, Integral t, Integral t1, Show (FDTerm s)) => [Expr (FDTerm s)] -> (t, t1) -> tree ()