Generated on Tue Mar 24 2020 14:04:04 for Gecode by doxygen 1.8.17
test_fzn_comparison.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Guido Tack <tack@gecode.org>
5  *
6  * Copyright:
7  * Guido Tack, 2014
8  *
9  * This file is part of Gecode, the generic constraint
10  * development environment:
11  * http://www.gecode.org
12  *
13  * Permission is hereby granted, free of charge, to any person obtaining
14  * a copy of this software and associated documentation files (the
15  * "Software"), to deal in the Software without restriction, including
16  * without limitation the rights to use, copy, modify, merge, publish,
17  * distribute, sublicense, and/or sell copies of the Software, and to
18  * permit persons to whom the Software is furnished to do so, subject to
19  * the following conditions:
20  *
21  * The above copyright notice and this permission notice shall be
22  * included in all copies or substantial portions of the Software.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31  *
32  */
33 
34 #include "test/flatzinc.hh"
35 
36 namespace Test { namespace FlatZinc {
37 
38  namespace {
40  class Create {
41  public:
42 
44  Create(void) {
45  (void) new FlatZincTest("fzn_comparison",
46 "var bool: b1;\n\
47 var bool: b2;\n\
48 var bool: b3;\n\
49 var bool: b4;\n\
50 var bool: b5;\n\
51 var bool: b6;\n\
52 \n\
53 var bool: rb1;\n\
54 var bool: rb2;\n\
55 var bool: rb3;\n\
56 var bool: rb4;\n\
57 var bool: rb5;\n\
58 var bool: rb6;\n\
59 \n\
60 var 1.0..10.0: f1;\n\
61 var 1.0..10.0: f2;\n\
62 var 1.0..10.0: f3;\n\
63 var 1.0..10.0: f4;\n\
64 var 1.0..10.0: f5;\n\
65 var 1.0..10.0: f6;\n\
66 \n\
67 var bool: rf1;\n\
68 var bool: rf2;\n\
69 var bool: rf3;\n\
70 var bool: rf4;\n\
71 var bool: rf5;\n\
72 var bool: rf6;\n\
73 \n\
74 var 1..10: i1;\n\
75 var 1..10: i2;\n\
76 var 1..10: i3;\n\
77 var 1..10: i4;\n\
78 var 1..10: i5;\n\
79 var 1..10: i6;\n\
80 \n\
81 var bool: ri1;\n\
82 var bool: ri2;\n\
83 var bool: ri3;\n\
84 var bool: ri4;\n\
85 var bool: ri5;\n\
86 var bool: ri6;\n\
87 \n\
88 array [1..3] of var 1.0..10.0: fa1;\n\
89 array [1..3] of var 1.0..10.0: fa2;\n\
90 array [1..3] of var 1.0..10.0: fa3;\n\
91 array [1..3] of var 1.0..10.0: fa4;\n\
92 array [1..3] of var 1.0..10.0: fa5;\n\
93 \n\
94 var bool: rfa1;\n\
95 var bool: rfa2;\n\
96 var bool: rfa3;\n\
97 var bool: rfa4;\n\
98 var bool: rfa5;\n\
99 \n\
100 array [1..3] of var 1..10: ia1;\n\
101 array [1..3] of var 1..10: ia2;\n\
102 array [1..3] of var 1..10: ia3;\n\
103 array [1..3] of var 1..10: ia4;\n\
104 array [1..3] of var 1..10: ia5;\n\
105 \n\
106 var bool: ria1;\n\
107 var bool: ria2;\n\
108 var bool: ria3;\n\
109 var bool: ria4;\n\
110 var bool: ria5;\n\
111 \n\
112 var set of 1..3: s1;\n\
113 var set of 1..3: s2;\n\
114 var set of 1..3: s3;\n\
115 var set of 1..3: s4;\n\
116 var set of 1..3: s5;\n\
117 var set of 1..3: s6;\n\
118 \n\
119 var bool: rs1;\n\
120 var bool: rs2;\n\
121 var bool: rs3;\n\
122 var bool: rs4;\n\
123 var bool: rs5;\n\
124 var bool: rs6;\n\
125 \n\
126 % int_{lt,le,eq,ne}\n\
127 \n\
128 constraint int_lt(2, 3);\n\
129 constraint int_lt(2, i1);\n\
130 constraint int_lt(i1, 9);\n\
131 \n\
132 constraint int_le(2, 3);\n\
133 constraint int_le(2, i2);\n\
134 constraint int_le(i2, 9);\n\
135 \n\
136 constraint int_le(2, i3);\n\
137 constraint int_le(i3, 9);\n\
138 \n\
139 constraint int_lt(2, i4);\n\
140 constraint int_lt(i4, 9);\n\
141 \n\
142 constraint int_eq(2, 2);\n\
143 constraint int_eq(2, i5);\n\
144 \n\
145 constraint int_ne(2, 3);\n\
146 constraint int_ne(1, i6);\n\
147 \n\
148 % int_{lt,le,eq,ne}_reif\n\
149 \n\
150 constraint int_lt_reif(2, 3, ri1);\n\
151 constraint int_lt_reif(2, i1, ri1);\n\
152 constraint int_lt_reif(i1, 9, ri1);\n\
153 \n\
154 constraint int_le_reif(2, 3, ri2);\n\
155 constraint int_le_reif(2, i2, ri2);\n\
156 constraint int_le_reif(i2, 9, ri2);\n\
157 \n\
158 constraint int_le_reif(2, 3, ri3);\n\
159 constraint int_le_reif(2, i3, ri3);\n\
160 constraint int_le_reif(i3, 9, ri3);\n\
161 \n\
162 constraint int_lt_reif(2, 3, ri4);\n\
163 constraint int_lt_reif(2, i4, ri4);\n\
164 constraint int_lt_reif(i4, 9, ri4);\n\
165 \n\
166 constraint int_eq_reif(2, 2, ri5);\n\
167 constraint int_eq_reif(2, i5, ri5);\n\
168 \n\
169 constraint int_ne_reif(2, 3, ri6);\n\
170 constraint int_ne_reif(1, i6, ri6);\n\
171 \n\
172 % float_{lt,le,ge,gt,eq,ne}\n\
173 \n\
174 % constraint float_lt(2.0, 3.0);\n\
175 % constraint float_lt(2.0, f1);\n\
176 % constraint float_lt(f1, 9.0);\n\
177 \n\
178 constraint float_le(2.0, 3.0);\n\
179 constraint float_le(2.0, f2);\n\
180 constraint float_le(f2, 9.0);\n\
181 \n\
182 constraint float_le(2.0, f3);\n\
183 constraint float_le(f3, 9.0);\n\
184 \n\
185 constraint float_eq(2.0, 2.0);\n\
186 constraint float_eq(2.0, f5);\n\
187 \n\
188 % constraint float_ne(2.0, 3.0);\n\
189 % constraint float_ne(2.0, f6);\n\
190 \n\
191 % float_{lt,le,eq,ne}_reif\n\
192 \n\
193 % constraint float_lt_reif(2.0, 3.0, rf1);\n\
194 % constraint float_lt_reif(2.0, f1, rf1);\n\
195 % constraint float_lt_reif(f1, 9.0, rf1);\n\
196 \n\
197 constraint float_le_reif(2.0, 3.0, rf2);\n\
198 constraint float_le_reif(2.0, f2, rf2);\n\
199 constraint float_le_reif(f2, 9.0, rf2);\n\
200 \n\
201 constraint float_le_reif(2.0, 3.0, rf3);\n\
202 constraint float_le_reif(2.0, f3, rf3);\n\
203 constraint float_le_reif(f3, 9.0, rf3);\n\
204 \n\
205 constraint float_eq_reif(2.0, 2.0, rf5);\n\
206 constraint float_eq_reif(2.0, f5, rf5);\n\
207 \n\
208 % constraint float_ne_reif(2.0, 3.0, rf6);\n\
209 % constraint float_ne_reif(2.0, f6, rf6);\n\
210 \n\
211 % set_{lt,le,gt,ge,eq,ne}\n\
212 \n\
213 constraint set_lt({}, {1, 2, 3});\n\
214 constraint set_lt({}, s1);\n\
215 constraint set_lt(s1, {1, 2, 3});\n\
216 \n\
217 constraint set_le({}, {1, 2, 3});\n\
218 constraint set_le({1}, s2);\n\
219 constraint set_le(s2, {1, 2, 3});\n\
220 \n\
221 constraint set_lt({}, {1, 2, 3});\n\
222 constraint set_lt({}, s3);\n\
223 constraint set_lt(s3, {1, 2, 3});\n\
224 \n\
225 constraint set_le({}, {1, 2, 3});\n\
226 constraint set_le({1}, s4);\n\
227 constraint set_le(s4, {1, 2, 3});\n\
228 \n\
229 constraint set_eq({1, 2, 3}, {1, 2, 3});\n\
230 constraint set_eq(s5, {1, 2, 3});\n\
231 \n\
232 constraint set_ne({}, {1, 2, 3});\n\
233 constraint set_ne(s6, {1, 2, 3});\n\
234 \n\
235 % int_lin_{lt,le,gt,ge,eq}\n\
236 \n\
237 % constraint int_lin_lt([1, 2, 3], [1, 2, 3], 100);\n\
238 % constraint int_lin_lt([1, 2, 3], ia1, 10);\n\
239 \n\
240 constraint int_lin_le([1, 2, 3], [1, 2, 3], 100);\n\
241 constraint int_lin_le([1, 2, 3], ia2, 10);\n\
242 \n\
243 % constraint int_lin_gt([1, 2, 3], [1, 2, 3], 10);\n\
244 % constraint int_lin_gt([1, 2, 3], ia3, 10);\n\
245 \n\
246 constraint int_lin_le([-1, -2, -3], [1, 2, 3], -10);\n\
247 constraint int_lin_le([-1, -2, -3], ia4, -10);\n\
248 \n\
249 constraint int_lin_eq([1, 2, 3], [1, 2, 3], 14);\n\
250 constraint int_lin_eq([1, 2, 3], ia5, 14);\n\
251 \n\
252 % int_lin_{lt,le,gt,ge,eq}_reif\n\
253 \n\
254 % constraint int_lin_lt_reif([1, 2, 3], [1, 2, 3], 100, ria1);\n\
255 % constraint int_lin_lt_reif([1, 2, 3], ia1, 10, ria1);\n\
256 \n\
257 constraint int_lin_le_reif([1, 2, 3], [1, 2, 3], 100, ria2);\n\
258 constraint int_lin_le_reif([1, 2, 3], ia2, 10, ria2);\n\
259 \n\
260 % constraint int_lin_gt_reif([1, 2, 3], [1, 2, 3], 10, ria3);\n\
261 % constraint int_lin_gt_reif([1, 2, 3], ia3, 10, ria3);\n\
262 \n\
263 constraint int_lin_le_reif([-1, -2, -3], [1, 2, 3], -10, ria4);\n\
264 constraint int_lin_le_reif([-1, -2, -3], ia4, -10, ria4);\n\
265 \n\
266 constraint int_lin_eq_reif([1, 2, 3], [1, 2, 3], 14, ria5);\n\
267 constraint int_lin_eq_reif([1, 2, 3], ia5, 14, ria5);\n\
268 \n\
269 solve satisfy;\n\
270 ",
271 "----------\n");
272  }
273  };
274 
275  Create c;
276  }
277 
278 }}
279 
280 // STATISTICS: test-flatzinc
General test support.
Definition: afc.cpp:39
Gecode::FloatVal c(-8, 8)