44 namespace Test {
namespace Int {
57 :
Test(
"Precede::Single::"+
str(s0)+
"<"+
str(t0),8,1,4),
62 for (
int i = 0 ;
i <
n ;
i++) {
84 :
Test(
"Precede::Multi::"+
str(c0),6,1,5), c(c0) {
89 for (
int j=0; j<c.
size()-1; j++)
90 for (
int i=0;
i<x.
size();
i++) {
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
int size(void) const
Return size of array (number of elements)
Multi _d(Gecode::IntArgs(3, 3, 2, 1))
Test for single value precedence constraint
Test for multiple value precedence constraint
ConTestLevel contest
Whether to test for certain consistency.
static std::string str(Gecode::ExtensionalPropKind epk)
Map extensional propagation kind to string.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
void precede(Home home, const IntVarArgs &x, int s, int t, IntConLevel)
Post propagator that s precedes t in x.
Multi(const Gecode::IntArgs &c0)
Create and register test.
Passing integer arguments.
virtual bool solution(const Assignment &x) const
Test whether x is solution
Node * x
Pointer to corresponding Boolean expression node.
Multi _e(Gecode::IntArgs(4, 4, 2, 3, 1))
Base class for assignments
Single(int s0, int t0)
Create and register test.
virtual bool solution(const Assignment &x) const
Test whether x is solution
int size(void) const
Return number of variables.
Multi _c(Gecode::IntArgs(3, 1, 2, 3))