From 2023ca9110cbc8638f28640f35505041c01566a9 Mon Sep 17 00:00:00 2001
From: vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Thu, 19 Jan 2017 08:58:37 +0000
Subject: Fix ccplint issue

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

Former-commit-id: 01ffb1d403c65a90d081cf17fe8f595c11a34bab
---
 src/Persistent_cohomology/example/rips_persistence_step_by_step.cpp | 3 ++-
 src/Rips_complex/include/gudhi/Rips_complex.h                       | 3 ++-
 src/common/include/gudhi/reader_utils.h                             | 3 ++-
 3 files changed, 6 insertions(+), 3 deletions(-)

(limited to 'src')

diff --git a/src/Persistent_cohomology/example/rips_persistence_step_by_step.cpp b/src/Persistent_cohomology/example/rips_persistence_step_by_step.cpp
index 1d9377df..c8f0921a 100644
--- a/src/Persistent_cohomology/example/rips_persistence_step_by_step.cpp
+++ b/src/Persistent_cohomology/example/rips_persistence_step_by_step.cpp
@@ -31,6 +31,8 @@
 #include <string>
 #include <vector>
 #include <limits>  // infinity
+#include <utility>  // for pair
+#include <map>
 
 // Types definition
 using Simplex_tree = Gudhi::Simplex_tree<Gudhi::Simplex_tree_options_fast_persistence>;
@@ -175,7 +177,6 @@ template< typename InputPointRange, typename Distance >
 Graph_t compute_proximity_graph(InputPointRange &points, Filtration_value threshold, Distance distance) {
   std::vector< Edge_t > edges;
   std::vector< Filtration_value > edges_fil;
-  std::map< Vertex_handle, Filtration_value > vertices;
 
   Vertex_handle idx_u, idx_v;
   Filtration_value fil;
diff --git a/src/Rips_complex/include/gudhi/Rips_complex.h b/src/Rips_complex/include/gudhi/Rips_complex.h
index c7bec34f..f0f39db8 100644
--- a/src/Rips_complex/include/gudhi/Rips_complex.h
+++ b/src/Rips_complex/include/gudhi/Rips_complex.h
@@ -160,7 +160,8 @@ class Rips_complex {
     // Creates the proximity graph from edges and sets the property with the filtration value.
     // Number of points is labeled from 0 to idx_u-1
     // --------------------------------------------------------------------------------------------
-    // Do not use : rips_skeleton_graph_ = OneSkeletonGraph(...) -> deep copy of the graph (boost graph is not move-enabled)
+    // Do not use : rips_skeleton_graph_ = OneSkeletonGraph(...) -> deep copy of the graph (boost graph is not
+    // move-enabled)
     rips_skeleton_graph_.~OneSkeletonGraph();
     new(&rips_skeleton_graph_)OneSkeletonGraph(edges.begin(), edges.end(), edges_fil.begin(), idx_u);
 
diff --git a/src/common/include/gudhi/reader_utils.h b/src/common/include/gudhi/reader_utils.h
index 4c8d85cd..97a87edd 100644
--- a/src/common/include/gudhi/reader_utils.h
+++ b/src/common/include/gudhi/reader_utils.h
@@ -30,9 +30,10 @@
 #include <iostream>
 #include <fstream>
 #include <map>
-#include <limits>  // for numeric_limits<>
+#include <limits>  // for numeric_limits
 #include <string>
 #include <vector>
+#include <utility>  // for pair
 
 // Keep this file tag for Doxygen to parse the code, otherwise, functions are not documented.
 // It is required for global functions and variables.
-- 
cgit v1.2.3