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

1 files changed, 10 insertions, 10 deletions

diff --git a/src/Spatial_searching/example/example_spatial_searching.cpp b/src/Spatial_searching/example/example_spatial_searching.cpp
index 034ad24a..8f9151fc 100644
--- a/src/Spatial_searching/example/example_spatial_searching.cpp
+++ b/src/Spatial_searching/example/example_spatial_searching.cpp
@@ -23,38 +23,38 @@ int main(void) {
   Points_ds points_ds(points);
 
   // 10-nearest neighbor query
-  std::cout << "10 nearest neighbors from points[20]:\n";
+  std::clog << "10 nearest neighbors from points[20]:\n";
   auto knn_range = points_ds.k_nearest_neighbors(points[20], 10, true);
   for (auto const& nghb : knn_range)
-    std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
+    std::clog << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
 
   // Incremental nearest neighbor query
-  std::cout << "Incremental nearest neighbors:\n";
+  std::clog << "Incremental nearest neighbors:\n";
   auto inn_range = points_ds.incremental_nearest_neighbors(points[45]);
   // Get the neighbors in distance order until we hit the first point
   for (auto ins_iterator = inn_range.begin(); ins_iterator->first != 0; ++ins_iterator)
-    std::cout << ins_iterator->first << " (sq. dist. = " << ins_iterator->second << ")\n";
+    std::clog << ins_iterator->first << " (sq. dist. = " << ins_iterator->second << ")\n";
 
   // 10-furthest neighbor query
-  std::cout << "10 furthest neighbors from points[20]:\n";
+  std::clog << "10 furthest neighbors from points[20]:\n";
   auto kfn_range = points_ds.k_furthest_neighbors(points[20], 10, true);
   for (auto const& nghb : kfn_range)
-    std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
+    std::clog << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
 
   // Incremental furthest neighbor query
-  std::cout << "Incremental furthest neighbors:\n";
+  std::clog << "Incremental furthest neighbors:\n";
   auto ifn_range = points_ds.incremental_furthest_neighbors(points[45]);
   // Get the neighbors in distance reverse order until we hit the first point
   for (auto ifs_iterator = ifn_range.begin(); ifs_iterator->first != 0; ++ifs_iterator)
-    std::cout << ifs_iterator->first << " (sq. dist. = " << ifs_iterator->second << ")\n";
+    std::clog << ifs_iterator->first << " (sq. dist. = " << ifs_iterator->second << ")\n";
 
   // All-near-neighbors search
-  std::cout << "All-near-neighbors search:\n";
+  std::clog << "All-near-neighbors search:\n";
   std::vector<std::size_t> rs_result;
   points_ds.all_near_neighbors(points[45], 0.5, std::back_inserter(rs_result));
   K k;
   for (auto const& p_idx : rs_result)
-    std::cout << p_idx << " (sq. dist. = " << k.squared_distance_d_object()(points[p_idx], points[45]) << ")\n";
+    std::clog << p_idx << " (sq. dist. = " << k.squared_distance_d_object()(points[p_idx], points[45]) << ")\n";
 
   return 0;
 }