summaryrefslogtreecommitdiff
path: root/tests/BD_Shape/frombox1.cc
blob: db513bac8458d3190a99ac10aac6e7f7b7dec15c (plain)
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
/* Test BD_Shape::BD_Shape(const Box<Interval>&).
   Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
   Copyright (C) 2010-2011 BUGSENG srl (http://bugseng.com)

This file is part of the Parma Polyhedra Library (PPL).

The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.

The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.

For the most up-to-date information see the Parma Polyhedra Library
site: http://www.cs.unipr.it/ppl/ . */

#include "ppl_test.hh"

namespace {

// Universe box.
bool
test01() {
  Rational_Box box(2);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// A 2D box which is a line parallel to the x axis.
bool
test02() {
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(3*B == 2);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);
  known_bds.add_constraint(3*B == 2);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// A 2D box that is a point, with divisors.
bool
test03() {
  Variable A(0);
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(3*A == -2);
  box.add_constraint(B == -10);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);
  known_bds.add_constraint(3*A == -2);
  known_bds.add_constraint(B == -10);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");
  print_constraints(known_bds, "*** bds(box) ***");

  return ok;
}

// A 3D box which is a 2D plane.
bool
test04() {
  Variable A(0);
  Variable B(1);
  Variable C(2);

  Rational_Box box(3);
  box.add_constraint(5*C == 15);

  TBD_Shape bds(box);

  TBD_Shape known_bds(3);
  known_bds.add_constraint(5*C == 15);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// Zero-dimensional box.
bool
test05() {
  Rational_Box box(0);

  TBD_Shape bds(box);

  TBD_Shape known_bds;

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// Empty box in 2D.
bool
test06() {
  Rational_Box box(2);
  box.set_empty();

  TBD_Shape bds(box);

  TBD_Shape known_bds(2, EMPTY);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// A 4D box containing a single 3D space.
bool
test07() {
  Variable A(0);
  Variable B(1);
  Variable C(2);
  Variable D(3);

  Rational_Box box(4);
  box.add_constraint(D == 4);

  TBD_Shape bds(box);

  TBD_Shape known_bds(4);
  known_bds.add_constraint(D == 4);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// Unit square.
bool
test08() {
  Variable A(0);
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(A >= 0);
  box.add_constraint(A <= 1);
  box.add_constraint(B >= 0);
  box.add_constraint(B <= 1);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);
  known_bds.add_constraint(A >= 0);
  known_bds.add_constraint(A <= 1);
  known_bds.add_constraint(B >= 0);
  known_bds.add_constraint(B <= 1);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// Simple box with divisor and an interval bounded only from below.
bool
test09() {
  Variable A(0);
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(A >= 0);
  box.add_constraint(2*B == 1);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);
  known_bds.add_constraint(A >= 0);
  known_bds.add_constraint(2*B == 1);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// Box with a dimension bounded only from above.
bool
test10() {
  Variable A(0);
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(7*A <= 3);
  box.add_constraint(2*B == 1);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);
  known_bds.add_constraint(7*A <= 3);
  known_bds.add_constraint(2*B == 1);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// A box having a dimension with an open bound, where
// the open bound makes the box empty.
bool
test11() {
  Variable A(0);
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(7*A == 3);
  box.add_constraint(2*B >= 1);
  box.add_constraint(2*B <= 0);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2, EMPTY);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// Zero-dimensional empty box.
bool
test12() {
  Rational_Box box(0);
  box.set_empty();

  TBD_Shape bds(box);

  TBD_Shape known_bds(0, EMPTY);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// A box from a higher dimension.
bool
test13() {
  Variable A(0);
  Variable B(1);
  Variable C(2);
  Variable D(3);
  Variable E(4);
  Variable F(5);

  Rational_Box box(6);
  box.add_constraint(3*A == -2);
  box.add_constraint(4*B == -11);
  box.add_constraint(3*D == 18);
  box.add_constraint(7*E == 15);
  box.add_constraint(7*F == -15);

  TBD_Shape bds(box);

  TBD_Shape known_bds(6);
  known_bds.add_constraint(3*A == -2);
  known_bds.add_constraint(4*B == -11);
  known_bds.add_constraint(3*D == 18);
  known_bds.add_constraint(7*E == 15);
  known_bds.add_constraint(7*F == -15);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

// A box having a dimension with an open bound, where
// the open bound does not make the box empty.
bool
test14() {
  Variable A(0);
  Variable B(1);

  Rational_Box box(2);
  box.add_constraint(7*A == 3);
  box.add_constraint(2*B >= 1);
  box.add_constraint(B >= 1);

  TBD_Shape bds(box);

  TBD_Shape known_bds(2);
  known_bds.add_constraint(7*A == 3);
  known_bds.add_constraint(2*B >= 1);
  known_bds.add_constraint(B >= 1);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

bool
test15() {
  Variable A(0);

  Rational_Box box(1);
  box.add_constraint(A >= 5);
  box.add_constraint(A <= -5);

  TBD_Shape bds(box);

  TBD_Shape known_bds(1, EMPTY);

  bool ok = (bds == known_bds);

  print_constraints(bds, "*** bds(box) ***");

  return ok;
}

} // namespace

BEGIN_MAIN
  DO_TEST(test01);
  DO_TEST(test02);
  DO_TEST(test03);
  DO_TEST(test04);
  DO_TEST(test05);
  DO_TEST(test06);
  DO_TEST(test07);
  DO_TEST(test08);
  DO_TEST(test09);
  DO_TEST(test10);
  DO_TEST(test11);
  DO_TEST(test12);
  DO_TEST(test13);
  DO_TEST(test14);
  DO_TEST(test15);
END_MAIN