3 files changed, 11 insertions, 15 deletions

diff --git a/src/common/example/Delaunay_triangulation_off_rw.cpp b/src/common/example/Delaunay_triangulation_off_rw.cpp
index 75e4fafb..4c7a9aaf 100644
--- a/src/common/example/Delaunay_triangulation_off_rw.cpp
+++ b/src/common/example/Delaunay_triangulation_off_rw.cpp
@@ -10,12 +10,12 @@
 // Use dynamic_dimension_tag for the user to be able to set dimension
 typedef CGAL::Epick_d< CGAL::Dynamic_dimension_tag > K;
 typedef CGAL::Delaunay_triangulation<K> T;
-// The triangulation uses the default instantiation of the 
+// The triangulation uses the default instantiation of the
 // TriangulationDataStructure template parameter
 
 void usage(char * const progName) {
   std::cerr << "Usage: " << progName << " inputFile.off outputFile.off" << std::endl;
-  exit(-1); // ----- >>
+  exit(-1);
 }
 
 int main(int argc, char **argv) {
@@ -30,9 +30,9 @@ int main(int argc, char **argv) {
   // Check the read operation was correct
   if (!off_reader.is_valid()) {
     std::cerr << "Unable to read file " << offInputFile << std::endl;
-    exit(-1); // ----- >>
+    exit(-1);
   }
-  
+
   // Retrieve the triangulation
   T* triangulation = off_reader.get_complex();
   // Operations on triangulation
@@ -47,8 +47,8 @@ int main(int argc, char **argv) {
   // Check the write operation was correct
   if (!off_writer.is_valid()) {
     std::cerr << "Unable to write file " << offOutputFile << std::endl;
-    exit(-1); // ----- >>
+    exit(-1);
   }
-  
+
   return 0;
-}
\ No newline at end of file
+}
diff --git a/src/common/include/gudhi/Delaunay_triangulation_off_io.h b/src/common/include/gudhi/Delaunay_triangulation_off_io.h
index 529774f0..e623cf7b 100644
--- a/src/common/include/gudhi/Delaunay_triangulation_off_io.h
+++ b/src/common/include/gudhi/Delaunay_triangulation_off_io.h
@@ -44,8 +44,8 @@ class Delaunay_triangulation_off_visitor_reader {
   Complex* complex_;
   typedef typename Complex::Point Point;
   std::vector<Point> point_cloud;
- public:
 
+ public:
   // TODO(VR) : Pass a Complex as a parameter is required, even if not used. Otherwise, compilation is KO.
 
   /** \brief Delaunay_triangulation_off_visitor_reader constructor
@@ -153,7 +153,6 @@ class Delaunay_triangulation_off_visitor_reader {
 template<typename Complex>
 class Delaunay_triangulation_off_reader {
  public:
-
   /** \brief Reads the OFF file and constructs the Delaunay triangulation from the points
    * that are in the OFF file.
    *
@@ -180,7 +179,6 @@ class Delaunay_triangulation_off_reader {
       std::cerr << "Delaunay_triangulation_off_reader::Delaunay_triangulation_off_reader could not open file " <<
           name_file << "\n";
     }
-
   }
 
   /** \brief Returns if the OFF file read operation was successful or not.
@@ -201,7 +199,6 @@ class Delaunay_triangulation_off_reader {
     if (valid_)
       return complex_;
     return nullptr;
-
   }
 
  private:
@@ -285,7 +282,6 @@ class Delaunay_triangulation_off_writer {
       }
 
       for (auto cit = complex_ptr->finite_full_cells_begin(); cit != complex_ptr->finite_full_cells_end(); ++cit) {
-        std::vector<int> vertexVector;
         stream << std::distance(cit->vertices_begin(), cit->vertices_end()) << " ";
         for (auto vit = cit->vertices_begin(); vit != cit->vertices_end(); ++vit) {
           stream << points_to_vh[(*vit)->point()] - 1 << " ";
@@ -299,7 +295,7 @@ class Delaunay_triangulation_off_writer {
           name_file << "\n";
     }
   }
-  
+
   /** \brief Returns if the OFF write operation was successful or not.
    *
    * @return OFF file write status.
@@ -313,6 +309,6 @@ class Delaunay_triangulation_off_writer {
   bool valid_;
 };
 
-} // namespace Gudhi
+}  // namespace Gudhi
 
 #endif  // DELAUNAY_TRIANGULATION_OFF_IO_H_
diff --git a/src/common/include/gudhi/Off_reader.h b/src/common/include/gudhi/Off_reader.h
index e45a7600..2420ae72 100644
--- a/src/common/include/gudhi/Off_reader.h
+++ b/src/common/include/gudhi/Off_reader.h
@@ -160,7 +160,7 @@ class Off_reader {
       iss >> num_face_vertices;
       std::vector<int> face;
       face.assign(std::istream_iterator<int>(iss), std::istream_iterator<int>());
-      //if (face.size() != (off_info_.dim + 1)) return false;
+      // if (face.size() != (off_info_.dim + 1)) return false;
       visitor.maximal_face(face);
     }
     return true;