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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Vincent Barichard <Vincent.Barichard@univ-angers.fr>
*
* Copyright:
* Christian Schulte, 2005
* Vincent Barichard, 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.
*
*/
#include "test/float.hh"
#include <gecode/minimodel.hh>
#ifdef GECODE_HAS_MPFR
#include <cmath>
#include <algorithm>
namespace Test { namespace Float {
/// %Tests for transcendental constraints
namespace Transcendental {
/// %Test for exponent constraint
class ExpXY : public Test {
public:
/// Create and register test
ExpXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Transcendental::Exp::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(exp(x[0]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::exp(home, x[0], x[1]);
else
Gecode::rel(home, exp(x[0]) == x[1]);
}
};
/// %Test for exponent constraint where solution is ensured
class ExpXYSol : public Test {
public:
/// Create and register test
ExpXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Transcendental::Exp::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(exp(x[0]), x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = exp(x[0]);
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::exp(home, x[0], x[1]);
}
};
/// %Test for exponent constraint with shared variables
class ExpXX : public Test {
public:
/// Create and register test
ExpXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Transcendental::Exp::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(exp(x[0]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::exp(home, x[0], x[0]);
}
};
/// %Test for logarithm constraint
class LogXY : public Test {
public:
/// Create and register test
LogXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Transcendental::Log::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (x[0].max() < 0.0)
return MT_FALSE;
return eq(log(x[0]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::log(home, x[0], x[1]);
else
Gecode::rel(home, log(x[0]) == x[1]);
}
};
/// %Test for logarithm constraint where solution is ensured
class LogXYSol : public Test {
public:
/// Create and register test
LogXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Transcendental::Log::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (x[0].max() < 0.0)
return MT_FALSE;
return eq(log(x[0]), x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
if (x[0].max() < 0.0) return false;
Gecode::FloatVal d = log(x[0]);
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::log(home, x[0], x[1]);
}
};
/// %Test for logarithm constraint with shared variables
class LogXX : public Test {
public:
/// Create and register test
LogXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Transcendental::Log::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (x[0].max() < 0.0)
return MT_FALSE;
return eq(log(x[0]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::log(home, x[0], x[0]);
}
};
/// %Test for logarithm base n constraint
class LogNXY : public Test {
Gecode::FloatNum base;
public:
/// Create and register test
LogNXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum _base, Gecode::FloatNum st)
: Test("Transcendental::Log::N::"+str(_base)+"::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false), base(_base) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((x[0].max() <= 0.0) || (base <= 0.0))
return MT_FALSE;
return eq(log(x[0]) / log(base), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::log(home, base, x[0], x[1]);
}
};
/// %Test for logarithm base n constraint where solution is ensured
class LogNXYSol : public Test {
Gecode::FloatNum base;
public:
/// Create and register test
LogNXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum _base, Gecode::FloatNum st)
: Test("Transcendental::Log::N::"+str(_base)+"::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false), base(_base) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((x[0].max() <= 0.0) || (base <= 0.0))
return MT_FALSE;
return eq(log(x[0]) / log(base), x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
if ((x[0].max() <= 0.0) || (base <= 0.0))
return false;
Gecode::FloatVal d = log(x[0])/log(base);
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::log(home, base, x[0], x[1]);
}
};
/// %Test for logarithm base n constraint with shared variables
class LogNXX : public Test {
Gecode::FloatNum base;
public:
/// Create and register test
LogNXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum _base, Gecode::FloatNum st)
: Test("Transcendental::Log::N::"+str(_base)+"::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false), base(_base) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((x[0].max() <= 0.0) || (base <= 0.0))
return MT_FALSE;
return eq(log(x[0]) / log(base), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::log(home, base, x[0], x[0]);
}
};
/// %Test for pow exponent n constraint
class PowXY : public Test {
Gecode::FloatNum base;
public:
/// Create and register test
PowXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum _base, Gecode::FloatNum st)
: Test("Transcendental::Pow::N::"+str(_base)+"::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false), base(_base) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (base <= 0.0)
return MT_FALSE;
return eq(exp(x[0] * log(base)), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::pow(home, base, x[0], x[1]);
}
};
/// %Test for pow exponent n constraint where solution is ensured
class PowXYSol : public Test {
Gecode::FloatNum base;
public:
/// Create and register test
PowXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum _base, Gecode::FloatNum st)
: Test("Transcendental::Pow::N::"+str(_base)+"::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false), base(_base) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (base <= 0.0)
return MT_FALSE;
return eq(exp(x[0] * log(base)), x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
if (base <= 0.0) return false;
Gecode::FloatVal d = exp(x[0]*log(base));
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::pow(home, base, x[0], x[1]);
}
};
/// %Test for pow exponent n constraint with shared variables
class PowXX : public Test {
Gecode::FloatNum base;
public:
/// Create and register test
PowXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum _base, Gecode::FloatNum st)
: Test("Transcendental::Pow::N::"+str(_base)+"::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false), base(_base) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((x[0].max() <= 0.0) || (base <= 0.0))
return MT_FALSE;
return eq(exp(x[0] * log(base)), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::pow(home, base, x[0], x[0]);
}
};
const Gecode::FloatNum step = 0.15;
Gecode::FloatVal a(-8,5);
Gecode::FloatVal b(9,12);
Gecode::FloatVal c(-8,8);
ExpXY exp_xy_a("A",a,step);
ExpXY exp_xy_b("B",b,step);
ExpXY exp_xy_c("C",c,step);
ExpXYSol exp_xy_sol_a("A",a,step);
ExpXYSol exp_xy_sol_b("B",b,step);
ExpXYSol exp_xy_sol_c("C",c,step);
ExpXX exp_xx_a("A",a,step);
ExpXX exp_xx_b("B",b,step);
ExpXX exp_xx_c("C",c,step);
LogXY log_xy_a("A",a,step);
LogXY log_xy_b("B",b,step);
LogXY log_xy_c("C",c,step);
LogXYSol log_xy_sol_a("A",a,step);
LogXYSol log_xy_sol_b("B",b,step);
LogXYSol log_xy_sol_c("C",c,step);
LogXX log_xx_a("A",a,step);
LogXX log_xx_b("B",b,step);
LogXX log_xx_c("C",c,step);
LogNXY logn_xy_a_1("A",a,-1.5,step);
LogNXY logn_xy_b_1("B",b,-1.5,step);
LogNXY logn_xy_c_1("C",c,-1.5,step);
LogNXYSol logn_xy_sol_a_1("A",a,-1.5,step);
LogNXYSol logn_xy_sol_b_1("B",b,-1.5,step);
LogNXYSol logn_xy_sol_c_1("C",c,-1.5,step);
LogNXX logn_xx_a_1("A",a,-1.5,step);
LogNXX logn_xx_b_1("B",b,-1.5,step);
LogNXX logn_xx_c_1("C",c,-1.5,step);
LogNXY logn_xy_a_2("A",a,1.5,step);
LogNXY logn_xy_b_2("B",b,1.5,step);
LogNXY logn_xy_c_2("C",c,1.5,step);
LogNXYSol logn_xy_sol_a_2("A",a,1.5,step);
LogNXYSol logn_xy_sol_b_2("B",b,1.5,step);
LogNXYSol logn_xy_sol_c_2("C",c,1.5,step);
LogNXX logn_xx_a_2("A",a,1.5,step);
LogNXX logn_xx_b_2("B",b,1.5,step);
LogNXX logn_xx_c_2("C",c,1.5,step);
LogNXY logn_xy_a_3("A",a,0,step);
LogNXY logn_xy_b_3("B",b,0,step);
LogNXY logn_xy_c_3("C",c,0,step);
LogNXYSol logn_xy_sol_a_3("A",a,0,step);
LogNXYSol logn_xy_sol_b_3("B",b,0,step);
LogNXYSol logn_xy_sol_c_3("C",c,0,step);
LogNXX logn_xx_a_3("A",a,0,step);
LogNXX logn_xx_b_3("B",b,0,step);
LogNXX logn_xx_c_3("C",c,0,step);
PowXY pow_xy_a_1("A",a,-1.5,step);
PowXY pow_xy_b_1("B",b,-1.5,step);
PowXY pow_xy_c_1("C",c,-1.5,step);
PowXYSol pow_xy_sol_a_1("A",a,-1.5,step);
PowXYSol pow_xy_sol_b_1("B",b,-1.5,step);
PowXYSol pow_xy_sol_c_1("C",c,-1.5,step);
PowXX pow_xx_a_1("A",a,-1.5,step);
PowXX pow_xx_b_1("B",b,-1.5,step);
PowXX pow_xx_c_1("C",c,-1.5,step);
PowXY pow_xy_a_2("A",a,1.5,step);
PowXY pow_xy_b_2("B",b,1.5,step);
PowXY pow_xy_c_2("C",c,1.5,step);
PowXYSol pow_xy_sol_a_2("A",a,1.5,step);
PowXYSol pow_xy_sol_b_2("B",b,1.5,step);
PowXYSol pow_xy_sol_c_2("C",c,1.5,step);
PowXX pow_xx_a_2("A",a,1.5,step);
PowXX pow_xx_b_2("B",b,1.5,step);
PowXX pow_xx_c_2("C",c,1.5,step);
PowXY pow_xy_a_3("A",a,0,step);
PowXY pow_xy_b_3("B",b,0,step);
PowXY pow_xy_c_3("C",c,0,step);
PowXYSol pow_xy_sol_a_3("A",a,0,step);
PowXYSol pow_xy_sol_b_3("B",b,0,step);
PowXYSol pow_xy_sol_c_3("C",c,0,step);
PowXX pow_xx_a_3("A",a,0,step);
PowXX pow_xx_b_3("B",b,0,step);
PowXX pow_xx_c_3("C",c,0,step);
//@}
}
}}
#endif
// STATISTICS: test-float
|
