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
|
/* Test Polyhedron::refine_with_constraint().
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 {
bool
test01() {
Variable A(0);
Variable B(1);
NNC_Polyhedron ph1(2);
ph1.refine_with_constraint(A > 0);
ph1.refine_with_constraint(B == 5);
ph1.refine_with_constraint(A + B < 6);
print_constraints(ph1, "*** ph1 ***");
C_Polyhedron ph2(2);
for (Constraint_System::const_iterator i = ph1.constraints().begin(),
cs_end = ph1.constraints().end(); i != cs_end; ++i)
ph2.refine_with_constraint(*i);
C_Polyhedron known_result(2);
known_result.add_constraint(A >= 0);
known_result.add_constraint(B == 5);
known_result.add_constraint(A <= 1);
bool ok = (ph2 == known_result);
print_constraints(ph2, "*** ph2 ***");
return ok;
}
bool
test02() {
Variable A(0);
Variable B(1);
C_Polyhedron ph(2, EMPTY);
print_constraints(ph, "*** ph ***");
C_Polyhedron known_result(ph);
ph.refine_with_constraint(A == B);
bool ok = (ph == known_result);
print_constraints(ph, "*** after ph.refine_with_constraint(A == B) ***");
return ok;
}
bool
test03() {
Variable A(0);
Variable B(1);
C_Polyhedron ph(2);
ph.refine_with_constraint(A >= 0);
ph.refine_with_constraint(A <= 2);
ph.refine_with_constraint(A >= -1);
print_constraints(ph, "*** ph ***");
ph.refine_with_constraint(B > 1);
C_Polyhedron known_result(2);
known_result.add_constraint(A >= 0);
known_result.add_constraint(A <= 2);
known_result.add_constraint(B >= 1);
bool ok = (ph == known_result);
print_constraints(ph,
"*** after ph.refine_with_constraint(B >= 1) ***");
return ok;
}
} // namespace
BEGIN_MAIN
DO_TEST(test01);
DO_TEST(test02);
DO_TEST(test03);
END_MAIN
|
