Safe Haskell | None |
---|---|
Language | Haskell98 |
Documentation
data OptimDirection Source #
LabelInt v VarExpr (ConstraintExpr -> ConstraintExpr -> ConstraintBoolExpr) | |
LabelCol a VarExpr OptimDirection VarExpr (ConstraintExpr -> ConstraintExpr -> ConstraintBoolExpr) | |
LabelBool b VarExpr |
data SearchSpec v a b Source #
Labelling (Labelling v a b) | |
CombineSeq (SearchSpec v a b) (SearchSpec v a b) | |
CombinePar (SearchSpec v a b) (SearchSpec v a b) | |
TryOnce (SearchSpec v a b) | |
LimitSolCount Integer (SearchSpec v a b) | |
LimitDepth Integer (SearchSpec v a b) | |
LimitNodeCount Integer (SearchSpec v a b) | |
LimitDiscrepancy Integer (SearchSpec v a b) | |
BranchBound v OptimDirection (SearchSpec v a b) | |
PrintSol [v] [a] [b] (SearchSpec v a b) |
type ConstraintExpr = Expr ConstraintRefs () () Source #
data ConstraintRefs Source #
mmapSearch :: Monad m => SearchSpec v1 a1 b1 -> (v1 -> m v2) -> (a1 -> m a2) -> (b1 -> m b2) -> m (SearchSpec v2 a2 b2) Source #