From 00e6e420e6bda8bc703de4d2de6e831821bad906 Mon Sep 17 00:00:00 2001
From: vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Mon, 22 Jan 2018 12:50:03 +0000
Subject: Fix some cpplint

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@3148 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 34a01d0b7d9b59e72fd14e7616a09dde50e1dbd1
---
 src/Nerve_GIC/include/gudhi/GIC.h | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

(limited to 'src/Nerve_GIC/include')

diff --git a/src/Nerve_GIC/include/gudhi/GIC.h b/src/Nerve_GIC/include/gudhi/GIC.h
index 9dc754f4..2fd61f14 100644
--- a/src/Nerve_GIC/include/gudhi/GIC.h
+++ b/src/Nerve_GIC/include/gudhi/GIC.h
@@ -169,9 +169,9 @@ class Cover_complex {
     double u;
     while (m < sampleSize) {
       u = GetUniform();
-      if ((populationSize - t) * u >= sampleSize - m)
+      if ((populationSize - t) * u >= sampleSize - m) {
         t++;
-      else {
+      } else {
         samples[m] = t;
         t++;
         m++;
@@ -679,8 +679,9 @@ class Cover_complex {
             tmp++;
           }
           u = inter3.second;
-        } else
+        } else {
           u = inter1.first;
+        }
 
         std::pair<double, double> inter2 = intervals[i + 1];
         while (func[points[tmp]] < inter2.first && tmp != n) {
@@ -1110,9 +1111,9 @@ class Cover_complex {
    */
   template <typename SimplicialComplex>
   void compute_distribution(int N = 100) {
-    if (distribution.size() >= N)
+    if (distribution.size() >= N) {
       std::cout << "Already done!" << std::endl;
-    else {
+    } else {
       for (int i = 0; i < N - distribution.size(); i++) {
         Cover_complex Cboot;
         Cboot.n = this->n;
-- 
cgit v1.2.3