64 for (
int i=x.
size(); i--; )
65 if ((x[i].max() >
c.max()) || (x[i].min() <
c.min()))
79 assert(x.
size() == 1);
103 for (
int i=x.
size(); i--; )
118 assert(x.
size() == 1);
130 for (
int c=-4;
c<=4;
c++) {
131 (void)
new Val(1,
c,step);
132 (void)
new Val(2,
c,step);
133 for (
int d=-3; d<=3; d++) {
134 (void)
new Num(1,
c,d,step);
135 (void)
new Num(2,
c,d,step);
Reification specification.
int size(void) const
Return size of array (number of elements).
Base class for assignments
int size(void) const
Return number of variables.
Help class to create and register tests.
Create(void)
Perform creation and registration.
Test for domain constraints with float numbers
Gecode::FloatNum max
Float number.
Num(int n, Gecode::FloatNum min0, Gecode::FloatNum max0, Gecode::FloatNum st)
Create and register test.
Gecode::FloatNum min
Float number.
virtual void post(Gecode::Space &home, Gecode::FloatVarArray &x)
Post constraint on x.
virtual void post(Gecode::Space &home, Gecode::FloatVarArray &x, Gecode::Reify r)
Post reified constraint on x for r.
virtual MaybeType solution(const Assignment &x) const
Test whether x is solution
Test for domain constraints with a float value
Val(int n, Gecode::FloatVal c0, Gecode::FloatNum st)
Create and register test.
virtual MaybeType solution(const Assignment &x) const
Test whether x is solution
Gecode::FloatVal c
Float constant.
virtual void post(Gecode::Space &home, Gecode::FloatVarArray &x, Gecode::Reify r)
Post reified constraint on x for r.
virtual void post(Gecode::Space &home, Gecode::FloatVarArray &x)
Post constraint on x.
bool testsubsumed
Whether to test for subsumption.
static std::string str(Gecode::FloatRelType frt)
Map float relation to string.
double FloatNum
Floating point number base type.
Gecode toplevel namespace
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Tests for domain constraints
MaybeType
Type for comparisons and solutions.