- PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(ppl-0_11-branch): Fixed interval construction from strings.
by Abramo Bagnara 08 Sep '10

08 Sep '10

Module: ppl/ppl Branch: ppl-0_11-branch Commit: 4a73f5fc01174513ca4bb9461af96898cb3d796b URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=4a73f5fc0117… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Tue Sep 7 21:13:17 2010 +0200 Fixed interval construction from strings. Fixed interval construction from strings. --- src/Interval.templates.hh | 20 ++++++++++++-------- 1 files changed, 12 insertions(+), 8 deletions(-) diff --git a/src/Interval.templates.hh b/src/Interval.templates.hh index eedd48e..11dff54 100644 --- a/src/Interval.templates.hh +++ b/src/Interval.templates.hh @@ -159,8 +159,9 @@ Interval<Boundary, Info>::Interval(const char* s) { case V_GT: lower_open = true; break; - case V_EQ_MINUS_INFINITY: case V_GT_MINUS_INFINITY: + lower_open = true; + case V_EQ_MINUS_INFINITY: lower_boundary_infinity = true; break; case V_EQ_PLUS_INFINITY: @@ -187,8 +188,9 @@ Interval<Boundary, Info>::Interval(const char* s) { else assign(EMPTY); break; - case V_EQ_PLUS_INFINITY: case V_LT_PLUS_INFINITY: + upper_open = true; + case V_EQ_PLUS_INFINITY: upper_boundary_infinity = true; break; default: @@ -202,12 +204,12 @@ Interval<Boundary, Info>::Interval(const char* s) { assign(EMPTY); else { if (lower_boundary_infinity) - special_set_boundary_infinity(LOWER, lower(), info()); + set_minus_infinity(LOWER, lower(), info(), lower_open); else Boundary_NS::assign(LOWER, lower(), info(), LOWER, lower_bound, SCALAR_INFO, lower_open); if (upper_boundary_infinity) - special_set_boundary_infinity(UPPER, upper(), info()); + set_plus_infinity(UPPER, upper(), info(), upper_open); else Boundary_NS::assign(UPPER, upper(), info(), UPPER, upper_bound, SCALAR_INFO, upper_open); @@ -295,8 +297,9 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) { case V_GT: lower_open = true; break; - case V_EQ_MINUS_INFINITY: case V_GT_MINUS_INFINITY: + lower_open = true; + case V_EQ_MINUS_INFINITY: lower_boundary_infinity = true; break; case V_EQ_PLUS_INFINITY: @@ -316,8 +319,9 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) { case V_LT: upper_open = true; break; - case V_EQ_MINUS_INFINITY: case V_GT_MINUS_INFINITY: + upper_open = true; + case V_EQ_MINUS_INFINITY: if (lower_r == V_EQ_MINUS_INFINITY || lower_r == V_GT_MINUS_INFINITY) x.assign(UNIVERSE); else @@ -338,12 +342,12 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) { x.assign(EMPTY); else { if (lower_boundary_infinity) - special_set_boundary_infinity(LOWER, x.lower(), x.info()); + set_minus_infinity(LOWER, x.lower(), x.info(), lower_open); else assign(LOWER, x.lower(), x.info(), LOWER, lower_bound, SCALAR_INFO, lower_open); if (upper_boundary_infinity) - special_set_boundary_infinity(UPPER, x.upper(), x.info()); + set_plus_infinity(UPPER, x.upper(), x.info(), upper_open); else assign(UPPER, x.upper(), x.info(), UPPER, upper_bound, SCALAR_INFO, upper_open);

1 0

[GIT] ppl/ppl(master): Mentioned the fix to Interval::Interval(const char*) .
by Roberto Bagnara 08 Sep '10

08 Sep '10

Module: ppl/ppl Branch: master Commit: ab1231051fa87f92b6df5d49f4cf723e540682fe URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ab1231051fa8… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed Sep 8 07:31:19 2010 +0200 Mentioned the fix to Interval::Interval(const char*). --- NEWS | 7 +++++++ 1 files changed, 7 insertions(+), 0 deletions(-) diff --git a/NEWS b/NEWS index 0297326..5ac4a8f 100644 --- a/NEWS +++ b/NEWS @@ -38,6 +38,13 @@ o Corrected a bug affecting methods whereby a lower bound would not be computed correctly when the two iterators specify an empty list of stop points. +o Fixed a bug affecting + + Interval::Interval(const char* s) + + whereby a wrong interval would be constructed if `s' denotes a number + that can only be represented as an infinity. + -------------------------------------------------------------------------- NEWS for version 0.11 (released on August 2, 2010)

1 0

[GIT] ppl/ppl(floating_point): New commits
by Roberto Bagnara 08 Sep '10

08 Sep '10

URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=4e420b1e2114… Merge: cd5191f18812ded12343b4fa936641d04761ffed 3e2fe287b4efd3b58127951793cc00ffe0ca21c0 Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed Sep 8 07:18:34 2010 +0200 Merge branch 'master' into floating_point URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3e2fe287b4ef… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Tue Sep 7 23:13:17 2010 +0200 Fixed interval construction from strings. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=22c92f00fb9e… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Tue Sep 7 20:01:44 2010 +0200 Announced a couple of new features and bugfixes. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f949a0fced31… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Tue Sep 7 19:31:56 2010 +0200 Mention the use of sparse matrices in MIP and PIP solvers. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=46655e57eb7d… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 19:05:39 2010 +0200 MIP_Problem: fix some debug messages and comments, in OK(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8df25ad97af2… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 18:49:40 2010 +0200 MIP_Problem: fix typos in some debug messages and comments, in OK().

1 0

[GIT] ppl/ppl(master): Fixed interval construction from strings.
by Abramo Bagnara 07 Sep '10

07 Sep '10

Module: ppl/ppl Branch: master Commit: 3e2fe287b4efd3b58127951793cc00ffe0ca21c0 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3e2fe287b4ef… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Tue Sep 7 23:13:17 2010 +0200 Fixed interval construction from strings. --- src/Interval.templates.hh | 20 ++++++++++++-------- 1 files changed, 12 insertions(+), 8 deletions(-) diff --git a/src/Interval.templates.hh b/src/Interval.templates.hh index eedd48e..11dff54 100644 --- a/src/Interval.templates.hh +++ b/src/Interval.templates.hh @@ -159,8 +159,9 @@ Interval<Boundary, Info>::Interval(const char* s) { case V_GT: lower_open = true; break; - case V_EQ_MINUS_INFINITY: case V_GT_MINUS_INFINITY: + lower_open = true; + case V_EQ_MINUS_INFINITY: lower_boundary_infinity = true; break; case V_EQ_PLUS_INFINITY: @@ -187,8 +188,9 @@ Interval<Boundary, Info>::Interval(const char* s) { else assign(EMPTY); break; - case V_EQ_PLUS_INFINITY: case V_LT_PLUS_INFINITY: + upper_open = true; + case V_EQ_PLUS_INFINITY: upper_boundary_infinity = true; break; default: @@ -202,12 +204,12 @@ Interval<Boundary, Info>::Interval(const char* s) { assign(EMPTY); else { if (lower_boundary_infinity) - special_set_boundary_infinity(LOWER, lower(), info()); + set_minus_infinity(LOWER, lower(), info(), lower_open); else Boundary_NS::assign(LOWER, lower(), info(), LOWER, lower_bound, SCALAR_INFO, lower_open); if (upper_boundary_infinity) - special_set_boundary_infinity(UPPER, upper(), info()); + set_plus_infinity(UPPER, upper(), info(), upper_open); else Boundary_NS::assign(UPPER, upper(), info(), UPPER, upper_bound, SCALAR_INFO, upper_open); @@ -295,8 +297,9 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) { case V_GT: lower_open = true; break; - case V_EQ_MINUS_INFINITY: case V_GT_MINUS_INFINITY: + lower_open = true; + case V_EQ_MINUS_INFINITY: lower_boundary_infinity = true; break; case V_EQ_PLUS_INFINITY: @@ -316,8 +319,9 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) { case V_LT: upper_open = true; break; - case V_EQ_MINUS_INFINITY: case V_GT_MINUS_INFINITY: + upper_open = true; + case V_EQ_MINUS_INFINITY: if (lower_r == V_EQ_MINUS_INFINITY || lower_r == V_GT_MINUS_INFINITY) x.assign(UNIVERSE); else @@ -338,12 +342,12 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) { x.assign(EMPTY); else { if (lower_boundary_infinity) - special_set_boundary_infinity(LOWER, x.lower(), x.info()); + set_minus_infinity(LOWER, x.lower(), x.info(), lower_open); else assign(LOWER, x.lower(), x.info(), LOWER, lower_bound, SCALAR_INFO, lower_open); if (upper_boundary_infinity) - special_set_boundary_infinity(UPPER, x.upper(), x.info()); + set_plus_infinity(UPPER, x.upper(), x.info(), upper_open); else assign(UPPER, x.upper(), x.info(), UPPER, upper_bound, SCALAR_INFO, upper_open);

1 0

[GIT] ppl/ppl(master): Announced a couple of new features and bugfixes.
by Enea Zaffanella 07 Sep '10

07 Sep '10

Module: ppl/ppl Branch: master Commit: 22c92f00fb9ed907226847676345b76f85081451 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=22c92f00fb9e… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Tue Sep 7 20:01:44 2010 +0200 Announced a couple of new features and bugfixes. --- NEWS | 10 ++++++++++ 1 files changed, 10 insertions(+), 0 deletions(-) diff --git a/NEWS b/NEWS index 4b1ec5d..0297326 100644 --- a/NEWS +++ b/NEWS @@ -16,10 +16,20 @@ o The implementations of the MIP and PIP solvers are based on a new show an improvement on the average case, that grows when the toughest tests in the benchmark suite are considered. +o When the --check option is used, the input data for demo ppl_lpsol + is perturbed the same way as GLPK does, thereby allowing for a + meaningful comparison of the results obtained. + +o The input routine for PPL numeric datatypes has been extended to + accept the ISO9899 (C99) hexadecimal floating constant syntax. + Bugfixes ======== +o Corrected a bug affecting the input routine of ppl_lpsol, whereby + the inhomogeneous term of the objective function was disregarded. + o Corrected a bug affecting methods Box::CC76_widening_assign(const T&, Iterator, Iterator)

1 0

[GIT] ppl/ppl(ppl-0_11-branch): Mention bug corrected on the input routine for ppl_lpsol.
by Enea Zaffanella 07 Sep '10

07 Sep '10

Module: ppl/ppl Branch: ppl-0_11-branch Commit: 04040ce39076a989bb3eda7cbb2e4f24dc6b5735 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=04040ce39076… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Tue Sep 7 19:48:01 2010 +0200 Mention bug corrected on the input routine for ppl_lpsol. --- NEWS | 5 ++++- 1 files changed, 4 insertions(+), 1 deletions(-) diff --git a/NEWS b/NEWS index 67c19e2..e884a40 100644 --- a/NEWS +++ b/NEWS @@ -4,12 +4,15 @@ Parma Polyhedra Library NEWS -- history of user-visible changes -------------------------------------------------------------------------- -NEWS for version 0.11 (release date to be decided) +NEWS for version 0.11.1 (release date to be decided) -------------------------------------------------------------------------- Bugfixes ======== +o Corrected a bug affecting the input routine of ppl_lpsol, whereby + the inhomogeneous term of the objective function was disregarded. + o Corrected a bug affecting methods Box::CC76_widening_assign(const T&, Iterator, Iterator)

1 0

[GIT] ppl/ppl(master): Mention the use of sparse matrices in MIP and PIP solvers.
by Enea Zaffanella 07 Sep '10

07 Sep '10

Module: ppl/ppl Branch: master Commit: f949a0fced3173a45aaab7f12579a82a15aa8674 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f949a0fced31… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Tue Sep 7 19:31:56 2010 +0200 Mention the use of sparse matrices in MIP and PIP solvers. --- NEWS | 12 +++++++++++- 1 files changed, 11 insertions(+), 1 deletions(-) diff --git a/NEWS b/NEWS index 67c19e2..4b1ec5d 100644 --- a/NEWS +++ b/NEWS @@ -4,9 +4,19 @@ Parma Polyhedra Library NEWS -- history of user-visible changes -------------------------------------------------------------------------- -NEWS for version 0.11 (release date to be decided) +NEWS for version 0.12 (release date to be decided) -------------------------------------------------------------------------- +New and Changed Features +======================== + +o The implementations of the MIP and PIP solvers are based on a new + data structure leading to significant space and time savings when + the tableau matrix is sparse; the benchmarks of the ppl_lpsol demo + show an improvement on the average case, that grows when the toughest + tests in the benchmark suite are considered. + + Bugfixes ========

1 0

[GIT] ppl/ppl(master): MIP_Problem: fix some debug messages and comments, in OK().
by Marco Poletti 07 Sep '10

07 Sep '10

Module: ppl/ppl Branch: master Commit: 46655e57eb7d63ccf42ee7ed51cb74139c7a3aca URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=46655e57eb7d… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 19:05:39 2010 +0200 MIP_Problem: fix some debug messages and comments, in OK(). --- src/MIP_Problem.cc | 10 +++++----- 1 files changed, 5 insertions(+), 5 deletions(-) diff --git a/src/MIP_Problem.cc b/src/MIP_Problem.cc index f603f4a..c122db4 100644 --- a/src/MIP_Problem.cc +++ b/src/MIP_Problem.cc @@ -2330,13 +2330,13 @@ PPL::MIP_Problem::OK() const { matrix_type::row_type::const_iterator itr = tableau_j.begin(); matrix_type::row_type::const_iterator itr_end = tableau_j.end(); for ( ; i != i_end && itr != itr_end; ++i) { - // tableau[i][base[i]] must be different from zero. - // tableau[i][base[j]], with i different from j, must not be a zero. + // tableau[i][base[j]], with i different from j, must be zero. if (itr.index() < i->first) itr = tableau_j.lower_bound(itr, itr.index()); if (i->second != j && itr.index() == i->first && *itr != 0) { #ifndef NDEBUG - cerr << "tableau[i][base[i]] must be different from zero" << endl; + cerr << "tableau[i][base[j]], with i different from j, must be " + << "zero" << endl; ascii_dump(cerr); #endif return false; @@ -2344,11 +2344,11 @@ PPL::MIP_Problem::OK() const { } } } + // tableau[i][base[i]] must not be a zero. for (dimension_type i = base.size(); i-- > 0; ) { if (tableau[i].get(base[i]) == 0) { #ifndef NDEBUG - cerr << "tableau[i][base[j]], with i different from j, must not be " - << "a zero" << endl; + cerr << "tableau[i][base[i]] must not be a zero" << endl; ascii_dump(cerr); #endif return false;

1 0

[GIT] ppl/ppl(MPI): New commits
by Roberto Bagnara 07 Sep '10

07 Sep '10

URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f25c15f191f1… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 18:51:33 2010 +0200 MIP_Problem: use Distributed_Sparse_Matrix::ascii_dump(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f320d664eb09… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 18:49:40 2010 +0200 MIP_Problem: fix typos in some debug messages and comments, in OK(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=7f93d7cfba97… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 18:42:57 2010 +0200 Distributed_Sparse_Matrix: add an ascii_dump() method. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b6ff87696a43… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 17:56:00 2010 +0200 MIP_Problem: use Distributed_Sparse_Matrix::set_row(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3132a4d7a4cf… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 17:30:21 2010 +0200 GMP_Integer: reduce serialization output size and improve serialization/deserialization performance. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=67ac3da87968… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 17:01:01 2010 +0200 MIP_Problem: use Distributed_Sparse_Matrix::set_artificial_indexes_for_unfeasible_rows(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b3e1c6ac5797… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 17:00:30 2010 +0200 Distributed_Sparse_Matrix: add set_artificial_indexes_for_unfeasible_rows() method. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=0c904a51b595… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Sep 7 16:07:22 2010 +0200 test06 fails with 8-bit coefficients. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f30b21274239… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 14:17:38 2010 +0200 MIP_Problem: use Distributed_Sparse_Matrix:make_inhomogeneous_terms_nonpositive(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=248212940212… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 14:17:07 2010 +0200 Distributed_Sparse_Matrix: add make_inhomogeneous_terms_nonpositive() method.

1 0

[GIT] ppl/ppl(master): MIP_Problem: fix typos in some debug messages and comments, in OK().
by Marco Poletti 07 Sep '10

07 Sep '10

Module: ppl/ppl Branch: master Commit: 8df25ad97af26345ee7d77a65120abee159ceede URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8df25ad97af2… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Sep 7 18:49:40 2010 +0200 MIP_Problem: fix typos in some debug messages and comments, in OK(). --- src/MIP_Problem.cc | 8 ++++---- 1 files changed, 4 insertions(+), 4 deletions(-) diff --git a/src/MIP_Problem.cc b/src/MIP_Problem.cc index 3d94007..f603f4a 100644 --- a/src/MIP_Problem.cc +++ b/src/MIP_Problem.cc @@ -2330,13 +2330,13 @@ PPL::MIP_Problem::OK() const { matrix_type::row_type::const_iterator itr = tableau_j.begin(); matrix_type::row_type::const_iterator itr_end = tableau_j.end(); for ( ; i != i_end && itr != itr_end; ++i) { - // tableau[i][base[i] must be different from zero. - // tableau[i][base[j], with i different from j, must not be a zero. + // tableau[i][base[i]] must be different from zero. + // tableau[i][base[j]], with i different from j, must not be a zero. if (itr.index() < i->first) itr = tableau_j.lower_bound(itr, itr.index()); if (i->second != j && itr.index() == i->first && *itr != 0) { #ifndef NDEBUG - cerr << "tableau[i][base[i] must be different from zero" << endl; + cerr << "tableau[i][base[i]] must be different from zero" << endl; ascii_dump(cerr); #endif return false; @@ -2347,7 +2347,7 @@ PPL::MIP_Problem::OK() const { for (dimension_type i = base.size(); i-- > 0; ) { if (tableau[i].get(base[i]) == 0) { #ifndef NDEBUG - cerr << "tableau[i][base[j], with i different from j, must not be " + cerr << "tableau[i][base[j]], with i different from j, must not be " << "a zero" << endl; ascii_dump(cerr); #endif

1 0