monadiccp-0.2: Package for Constraint Programming

Language.CP.FDSugar

Documentation

pfs :: Ord a => PriorityQueue a (a, b, c)Source

restart :: (Queue q, Solver solver, CTransformer c, CForSolver c ~ solver, Elem q ~ (Label solver, Tree solver (CForResult c), CTreeState c)) => q -> [c] -> Tree solver (CForResult c) -> (Int, [CForResult c])Source

restartOpt :: (Queue q, CTransformer c, CForSolver c ~ FD, Elem q ~ (Label FD, Tree FD (CForResult c), CTreeState c)) => q -> [c] -> Tree FD (CForResult c) -> (Int, [CForResult c])Source

in_order :: Monad m => a -> m aSource

data Plus Source

Constructors

FD_Term :+ Int