40namespace Test {
namespace Int {
53 :
Test(
"Precede::Single::"+
str(s0)+
"<"+
str(t0),8,1,4),
58 for (
int i = 0 ; i <
n ; i++) {
80 :
Test(
"Precede::Multi::"+
str(c0),6,1,5), c(c0) {
85 for (
int j=0; j<c.
size()-1; j++)
86 for (
int i=0; i<
x.
size(); i++) {
int n
Number of negative literals for node type.
Node * x
Pointer to corresponding Boolean expression node.
int size(void) const
Return size of array (number of elements)
FloatNum size(void) const
Return size of float value (distance between maximum and minimum)
Passing integer arguments.
Base class for assignments
Test for multiple value precedence constraint
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Multi(const Gecode::IntArgs &c0)
Create and register test.
virtual bool solution(const Assignment &x) const
Test whether x is solution
Test for single value precedence constraint
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Single(int s0, int t0)
Create and register test.
virtual bool solution(const Assignment &x) const
Test whether x is solution
static std::string str(Gecode::IntPropLevel ipl)
Map integer propagation level to string.
ConTestLevel contest
Whether to test for certain consistency.
void precede(Home home, const IntVarArgs &x, int s, int t, IntPropLevel=IPL_DEF)
Post propagator that s precedes t in x.
Multi _e(Gecode::IntArgs({4, 2, 3, 1}))
Multi _c(Gecode::IntArgs({1, 2, 3}))
Multi _d(Gecode::IntArgs({3, 2, 1}))
@ CTL_NONE
No consistency-test.