[PPL-devel] [GIT] ppl/ppl(master): Spurious spaces removed.

[Roberto Bagnara]

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

Author: Roberto Bagnara <bagnara at cs.unipr.it>
Date:   Sun Feb 12 21:08:36 2012 +0100

Spurious spaces removed.

---

 src/BD_Shape.templates.hh        |   40 +++++++++++++++++++-------------------
 src/Octagonal_Shape.templates.hh |   40 +++++++++++++++++++-------------------
 2 files changed, 40 insertions(+), 40 deletions(-)

diff --git a/src/BD_Shape.templates.hh b/src/BD_Shape.templates.hh
index 7fe9743..8b74cac 100644
--- a/src/BD_Shape.templates.hh
+++ b/src/BD_Shape.templates.hh
@@ -1470,27 +1470,27 @@ BD_Shape<T>::relation_with(const Constraint& c) const {
       switch (sgn(min_numer)) {
       case 1:
         if (c.is_equality())
-          return  Poly_Con_Relation::is_disjoint();
-        return  Poly_Con_Relation::is_included();
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_included();
       case 0:
         if (c.is_strict_inequality() || c.is_equality())
-          return  Poly_Con_Relation::strictly_intersects();
-        return  Poly_Con_Relation::is_included();
+          return Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::is_included();
       case -1:
-        return  Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::strictly_intersects();
       }
     }
     if (!bounded_below) {
       max_numer += c.inhomogeneous_term() * max_denom;
       switch (sgn(max_numer)) {
       case 1:
-        return  Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::strictly_intersects();
       case 0:
         if (c.is_strict_inequality())
-          return  Poly_Con_Relation::is_disjoint();
-        return  Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
       case -1:
-        return  Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       }
     }
     else {
@@ -1501,30 +1501,30 @@ BD_Shape<T>::relation_with(const Constraint& c) const {
         switch (sgn(min_numer)) {
         case 1:
           if (c.is_equality())
-            return  Poly_Con_Relation::is_disjoint();
-          return  Poly_Con_Relation::is_included();
+            return Poly_Con_Relation::is_disjoint();
+          return Poly_Con_Relation::is_included();
         case 0:
           if (c.is_equality())
-            return  Poly_Con_Relation::strictly_intersects();
+            return Poly_Con_Relation::strictly_intersects();
           if (c.is_strict_inequality())
-            return  Poly_Con_Relation::strictly_intersects();
-          return  Poly_Con_Relation::is_included();
+            return Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_included();
         case -1:
-          return  Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::strictly_intersects();
         }
       case 0:
         if (min_numer == 0) {
           if (c.is_strict_inequality())
-            return  Poly_Con_Relation::is_disjoint()
+            return Poly_Con_Relation::is_disjoint()
               && Poly_Con_Relation::saturates();
-          return  Poly_Con_Relation::is_included()
+          return Poly_Con_Relation::is_included()
             && Poly_Con_Relation::saturates();
         }
         if (c.is_strict_inequality())
-          return  Poly_Con_Relation::is_disjoint();
-        return  Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
       case -1:
-        return  Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       }
     }
   }
diff --git a/src/Octagonal_Shape.templates.hh b/src/Octagonal_Shape.templates.hh
index 36338be..1c47af1 100644
--- a/src/Octagonal_Shape.templates.hh
+++ b/src/Octagonal_Shape.templates.hh
@@ -1895,27 +1895,27 @@ Octagonal_Shape<T>::relation_with(const Constraint& c) const {
       switch (sgn(min_numer)) {
       case 1:
         if (c.is_equality())
-          return  Poly_Con_Relation::is_disjoint();
-        return  Poly_Con_Relation::is_included();
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_included();
       case 0:
         if (c.is_strict_inequality() || c.is_equality())
-          return  Poly_Con_Relation::strictly_intersects();
-        return  Poly_Con_Relation::is_included();
+          return Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::is_included();
       case -1:
-        return  Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::strictly_intersects();
       }
     }
     if (!bounded_below) {
       max_numer += c.inhomogeneous_term() * max_denom;
       switch (sgn(max_numer)) {
       case 1:
-        return  Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::strictly_intersects();
       case 0:
         if (c.is_strict_inequality())
-          return  Poly_Con_Relation::is_disjoint();
-        return  Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
       case -1:
-        return  Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       }
     }
     else {
@@ -1926,30 +1926,30 @@ Octagonal_Shape<T>::relation_with(const Constraint& c) const {
         switch (sgn(min_numer)) {
         case 1:
           if (c.is_equality())
-            return  Poly_Con_Relation::is_disjoint();
-          return  Poly_Con_Relation::is_included();
+            return Poly_Con_Relation::is_disjoint();
+          return Poly_Con_Relation::is_included();
         case 0:
           if (c.is_equality())
-            return  Poly_Con_Relation::strictly_intersects();
+            return Poly_Con_Relation::strictly_intersects();
           if (c.is_strict_inequality())
-            return  Poly_Con_Relation::strictly_intersects();
-          return  Poly_Con_Relation::is_included();
+            return Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_included();
         case -1:
-          return  Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::strictly_intersects();
         }
       case 0:
         if (min_numer == 0) {
           if (c.is_strict_inequality())
-            return  Poly_Con_Relation::is_disjoint()
+            return Poly_Con_Relation::is_disjoint()
               && Poly_Con_Relation::saturates();
-          return  Poly_Con_Relation::is_included()
+          return Poly_Con_Relation::is_included()
             && Poly_Con_Relation::saturates();
         }
         if (c.is_strict_inequality())
-          return  Poly_Con_Relation::is_disjoint();
-        return  Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
       case -1:
-        return  Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       }
     }
   }