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
|
/* -*- 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>
namespace Test { namespace Float {
/// %Tests for relation constraints
namespace Rel {
/**
* \defgroup TaskTestFloatRel Relation constraints
* \ingroup TaskTestFloat
*/
//@{
/// %Test for simple relation involving float variables
class FloatVarXY : public Test {
protected:
/// Float relation type to propagate
Gecode::FloatRelType frt;
public:
/// Create and register test
FloatVarXY(Gecode::FloatRelType frt0, int n, Gecode::FloatNum st)
: Test("Rel::Float::Var::XY::"+str(frt0)+"::"+str(n),
n+1,-3,3,st,CPLT_ASSIGNMENT,n==1),
frt(frt0) {
testsubsumed = false;
}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (x.size() == 2) {
return cmp(x[0],frt,x[1]);
} else {
MaybeType r1 = cmp(x[0],frt,x[2]);
MaybeType r2 = cmp(x[1],frt,x[2]);
if ((r1 == MT_TRUE) && (r2 == MT_TRUE)) return MT_TRUE;
else if ((r1 == MT_FALSE) || (r2 == MT_FALSE)) return MT_FALSE;
else return MT_MAYBE;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
using namespace Gecode;
if (x.size() == 2) {
rel(home, x[0], frt, x[1]);
} else {
FloatVarArgs y(2);
y[0]=x[0]; y[1]=x[1];
rel(home, y, frt, x[2]);
}
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x,
Gecode::Reify r) {
assert(x.size() == 2);
Gecode::rel(home, x[0], frt, x[1], r);
}
};
/// %Test for simple relation involving shared float variables
class FloatVarXX : public Test {
protected:
/// Float relation type to propagate
Gecode::FloatRelType frt;
public:
/// Create and register test
FloatVarXX(Gecode::FloatRelType frt0, Gecode::FloatNum st)
: Test("Rel::Float::Var::XX::"+str(frt0),
1,-3,3,st,CPLT_ASSIGNMENT,true),
frt(frt0) {
testsubsumed = false;
}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return cmp(x[0],frt,x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::rel(home, x[0], frt, x[0]);
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x,
Gecode::Reify r) {
Gecode::rel(home, x[0], frt, x[0], r);
}
};
/// %Test for simple relation involving float variable and float constant
class FloatFloat : public Test {
protected:
/// Float relation type to propagate
Gecode::FloatRelType frt;
/// Float constant
Gecode::FloatVal c;
public:
/// Create and register test
FloatFloat(Gecode::FloatRelType frt0, int n, Gecode::FloatNum c0,
Gecode::FloatNum st)
: Test("Rel::Float::Float::"+str(frt0)+"::"+str(n)+"::"+str(c0),
n,-3,3,st,CPLT_ASSIGNMENT,n==1),
frt(frt0), c(c0) {
testsubsumed = false;
}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if (x.size() == 1) {
return cmp(x[0],frt,c);
} else {
return cmp(x[0],frt,c) & cmp(x[1],frt,c);
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
using namespace Gecode;
if (x.size() == 1)
rel(home, x[0], frt, c);
else
rel(home, x, frt, c);
}
/// Post reified constraint on \a x for \a r
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x,
Gecode::Reify r) {
assert(x.size() == 1);
Gecode::rel(home, x[0], frt, c, r);
}
};
/// Help class to create and register tests
class Create {
public:
/// Perform creation and registration
Create(void) {
using namespace Gecode;
Gecode::FloatNum step = 0.7;
for (FloatRelTypes frts; frts(); ++frts) {
(void) new FloatVarXY(frts.frt(),1,step);
(void) new FloatVarXY(frts.frt(),2,step);
(void) new FloatVarXX(frts.frt(),step);
for (int c=-4; c<=4; c++) {
(void) new FloatFloat(frts.frt(),1,c,step);
(void) new FloatFloat(frts.frt(),2,c,step);
}
}
}
};
Create c;
//@}
}
}}
// STATISTICS: test-float
|
