Control.CP.FD.FDSugar

Documentation

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

nb :: Int -> CNodeBoundedST FD a

db :: Int -> CDepthBoundedST FD a

bb :: NewBound FD -> CBranchBoundST FD a

fs :: CFirstSolutionST FD a

it :: CIdentityCST FD a

ra :: Int -> CRandomST FD a

ld :: Int -> CLimitedDiscrepancyST FD a

newBound :: NewBound FD

newBoundBis :: NewBound FD

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])

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])

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

(@\=) :: FD_Term -> FD_Term -> Tree FD ()

(@=) :: FD_Term -> Int -> Tree FD ()

data Plus

Constructors

FD_Term :+ Int

(@\==) :: FD_Term -> Plus -> Tree FD ()

(@<) :: FD_Term -> Int -> Tree FD ()

(@>) :: FD_Term -> Int -> Tree FD ()