[PPL-devel] [GIT] ppl/ppl(compliance): Use a monotonic indentation style.

[Roberto Bagnara]

Module: ppl/ppl
Branch: compliance
Commit: dbc2d08da5e9062670d62e7ff37aff35e7cec601
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=dbc2d08da5e9062670d62e7ff37aff35e7cec601

Author: Roberto Bagnara <roberto.bagnara at bugseng.com>
Date:   Mon Jul 28 21:45:24 2014 +0200

Use a monotonic indentation style.
Fixes violations detected by ECLAIR checker B.MONOINDENT.

---

 src/Pending_List_templates.hh        |    2 +-
 src/Polyhedron_minimize_templates.hh |    2 +-
 src/Polyhedron_simplify_templates.hh |    4 ++--
 3 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/Pending_List_templates.hh b/src/Pending_List_templates.hh
index 54f04f1..440b17e 100644
--- a/src/Pending_List_templates.hh
+++ b/src/Pending_List_templates.hh
@@ -42,7 +42,7 @@ Pending_List<Traits>::insert(const typename Traits::Threshold& deadline,
        position != active_list_end
          && Traits::less_than(position->deadline(), deadline);
        ++position) {
-   }
+  }
   iterator pending_element_p;
   // Only allocate a new element if the free list is empty.
   if (free_list.empty()) {
diff --git a/src/Polyhedron_minimize_templates.hh b/src/Polyhedron_minimize_templates.hh
index 40d1d53..d9e4e78 100644
--- a/src/Polyhedron_minimize_templates.hh
+++ b/src/Polyhedron_minimize_templates.hh
@@ -414,7 +414,7 @@ Polyhedron::add_and_minimize(const bool con_to_gen,
       if (dest[first_point].expr.get(Variable(dest.space_dimension())) > 0) {
         break;
       }
-     }
+    }
   }
 
   if (first_point == dest_num_rows) {
diff --git a/src/Polyhedron_simplify_templates.hh b/src/Polyhedron_simplify_templates.hh
index c2da7bc..71d4ffb 100644
--- a/src/Polyhedron_simplify_templates.hh
+++ b/src/Polyhedron_simplify_templates.hh
@@ -290,8 +290,8 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
             swap(sat[j], sat[num_rows]);
             swap(num_saturators[j], num_saturators[num_rows]);
           }
-       }
-       else {
+        }
+        else {
           // If we reach this point then we know that `sat[i]' does
           // not contain (and is different from) `sat[j]', so that
           // `sys[i]' is not made redundant by inequality `sys[j]'.