- newtype CodegenSolver a = CodegenSolver {}
- compile :: Tree CodegenSolver a -> Store
- data Store = Store {}
- data StoreNode = StoreNode {
- cons :: [GConstraint]
- nbounds :: [VarBoundPropagator]
- nvars :: [Int]
- dis :: StoreNodeType
- data StoreNodeType
- getVarType :: Store -> Int -> GType
- isVarImplicit :: Store -> Int -> Bool
- data VarBound = VarBound {}
- getAllBounds :: Store -> VarBoundMap
Documentation
newtype CodegenSolver a Source
CodegenSolver monad definition
Monad CodegenSolver | |
Solver CodegenSolver | Helper functions Gecode Solver instance declaration |
FDSolver CodegenSolver | |
GecodeSolver CodegenSolver | CodegenSolver FDSolver instance |
MonadState Store CodegenSolver | |
Term CodegenSolver BoolTerm | |
Term CodegenSolver IntTerm | CodegenSolver terms |
compile :: Tree CodegenSolver a -> StoreSource
CodegenSolver compilation
StoreNode represents a node in the search tree. * Each node adds new constraints and variables. * A node is a leaf node or an internal node
StoreNode | |
|
getVarType :: Store -> Int -> GTypeSource
isVarImplicit :: Store -> Int -> BoolSource
getAllBounds :: Store -> VarBoundMapSource