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
|
/* Test C_Polyhedron Java test class of the Parma Polyhedra Library Java
interface.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2016 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://bugseng.com/products/ppl/ . */
import parma_polyhedra_library.*;
public class C_Polyhedron_test1 {
static {
try {
System.loadLibrary("ppl_java");
}
catch (UnsatisfiedLinkError e) {
System.out.println("Unable to load the library");
System.out.println(e.getMessage());
System.exit(-1);
}
}
// This code tests the method `map_space_dimension(pfunc)'.
public static boolean test01() {
Partial_Function partial_function = new Partial_Function();
partial_function.insert(0, 2);
partial_function.insert(2, 0);
partial_function.insert(1, 1);
Variable A = new Variable(0);
Variable B = new Variable(1);
Variable C = new Variable(2);
Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
Linear_Expression_Sum le_a_plus_b
= new Linear_Expression_Sum(le_a, le_b);
Linear_Expression_Sum le_a_plus_c
= new Linear_Expression_Sum(le_a, le_c);
Linear_Expression_Sum le_c_plus_b
= new Linear_Expression_Sum(le_c, le_b);
Linear_Expression_Sum le_c_plus_a
= new Linear_Expression_Sum(le_c, le_a);
Linear_Expression_Coefficient le_two
= new Linear_Expression_Coefficient(new Coefficient(2));
Linear_Expression_Times le_2c
= new Linear_Expression_Times(le_c, new Coefficient(2));
Linear_Expression_Times le_2a
= new Linear_Expression_Times(le_a, new Coefficient(2));
Generator_System gs = new Generator_System();
gs.add(Generator.point(le_2c, new Coefficient(1)));
gs.add(Generator.line(le_a_plus_b));
gs.add(Generator.ray(le_a_plus_c));
C_Polyhedron poly1 = new C_Polyhedron(gs);
poly1.map_space_dimensions(partial_function);
Generator_System known_gs = new Generator_System();
known_gs.add(Generator.point(le_2a, new Coefficient(1)));
known_gs.add(Generator.line(le_c_plus_b));
known_gs.add(Generator.ray(le_c_plus_a));
C_Polyhedron known_result = new C_Polyhedron(known_gs);
return known_result.equals(poly1);
}
public static boolean test02() {
// Test if `minimized_constraints' returns an empty Constraint_System
// if the Polyhedron is built from universe with a dimension greater
// than zero.
Variable X = new Variable(0);
Variable Y = new Variable(1);
Variable Z = new Variable(2);
C_Polyhedron ph = new C_Polyhedron(3, Degenerate_Element.UNIVERSE);
Constraint_System cs = ph.minimized_constraints();
return cs.isEmpty();
}
public static boolean test03() {
Variable A = new Variable(0);
Variable B = new Variable(1);
Generator_System gs = new Generator_System();
gs.add(Generator.point(new Linear_Expression_Variable(A),
new Coefficient(2)));
gs.add(Generator.point(new Linear_Expression_Variable(B),
new Coefficient(2)));
C_Polyhedron ph = new C_Polyhedron(gs);
Variables_Set var_set = new Variables_Set();
var_set.add(B);
ph.drop_some_non_integer_points(var_set,
Complexity_Class.ANY_COMPLEXITY);
Generator_System gs_out = ph.minimized_generators();
boolean ok = (gs_out.size() == 1);
ph.drop_some_non_integer_points(Complexity_Class.ANY_COMPLEXITY);
gs_out = ph.minimized_generators();
ok = ok && gs_out.isEmpty();
return ok;
}
public static boolean test04() {
Coefficient freq_n = new Coefficient(0);
Coefficient freq_d = new Coefficient(0);
Coefficient val_n = new Coefficient(0);
Coefficient val_d = new Coefficient(0);
Linear_Expression le
= new Linear_Expression_Coefficient(new Coefficient(0));
C_Polyhedron ph = new C_Polyhedron(0, Degenerate_Element.UNIVERSE);
return ph.frequency(le, freq_n, freq_d, val_n, val_d);
}
public static void main(String[] args) {
Parma_Polyhedra_Library.initialize_library();
boolean test_result_ok =
Test_Executor.executeTests(C_Polyhedron_test1.class);
Parma_Polyhedra_Library.finalize_library();
if (!test_result_ok)
System.exit(1);
System.exit(0);
}
}
|
