Module: ppl/ppl Branch: pip Commit: cfbfb20b161ed7aecb6a500a4d34b73b0660e513 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=cfbfb20b161ed...
Author: Enea Zaffanella zaffanella@cs.unipr.it Date: Tue Nov 24 10:18:16 2009 +0100
Started adding tests to increase coverage.
---
tests/PIP_Problem/Makefile.am | 3 +- tests/PIP_Problem/pipproblem2.cc | 101 ++++++++++++++++++++++++++++++++++++++ 2 files changed, 103 insertions(+), 1 deletions(-)
diff --git a/tests/PIP_Problem/Makefile.am b/tests/PIP_Problem/Makefile.am index da24a57..6009243 100644 --- a/tests/PIP_Problem/Makefile.am +++ b/tests/PIP_Problem/Makefile.am @@ -50,7 +50,7 @@ $(top_builddir)/src/libppl.la \ @extra_libraries@
TESTS = \ -pipproblem1 +pipproblem1 pipproblem2
XFAIL_TESTS =
@@ -61,6 +61,7 @@ BUGS = #
pipproblem1_SOURCES = pipproblem1.cc +pipproblem2_SOURCES = pipproblem2.cc
check_PROGRAMS = \ $(TESTS) \ diff --git a/tests/PIP_Problem/pipproblem2.cc b/tests/PIP_Problem/pipproblem2.cc new file mode 100644 index 0000000..068e20d --- /dev/null +++ b/tests/PIP_Problem/pipproblem2.cc @@ -0,0 +1,101 @@ +/* Test the PIP_Problem class + Copyright (C) 2001-2009 Roberto Bagnara bagnara@cs.unipr.it + +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); + Variable P(2); + Variable Q(3); + Variables_Set params(P, Q); + + Constraint_System cs; + cs.insert(A + B >= 0); + cs.insert(A - B <= P); + cs.insert(3*A - 2*B == 5*Q); + + PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params); + + bool ok = (pip.space_dimension() == 4); + + pip.add_space_dimensions_and_embed(2, 2); + ok &= (pip.space_dimension() == 8); + params.insert(Variable(6)); + params.insert(Variable(7)); + ok &= (pip.parameter_space_dimensions() == params); + + for (PIP_Problem::const_iterator i = pip.constraints_begin(), + i_end = pip.constraints_end(); i != i_end; ++i) + print_constraint(*i); + + return ok; +} + +bool +test02() { + PIP_Problem pip_1(2); + PIP_Problem pip_2(2); + pip_2 = pip_1; + + Variables_Set params(Variable(1)); + pip_2.add_to_parameter_space_dimensions(params); + + std::swap(pip_1, pip_2); + + bool ok = (pip_1.space_dimension() == 2 + && pip_2.space_dimension() == 2 + && pip_1.parameter_space_dimensions() == params + && pip_2.parameter_space_dimensions() == Variables_Set()); + + return ok; +} + +bool +test03() { + PIP_Problem pip; + PIP_Problem::Control_Parameter_Value cp; + + cp = pip.get_control_parameter(PIP_Problem::CUTTING_STRATEGY); + bool ok = (cp == PIP_Problem::CUTTING_STRATEGY_FIRST); + + pip.set_control_parameter(PIP_Problem::CUTTING_STRATEGY_DEEPEST); + cp = pip.get_control_parameter(PIP_Problem::CUTTING_STRATEGY); + ok &= (cp == PIP_Problem::CUTTING_STRATEGY_DEEPEST); + + PIP_Problem pip_copy(pip); + cp = pip_copy.get_control_parameter(PIP_Problem::CUTTING_STRATEGY); + ok &= (cp == PIP_Problem::CUTTING_STRATEGY_DEEPEST); + + return ok; +} + +} // namespace + +BEGIN_MAIN + DO_TEST(test01); + DO_TEST(test02); + DO_TEST(test03); +END_MAIN