Module: ppl/ppl Branch: compliance Commit: b66d4542348843ce6ac4fe8efc6f3686f0055117 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b66d454234884...
Author: Roberto Bagnara roberto.bagnara@bugseng.com Date: Wed Jun 18 21:56:56 2014 +0200
Deleted trailing whitespace.
---
src/Box_templates.hh | 12 ++++++------ src/Generator_inlines.hh | 2 +- src/Linear_System_inlines.hh | 2 +- src/MIP_Problem.cc | 2 +- src/Polyhedron_nonpublic.cc | 4 ++-- src/Polyhedron_public.cc | 4 ++-- 6 files changed, 13 insertions(+), 13 deletions(-)
diff --git a/src/Box_templates.hh b/src/Box_templates.hh index 092283e..078577b 100755 --- a/src/Box_templates.hh +++ b/src/Box_templates.hh @@ -1340,7 +1340,7 @@ Box<ITV>::affine_dimension() const { if (seq[k].is_singleton()) --d; } - + return d; }
@@ -1739,7 +1739,7 @@ Box<ITV>::drop_some_non_integer_points(Complexity_Class) { for (dimension_type k = seq.size(); k-- > 0; ) { seq[k].drop_some_non_integer_points(); } - + PPL_ASSERT(OK()); }
@@ -1764,7 +1764,7 @@ Box<ITV>::drop_some_non_integer_points(const Variables_Set& vars, v_end = vars.end(); v_i != v_end; ++v_i) { seq[*v_i].drop_some_non_integer_points(); } - + PPL_ASSERT(OK()); }
@@ -1798,7 +1798,7 @@ Box<ITV>::intersection_assign(const Box& y) { for (dimension_type k = space_dim; k-- > 0; ) { x.seq[k].intersect_assign(y.seq[k]); } - + PPL_ASSERT(x.OK()); }
@@ -1822,7 +1822,7 @@ Box<ITV>::upper_bound_assign(const Box& y) { for (dimension_type k = x.seq.size(); k-- > 0; ) { x.seq[k].join_assign(y.seq[k]); } - + PPL_ASSERT(x.OK()); }
@@ -1907,7 +1907,7 @@ Box<ITV>::difference_assign(const Box& y) { break; } } - + switch (number_non_contained) { case 0: // `y' covers `x': the difference is empty. diff --git a/src/Generator_inlines.hh b/src/Generator_inlines.hh index 0a85c2e..c3366b4 100644 --- a/src/Generator_inlines.hh +++ b/src/Generator_inlines.hh @@ -436,7 +436,7 @@ Generator::ascii_dump(std::ostream& s) const { expr.ascii_dump(s);
s << " "; - + switch (type()) { case Generator::LINE: s << "L "; diff --git a/src/Linear_System_inlines.hh b/src/Linear_System_inlines.hh index ed17b4e..9fc14aa 100644 --- a/src/Linear_System_inlines.hh +++ b/src/Linear_System_inlines.hh @@ -540,7 +540,7 @@ Linear_System<Row>::swap_row_intervals(dimension_type first, for (dimension_type i = first; i < last; ++i) { swap(rows[i], rows[i + offset]); } - + if (first < index_first_pending) // The swaps involved not pending rows, so they may not be sorted anymore. set_sorted(false); diff --git a/src/MIP_Problem.cc b/src/MIP_Problem.cc index 54ad205..a174b6d 100644 --- a/src/MIP_Problem.cc +++ b/src/MIP_Problem.cc @@ -1666,7 +1666,7 @@ PPL::MIP_Problem::erase_artificials(const dimension_type begin_artificials, for (dimension_type i = tableau_n_rows; i-- > 0; ) { tableau[i].reset(new_last_column); } - + // ... then properly set the element in the (new) last column, // encoding the kind of optimization; ... { diff --git a/src/Polyhedron_nonpublic.cc b/src/Polyhedron_nonpublic.cc index 5a9812e..0e71ea6 100644 --- a/src/Polyhedron_nonpublic.cc +++ b/src/Polyhedron_nonpublic.cc @@ -1499,7 +1499,7 @@ PPL::Polyhedron::BHZ09_C_poly_hull_assign_if_exact(const Polyhedron& y) { ++num_x_gs_red_in_y; } } - + Bit_Row y_gs_red_in_x; dimension_type num_y_gs_red_in_x = 0; for (dimension_type i = y_gs_num_rows; i-- > 0; ) { @@ -1555,7 +1555,7 @@ PPL::Polyhedron::BHZ09_C_poly_hull_assign_if_exact(const Polyhedron& y) { if (!y_gs_red_in_x[j]) add_generator(y_gs[j]); } - + PPL_ASSERT_HEAVY(OK()); return true; } diff --git a/src/Polyhedron_public.cc b/src/Polyhedron_public.cc index 60d44f6..d6d630d 100644 --- a/src/Polyhedron_public.cc +++ b/src/Polyhedron_public.cc @@ -499,7 +499,7 @@ PPL::Polyhedron::is_bounded() const { if (gen_sys[i].is_line_or_ray()) return false; } - + // The system of generators is composed only by // points and closure points: the polyhedron is bounded. return true; @@ -705,7 +705,7 @@ PPL::Polyhedron::constrains(const Variable var) const { if (gen_sys[i].is_line()) ++num_lines; } - + if (num_lines == space_dim) return false; }