Generated on for Gecode by doxygen 1.17.0
dom.cpp
Go to the documentation of this file.
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Guido Tack <tack@gecode.dev>
5 *
6 * Copyright:
7 * Guido Tack, 2005
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.dev
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <gecode/minimodel.hh>
35
36#include "test/set.hh"
37
38using namespace Gecode;
39
40namespace Test { namespace Set {
41
43 namespace Dom {
44
50
51 static const int d1r[4][2] = {
52 {-4,-3},{-1,-1},{1,1},{3,5}
53 };
54 static IntSet d1(d1r,4);
55
56 static const int d1cr[5][2] = {
58 {-2,-2},{0,0},{2,2},
60 };
61 static IntSet d1c(d1cr,5);
62
63 static IntSet ds_33(-3,3);
64
65 static const int d2r[2][2] = {
67 };
68 static IntSet ds_33c(d2r,2);
69
70 namespace {
71 static int minSymDiff(const SetAssignment& x, int i, const IntSet& is) {
73 CountableSetRanges xr00(x.lub, x[i]);
74 IntSetRanges xr10(is);
75 DiffA a(xr00,xr10);
77 CountableSetRanges xr01(x.lub, x[i]);
78 IntSetRanges xr11(is);
79 DiffB b(xr11,xr01);
81 return u() ? u.min() : Gecode::Set::Limits::max+1;
82 }
83 template<class I>
84 static bool in(int i, I& c, bool eq=false) {
85 if (eq && i==Gecode::Set::Limits::max+1)
86 return true;
88 return Iter::Ranges::subset(s,c);
89 }
90 }
91
93 class DomRange : public SetTest {
94 private:
96 IntSet is;
97 public:
99 DomRange(SetRelType srt0, int n) :
100 SetTest(TestTags::sweep(),"Dom::Range::"+str(srt0)+"::"+str(n),
101 n,ds_33,(n == 1)),
102 srt(srt0), is(srt == Gecode::SRT_CMPL ? ds_33c: ds_33) {}
103
104 virtual bool solution(const SetAssignment& x) const {
105 for (int i=x.size(); i--; ) {
106 CountableSetRanges xr(x.lub, x[i]);
107 IntSetRanges dr(is);
108 switch (srt) {
109 case SRT_EQ:
110 if (!Iter::Ranges::equal(xr, dr))
111 return false;
112 break;
113 case SRT_LQ:
114 if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
115 return false;
116 break;
117 case SRT_LE:
118 if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
119 return false;
120 break;
121 case SRT_GQ:
122 if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
123 return false;
124 break;
125 case SRT_GR:
126 if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
127 return false;
128 break;
129 case SRT_NQ:
130 if (Iter::Ranges::equal(xr, dr))
131 return false;
132 break;
133 case SRT_SUB:
134 if (!Iter::Ranges::subset(xr, dr))
135 return false;
136 break;
137 case SRT_SUP:
138 if (!Iter::Ranges::subset(dr, xr))
139 return false;
140 break;
141 case SRT_DISJ:
142 {
144 inter(xr, dr);
145 if (inter())
146 return false;
147 }
148 break;
149 case SRT_CMPL:
150 {
152 if (!Iter::Ranges::equal(xr,drc))
153 return false;
154 }
155 break;
156 default: GECODE_NEVER;
157 }
158 }
159 return true;
160 }
161
162 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
163 if (x.size() == 1)
164 Gecode::dom(home, x[0], srt, is);
165 else
166 Gecode::dom(home, x, srt, is);
167 }
168
169 virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
170 assert(x.size() == 1);
171 if (_rand(2) != 0) {
172 Gecode::dom(home, x[0], srt, is, r);
173 } else {
174 switch (r.mode()) {
175 case Gecode::RM_EQV:
176 Gecode::rel(home, Gecode::dom(x[0], srt, is) == r.var()); break;
177 case Gecode::RM_IMP:
178 Gecode::rel(home, Gecode::dom(x[0], srt, is) << r.var()); break;
179 case Gecode::RM_PMI:
180 Gecode::rel(home, Gecode::dom(x[0], srt, is) >> r.var()); break;
181 default: GECODE_NEVER;
182 }
183 }
184 }
185 };
186
188 class DomIntRange : public SetTest {
189 private:
191 public:
194 : SetTest(TestTags::sweep(),"Dom::IntRange::"+str(srt0)+"::"+str(n),1,ds_33,n==1),
195 srt(srt0) {}
196
197 virtual bool solution(const SetAssignment& x) const {
198 for (int i=x.size(); i--; ) {
199 CountableSetRanges xr(x.lub, x[i]);
200 IntSet is(-3,-1);
201 IntSetRanges dr(is);
202 switch (srt) {
203 case SRT_EQ:
204 if (!Iter::Ranges::equal(xr, dr))
205 return false;
206 break;
207 case SRT_LQ:
208 if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
209 return false;
210 break;
211 case SRT_LE:
212 if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
213 return false;
214 break;
215 case SRT_GQ:
216 if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
217 return false;
218 break;
219 case SRT_GR:
220 if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
221 return false;
222 break;
223 case SRT_NQ:
224 if (!(!Iter::Ranges::equal(xr, dr)))
225 return false;
226 break;
227 case SRT_SUB:
228 if (!(Iter::Ranges::subset(xr, dr)))
229 return false;
230 break;
231 case SRT_SUP:
232 if (!(Iter::Ranges::subset(dr, xr)))
233 return false;
234 break;
235 case SRT_DISJ:
236 {
238 inter(xr, dr);
239 if (inter())
240 return false;
241 }
242 break;
243 case SRT_CMPL:
244 {
246 if (!Iter::Ranges::equal(xr,drc))
247 return false;
248 }
249 break;
250 default: GECODE_NEVER;
251 }
252 }
253 return true;
254 }
255
256 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
257 if (x.size() == 1)
258 Gecode::dom(home, x[0], srt, -3, -1);
259 else
260 Gecode::dom(home, x, srt, -3, -1);
261 }
262
263 virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
264 assert(x.size() == 1);
265 if (_rand(2) != 0) {
266 Gecode::dom(home, x[0], srt, -3, -1, r);
267 } else {
268 switch (r.mode()) {
269 case Gecode::RM_EQV:
270 Gecode::rel(home, Gecode::dom(x[0], srt, -3, -1) == r.var()); break;
271 case Gecode::RM_IMP:
272 Gecode::rel(home, Gecode::dom(x[0], srt, -3, -1) << r.var()); break;
273 case Gecode::RM_PMI:
274 Gecode::rel(home, Gecode::dom(x[0], srt, -3, -1) >> r.var()); break;
275 default: GECODE_NEVER;
276 }
277 }
278 }
279 };
280
282 class DomInt : public SetTest {
283 private:
285 public:
288 SetTest(TestTags::sweep(),"Dom::Int::"+str(srt0)+"::"+str(n),
289 n,ds_33,n==1),
290 srt(srt0) {}
291
292 virtual bool solution(const SetAssignment& x) const {
293 IntSet is(-3,-3);
294 for (int i=x.size(); i--; ) {
295 CountableSetRanges xr(x.lub, x[i]);
296 IntSetRanges dr(is);
297 switch (srt) {
298 case SRT_EQ:
299 if (!Iter::Ranges::equal(xr, dr))
300 return false;
301 break;
302 case SRT_LQ:
303 if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
304 return false;
305 break;
306 case SRT_LE:
307 if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
308 return false;
309 break;
310 case SRT_GQ:
311 if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
312 return false;
313 break;
314 case SRT_GR:
315 if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
316 return false;
317 break;
318 case SRT_NQ:
319 if (Iter::Ranges::equal(xr, dr))
320 return false;
321 break;
322 case SRT_SUB:
323 if (!(Iter::Ranges::subset(xr, dr)))
324 return false;
325 break;
326 case SRT_SUP:
327 if (!(Iter::Ranges::subset(dr, xr)))
328 return false;
329 break;
330 case SRT_DISJ:
331 {
333 inter(xr, dr);
334
335 if (inter())
336 return false;
337 break;
338 }
339 case SRT_CMPL:
340 {
342
343 if (!Iter::Ranges::equal(xr,drc))
344 return false;
345 break;
346 }
347 default: GECODE_NEVER;
348 }
349 }
350 return true;
351 }
352
353 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
354 if (x.size() == 1)
355 Gecode::dom(home, x[0], srt, -3);
356 else
357 Gecode::dom(home, x, srt, -3);
358 }
359
360 virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
361 assert(x.size() == 1);
362 if (_rand(2) != 0) {
363 Gecode::dom(home, x[0], srt, -3, r);
364 } else {
365 switch (r.mode()) {
366 case Gecode::RM_EQV:
367 Gecode::rel(home, Gecode::dom(x[0], srt, -3) == r.var()); break;
368 case Gecode::RM_IMP:
369 Gecode::rel(home, Gecode::dom(x[0], srt, -3) << r.var()); break;
370 case Gecode::RM_PMI:
371 Gecode::rel(home, Gecode::dom(x[0], srt, -3) >> r.var()); break;
372 default: GECODE_NEVER;
373 }
374 }
375 }
376 };
377
379 class DomDom : public SetTest {
380 private:
383 public:
386 SetTest(srt0 == Gecode::SRT_GR
387 ? TestTags::check()
388 : TestTags(TestTags::sweep()),
389 "Dom::Dom::"+str(srt0)+"::"+str(n),n,d1,(n == 1)),
390 srt(srt0), is(srt == Gecode::SRT_CMPL ? d1c: d1) {}
391
392 virtual bool solution(const SetAssignment& x) const {
393 for (int i=x.size(); i--; ) {
394 CountableSetRanges xr(x.lub, x[i]);
395 IntSetRanges dr(is);
396 switch (srt) {
397 case SRT_EQ:
398 if (!Iter::Ranges::equal(xr, dr))
399 return false;
400 break;
401 case SRT_LQ:
402 if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
403 return false;
404 break;
405 case SRT_LE:
406 if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
407 return false;
408 break;
409 case SRT_GQ:
410 if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
411 return false;
412 break;
413 case SRT_GR:
414 if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
415 return false;
416 break;
417 case SRT_NQ:
418 if (Iter::Ranges::equal(xr, dr))
419 return false;
420 break;
421 case SRT_SUB:
422 if (!Iter::Ranges::subset(xr, dr))
423 return false;
424 break;
425 case SRT_SUP:
426 if (!Iter::Ranges::subset(dr, xr))
427 return false;
428 break;
429 case SRT_DISJ:
430 {
432 inter(xr, dr);
433 if (inter())
434 return false;
435 }
436 break;
437 case SRT_CMPL:
438 {
440 if (!Iter::Ranges::equal(xr,drc))
441 return false;
442 }
443 break;
444 default: GECODE_NEVER;
445 }
446 }
447 return true;
448 }
449
450 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
451 if (x.size() == 1)
452 Gecode::dom(home, x[0], srt, is);
453 else
454 Gecode::dom(home, x, srt, is);
455 }
456
457 virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
458 assert(x.size() == 1);
459 Gecode::dom(home, x[0], srt, is, r);
460 }
461 };
462
464 class CardRange : public SetTest {
465 public:
468 : SetTest(TestTags::sweep(),"Dom::CardRange::"+str(n),n,d1,false) {}
469
470 virtual bool solution(const SetAssignment& x) const {
471 for (int i=x.size(); i--; ) {
472 CountableSetRanges xr(x.lub, x[i]);
473 unsigned int card = Iter::Ranges::size(xr);
474 if ((card < 2) || (card > 3))
475 return false;
476 }
477 return true;
478 }
479
480 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
481 if (x.size() == 1)
482 Gecode::cardinality(home, x[0], 2, 3);
483 else
484 Gecode::cardinality(home, x, 2, 3);
485 }
486 };
487
508
529
550
571
574
575}}}
576
577// STATISTICS: test-set
Range iterator for integer sets.
Definition int.hh:311
Integer sets.
Definition int.hh:179
Integer variable array.
Definition int.hh:792
Range iterator for computing set difference.
Range iterator for computing intersection (binary).
int min(void) const
Return smallest value of range.
Range iterator for singleton range.
Range iterator for computing union (binary).
Reification specification.
Definition int.hh:1176
Set variable array
Definition set.hh:575
A complement iterator spezialized for the BndSet limits.
Definition var-imp.hpp:293
Computation spaces.
Definition core.hpp:1787
int size(void) const
Return size of array (number of elements).
Definition array.hpp:945
Gecode::Support::RandomGenerator _rand
Random number generator.
Definition test.hh:238
Range iterator producing subsets of an IntSet.
Definition set.hh:113
Test for cardinality range
Definition dom.cpp:464
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:480
CardRange(int n)
Create and register test.
Definition dom.cpp:467
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:470
Test for equality with a domain
Definition dom.cpp:379
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:392
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:457
DomDom(Gecode::SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:385
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:450
Test for equality with an integer range
Definition dom.cpp:188
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:256
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:263
DomIntRange(Gecode::SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:193
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:197
Test for equality with an integer
Definition dom.cpp:282
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:360
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:353
DomInt(Gecode::SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:287
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:292
Test for equality with a range
Definition dom.cpp:93
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:169
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:162
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:104
DomRange(SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:99
Generate all set assignments.
Definition set.hh:156
int size(void) const
Return arity.
Definition set.hh:187
Gecode::IntSet lub
The common superset for all domains.
Definition set.hh:168
static std::string str(Gecode::SetRelType srt)
Map set relation to string.
Definition set.hpp:46
SetTest(const std::string &s, int a, const Gecode::IntSet &d, bool r=false, int w=0)
Constructor.
Definition set.hh:312
Set of test tags.
Definition test.hh:105
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
Definition rel.cpp:68
@ RM_IMP
Implication for reification.
Definition int.hh:1162
@ RM_PMI
Inverse implication for reification.
Definition int.hh:1169
@ RM_EQV
Equivalence for reification (default).
Definition int.hh:1155
SetRelType
Common relation types for sets.
Definition set.hh:650
@ SRT_GQ
Greater or equal ( ).
Definition set.hh:659
@ SRT_CMPL
Complement.
Definition set.hh:656
@ SRT_GR
Greater ( ).
Definition set.hh:660
@ SRT_LQ
Less or equal ( ).
Definition set.hh:657
@ SRT_NQ
Disequality ( ).
Definition set.hh:652
@ SRT_LE
Less ( ).
Definition set.hh:658
@ SRT_EQ
Equality ( ).
Definition set.hh:651
@ SRT_SUP
Superset ( ).
Definition set.hh:654
@ SRT_DISJ
Disjoint ( ).
Definition set.hh:655
@ SRT_SUB
Subset ( ).
Definition set.hh:653
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
unsigned int size(I &i)
Size of all ranges of range iterator i.
bool equal(I &i, J &j)
Check whether range iterators i and j are equal.
const int min
Smallest allowed integer in integer set.
Definition set.hh:99
const int max
Largest allowed integer in integer set.
Definition set.hh:97
Gecode toplevel namespace
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Definition dom.cpp:40
SetExpr inter(const SetVarArgs &)
Intersection of set variables.
Definition set-expr.cpp:696
LinIntExpr cardinality(const SetExpr &)
Cardinality of set expression.
Definition set-expr.cpp:817
Tests for domain constraints
Definition dom.cpp:43
DomIntRange _domintrange_sup1(SRT_SUP, 1)
DomIntRange _domintrange_nq1(SRT_NQ, 1)
DomInt _domint_nq1(SRT_NQ, 1)
DomRange _domrange_le1(SRT_LE, 1)
DomIntRange _domintrange_sub2(SRT_SUB, 2)
DomInt _domint_gr1(SRT_GR, 1)
DomIntRange _domintrange_eq1(SRT_EQ, 1)
DomDom _domdom_lq1(SRT_LQ, 1)
DomRange _domrange_gr1(SRT_GR, 1)
DomInt _domint_lq1(SRT_LQ, 1)
DomRange _domrange_sup2(SRT_SUP, 2)
DomDom _domdom_eq1(SRT_EQ, 1)
DomDom _domdom_cmpl1(SRT_CMPL, 1)
DomIntRange _domintrange_gq2(SRT_GQ, 2)
DomDom _domdom_gq1(SRT_GQ, 1)
DomIntRange _domintrange_disj1(SRT_DISJ, 1)
DomRange _domrange_disj1(SRT_DISJ, 1)
DomDom _domdom_disj1(SRT_DISJ, 1)
DomIntRange _domintrange_gq1(SRT_GQ, 1)
DomInt _domint_gr2(SRT_GR, 2)
DomDom _domdom_gq2(SRT_GQ, 2)
DomInt _domint_lq2(SRT_LQ, 2)
DomInt _domint_disj2(SRT_DISJ, 2)
DomRange _domrange_gq1(SRT_GQ, 1)
DomIntRange _domintrange_gr1(SRT_GR, 1)
DomRange _domrange_lq2(SRT_LQ, 2)
DomRange _domrange_gq2(SRT_GQ, 2)
DomDom _domdom_nq1(SRT_NQ, 1)
DomRange _domrange_gr2(SRT_GR, 2)
DomRange _domrange_eq1(SRT_EQ, 1)
DomRange _domrange_nq2(SRT_NQ, 2)
DomInt _domint_le2(SRT_LE, 2)
DomInt _domint_sup2(SRT_SUP, 2)
DomIntRange _domintrange_nq2(SRT_NQ, 2)
DomIntRange _domintrange_gr2(SRT_GR, 2)
DomRange _domrange_lq1(SRT_LQ, 1)
DomIntRange _domintrange_sub1(SRT_SUB, 1)
DomRange _domrange_sub1(SRT_SUB, 1)
DomIntRange _domintrange_cmpl2(SRT_CMPL, 2)
DomRange _domrange_cmpl1(SRT_CMPL, 1)
DomInt _domint_eq1(SRT_EQ, 1)
DomIntRange _domintrange_le1(SRT_LE, 1)
DomDom _domdom_gr1(SRT_GR, 1)
DomInt _domint_sup1(SRT_SUP, 1)
DomDom _domdom_le1(SRT_LE, 1)
DomRange _domrange_cmpl2(SRT_CMPL, 2)
DomRange _domrange_disj2(SRT_DISJ, 2)
DomInt _domint_nq2(SRT_NQ, 2)
DomInt _domint_cmpl1(SRT_CMPL, 1)
DomInt _domint_gq1(SRT_GQ, 1)
DomDom _domdom_sub2(SRT_SUB, 2)
DomIntRange _domintrange_lq2(SRT_LQ, 2)
DomDom _domdom_eq2(SRT_EQ, 2)
DomRange _domrange_sup1(SRT_SUP, 1)
DomRange _domrange_nq1(SRT_NQ, 1)
DomDom _domdom_le2(SRT_LE, 2)
DomInt _domint_eq2(SRT_EQ, 2)
DomIntRange _domintrange_lq1(SRT_LQ, 1)
DomRange _domrange_le2(SRT_LE, 2)
CardRange _cr2(2)
DomDom _domdom_sub1(SRT_SUB, 1)
DomDom _domdom_gr2(SRT_GR, 2)
DomDom _domdom_lq2(SRT_LQ, 2)
DomDom _domdom_sup1(SRT_SUP, 1)
DomIntRange _domintrange_disj2(SRT_DISJ, 2)
DomInt _domint_gq2(SRT_GQ, 2)
DomRange _domrange_eq2(SRT_EQ, 2)
DomDom _domdom_nq2(SRT_NQ, 2)
DomInt _domint_disj1(SRT_DISJ, 1)
DomInt _domint_le1(SRT_LE, 1)
DomRange _domrange_sub2(SRT_SUB, 2)
DomInt _domint_sub1(SRT_SUB, 1)
DomIntRange _domintrange_le2(SRT_LE, 2)
DomInt _domint_cmpl2(SRT_CMPL, 2)
DomDom _domdom_disj2(SRT_DISJ, 2)
CardRange _cr1(1)
DomInt _domint_sub2(SRT_SUB, 2)
DomDom _domdom_cmpl2(SRT_CMPL, 2)
DomIntRange _domintrange_eq2(SRT_EQ, 2)
DomIntRange _domintrange_cmpl1(SRT_CMPL, 1)
DomDom _domdom_sup2(SRT_SUP, 2)
DomIntRange _domintrange_sup2(SRT_SUP, 2)
Testing finite sets.
Definition set.cpp:42
General test support.
Definition afc.cpp:41
Region r
Definition region.cpp:65
@ check
Basic integrity tests.
Definition test.hh:99
@ sweep
Really heavy sweep tests.
Definition test.hh:101
#define GECODE_NEVER
Assert that this command is never executed.
Definition macros.hpp:56