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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 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/set.hh"
using namespace Gecode;
namespace Test { namespace Set {
/// %Tests for relation constraints
namespace Rel {
/**
* \defgroup TaskTestSetRel Relation constraints
* \ingroup TaskTestSet
*/
//@{
static IntSet ds_33(-3,3);
static IntSet ds_03(0,3);
/// %Test for binary set relation constraint
class RelBin : public SetTest {
private:
Gecode::SetRelType srt;
bool shared;
public:
/// Create and register test
RelBin(Gecode::SetRelType srt0, bool shared0)
: SetTest("Rel::Bin::"+str(srt0)+"::S"+(shared0 ? "1":"0"),
shared0 ? 1 : 2,ds_33,true)
, srt(srt0), shared(shared0){}
int minSymDiff(const SetAssignment& x) const {
int x1 = shared ? x[0] : x[1];
typedef Iter::Ranges::Diff<CountableSetRanges,CountableSetRanges> Diff;
CountableSetRanges xr00(x.lub, x[0]);
CountableSetRanges xr10(x.lub, x1);
Diff a(xr00,xr10);
CountableSetRanges xr01(x.lub, x[0]);
CountableSetRanges xr11(x.lub, x1);
Diff b(xr11,xr01);
Iter::Ranges::Union<Diff,Diff> u(a,b);
return u() ? u.min() : Gecode::Set::Limits::max+1;
}
bool in(int i, CountableSetRanges& c, bool eq=false) const {
if (eq && i==Gecode::Set::Limits::max+1)
return true;
Iter::Ranges::Singleton s(i,i);
return Iter::Ranges::subset(s,c);
}
/// %Test whether \a x is solution
bool solution(const SetAssignment& x) const {
int x1 = shared ? x[0] : x[1];
CountableSetRanges xr0(x.lub, x[0]);
CountableSetRanges xr1(x.lub, x1);
switch (srt) {
case SRT_EQ: return Iter::Ranges::equal(xr0, xr1);
case SRT_NQ: return !Iter::Ranges::equal(xr0, xr1);
case SRT_LQ: return (!xr0()) || in(minSymDiff(x),xr1,true);
case SRT_LE: return xr0() ? in(minSymDiff(x),xr1) : xr1();
case SRT_GQ: return (!xr1()) || in(minSymDiff(x),xr0,true);
case SRT_GR: return xr1() ? in(minSymDiff(x),xr0) : xr0();
case SRT_SUB: return Iter::Ranges::subset(xr0, xr1);
case SRT_SUP: return Iter::Ranges::subset(xr1, xr0);
case SRT_DISJ:
{
Iter::Ranges::Inter<CountableSetRanges,CountableSetRanges>
inter(xr0,xr1);
return !inter();
}
case SRT_CMPL:
{
Gecode::Set::RangesCompl<CountableSetRanges> rc(xr0);
return Iter::Ranges::equal(rc,xr1);
}
default:
GECODE_NEVER;
}
GECODE_NEVER;
return false;
}
/// Post constraint on \a x
void post(Space& home, SetVarArray& x, IntVarArray&) {
if (!shared)
Gecode::rel(home, x[0], srt, x[1]);
else
Gecode::rel(home, x[0], srt, x[0]);
}
/// Post reified constraint on \a x for \a b
void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
if (!shared)
Gecode::rel(home, x[0], srt, x[1], r);
else
Gecode::rel(home, x[0], srt, x[0], r);
}
};
/// %Test for if-then-else-constraint
class ITE : public SetTest {
public:
/// Construct and register test
ITE(void)
: SetTest("ITE",3,ds_03,false,1) {}
/// Check whether \a x is a solution
virtual bool solution(const SetAssignment& x) const {
if ((x.intval() < 0) || (x.intval() > 1))
return false;
if (x.intval() == 1) {
CountableSetRanges xr0(x.lub, x[0]);
CountableSetRanges xr2(x.lub, x[2]);
return Iter::Ranges::equal(xr0,xr2);
} else {
CountableSetRanges xr1(x.lub, x[1]);
CountableSetRanges xr2(x.lub, x[2]);
return Iter::Ranges::equal(xr1,xr2);
}
}
/// Post constraint on \a x and \a y
void post(Space& home, SetVarArray& x, IntVarArray& y) {
Gecode::ite(home, Gecode::channel(home,y[0]), x[0], x[1], x[2]);
}
};
RelBin _relbin_eq(Gecode::SRT_EQ,false);
RelBin _relbin_lq(Gecode::SRT_LQ,false);
RelBin _relbin_le(Gecode::SRT_LE,false);
RelBin _relbin_gq(Gecode::SRT_GQ,false);
RelBin _relbin_gr(Gecode::SRT_GR,false);
RelBin _relbin_nq(Gecode::SRT_NQ,false);
RelBin _relbin_sub(Gecode::SRT_SUB,false);
RelBin _relbin_sup(Gecode::SRT_SUP,false);
RelBin _relbin_disj(Gecode::SRT_DISJ,false);
RelBin _relbin_cmpl(Gecode::SRT_CMPL,false);
RelBin _relbin_shared_eq(Gecode::SRT_EQ,true);
RelBin _relbin_shared_lq(Gecode::SRT_LQ,true);
RelBin _relbin_shared_le(Gecode::SRT_LE,true);
RelBin _relbin_shared_gq(Gecode::SRT_GQ,true);
RelBin _relbin_shared_gr(Gecode::SRT_GR,true);
RelBin _relbin_shared_nq(Gecode::SRT_NQ,true);
RelBin _relbin_shared_sub(Gecode::SRT_SUB,true);
RelBin _relbin_shared_sup(Gecode::SRT_SUP,true);
RelBin _relbin_shared_disj(Gecode::SRT_DISJ,true);
RelBin _relbin_shared_cmpl(Gecode::SRT_CMPL,true);
ITE _ite;
//@}
}}}
// STATISTICS: test-set
|
