Merge tag 'tags/gudhi-release-3.2.0' into dfsg/latest

3 files changed, 17 insertions, 17 deletions

diff --git a/src/Skeleton_blocker/example/Skeleton_blocker_from_simplices.cpp b/src/Skeleton_blocker/example/Skeleton_blocker_from_simplices.cpp
index 486827eb..d04ca289 100644
--- a/src/Skeleton_blocker/example/Skeleton_blocker_from_simplices.cpp
+++ b/src/Skeleton_blocker/example/Skeleton_blocker_from_simplices.cpp
@@ -35,13 +35,13 @@ int main(int argc, char *argv[]) {
   Complex complex(Gudhi::skeleton_blocker::make_complex_from_top_faces<Complex>(simplices.begin(), simplices.end()));
 
 
-  std::cout << "Simplices:" << std::endl;
+  std::clog << "Simplices:" << std::endl;
   for (const Simplex & s : complex.complex_simplex_range())
-    std::cout << s << " ";
-  std::cout << std::endl;
+    std::clog << s << " ";
+  std::clog << std::endl;
 
   // One blocker as simplex 0123 is not in the complex but all its proper faces are.
-  std::cout << "Blockers: " << complex.blockers_to_string() << std::endl;
+  std::clog << "Blockers: " << complex.blockers_to_string() << std::endl;
 
   // now build a complex from its full list of simplices
   simplices.clear();
@@ -53,13 +53,13 @@ int main(int argc, char *argv[]) {
   simplices.push_back(Simplex(Vertex_handle(2), Vertex_handle(0)));
   complex = Complex(simplices.begin(), simplices.end());
 
-  std::cout << "Simplices:" << std::endl;
+  std::clog << "Simplices:" << std::endl;
   for (const Simplex & s : complex.complex_simplex_range())
-    std::cout << s << " ";
-  std::cout << std::endl;
+    std::clog << s << " ";
+  std::clog << std::endl;
 
   // One blocker as simplex 012 is not in the complex but all its proper faces are.
-  std::cout << "Blockers: " << complex.blockers_to_string() << std::endl;
+  std::clog << "Blockers: " << complex.blockers_to_string() << std::endl;
 
   return EXIT_SUCCESS;
 }
diff --git a/src/Skeleton_blocker/example/Skeleton_blocker_iteration.cpp b/src/Skeleton_blocker/example/Skeleton_blocker_iteration.cpp
index 7f301047..62084692 100644
--- a/src/Skeleton_blocker/example/Skeleton_blocker_iteration.cpp
+++ b/src/Skeleton_blocker/example/Skeleton_blocker_iteration.cpp
@@ -45,7 +45,7 @@ int main(int argc, char *argv[]) {
   // more appropriated!
   unsigned num_vertices = 0;
   for (auto v : complex.vertex_range()) {
-    std::cout << "Vertex " << v << std::endl;
+    std::clog << "Vertex " << v << std::endl;
     ++num_vertices;
   }
 
@@ -65,9 +65,9 @@ int main(int argc, char *argv[]) {
     else
       euler -= 1;
   }
-  std::cout << "Saw " << num_vertices << " vertices, " << num_edges << " edges and " << num_simplices << " simplices"
+  std::clog << "Saw " << num_vertices << " vertices, " << num_edges << " edges and " << num_simplices << " simplices"
       << std::endl;
-  std::cout << "The Euler Characteristic is " << euler << std::endl;
-  std::cout << skbl_chrono;
+  std::clog << "The Euler Characteristic is " << euler << std::endl;
+  std::clog << skbl_chrono;
   return EXIT_SUCCESS;
 }
diff --git a/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp b/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp
index e634b656..ba7ce43c 100644
--- a/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp
+++ b/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp
@@ -32,25 +32,25 @@ int main(int argc, char *argv[]) {
   Simplex tetrahedron(Vertex_handle(0), Vertex_handle(1), Vertex_handle(2), Vertex_handle(3));
   complex.add_simplex(tetrahedron);
 
-  std::cout << "complex:" << complex.to_string() << std::endl;
+  std::clog << "complex:" << complex.to_string() << std::endl;
 
   // build the link of vertex 1, eg a triangle {0,2,3}
   auto link = complex.link(Vertex_handle(1));
-  std::cout << "link:" << link.to_string() << std::endl;
+  std::clog << "link:" << link.to_string() << std::endl;
 
   // Internally link is a subcomplex of 'complex' and its vertices are stored in a vector.
   // They can be accessed via Vertex_handle(x) where x is an index of the vector.
   // In that example, link has three vertices and thus it contains only
   // Vertex_handle(0),Vertex_handle(1) and Vertex_handle(2) are).
   for (int i = 0; i < 5; ++i)
-    std::cout << "link.contains_vertex(Vertex_handle(" << i << ")):" << link.contains_vertex(Vertex_handle(i)) <<
+    std::clog << "link.contains_vertex(Vertex_handle(" << i << ")):" << link.contains_vertex(Vertex_handle(i)) <<
         std::endl;
-  std::cout << std::endl;
+  std::clog << std::endl;
 
   // To access to the initial vertices eg (0,1,2,3,4),  Root_vertex_handle must be used.
   // For instance, to test if the link contains the vertex that was labeled i:
   for (int i = 0; i < 5; ++i)
-    std::cout << "link.contains_vertex(Root_vertex_handle(" << i << ")):" <<
+    std::clog << "link.contains_vertex(Root_vertex_handle(" << i << ")):" <<
       link.contains_vertex(Root_vertex_handle(i)) << std::endl;
 
   return EXIT_SUCCESS;