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
|
/* Test Polyhedron::minimized_constraints().
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"
#include <algorithm>
namespace {
bool
test01() {
NNC_Polyhedron ph1;
Constraint_System cs = ph1.minimized_constraints();
NNC_Polyhedron ph2(cs);
const Constraint_System& min_cs = ph2.minimized_constraints();
bool ok = (ph1 == ph2
&& min_cs.begin() == min_cs.end());
print_constraints(ph1, "*** ph1 ***");
print_constraints(cs, "*** cs ***");
print_constraints(ph2, "*** ph2 ***");
return ok;
}
bool
test02() {
Variable x(0);
Variable y(1);
Constraint_System cs;
cs.insert(x >= 0);
cs.insert(x < 1);
cs.insert(y > 0);
NNC_Polyhedron ph(cs);
const Constraint_System& min_cs = ph.minimized_constraints();
return std::distance(min_cs.begin(), min_cs.end()) == 3;
}
} // namespace
BEGIN_MAIN
DO_TEST(test01);
DO_TEST(test02);
END_MAIN
|
