File: fromgrid1.cc

package info (click to toggle)
ppl 1%3A1.2-8.1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 44,328 kB
  • sloc: cpp: 212,085; sh: 12,176; makefile: 7,192; perl: 6,333; java: 2,220; ansic: 1,842; ml: 1,132; sed: 80
file content (202 lines) | stat: -rw-r--r-- 4,427 bytes parent folder | download | duplicates (3)
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
/* Test C_Polyhedron::C_Polyhedron(const Grid&)
   and NNC_Polyhedron::NNC_Polyhedron(const Grid&).
   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/ . */

#include "ppl_test.hh"

namespace {

// Constructs the polyhedron { x + y == 0, y - z == 0 }
// from a grid with the same equalities but 1 extra congruence.
bool
test01() {
  Variable x(0);
  Variable y(1);
  Variable z(2);

  Grid gr(3);
  gr.add_congruence((x + y %= 0) / 0);
  gr.add_congruence((y - z %= 0) / 0);
  gr.add_congruence((z %= 0) / 1);

  TOctagonal_Shape oct(gr);


  Octagonal_Shape<mpq_class> known_oct(gr.space_dimension());
  known_oct.add_constraint(x + y == 0);
  known_oct.add_constraint(y - z == 0);

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// The grid is the xy plane.
bool
test02() {
  Grid gr(2);

  TOctagonal_Shape oct(gr);

  Octagonal_Shape<mpq_class> known_oct(gr.space_dimension());

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// This grid is unbounded.
bool
test03() {
  Variable x(0);
  Variable y(1);
  Variable z(2);

  Grid gr(3);
  gr.add_congruence((x + y %= 1) / 3);
  gr.add_congruence((y - z %= 2) / 5);

  TOctagonal_Shape oct(gr);

  Octagonal_Shape<mpq_class> known_oct(gr.space_dimension());

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// A zero-dimensional grid.
bool
test04() {
  Grid gr(0);

  TOctagonal_Shape oct(gr);

  Octagonal_Shape<mpq_class> known_oct;

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// An empty closed grid in 2D.
bool
test05() {
  Grid gr(2, EMPTY);

  TOctagonal_Shape oct(gr);

  Octagonal_Shape<mpq_class> known_oct(2, EMPTY);

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// A single point.
bool
test06() {
  Variable x(0);
  Variable y(1);
  Variable z(2);

  Grid gr(3);
  gr.add_congruence((x - y %= 1) / 0);
  gr.add_congruence((y %= 0) / 0);

  TOctagonal_Shape oct(gr);

  Octagonal_Shape<mpq_class> known_oct(gr.space_dimension());
  known_oct.add_constraint(x == 1);
  known_oct.add_constraint(y == 0);

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// A zero-dimensional empty grid.
bool
test07() {
  Grid gr(0, EMPTY);

  TOctagonal_Shape oct(gr);

  Octagonal_Shape<mpq_class> known_oct(0, EMPTY);

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  return ok;
}

// The grid is the xy plane.
bool
test08() {
  Grid gr(2);
  Constraint_System cs = gr.constraints();

  TOctagonal_Shape oct(cs);

  Octagonal_Shape<mpq_class> known_oct(gr.space_dimension());

  bool ok = (check_result(oct, known_oct));

  print_constraints(oct, "*** oct ***");
  print_constraints(known_oct, "*** known_oct ***");

  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);
END_MAIN