- PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(master): Cater for systems where Watchdog objects are not supported.
by Roberto Bagnara 25 Jun '12

25 Jun '12

Module: ppl/ppl Branch: master Commit: 1fdc42b117a044a92a4c3fc74835477fe4437d6a URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=1fdc42b117a0… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Mon Jun 25 07:28:43 2012 +0200 Cater for systems where Watchdog objects are not supported. --- tests/MIP_Problem/mipproblem2.cc | 8 ++++++++ 1 files changed, 8 insertions(+), 0 deletions(-) diff --git a/tests/MIP_Problem/mipproblem2.cc b/tests/MIP_Problem/mipproblem2.cc index 3f436c5..60a07b0 100644 --- a/tests/MIP_Problem/mipproblem2.cc +++ b/tests/MIP_Problem/mipproblem2.cc @@ -139,6 +139,14 @@ bool test01() { nout << "timeout, as expected" << endl; return true; } +#if !PPL_WATCHDOG_OBJECTS_ARE_SUPPORTED + // If Watchdog objects are not supported, an std::logic_error exception + // will be thrown: this is normal. + catch (const std::logic_error& e) { + nout << "std::logic_error exception caught: \n" << e.what() << std::endl; + exit(0); + } +#endif // !PPL_WATCHDOG_OBJECTS_ARE_SUPPORTED catch (const std::overflow_error& e) { abandon_expensive_computations = 0; if (std::numeric_limits<Coefficient>::is_integer

1 0

[GIT] ppl/ppl(master): Removed a couple of typedefs.
by Enea Zaffanella 23 Jun '12

23 Jun '12

Module: ppl/ppl Branch: master Commit: 1ea5be453eb3cdac4d5cfd35fe9b4b866a4d8f11 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=1ea5be453eb3… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jun 23 14:56:59 2012 +0200 Removed a couple of typedefs. These have become useless (and confusing) after the merge of sparse_matrices. --- .../C/ppl_c_implementation_common.inlines.hh | 2 -- 1 files changed, 0 insertions(+), 2 deletions(-) diff --git a/interfaces/C/ppl_c_implementation_common.inlines.hh b/interfaces/C/ppl_c_implementation_common.inlines.hh index 3057913..3e3e8f0 100644 --- a/interfaces/C/ppl_c_implementation_common.inlines.hh +++ b/interfaces/C/ppl_c_implementation_common.inlines.hh @@ -47,7 +47,6 @@ DECLARE_CONVERSIONS(Constraint, Constraint) DECLARE_CONVERSIONS(Constraint_System, Constraint_System) -typedef Constraint_System::const_iterator Constraint_System_const_iterator; DECLARE_CONVERSIONS(Constraint_System_const_iterator, Constraint_System_const_iterator) @@ -55,7 +54,6 @@ DECLARE_CONVERSIONS(Generator, Generator) DECLARE_CONVERSIONS(Generator_System, Generator_System) -typedef Generator_System::const_iterator Generator_System_const_iterator; DECLARE_CONVERSIONS(Generator_System_const_iterator, Generator_System_const_iterator)

1 0

[GIT] ppl/ppl(master): Fixed another couple of Doxygen warnings.
by Enea Zaffanella 23 Jun '12

23 Jun '12

Module: ppl/ppl Branch: master Commit: 98e065d16652e680675adda2d62da225325e6da8 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=98e065d16652… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jun 23 12:12:14 2012 +0200 Fixed another couple of Doxygen warnings. --- src/Linear_Form.templates.hh | 2 +- src/Swapping_Vector.defs.hh | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/src/Linear_Form.templates.hh b/src/Linear_Form.templates.hh index 7af69d1..a05e665 100644 --- a/src/Linear_Form.templates.hh +++ b/src/Linear_Form.templates.hh @@ -473,7 +473,7 @@ Linear_Form<C>::intervalize(const FP_Oracle<Target,C>& oracle, return true; } -/*! \relates Linear_Form */ +/*! \relates Parma_Polyhedra_Library::Linear_Form */ template <typename C> std::ostream& IO_Operators::operator<<(std::ostream& s, const Linear_Form<C>& f) { diff --git a/src/Swapping_Vector.defs.hh b/src/Swapping_Vector.defs.hh index 1e2f995..65bcf41 100644 --- a/src/Swapping_Vector.defs.hh +++ b/src/Swapping_Vector.defs.hh @@ -84,7 +84,7 @@ private: }; #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS -/*! \relates Swapping_Vector<T> */ +/*! \relates Swapping_Vector */ #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) template <typename T> void swap(Swapping_Vector<T>& x, Swapping_Vector<T>& y);

1 0

[GIT] ppl/ppl(master): Fixed several Doxygen warnings.
by Enea Zaffanella 23 Jun '12

23 Jun '12

Module: ppl/ppl Branch: master Commit: 29702bdc84ed6f040a22dc730b07d084a3db8e85 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=29702bdc84ed… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jun 23 11:30:49 2012 +0200 Fixed several Doxygen warnings. --- src/Linear_Form.templates.hh | 33 ++++++++++++++++----------------- src/Linear_System.defs.hh | 3 +++ 2 files changed, 19 insertions(+), 17 deletions(-) diff --git a/src/Linear_Form.templates.hh b/src/Linear_Form.templates.hh index 3eca9ac..7af69d1 100644 --- a/src/Linear_Form.templates.hh +++ b/src/Linear_Form.templates.hh @@ -82,7 +82,7 @@ Linear_Form<C>::Linear_Form(const Linear_Expression& e) vec[0] = e.inhomogeneous_term(); } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> operator+(const Linear_Form<C>& f1, const Linear_Form<C>& f2) { @@ -133,7 +133,7 @@ operator+(const Variable v, const Linear_Form<C>& f) { return r; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> operator+(const C& n, const Linear_Form<C>& f) { @@ -142,7 +142,7 @@ operator+(const C& n, const Linear_Form<C>& f) { return r; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> operator-(const Linear_Form<C>& f) { @@ -152,7 +152,7 @@ operator-(const Linear_Form<C>& f) { return r; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> operator-(const Linear_Form<C>& f1, const Linear_Form<C>& f2) { @@ -188,7 +188,7 @@ operator-(const Linear_Form<C>& f1, const Linear_Form<C>& f2) { } } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> operator-(const Variable v, const Linear_Form<C>& f) { @@ -224,7 +224,7 @@ operator-(const Linear_Form<C>& f, const Variable v) { return r; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> operator-(const C& n, const Linear_Form<C>& f) { @@ -235,18 +235,17 @@ operator-(const C& n, const Linear_Form<C>& f) { return r; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C> -operator*(const C& n, - const Linear_Form<C>& f) { +operator*(const C& n, const Linear_Form<C>& f) { Linear_Form<C> r(f); for (dimension_type i = f.size(); i-- > 0; ) r[i] *= n; return r; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C>& operator+=(Linear_Form<C>& f1, const Linear_Form<C>& f2) { @@ -259,7 +258,7 @@ operator+=(Linear_Form<C>& f1, const Linear_Form<C>& f2) { return f1; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C>& operator+=(Linear_Form<C>& f, const Variable v) { @@ -274,7 +273,7 @@ operator+=(Linear_Form<C>& f, const Variable v) { return f; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C>& operator-=(Linear_Form<C>& f1, const Linear_Form<C>& f2) { @@ -287,7 +286,7 @@ operator-=(Linear_Form<C>& f1, const Linear_Form<C>& f2) { return f1; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C>& operator-=(Linear_Form<C>& f, const Variable v) { @@ -302,7 +301,7 @@ operator-=(Linear_Form<C>& f, const Variable v) { return f; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C>& operator*=(Linear_Form<C>& f, const C& n) { @@ -312,7 +311,7 @@ operator*=(Linear_Form<C>& f, const C& n) { return f; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> Linear_Form<C>& operator/=(Linear_Form<C>& f, const C& n) { @@ -322,7 +321,7 @@ operator/=(Linear_Form<C>& f, const C& n) { return f; } -/*! \relates Linear_Row */ +/*! \relates Linear_Form */ template <typename C> inline bool operator==(const Linear_Form<C>& x, const Linear_Form<C>& y) { @@ -474,7 +473,7 @@ Linear_Form<C>::intervalize(const FP_Oracle<Target,C>& oracle, return true; } -/*! \relates Parma_Polyhedra_Library::Linear_Form */ +/*! \relates Linear_Form */ template <typename C> std::ostream& IO_Operators::operator<<(std::ostream& s, const Linear_Form<C>& f) { diff --git a/src/Linear_System.defs.hh b/src/Linear_System.defs.hh index a260842..870cb38 100644 --- a/src/Linear_System.defs.hh +++ b/src/Linear_System.defs.hh @@ -79,6 +79,9 @@ public: \param space_dim The number of space dimensions of the system that will be created. + \param r + The representation for system's rows. + Creates a \p n_rows \f$\times\f$ \p space_dim system whose coefficients are all zero and with the given topology. */

1 0

[GIT] ppl/ppl(master): Typo in documentation fixed.
by Patricia Hill 22 Jun '12

22 Jun '12

Module: ppl/ppl Branch: master Commit: 94006e208b903d4b76d83e2e8c39881835cc4103 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=94006e208b90… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Fri Jun 22 08:29:23 2012 +0100 Typo in documentation fixed. --- src/Init.defs.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/Init.defs.hh b/src/Init.defs.hh index a6dfc73..12a5da5 100644 --- a/src/Init.defs.hh +++ b/src/Init.defs.hh @@ -44,7 +44,7 @@ void set_rounding_for_PPL(); This is important if the application uses floating-point computations outside the PPL. It is crucial when the application uses functions - from a mathematical library that is not guaranteed to work correctly + from a mathematical library that are not guaranteed to work correctly under all rounding modes. After calling this function it is absolutely necessary to call

1 0

[GIT] ppl/ppl(master): Long source lines avoided.
by Roberto Bagnara 21 Jun '12

21 Jun '12

Module: ppl/ppl Branch: master Commit: f7672cfef0ca761880ec597c57042e540fa42806 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f7672cfef0ca… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jun 21 18:14:17 2012 +0200 Long source lines avoided. --- src/Interval.inlines.hh | 42 ++++++++++++++++++++++++++++-------------- 1 files changed, 28 insertions(+), 14 deletions(-) diff --git a/src/Interval.inlines.hh b/src/Interval.inlines.hh index a82da6e..e2e3932 100644 --- a/src/Interval.inlines.hh +++ b/src/Interval.inlines.hh @@ -88,11 +88,13 @@ struct Scalar_As_Interval_Policy { const_bool_nodef(check_inexact, false); }; -typedef Interval_Info_Null<Scalar_As_Interval_Policy> Scalar_As_Interval_Info; +typedef Interval_Info_Null<Scalar_As_Interval_Policy> +Scalar_As_Interval_Info; const Scalar_As_Interval_Info SCALAR_INFO; -typedef Interval_Info_Null_Open<Scalar_As_Interval_Policy> Scalar_As_Interval_Info_Open; +typedef Interval_Info_Null_Open<Scalar_As_Interval_Policy> +Scalar_As_Interval_Info_Open; template <typename T> inline typename Enable_If<Is_Singleton<T>::value, const T&>::type @@ -105,12 +107,14 @@ f_upper(const T& x) { return x; } template <typename T> -inline typename Enable_If<Is_Singleton<T>::value, const Scalar_As_Interval_Info&>::type +inline typename Enable_If<Is_Singleton<T>::value, + const Scalar_As_Interval_Info&>::type f_info(const T&) { return SCALAR_INFO; } template <typename T> -inline typename Enable_If<Is_Singleton<T>::value, Scalar_As_Interval_Info_Open>::type +inline typename Enable_If<Is_Singleton<T>::value, + Scalar_As_Interval_Info_Open>::type f_info(const T&, bool open) { return Scalar_As_Interval_Info_Open(open); } @@ -130,13 +134,15 @@ f_is_singleton(const T& x) { } // namespace Interval_NS template <typename T> -inline typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, bool>::type +inline typename Enable_If<Is_Singleton<T>::value + || Is_Interval<T>::value, bool>::type is_singleton_integer(const T& x) { return is_singleton(x) && is_integer(f_lower(x)); } template <typename T> -inline typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, bool>::type +inline typename Enable_If<Is_Singleton<T>::value + || Is_Interval<T>::value, bool>::type check_empty_arg(const T& x) { if (f_info(x).may_be_empty) return f_is_empty(x); @@ -147,9 +153,12 @@ check_empty_arg(const T& x) { } template <typename T1, typename T2> -inline typename Enable_If<((Is_Singleton<T1>::value || Is_Interval<T1>::value) - && (Is_Singleton<T2>::value || Is_Interval<T2>::value) - && (Is_Interval<T1>::value || Is_Interval<T2>::value)), +inline typename Enable_If<((Is_Singleton<T1>::value + || Is_Interval<T1>::value) + && (Is_Singleton<T2>::value + || Is_Interval<T2>::value) + && (Is_Interval<T1>::value + || Is_Interval<T2>::value)), bool>::type operator==(const T1& x, const T2& y) { PPL_ASSERT(f_OK(x)); @@ -163,9 +172,12 @@ operator==(const T1& x, const T2& y) { } template <typename T1, typename T2> -inline typename Enable_If<((Is_Singleton<T1>::value || Is_Interval<T1>::value) - && (Is_Singleton<T2>::value || Is_Interval<T2>::value) - && (Is_Interval<T1>::value || Is_Interval<T2>::value)), +inline typename Enable_If<((Is_Singleton<T1>::value + || Is_Interval<T1>::value) + && (Is_Singleton<T2>::value + || Is_Interval<T2>::value) + && (Is_Interval<T1>::value + || Is_Interval<T2>::value)), bool>::type operator!=(const T1& x, const T2& y) { return !(x == y); @@ -173,7 +185,8 @@ operator!=(const T1& x, const T2& y) { template <typename Boundary, typename Info> template <typename T> -inline typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, bool>::type +inline typename Enable_If<Is_Singleton<T>::value + || Is_Interval<T>::value, bool>::type Interval<Boundary, Info>::contains(const T& y) const { PPL_ASSERT(OK()); PPL_ASSERT(f_OK(y)); @@ -187,7 +200,8 @@ Interval<Boundary, Info>::contains(const T& y) const { template <typename Boundary, typename Info> template <typename T> -inline typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, bool>::type +inline typename Enable_If<Is_Singleton<T>::value + || Is_Interval<T>::value, bool>::type Interval<Boundary, Info>::strictly_contains(const T& y) const { PPL_ASSERT(OK()); PPL_ASSERT(f_OK(y));

1 0

[GIT] ppl/ppl(master): Test restored.
by Roberto Bagnara 21 Jun '12

21 Jun '12

Module: ppl/ppl Branch: master Commit: d7d512494182b94caf5ce9d53f2e7671d2eeae5c URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d7d512494182… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jun 21 18:14:00 2012 +0200 Test restored. --- src/Interval.defs.hh | 6 ++---- 1 files changed, 2 insertions(+), 4 deletions(-) diff --git a/src/Interval.defs.hh b/src/Interval.defs.hh index 5e75c15..7d25bcd 100644 --- a/src/Interval.defs.hh +++ b/src/Interval.defs.hh @@ -502,14 +502,12 @@ public: bool ascii_load(std::istream& s); bool OK() const { -#if 0 if (!Info::may_be_empty && is_empty()) { #ifndef NDEBUG - std::cerr << "The interval is unexpectedly empty.\n"; + std::cerr << "The interval is unexpectedly empty.\n"; #endif - return false; + return false; } -#endif if (is_open(LOWER, lower(), info())) { if (is_plus_infinity(LOWER, lower(), info())) {

1 0

[GIT] ppl/ppl(master): Restore the pre-PPL rounding mode before using libm functions.
by Roberto Bagnara 21 Jun '12

21 Jun '12

Module: ppl/ppl Branch: master Commit: 25f38f85a3fb07b98650bbe340574835ece94fe3 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=25f38f85a3fb… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jun 21 17:41:01 2012 +0200 Restore the pre-PPL rounding mode before using libm functions. --- tests/Box/interval1.cc | 13 ++++++++++--- tests/Box/membytes1.cc | 11 +++++++++-- tests/Polyhedron/randphull1.cc | 7 +++++++ 3 files changed, 26 insertions(+), 5 deletions(-) diff --git a/tests/Box/interval1.cc b/tests/Box/interval1.cc index ff5fae7..4c59a54 100644 --- a/tests/Box/interval1.cc +++ b/tests/Box/interval1.cc @@ -115,9 +115,16 @@ solve(const std::vector<N>& P, // Initial estimates are given by roots of unity. std::vector<std::complex<N> > x(5); double theta = 2*M_PI/degree; - for (int i = 0; i < degree; ++i) - x[i] = std::complex<N>(N(cos(i*theta)), - N(sin(i*theta))); + for (int i = 0; i < degree; ++i) { + // Many libm implementations only work with round-to-nearest. + // See, e.g, http://sources.redhat.com/bugzilla/show_bug.cgi?id=3976 + restore_pre_PPL_rounding(); + N cos_i_theta = N(cos(i*theta)); + N sin_i_theta = N(sin(i*theta)); + set_rounding_for_PPL(); + + x[i] = std::complex<N>(cos_i_theta, sin_i_theta); + } for (int iteration = 0; iteration < 50; ++iteration) { for (int i = 0; i < degree; ++i) diff --git a/tests/Box/membytes1.cc b/tests/Box/membytes1.cc index 8a0093b..4649659 100644 --- a/tests/Box/membytes1.cc +++ b/tests/Box/membytes1.cc @@ -75,9 +75,16 @@ bool test02() { ix.join_assign(boundary_type(d-0.015)); ix.join_assign(boundary_type(d+0.015)); + // Many libm implementations only work with round-to-nearest. + // See, e.g, http://sources.redhat.com/bugzilla/show_bug.cgi?id=3976 + restore_pre_PPL_rounding(); + boundary_type sdm = boundary_type(sin(d-0.015)); + boundary_type sdp = boundary_type(sin(d-0.015)); + set_rounding_for_PPL(); + iy.assign(EMPTY); - iy.join_assign(boundary_type(sin(d-0.015))); - iy.join_assign(boundary_type(sin(d+0.015))); + iy.join_assign(sdm); + iy.join_assign(sdp); box.set_interval(x, ix); box.set_interval(y, iy); diff --git a/tests/Polyhedron/randphull1.cc b/tests/Polyhedron/randphull1.cc index 6fab90a..44103a5 100644 --- a/tests/Polyhedron/randphull1.cc +++ b/tests/Polyhedron/randphull1.cc @@ -98,6 +98,11 @@ point_on_the_unit_n_sphere(unsigned n, const std::vector<float>& theta, std::vector<float>& coordinate) { assert(n >= 2); + + // Many libm implementations only work with round-to-nearest. + // See, e.g, http://sources.redhat.com/bugzilla/show_bug.cgi?id=3976 + restore_pre_PPL_rounding(); + if (n == 2) { coordinate[0] *= sin(theta[0]); coordinate[1] *= cos(theta[0]); @@ -109,6 +114,8 @@ point_on_the_unit_n_sphere(unsigned n, coordinate[i] *= sin_theta_n_2; coordinate[n-1] *= cos(theta[n-2]); } + + set_rounding_for_PPL(); } void

1 0

[GIT] ppl/ppl(master): Documentation of restore_pre_PPL_rounding() extended .
by Roberto Bagnara 21 Jun '12

21 Jun '12

Module: ppl/ppl Branch: master Commit: 38a6756260a2c339f5aaddd012532194af1709e5 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=38a6756260a2… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jun 21 17:38:55 2012 +0200 Documentation of restore_pre_PPL_rounding() extended. --- src/Init.defs.hh | 5 +++++ 1 files changed, 5 insertions(+), 0 deletions(-) diff --git a/src/Init.defs.hh b/src/Init.defs.hh index f31121c..a6dfc73 100644 --- a/src/Init.defs.hh +++ b/src/Init.defs.hh @@ -42,6 +42,11 @@ void set_rounding_for_PPL(); /*! \brief Sets the FPU rounding mode as it was before initialization of the PPL. + This is important if the application uses floating-point computations + outside the PPL. It is crucial when the application uses functions + from a mathematical library that is not guaranteed to work correctly + under all rounding modes. + After calling this function it is absolutely necessary to call set_rounding_for_PPL() before using any PPL abstractions based on floating point numbers.

1 0

[GIT] ppl/ppl(master): Updated.
by Roberto Bagnara 21 Jun '12

21 Jun '12

Module: ppl/ppl Branch: master Commit: 224d39b5cc61e68067cb7d00030aa702462c9aee URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=224d39b5cc61… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jun 21 07:07:47 2012 +0200 Updated. --- NEWS | 21 +++++++++++---------- 1 files changed, 11 insertions(+), 10 deletions(-) diff --git a/NEWS b/NEWS index 5286ce9..3ff2c3f 100644 --- a/NEWS +++ b/NEWS @@ -9,7 +9,7 @@ Parma Polyhedra Library NEWS -- history of user-visible changes =============================================================== -------------------------------------------------------------------------- -NEWS for version 0.13 (release date TBD) +NEWS for version 1.0 (released on June 27, 2012) -------------------------------------------------------------------------- New and Changed Features @@ -19,9 +19,10 @@ o Added a generic interface for sequences of coefficients enabling a seamless switch between the dense or the sparse row representation. The implementation of many library entities (linear expressions, constraints, generators, congruences, and their systems) can now be - tailored to the specific usage context, sometimes leading to significant - memory space savings (e.g., for constraint systems describing weakly - relational abstractions such as boxes and octagonal shapes). + tailored to the specific usage context, sometimes leading to + significant memory space savings (e.g., for constraint systems + describing weakly relational abstractions such as boxes and + octagonal shapes). Bugfixes @@ -29,8 +30,8 @@ Bugfixes o Fixed a bug affecting methods - bool BD_Shape<T>::contains(const BD_Shape& y) const; - bool Octagonal_Shape<T>::contains(const Octagonal_Shape& y) const; + bool BD_Shape<T>::contains(const BD_Shape& y) const; + bool Octagonal_Shape<T>::contains(const Octagonal_Shape& y) const; whereby the wrong result was obtained when *this is an empty weakly-relational shape and y is not empty. @@ -55,10 +56,10 @@ o In the C, Java, OCaml and Prolog interfaces, modified the signature o Added new Box<ITV> methods - bool has_upper_bound(Variable var, - Coefficient& n, Coefficient& d, bool& closed) const; - bool has_lower_bound(Variable var, - Coefficient& n, Coefficient& d, bool& closed) const; + bool has_upper_bound(Variable var, + Coefficient& n, Coefficient& d, bool& closed) const; + bool has_lower_bound(Variable var, + Coefficient& n, Coefficient& d, bool& closed) const; to query a non-empty box for the existence and value of its upper/lower bound on variable `var'. The methods have been also added to all the

1 0