June 2014 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(master): Long lines avoided.
by Roberto Bagnara 08 Jun '14

08 Jun '14

Module: ppl/ppl Branch: master Commit: 057444894a1b5e509f8017c7a99ef7b2df1b74c5 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=057444894a1b… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Sun Jun 8 17:06:33 2014 +0200 Long lines avoided. Fixes violations of rule LP1.41 detected by ECLAIR. --- src/Polyhedron_nonpublic.cc | 9 ++++++--- 1 files changed, 6 insertions(+), 3 deletions(-) diff --git a/src/Polyhedron_nonpublic.cc b/src/Polyhedron_nonpublic.cc index b00f50c..0457714 100644 --- a/src/Polyhedron_nonpublic.cc +++ b/src/Polyhedron_nonpublic.cc @@ -2310,10 +2310,13 @@ PPL::Polyhedron::positive_time_elapse_assign_impl(const Polyhedron& y) { const Generator &gx = x_points_gs.sys.rows[j]; PPL_ASSERT(gx.is_point()); // ...insert the point obtained as the sum of g and gx. - Generator new_g = g; // make a copy - Coefficient new_divisor = g.expr.inhomogeneous_term() * gx.expr.inhomogeneous_term(); + Generator new_g = g; + Coefficient new_divisor + = g.expr.inhomogeneous_term() * gx.expr.inhomogeneous_term(); - new_g.expr.linear_combine(gx.expr, gx.expr.inhomogeneous_term(), g.expr.inhomogeneous_term()); + new_g.expr.linear_combine(gx.expr, + gx.expr.inhomogeneous_term(), + g.expr.inhomogeneous_term()); new_g.expr.set_inhomogeneous_term(new_divisor); if (new_g.is_not_necessarily_closed()) { new_g.set_epsilon_coefficient(g.epsilon_coefficient());

1 0

[GIT] ppl/ppl(master): Tabs avoided.
by Roberto Bagnara 08 Jun '14

08 Jun '14

Module: ppl/ppl Branch: master Commit: f583be190c8ea3ad57216efc2ec17b71807b8b14 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f583be190c8e… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Sun Jun 8 16:39:39 2014 +0200 Tabs avoided. Fixes violations of rule UCRP1.RS1 detected by ECLAIR. --- src/Polyhedron_nonpublic.cc | 16 ++++++++-------- 1 files changed, 8 insertions(+), 8 deletions(-) diff --git a/src/Polyhedron_nonpublic.cc b/src/Polyhedron_nonpublic.cc index ad47770..b00f50c 100644 --- a/src/Polyhedron_nonpublic.cc +++ b/src/Polyhedron_nonpublic.cc @@ -2320,19 +2320,19 @@ PPL::Polyhedron::positive_time_elapse_assign_impl(const Polyhedron& y) { } new_g.expr.normalize(); PPL_ASSERT(new_g.OK()); - new_gs.insert(new_g); + new_gs.insert(new_g); } break; case Generator::CLOSURE_POINT: // If g is not the origin, insert g into new_gs, as a ray. if (!g.expr.all_homogeneous_terms_are_zero()) { - // Turn a copy of g into a ray. - Generator g_as_a_ray = g; - g_as_a_ray.expr.set_inhomogeneous_term(0); - g_as_a_ray.expr.normalize(); - PPL_ASSERT(g_as_a_ray.OK()); - // Insert the ray. - new_gs.insert(g_as_a_ray); + // Turn a copy of g into a ray. + Generator g_as_a_ray = g; + g_as_a_ray.expr.set_inhomogeneous_term(0); + g_as_a_ray.expr.normalize(); + PPL_ASSERT(g_as_a_ray.OK()); + // Insert the ray. + new_gs.insert(g_as_a_ray); } break; case Generator::RAY:

1 0

extrapolation and termination
by Bishoksan Kafle 01 Jun '14

01 Jun '14

Dear Roberto, I have a question about extrapolation operators in PPL library, in general, they don't guarantee termination, right? Then, I found the following text from the documentation: "Note that a convergence guarantee can only be obtained by suitably restricting the set of constraints that can occur in this additional parameter. " Here is my question: Do they guarantee termination if I have a fixed set (any) of constraints? or the set of constraints has to be carefully chosen? Many thanks in advance :) Best Bishoksan

2 1