Documentation
pfs :: Ord a => PriorityQueue a (a, b, c)Source
nb :: Int -> CNodeBoundedST FD aSource
db :: Int -> CDepthBoundedST FD aSource
fs :: CFirstSolutionST FD aSource
it :: CIdentityCST FD aSource
ld :: Int -> CLimitedDiscrepancyST FD aSource
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