42 namespace Test {
namespace Set {
47 static_cast<unsigned int>(
pow(static_cast<double>(2.0),
60 static_cast<unsigned int>(
pow(static_cast<double>(2.0),
69 :
n(n0), dsv(new
CountableSet[
n]), ir(_withInt, d0), done(false), lub(d0),
108 for (
int i=0;
i<n;
i++) {
111 os << icsv << ((i!=n-1) ?
"," :
"}");
118 namespace Test {
namespace Set {
122 :
d(d0),
y(*this, i,
d),
124 reified(false), test(t) {
130 dom(*
this,
x[0],_x[0]);
134 olog <<
ind(2) <<
"Initial: x[]=" <<
x;
135 olog <<
" y[]=" <<
y;
146 olog <<
ind(2) <<
"Initial: x[]=" <<
x;
147 olog <<
" y[]=" <<
y;
174 olog <<
ind(3) <<
"Posting reified propagator" << std::endl;
178 olog <<
ind(3) <<
"Posting propagator" << std::endl;
185 olog <<
ind(3) <<
"Fixpoint: x[]=" <<
x 186 <<
" y[]=" <<
y << std::endl;
189 <<
" y[]=" <<
y << std::endl;
204 olog <<
ind(4) <<
"x[" << i <<
"] ";
217 olog << is << std::endl;
225 olog <<
ind(4) << cmin <<
" <= #(x[" << i <<
"]) <= " << cmax
234 olog <<
ind(4) <<
"y[" << i <<
"] ";
243 olog <<
" " << n << std::endl;
253 olog <<
ind(4) <<
"b = " << n << std::endl;
259 for (
int i=a.
size();
i--; ) {
293 for (
int j=0; j<
v; j++, ++diffV) {}
307 for (
int j=0; j<
v; j++, ++diffV) {}
321 for (
int j=0; j<
v; j++, ++interV) {}
335 for (
int j=0; j<
v; j++, ++interV) {}
346 olog <<
ind(3) <<
"Testing fixpoint on copy" << std::endl;
349 delete c;
return false;
353 if (
x[
i].glbSize() != c->
x[
i].glbSize() ||
354 x[
i].lubSize() != c->
x[
i].lubSize() ||
355 x[
i].cardMin() != c->
x[
i].cardMin() ||
356 x[
i].cardMax() != c->
x[
i].cardMax()) {
362 delete c;
return false;
365 delete c;
return false;
368 olog <<
ind(3) <<
"Finished testing fixpoint on copy" << std::endl;
376 olog <<
ind(3) <<
"Testing whether enabled space is the same" 386 if (
x[
i].glbSize() != c.
x[
i].glbSize() ||
387 x[
i].lubSize() != c.
x[
i].lubSize() ||
388 x[
i].cardMin() != c.
x[
i].cardMin() ||
389 x[
i].cardMax() != c.
x[
i].cardMax())
399 olog <<
ind(3) <<
"Finished testing whether enabled space is the same" 407 bool setsAssigned =
true;
408 for (
int j=
x.
size(); j--; )
410 setsAssigned =
false;
413 bool intsAssigned =
true;
414 for (
int j=
y.
size(); j--; )
416 intsAssigned =
false;
424 }
else if (setsAssigned) {
430 if (setsAssigned || i>=
x.
size()) {
434 i = (i+1) %
y.
size();
441 if (a.
ints()[
i] <
y[
i].max()) {
444 assert((v > a.
ints()[
i]) && (v <=
y[i].
max()));
449 if (a.
ints()[
i] >
y[
i].min()) {
452 assert((v < a.
ints()[
i]) && (v >=
y[i].
min()));
461 if (it.
width() > skip) {
463 if (v == a.
ints()[
i]) {
464 if (it.
width() == 1) {
466 }
else if (v < it.
max()) {
482 i = (i+1) %
x.
size();
488 Gecode::SetVarUnknownRanges ur2(
x[i]);
511 if (
x[i].cardMin() < aisize) {
512 unsigned int newc =
x[
i].cardMin() + 1 +
514 assert( newc >
x[i].cardMin() );
515 assert( newc <= aisize );
520 if (
x[i].cardMax() > aisize) {
521 unsigned int newc =
x[
i].cardMax() - 1 -
523 assert( newc <
x[i].cardMax() );
524 assert( newc >= aisize );
544 bool setsAssigned =
true;
545 for (
int j=
x.
size(); j--; )
547 setsAssigned =
false;
550 bool intsAssigned =
true;
551 for (
int j=
y.
size(); j--; )
553 intsAssigned =
false;
561 }
else if (setsAssigned) {
567 if (setsAssigned || i>=
x.
size()) {
571 i = (i+1) %
y.
size();
578 if (a.
ints()[
i] <
y[
i].max()) {
581 assert((v > a.
ints()[
i]) && (v <=
y[i].
max()));
587 if (a.
ints()[
i] >
y[
i].min()) {
590 assert((v < a.
ints()[
i]) && (v >=
y[i].
min()));
600 if (it.
width() > skip) {
602 if (v == a.
ints()[
i]) {
603 if (it.
width() == 1) {
605 }
else if (v < it.
max()) {
623 i = (i+1) %
x.
size();
629 Gecode::SetVarUnknownRanges ur2(
x[i]);
652 if (
x[i].cardMin() < aisize) {
653 unsigned int newc =
x[
i].cardMin() + 1 +
655 assert( newc >
x[i].cardMin() );
656 assert( newc <= aisize );
662 if (
x[i].cardMax() > aisize) {
663 unsigned int newc =
x[
i].cardMax() - 1 -
665 assert( newc <
x[i].cardMax() );
666 assert( newc >= aisize );
702 #define CHECK_TEST(T,M) \ 704 olog << ind(3) << "Check: " << (M) << std::endl; \ 706 problem = (M); delete s; goto failed; \ 710 #define START_TEST(T) \ 713 olog << ind(2) << "Testing: " << (T) << std::endl; \ 720 const char*
test =
"NONE";
721 const char* problem =
"NONE";
726 bool is_sol = solution(a);
728 olog <<
ind(1) <<
"Assignment: " << a
729 << (is_sol ?
" (solution)" :
" (no solution)")
739 olog <<
ind(3) <<
"No copy" << std::endl;
745 olog <<
ind(3) <<
"Copy" << std::endl;
752 default: assert(
false);
763 START_TEST(
"Assignment (after posting, disable)");
797 problem =
"No fixpoint";
818 problem =
"Different result after re-enable";
824 problem =
"Different failure after re-enable";
832 START_TEST(
"Assignment reified (rewrite after post, <=>)");
842 START_TEST(
"Assignment reified (rewrite after post, =>)");
852 START_TEST(
"Assignment reified (rewrite after post, <=)");
863 START_TEST(
"Assignment reified (rewrite failure, <=>)");
872 START_TEST(
"Assignment reified (rewrite failure, =>)");
886 START_TEST(
"Assignment reified (rewrite failure, <=)");
899 START_TEST(
"Assignment reified (immediate rewrite, <=>)");
909 START_TEST(
"Assignment reified (immediate rewrite, =>)");
919 START_TEST(
"Assignment reified (immediate rewrite, <=)");
929 START_TEST(
"Assignment reified (immediate failure, <=>)");
938 START_TEST(
"Assignment reified (immediate failure, =>)");
952 START_TEST(
"Assignment reified (immediate failure, <=)");
966 START_TEST(
"Assignment reified (before posting, <=>)");
981 START_TEST(
"Assignment reified (before posting, =>)");
996 START_TEST(
"Assignment reified (before posting, <=)");
1011 START_TEST(
"Assignment reified (after posting, <=>)");
1026 START_TEST(
"Assignment reified (after posting, =>)");
1041 START_TEST(
"Assignment reified (after posting, <=)");
1056 START_TEST(
"Assignment reified (after posting, <=>, disable)");
1073 START_TEST(
"Assignment reified (after posting, =>, disable)");
1090 START_TEST(
"Assignment reified (after posting, <=, disable)");
1114 problem =
"No fixpoint";
1135 problem =
"No fixpoint";
1157 problem =
"No fixpoint";
1178 olog <<
"FAILURE" << std::endl
1179 <<
ind(1) <<
"Test: " << test << std::endl
1180 <<
ind(1) <<
"Problem: " << problem << std::endl;
1182 olog <<
ind(1) <<
"Assignment: " << a << std::endl;
void removeFromLub(int v, int i, const SetAssignment &a)
Remove value v from the upper bound of x[i].
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
void operator++(void)
Move to next subset.
void cardinality(int i, int cmin, int cmax)
Perform cardinality tell operation on x[i].
void disable(void)
Disable propagators in space and compute fixpoint (make all idle)
SetRelType
Common relation types for sets.
Inverse implication for reification.
Simple class for describing identation.
Gecode::Reify r
Reification information.
const int min
Smallest allowed integer in integer set.
Range iterator for integer sets.
void log(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
int size(void) const
Return size of array (number of elements)
const FloatNum max
Largest allowed float value.
ReifyMode mode(void) const
Return reification mode.
virtual Gecode::Space * copy(void)
Copy space during cloning.
void update(Space &home, VarArray< Var > &a)
Update array to be a clone of array a.
static Gecode::Support::RandomGenerator rand
Random number generator.
Gecode::SetVarArray x
Set variables to be tested.
unsigned int size(void) const
Return size (cardinality) of domain.
void enable(void)
Enable propagators in space.
void disable(Space &home)
Disable all propagators in a group.
static PropagatorGroup all
Group of all propagators.
bool assigned(void) const
Test whether view is assigned.
void assign(const SetAssignment &a)
Assign all variables to values in a.
void pow(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for $n 0$.
CountableSet(void)
Default constructor.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
bool same(SetTestSpace &c)
Check whether propagation is the same as in c.
int val(void) const
Return current subset.
SetOpType
Common operations for sets.
const unsigned int card
Maximum cardinality of an integer set.
SetAssignment(int n, const Gecode::IntSet &d, int i=0)
Initialize with n set variables, initial bound d and i int variables.
const int max
Largest allowed integer in integer set.
unsigned int size(Space &home) const
Return number of propagators in a group.
Iterator for the unknown ranges of a set variable.
bool reified
Whether the test is for a reified propagator.
void rel(int i, Gecode::SetRelType srt, const Gecode::IntSet &is)
Perform set tell operation on x[i].
const FloatNum min
Smallest allowed float value.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
IntRelType
Relation types for integers.
Range iterator for computing intersection (binary)
Space * clone(CloneStatistics &stat=unused_clone) const
Clone space.
ChannelShared csv(Gecode::IPL_VAL)
static bool fixpoint(void)
Throw a coin whether to compute a fixpoint.
void post(void)
Post propagator.
bool failed(void)
Compute a fixpoint and check for failure.
Value iterator from range iterator.
unsigned int size(I &i)
Size of all ranges of range iterator i.
int min(void) const
Return smallest value of range.
struct Gecode::Space::@58::@60 c
Data available only during copying.
void update(Space &home, VarImpVar< VarImp > &y)
Update this variable to be a clone of variable y.
virtual bool run(void)
Perform test.
bool log
Whether to log the tests.
Gecode::IntSet lub
The common superset for all domains.
union Gecode::@585::NNF::@62 u
Union depending on nodetype t.
const Test::Int::Assignment & ints(void) const
Return assignment for integer variables.
#define START_TEST(T)
Start new test.
bool assigned(void) const
Test whether all variables are assigned.
static const IntSet empty
Empty set.
Gecode::IntSet d
Initial domain.
SetTestSpace(int n, Gecode::IntSet &d0, int i, SetTest *t, bool log=true)
Create test space without reification.
Boolean integer variables.
LinIntExpr cardinality(const SetExpr &e)
Cardinality of set expression.
SetExpr inter(const SetVarArgs &x)
Intersection of set variables.
bool prune(const SetAssignment &a)
Perform random pruning.
struct Gecode::@585::NNF::@62::@63 b
For binary nodes (and, or, eqv)
unsigned int propagators(void)
Return the number of propagators.
Post propagator for SetVar SetOpType SetVar y
int withInt
How many integer variables to iterate.
void addToGlb(int v, int i, const SetAssignment &a)
Remove value v from the lower bound of x[i].
bool disabled(const SetAssignment &a, SetTestSpace &c)
Prune values also in a space c with disabled propagators, but not those in assignment a...
struct Gecode::@585::NNF::@62::@64 a
For atomic nodes.
virtual void post(Gecode::Space &home, Gecode::SetVarArray &x, Gecode::IntVarArray &y)=0
Post propagator.
Base class for tests with set constraints
Generate all set assignments.
void operator++(void)
Move to next assignment.
bool fixprob(void)
Perform fixpoint computation.
void enable(Space &home, bool s=true)
Enable all propagators in a group.
std::ostringstream olog
Stream used for logging.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
std::ostream & operator<<(std::ostream &os, const Test::Set::SetAssignment &a)
Gecode::IntVarArray y
Int variables to be tested.
bool subsumed(bool b)
Check for subsumption if b is true.
BoolVar var(void) const
Return Boolean control variable.
Range iterator producing subsets of an IntSet.
SpaceStatus status(StatusStatistics &stat=unused_status)
Query space status.
int withInt
How many integer variables are used by the test.
int max(void) const
Return largest value of range.
Gecode toplevel namespace
Implication for reification.
int size(void) const
Return arity.
Range iterator for computing set difference.
#define CHECK_TEST(T, M)
Check the test result and handle failed test.
SetTest * test
The test currently run.
Space for executing set tests.
Iterate all subsets of a given set.
ReifyMode
Mode for reification.
void init(const Gecode::IntSet &s)
Initialize with set s.
Equivalence for reification (default)
int val(void) const
Return assigned value.