buildtools/ppl/tests/Box/addconstraints1.cc
Jerome Duval 5873a060ca imported PPL 0.11.1 and CLooG 0.18.0.
* these are dependencies for gcc 4 Graphite engine build.
* CLooG 0.18.0 includes ISL 0.11.1 which is the backend that the build script enables.
* PPL is needed by GCC build even if it isn't the chosen backend.
2013-04-06 15:10:34 +02:00

291 lines
5.9 KiB
C++

/* Test Box::add_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"
namespace {
bool
test01() {
Variable A(0);
Variable B(1);
Constraint_System cs;
cs.insert(B >= 0);
cs.insert(A >= 0);
cs.insert(B == 5);
cs.insert(B <= 7);
TBox box(2);
box.add_constraints(cs);
print_constraints(box, "*** box.add_constraints(cs) ***");
Rational_Box known_result(2);
known_result.add_constraint(A >= 0);
known_result.add_constraint(B == 5);
bool ok = check_result(box, known_result);
print_constraints(known_result, "*** known_result ***");
return ok;
}
bool
test02() {
Variable x(0);
Variable y(1);
Variable z(2);
TBox box(2);
try {
// This is an invalid use of method
// Box::add_constraint: it is illegal
// to add a constraint with bigger dimension.
box.add_constraint(x <= 0);
box.add_constraint(y - x + z >= 0);
}
catch (std::invalid_argument& e) {
nout << "std::invalid_argument: " << endl;
return true;
}
catch (...) {
}
return false;
}
bool
test03() {
Variable x(0);
Variable y(1);
TBox box(1);
try {
// This is an invalid use of the method
// Box::add_constraints(cs): it is illegal to
// add a system of constraints that is not dimensional incompatible
// with the polyhedron.
Constraint_System cs;
cs.insert(x - y >= 0);
box.add_constraints(cs);
}
catch (std::invalid_argument& e) {
nout << "std::invalid_argument: " << endl;
return true;
}
catch (...) {
}
return false;
}
bool
test04() {
Variable y(1);
TBox box(1);
try {
// This is an invalid use of the method
// Box::add_constraint(c): it is illegal to insert a
// constraints that contains a variable that is not in the space
// of the polyhedron.
box.add_constraint(y >= 0);
}
catch (std::invalid_argument& e) {
nout << "std::invalid_argument: " << endl;
return true;
}
catch (...) {
}
return false;
}
bool
test05() {
Variable x(0);
Variable y(1);
TBox box(1);
try {
// This is an invalid use of the method
// Box::add_constraints(cs): it is illegal to add a system
// of constraints that is dimensional incompatible with the
// polyhedron.
Constraint_System cs;
cs.insert(x - y == 0);
box.add_constraints(cs);
}
catch (std::invalid_argument& e) {
nout << "std::invalid_argument: " << endl;
return true;
}
catch (...) {
}
return false;
}
bool
test06() {
Variable A(0);
Variable B(1);
Constraint_System cs;
cs.insert(A >= 0);
cs.insert(B >= 5);
cs.insert(B <= 5);
TBox box(2);
box.add_constraints(cs);
bool ok = !box.is_empty();
Rational_Box known_result(2);
known_result.add_constraint(A >= 0);
known_result.add_constraint(B == 5);
ok = ok && check_result(box, known_result);
print_constraints(box, "*** box.add_constraints(cs) ***");
print_constraints(known_result, "*** known_result ***");
return ok;
}
bool
test07() {
Variable A(0);
Variable B(1);
Constraint_System cs;
cs.insert(A >= 0);
cs.insert(B >= 5);
cs.insert(B <= 5);
TBox box(2);
box.add_recycled_constraints(cs);
Rational_Box known_result(2);
known_result.add_constraint(A >= 0);
known_result.add_constraint(B == 5);
bool ok = check_result(box, known_result);
print_constraints(box, "*** box.add_constraints(cs) ***");
print_constraints(known_result, "*** known_result ***");
return ok;
}
bool
test08() {
Variable A(0);
Variable B(1);
Constraint_System cs;
cs.insert(A >= 0);
cs.insert(B >= 5);
cs.insert(B <= 5);
TBox box(2);
box.add_recycled_constraints(cs);
bool ok = !box.is_empty();
Rational_Box known_result(2);
known_result.add_constraint(A >= 0);
known_result.add_constraint(B == 5);
ok = ok && check_result(box, known_result);
print_constraints(box, "*** box.add_constraints(cs) ***");
print_constraints(known_result, "*** known_result ***");
return ok;
}
bool
test09() {
Variable A(0);
Variable B(1);
Constraint_System cs;
cs.insert(A >= 0);
cs.insert(B >= 5);
cs.insert(B <= 4);
TBox box(2);
box.add_constraints(cs);
bool ok = box.is_empty();
Rational_Box known_result(2, EMPTY);
ok = ok && check_result(box, known_result);
print_constraints(box, "*** box.add_constraints(cs) ***");
print_constraints(known_result, "*** known_result ***");
return ok;
}
bool
test10() {
Variable A(0);
Variable B(1);
Constraint_System cs;
cs.insert(A >= 0);
cs.insert(B >= 5);
cs.insert(B <= 5);
cs.insert(A + 3 <= 2);
TBox box(2);
box.add_recycled_constraints(cs);
bool ok = box.is_empty();
Rational_Box known_result(2, EMPTY);
ok = ok && check_result(box, known_result);
print_constraints(box, "*** box.add_constraints(cs) ***");
print_constraints(known_result, "*** known_result ***");
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);
END_MAIN