1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2005
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#include <gecode/minimodel.hh>
#include "test/int.hh"
namespace Test { namespace Int {
/// %Tests for domain constraints
namespace Dom {
/**
* \defgroup TaskTestIntDom Domain constraints
* \ingroup TaskTestInt
*/
//@{
/// %Test for domain constraint (integer)
class DomInt : public Test {
public:
/// Create and register test
DomInt(int n)
: Test("Dom::Int::"+str(n),n,-4,4,n == 1,
Gecode::IPL_DOM) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
for (int i=x.size(); i--; )
if (x[i] != -2)
return false;
return true;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
if (x.size() == 1)
Gecode::dom(home, x[0], -2);
else
Gecode::dom(home, x, -2);
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
Gecode::Reify r) {
assert(x.size() == 1);
if (_rand(2) != 0) {
Gecode::dom(home, x[0], -2, r);
} else {
switch (r.mode()) {
case Gecode::RM_EQV:
Gecode::rel(home, Gecode::dom(x[0], -2) == r.var()); break;
case Gecode::RM_IMP:
Gecode::rel(home, Gecode::dom(x[0], -2) << r.var()); break;
case Gecode::RM_PMI:
Gecode::rel(home, Gecode::dom(x[0], -2) >> r.var()); break;
default: GECODE_NEVER;
}
}
}
};
/// %Test for domain constraint (range)
class DomRange : public Test {
public:
/// Create and register test
DomRange(int n)
: Test("Dom::Range::"+str(n),n,-4,4,n == 1,
Gecode::IPL_DOM) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
for (int i=x.size(); i--; )
if ((x[i] < -2) || (x[i] > 2))
return false;
return true;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
if (x.size() == 1)
Gecode::dom(home, x[0], -2, 2);
else
Gecode::dom(home, x, -2, 2);
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
Gecode::Reify r) {
assert(x.size() == 1);
if (_rand(2) != 0) {
Gecode::dom(home, x[0], -2, 2, r);
} else {
switch (r.mode()) {
case Gecode::RM_EQV:
Gecode::rel(home, Gecode::dom(x[0], -2, 2) == r.var()); break;
case Gecode::RM_IMP:
Gecode::rel(home, Gecode::dom(x[0], -2, 2) << r.var()); break;
case Gecode::RM_PMI:
Gecode::rel(home, Gecode::dom(x[0], -2, 2) >> r.var()); break;
default: GECODE_NEVER;
}
}
}
};
/// %Test for domain constraint (empty range)
class DomRangeEmpty : public Test {
public:
/// Create and register test
DomRangeEmpty(void) : Test("Dom::Range::Empty",1,-4,4,true) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment&) const {
return false;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray&) {
home.fail();
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
Gecode::Reify r) {
Gecode::dom(home, x[0], 3, 2, r);
}
};
const int r[4][2] = {
{-4,-3},{-1,-1},{1,1},{3,5}
};
Gecode::IntSet d(r,4);
/// %Test for domain constraint (full integer set)
class DomDom : public Test {
public:
/// Create and register test
DomDom(int n)
: Test("Dom::Dom::"+str(n),n,-6,6,n == 1,
Gecode::IPL_DOM) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
for (int i=x.size(); i--; )
if (!(((x[i] >= -4) && (x[i] <= -3)) ||
((x[i] >= -1) && (x[i] <= -1)) ||
((x[i] >= 1) && (x[i] <= 1)) ||
((x[i] >= 3) && (x[i] <= 5))))
return false;
return true;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
if (x.size() == 1)
Gecode::dom(home, x[0], d);
else
Gecode::dom(home, x, d);
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
Gecode::Reify r) {
assert(x.size() == 1);
if (_rand(2) != 0) {
Gecode::dom(home, x[0], d, r);
} else {
switch (r.mode()) {
case Gecode::RM_EQV:
Gecode::rel(home, Gecode::dom(x[0], d) == r.var()); break;
case Gecode::RM_IMP:
Gecode::rel(home, Gecode::dom(x[0], d) << r.var()); break;
case Gecode::RM_PMI:
Gecode::rel(home, Gecode::dom(x[0], d) >> r.var()); break;
default: GECODE_NEVER;
}
}
}
};
DomInt di1(1);
DomInt di3(3);
DomRange dr1(1);
DomRange dr3(3);
DomDom dd1(1);
DomDom dd3(3);
DomRangeEmpty dre;
//@}
}
}}
// STATISTICS: test-int
|
