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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
*
* 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/int/element.hh>
namespace Gecode { namespace Int { namespace Element {
Actor*
Pair::copy(Space& home) {
return new (home) Pair(home,*this);
}
/// Value iterator for pair of iterators
template<class View>
class PairValues {
private:
/// View for x-values
View x;
/// Iterator for x-values
ViewValues<View> xv;
/// Iterator for y-values
ViewValues<View> yv;
/// Width
int w;
public:
/// \name Constructors and initialization
//@{
/// Initialize with views \a x and \a y and width \a w
PairValues(View x, View y, int w);
//@}
/// \name Iteration control
//@{
/// Test whether iterator is still at a value or done
bool operator ()(void) const;
/// Move iterator to next value (if possible)
void operator ++(void);
//@}
/// \name Value access
//@{
/// Return current value
int val(void) const;
//@}
};
template<class View>
forceinline
PairValues<View>::PairValues(View x0, View y0, int w0)
: x(x0), xv(x0), yv(y0), w(w0) {}
template<class View>
forceinline void
PairValues<View>::operator ++(void) {
++xv;
if (!xv()) {
xv.init(x); ++yv;
}
}
template<class View>
forceinline bool
PairValues<View>::operator ()(void) const {
return yv();
}
template<class View>
forceinline int
PairValues<View>::val(void) const {
return xv.val() + w*yv.val();
}
ExecStatus
Pair::propagate(Space& home, const ModEventDelta&) {
Region r;
if (x0.assigned()) {
// Bitset for supported div and mod values
Support::BitSet<Region> d(r,static_cast<unsigned int>((x2.max() / w)+1));
for (ViewValues<IntView> i(x2); i(); ++i) {
d.set(static_cast<unsigned int>(i.val() / w));
}
Iter::Values::BitSet<Support::BitSet<Region> > id(d,x1.min(),x1.max());
GECODE_ME_CHECK(x1.inter_v(home,id,false));
} else {
// Bitset for supported div and mod values
Support::BitSet<Region>
d(r,static_cast<unsigned int>((x2.max() / w)+1)),
m(r,static_cast<unsigned int>(w));
for (ViewValues<IntView> i(x2); i(); ++i) {
d.set(static_cast<unsigned int>(i.val() / w));
m.set(static_cast<unsigned int>(i.val() % w));
}
Iter::Values::BitSet<Support::BitSet<Region> > im(m,x0.min(),x0.max());
GECODE_ME_CHECK(x0.inter_v(home,im,false));
Iter::Values::BitSet<Support::BitSet<Region> > id(d,x1.min(),x1.max());
GECODE_ME_CHECK(x1.inter_v(home,id,false));
}
if (x0.assigned() && x1.assigned()) {
GECODE_ME_CHECK(x2.eq(home,x0.val()+w*x1.val()));
return home.ES_SUBSUMED(*this);
} else if (x1.assigned()) {
OffsetView x0x1w(x0,x1.val()*w);
GECODE_REWRITE(*this,(Rel::EqDom<OffsetView,IntView>
::post(home(*this),x0x1w,x2)));
}
PairValues<IntView> xy(x0,x1,w);
GECODE_ME_CHECK(x2.inter_v(home,xy,false));
if (x2.assigned()) {
GECODE_ME_CHECK(x0.eq(home,x2.val() % w));
GECODE_ME_CHECK(x1.eq(home,static_cast<int>(x2.val() / w)));
return home.ES_SUBSUMED(*this);
}
return ES_NOFIX;
}
Actor*
PairWithOffsets::copy(Space& home) {
return new (home) PairWithOffsets(home,*this);
}
ExecStatus
PairWithOffsets::propagate(Space& home, const ModEventDelta&) {
Region r;
if (x0.assigned()) {
// Bitset for supported div and mod values
Support::BitSet<Region> d(r,static_cast<unsigned int>((x2.max() / w)+1));
for (ViewValues<OffsetView> i(x2); i(); ++i) {
d.set(static_cast<unsigned int>(i.val() / w));
}
Iter::Values::BitSet<Support::BitSet<Region> > id(d,x1.min(),x1.max());
GECODE_ME_CHECK(x1.inter_v(home,id,false));
} else {
// Bitset for supported div and mod values
Support::BitSet<Region>
d(r,static_cast<unsigned int>((x2.max() / w)+1)),
m(r,static_cast<unsigned int>(w));
for (ViewValues<OffsetView> i(x2); i(); ++i) {
d.set(static_cast<unsigned int>(i.val() / w));
m.set(static_cast<unsigned int>(i.val() % w));
}
Iter::Values::BitSet<Support::BitSet<Region> > im(m,x0.min(),x0.max());
GECODE_ME_CHECK(x0.inter_v(home,im,false));
Iter::Values::BitSet<Support::BitSet<Region> > id(d,x1.min(),x1.max());
GECODE_ME_CHECK(x1.inter_v(home,id,false));
}
if (x0.assigned() && x1.assigned()) {
GECODE_ME_CHECK(x2.eq(home,x0.val()+w*x1.val()));
return home.ES_SUBSUMED(*this);
} else if (x1.assigned()) {
OffsetView x0x1w(x0.base(),x0.offset()+x1.val()*w);
GECODE_REWRITE(*this,(Rel::EqDom<OffsetView,OffsetView>
::post(home(*this),x0x1w,x2)));
}
PairValues<OffsetView> xy(x0,x1,w);
GECODE_ME_CHECK(x2.inter_v(home,xy,false));
if (x2.assigned()) {
GECODE_ME_CHECK(x0.eq(home,x2.val() % w));
GECODE_ME_CHECK(x1.eq(home,static_cast<int>(x2.val() / w)));
return home.ES_SUBSUMED(*this);
}
return ES_NOFIX;
}
}}}
// STATISTICS: int-prop
|
