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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Matthias Balzer <matthias.balzer@itwm.fraunhofer.de>
*
* Copyright:
* Christian Schulte, 2005
* Fraunhofer ITWM, 2017
*
* 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>
#ifdef GECODE_HAS_SET_VARS
namespace Gecode {
/*
* Operators
*
*/
SetRel
operator ==(const SetExpr& e0, const SetExpr& e1) {
return SetRel(e0, SRT_EQ, e1);
}
SetRel
operator !=(const SetExpr& e0, const SetExpr& e1) {
return SetRel(e0, SRT_NQ, e1);
}
SetCmpRel
operator <=(const SetExpr& e0, const SetExpr& e1) {
return SetCmpRel(e0, SRT_SUB, e1);
}
BoolExpr
operator <=(const SetCmpRel& r, const SetExpr& l) {
return BoolExpr(r) && BoolExpr(r.r <= l);
}
SetCmpRel
operator >=(const SetExpr& e0, const SetExpr& e1) {
return SetCmpRel(e0, SRT_SUP, e1);
}
BoolExpr
operator >=(const SetCmpRel& r, const SetExpr& l) {
return BoolExpr(r) && BoolExpr(r.r >= l);
}
SetRel
operator ||(const SetExpr& e0, const SetExpr& e1) {
return SetRel(e0, SRT_DISJ, e1);
}
namespace {
/// Boolean expression for IRT relations with SetExpr
class SetIRTRel : public BoolExpr::Misc {
/// The set expression
SetExpr _s;
/// The integer expression
LinIntExpr _x;
/// The integer relation type
IntRelType _irt;
public:
/// Constructor
SetIRTRel(const SetExpr&, IntRelType, const LinIntExpr&);
/// Constrain \a b to be equivalent to the expression (negated if \a neg)
virtual void post(Home, BoolVar b, bool neg,
const IntPropLevels&) override;
};
SetIRTRel::SetIRTRel(const SetExpr& s, IntRelType irt, const LinIntExpr& x)
: _s(s), _x(x), _irt(irt) {}
void
SetIRTRel::post(Home home, BoolVar b, bool neg,
const IntPropLevels& ipls) {
if (b.zero()) {
rel(home, _s.post(home), neg ? _irt : Gecode::neg(_irt),
_x.post(home, ipls));
} else if (b.one()) {
rel(home, _s.post(home), neg ? Gecode::neg(_irt) : _irt,
_x.post(home, ipls));
} else {
rel(home, _s.post(home), neg ? Gecode::neg(_irt) : _irt,
_x.post(home, ipls), b);
}
}
}
/*
* IRT relations with SetExpr
*
*/
BoolExpr
operator ==(const SetExpr& x, const LinIntExpr& y) {
return BoolExpr(new SetIRTRel(x, IRT_EQ, y));
}
BoolExpr
operator ==(const LinIntExpr& x, const SetExpr& y) {
return operator ==(y, x);
}
BoolExpr
operator !=(const SetExpr& x, const LinIntExpr& y) {
return BoolExpr(new SetIRTRel(x, IRT_NQ, y));
}
BoolExpr
operator !=(const LinIntExpr& x, const SetExpr& y) {
return operator !=(y, x);
}
BoolExpr
operator <=(const SetExpr& x, const LinIntExpr& y) {
return BoolExpr(new SetIRTRel(x, IRT_LQ, y));
}
BoolExpr
operator <=(const LinIntExpr& x, const SetExpr& y) {
return operator >=(y, x);
}
BoolExpr
operator <(const SetExpr& x, const LinIntExpr& y) {
return BoolExpr(new SetIRTRel(x, IRT_LE, y));
}
BoolExpr
operator <(const LinIntExpr& x, const SetExpr& y) {
return operator >(y, x);
}
BoolExpr
operator >=(const SetExpr& x, const LinIntExpr& y) {
return BoolExpr(new SetIRTRel(x, IRT_GQ, y));
}
BoolExpr
operator >=(const LinIntExpr& x, const SetExpr& y) {
return operator <=(y, x);
}
BoolExpr
operator >(const SetExpr& x, const LinIntExpr& y) {
return BoolExpr(new SetIRTRel(x, IRT_GR, y));
}
BoolExpr
operator >(const LinIntExpr& x, const SetExpr& y) {
return operator <(y, x);
}
}
#endif
// STATISTICS: minimodel-any
|
