61 for (
int i=x.
size(); i--; )
76 for (
int i=0; i<5; i++) {
77 values[i] = i-1; cards[i] = fixed;
95 for (
int i=x.
size(); i--; )
109 for (
int i=0; i<4; i++) {
123 "GCC::Int::All::Max::"+
str(
ipl), 4, 1,2, false,
ipl) {}
129 for (
int i=x.
size(); i--; )
131 if (n[0] != 2 || n[1] != 2)
150 (hole ?
"::Hole" :
"::Full")+
str(
ipl),4,1,4,false,
ipl) {}
156 for (
int i=x.
size(); i--; )
158 if ((n[0] < 2) || (n[1] < 2) || (n[2] > 0) || (n[3] > 0))
174 cards[0]=fixed; cards[1]=fixed;
183 static const int n = 4;
192 for (
int i=0; i<
n; i++)
193 if ((x[i] < 0) || (x[i] > 2))
195 int* card =
new int[m];
196 for (
int i=0; i<m; i++) {
198 if ((x[
n+i] < 0) || (x[
n+i] > 2)) {
203 for (
int i=0; i<
n; i++)
205 for (
int i=0; i<m; i++)
206 if (card[i] != x[
n+i]) {
220 for (
int i=0; i<
n; i++)
222 for (
int i=0; i<m; i++)
251 int* card =
new int[m];
252 for (
int i=0; i<m; i++) {
254 if ((x[
n+i] < 0) || (x[
n+i] >
n)) {
259 for (
int i=0; i<
n; i++)
260 card[x[i]-
dom.min()]++;
261 for (
int i=0; i<m; i++)
262 if (card[i] != x[
n+i]) {
282 for (
int i=0; i<
n; i++)
284 for (
int i=0; i<m; i++)
288 values[i] = i+
dom.min();
304 (void)
new VarAll(ipls.ipl());
305 (void)
new VarSome(
"Small",2,-1,3,ipls.ipl());
306 (void)
new VarSome(
"Large",3,-1,4,ipls.ipl());
Passing integer arguments.
Passing integer variables.
int size(void) const
Return size of array (number of elements).
Gecode::Support::RandomGenerator _rand
Random number generator.
Base class for assignments
int size(void) const
Return number of variables.
Generate all assignments.
Help class to create and register tests.
Create(void)
Perform creation and registration.
Test for integer cardinality with max cardinality for all variables
IntAllMax(Gecode::IntPropLevel ipl)
Create and register test.
virtual bool solution(const Assignment &x) const
Test whether x is solution
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Test for integer cardinality with min and max for all variables
IntAllMinMaxDef(Gecode::IntPropLevel ipl)
Create and register test.
virtual bool solution(const Assignment &x) const
Test whether x is solution
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Test for integer cardinality with min and max for all variables
IntAllMinMax(Gecode::IntPropLevel ipl)
Create and register test.
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
virtual bool solution(const Assignment &x) const
Test whether x is solution
Test for integer cardinality for some variables
virtual bool solution(const Assignment &x) const
Test whether x is solution
IntSome(Gecode::IntPropLevel ipl)
Create and register test.
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Test for variable cardinality for all cardinality values
virtual bool solution(const Assignment &x) const
Test whether x is solution
static const int n
Number of non-cardinality variables.
VarAll(Gecode::IntPropLevel ipl)
Create and register test.
virtual void post(Gecode::Space &home, Gecode::IntVarArray &xy)
Post constraint on xy.
Test for variable cardinality for some cardinality values
int n
Number of non-cardinality variables.
virtual void post(Gecode::Space &home, Gecode::IntVarArray &xy)
Post constraint on xy.
virtual Assignment * assignment(void) const
Create and register initial assignment.
virtual bool solution(const Assignment &x) const
Test whether x is solution
VarSome(std::string s, int n0, int min, int max, Gecode::IntPropLevel ipl)
Create and register test.
static const int randomArity
Arity beyond which to use randomized tests.
Iterator for simple integer propagation levels.
Generate random selection of assignments.
bool testsearch
Whether to perform search test.
static std::string str(bool b)
Map bool to string.
Gecode::IntPropLevel ipl
Propagation level.
int arity
Number of variables.
Gecode::IntSet dom
Domain of variables.
ConTestLevel contest
Whether to test for certain consistency.
IntPropLevel
Propagation levels for integer propagators.
@ IPL_BND
Bounds propagation.
Gecode toplevel namespace
ArgArray< IntSet > IntSetArgs
Passing set arguments.
void count(Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF)
Post propagator for .
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Tests for counting constraints (global cardinality)
Testing finite domain integers.
@ CTL_NONE
No consistency-test.
@ standard
Standard test suite.
@ sweep
Really heavy sweep tests.