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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Mikael Lagerkvist <lagerkvist@gecode.org>
*
* Copyright:
* Mikael Lagerkvist, 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/int/cumulatives.hh>
namespace Gecode {
using namespace Int;
namespace {
ViewArray<IntView>
make_view_array(Space& home, const IntVarArgs& in) {
return ViewArray<Int::IntView>(home, in);
}
ViewArray<ConstIntView>
make_view_array(Space& home, const IntArgs& in) {
ViewArray<Int::ConstIntView> res(home, in.size());
for (int i=0; i<in.size(); i++) {
Int::Limits::check(in[i],"Int::cumulatives");
res[i] = Int::ConstIntView(in[i]);
}
return res;
}
template<class In> class ViewType;
template<>
class ViewType<IntArgs> {
public:
typedef Int::ConstIntView Result;
};
template<>
class ViewType<IntVarArgs> {
public:
typedef Int::IntView Result;
};
template<class Machine, class Processing, class Usage>
void
post_cumulatives(Home home, const Machine& m,
const IntVarArgs& s, const Processing& p,
const IntVarArgs& e, const Usage& u,
const IntArgs& c, bool at_most,
IntPropLevel) {
if (m.size() != s.size() ||
s.size() != p.size() ||
p.size() != e.size() ||
e.size() != u.size())
throw Int::ArgumentSizeMismatch("Int::cumulatives");
GECODE_POST;
ViewArray<typename ViewType<Machine>::Result>
vm = make_view_array(home, m);
ViewArray<typename ViewType<Processing>::Result>
vp = make_view_array(home, p);
ViewArray<typename ViewType<Usage>::Result>
vu = make_view_array(home, u);
ViewArray<IntView>
vs = make_view_array(home, s),
ve = make_view_array(home, e);
SharedArray<int> c_s(c.size());
for (int i=0; i<c.size(); i++)
c_s[i] = c[i];
// There is only the value-consistent propagator for this constraint
GECODE_ES_FAIL((Int::Cumulatives::Val<
typename ViewType<Machine>::Result,
typename ViewType<Processing>::Result,
typename ViewType<Usage>::Result,
IntView>::post(home, vm,vs,vp,ve,vu,c_s,at_most)));
}
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
}
// STATISTICS: int-post
|
