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
209
210
211
212
213
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2012
*
* 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.
*
*/
namespace Gecode { namespace Int { namespace Branch {
// Minimum merit
template<class View>
forceinline
MeritMin<View>::MeritMin
(Space& home, const VarBranch<typename MeritMin<View>::Var>& vb)
: MeritBase<View,int>(home,vb) {}
template<class View>
forceinline
MeritMin<View>::MeritMin(Space& home, MeritMin& m)
: MeritBase<View,int>(home,m) {}
template<class View>
forceinline int
MeritMin<View>::operator ()(const Space&, View x, int) {
return x.min();
}
// Maximum merit
template<class View>
forceinline
MeritMax<View>::MeritMax
(Space& home, const VarBranch<typename MeritMax<View>::Var>& vb)
: MeritBase<View,int>(home,vb) {}
template<class View>
forceinline
MeritMax<View>::MeritMax(Space& home, MeritMax& m)
: MeritBase<View,int>(home,m) {}
template<class View>
forceinline int
MeritMax<View>::operator ()(const Space&, View x, int) {
return x.max();
}
// Size merit
template<class View>
forceinline
MeritSize<View>::MeritSize
(Space& home, const VarBranch<typename MeritSize<View>::Var>& vb)
: MeritBase<View,unsigned int>(home,vb) {}
template<class View>
forceinline
MeritSize<View>::MeritSize(Space& home, MeritSize& m)
: MeritBase<View,unsigned int>(home,m) {}
template<class View>
forceinline unsigned int
MeritSize<View>::operator ()(const Space&, View x, int) {
return x.size();
}
// Degree over size merit
template<class View>
forceinline
MeritDegreeSize<View>::MeritDegreeSize
(Space& home, const VarBranch<typename MeritDegreeSize<View>::Var>& vb)
: MeritBase<View,double>(home,vb) {}
template<class View>
forceinline
MeritDegreeSize<View>::MeritDegreeSize(Space& home, MeritDegreeSize& m)
: MeritBase<View,double>(home,m) {}
template<class View>
forceinline double
MeritDegreeSize<View>::operator ()(const Space&, View x, int) {
return static_cast<double>(x.degree()) / static_cast<double>(x.size());
}
// AFC over size merit
template<class View>
forceinline
MeritAFCSize<View>::MeritAFCSize
(Space& home, const VarBranch<typename MeritAFCSize<View>::Var>& vb)
: MeritBase<View,double>(home,vb), afc(vb.afc()) {}
template<class View>
forceinline
MeritAFCSize<View>::MeritAFCSize(Space& home, MeritAFCSize& m)
: MeritBase<View,double>(home,m), afc(m.afc) {}
template<class View>
forceinline double
MeritAFCSize<View>::operator ()(const Space&, View x, int) {
return x.afc() / static_cast<double>(x.size());
}
template<class View>
forceinline bool
MeritAFCSize<View>::notice(void) const {
return false;
}
template<class View>
forceinline void
MeritAFCSize<View>::dispose(Space&) {
// Not needed
afc.~AFC();
}
// Action over size merit
template<class View>
forceinline
MeritActionSize<View>::MeritActionSize
(Space& home, const VarBranch<typename MeritActionSize<View>::Var>& vb)
: MeritBase<View,double>(home,vb), action(vb.action()) {}
template<class View>
forceinline
MeritActionSize<View>::MeritActionSize(Space& home, MeritActionSize& m)
: MeritBase<View,double>(home,m), action(m.action) {}
template<class View>
forceinline double
MeritActionSize<View>::operator ()(const Space&, View x, int i) {
return action[i] / static_cast<double>(x.size());
}
template<class View>
forceinline bool
MeritActionSize<View>::notice(void) const {
return true;
}
template<class View>
forceinline void
MeritActionSize<View>::dispose(Space&) {
action.~Action();
}
// CHB over size merit
template<class View>
forceinline
MeritCHBSize<View>::MeritCHBSize
(Space& home, const VarBranch<typename MeritCHBSize<View>::Var>& vb)
: MeritBase<View,double>(home,vb), chb(vb.chb()) {}
template<class View>
forceinline
MeritCHBSize<View>::MeritCHBSize(Space& home, MeritCHBSize& m)
: MeritBase<View,double>(home,m), chb(m.chb) {}
template<class View>
forceinline double
MeritCHBSize<View>::operator ()(const Space&, View x, int i) {
return chb[i] / static_cast<double>(x.size());
}
template<class View>
forceinline bool
MeritCHBSize<View>::notice(void) const {
return true;
}
template<class View>
forceinline void
MeritCHBSize<View>::dispose(Space&) {
chb.~CHB();
}
// Minimum regret merit
template<class View>
forceinline
MeritRegretMin<View>::MeritRegretMin
(Space& home, const VarBranch<typename MeritRegretMin<View>::Var>& vb)
: MeritBase<View,unsigned int>(home,vb) {}
template<class View>
forceinline
MeritRegretMin<View>::MeritRegretMin(Space& home, MeritRegretMin& m)
: MeritBase<View,unsigned int>(home,m) {}
template<class View>
forceinline unsigned int
MeritRegretMin<View>::operator ()(const Space&, View x, int) {
return x.regret_min();
}
// Maximum regret merit
template<class View>
forceinline
MeritRegretMax<View>::MeritRegretMax
(Space& home, const VarBranch<typename MeritRegretMax<View>::Var>& vb)
: MeritBase<View,unsigned int>(home,vb) {}
template<class View>
forceinline
MeritRegretMax<View>::MeritRegretMax(Space& home, MeritRegretMax& m)
: MeritBase<View,unsigned int>(home,m) {}
template<class View>
forceinline unsigned int
MeritRegretMax<View>::operator ()(const Space&, View x, int) {
return x.regret_max();
}
}}}
// STATISTICS: int-branch
|
