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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Matthias Balzer <matthias.balzer@itwm.fraunhofer.de>
*
* Copyright:
* 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>
#include <cstddef>
#include <tuple>
#include <utility>
/// reproduce C++-14 std::index_sequence
namespace { namespace cxx14 {
namespace detail {
template<std::size_t...>
struct sequence {};
template<std::size_t N, std::size_t... I>
struct make_sequence : make_sequence<N - 1, N - 1, I...> {};
template<std::size_t... I>
struct make_sequence<0, I...> {
using type = sequence<I...>;
};
}
template<std::size_t... I>
using index_sequence = detail::sequence<I...>;
template<typename... Ts>
using index_sequence_for = typename detail::make_sequence<sizeof...(Ts)>::type;
}}
namespace Gecode {
namespace {
/// Buffer for domain constraint arguments
template<typename... Args>
class DomArgs {
public:
/// Constructor
DomArgs(Args...);
protected:
/// Post reified domain constraint using the stored arguments
template<std::size_t... I>
void apply(Home, BoolVar, const IntPropLevels&,
cxx14::index_sequence<I...>);
private:
/// Storage for the arguments
std::tuple<Args...> _args;
};
/// Buffer for domain constraint arguments - partial specialization for IntVar
template<typename... Args>
class DomArgs<IntVar, Args...> {
public:
/// Constructor
DomArgs(IntVar, Args...);
protected:
/// Post reified domain constraint using stored arguments
template<std::size_t... I>
void apply(Home, BoolVar, const IntPropLevels&,
cxx14::index_sequence<I...>);
private:
/// Storage for the arguments
std::tuple<IntVar, Args...> _args;
};
/*
* Operations for argument buffer
*
*/
template<typename... Args>
DomArgs<Args...>::DomArgs(Args... args)
: _args(std::forward<Args>(args)...) {}
template<typename... Args>
template<std::size_t... I>
void
DomArgs<Args...>::apply(Home home, BoolVar b, const IntPropLevels&,
cxx14::index_sequence<I...>) {
dom(home, std::get<I>(_args)..., b);
}
template<typename... Args>
DomArgs<IntVar, Args...>::DomArgs(IntVar x, Args... args)
: _args (x, std::forward<Args>(args)...) {}
template<typename... Args>
template<std::size_t... I>
void
DomArgs<IntVar, Args...>::apply(Home home, BoolVar b,
const IntPropLevels&,
cxx14::index_sequence<I...>) {
dom(home, std::get<I>(_args)..., b);
}
/// Domain expression
template<typename... Args>
class DomExpr : public DomArgs<Args...>, public BoolExpr::Misc
{
public:
using DomArgs<Args...>::DomArgs;
/// Constrain \a b to be equivalent to the expression (negated if \a neg)
virtual void post(Home, BoolVar b, bool neg,
const IntPropLevels&) override;
/// Destructor
virtual ~DomExpr() = default;
};
template<typename... Args>
void
DomExpr<Args...>::post(Home home, BoolVar b, bool neg,
const IntPropLevels& ipls)
{
DomArgs<Args...>::apply(home, neg ? (!b).expr (home, ipls) : b, ipls,
cxx14::index_sequence_for<Args...>{});
}
}
/*
* Domain constraints
*
*/
BoolExpr
dom(const IntVar& x, int n) {
return BoolExpr(new DomExpr<IntVar, int>(x, n));
}
BoolExpr
dom(const IntVar& x, int l, int u) {
return BoolExpr(new DomExpr<IntVar, int, int>(x, l, u));
}
BoolExpr
dom(const IntVar& x, const IntSet& s) {
return BoolExpr(new DomExpr<IntVar, IntSet>(x, s));
}
#ifdef GECODE_HAS_SET_VARS
BoolExpr
dom(const SetVar& x, SetRelType rt, int i) {
return BoolExpr(new DomExpr<SetVar, SetRelType, int>(x, rt, i));
}
BoolExpr
dom(const SetVar& x, SetRelType rt, int i, int j) {
return BoolExpr(new DomExpr<SetVar, SetRelType, int, int>(x, rt, i, j));
}
BoolExpr
dom(const SetVar& x, SetRelType rt, const IntSet& s) {
return BoolExpr(new DomExpr<SetVar, SetRelType, IntSet>(x, rt, s));
}
#endif
#ifdef GECODE_HAS_FLOAT_VARS
BoolExpr
dom(const FloatVar& x, const FloatVal& n) {
return BoolExpr(new DomExpr<FloatVar, FloatVal>(x, n));
}
BoolExpr
dom(const FloatVar& x, FloatNum l, FloatNum u) {
return BoolExpr(new DomExpr<FloatVar, FloatNum, FloatNum>(x, l, u));
}
#endif
}
// STATISTICS: minimodel-any
|
