kns, kfs... => knn, kfn...

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

Former-commit-id: 4965c110b94a8ff1e919464a1f55ec3e62fd8bbf

1 files changed, 8 insertions, 8 deletions

diff --git a/src/Spatial_searching/example/example_spatial_searching.cpp b/src/Spatial_searching/example/example_spatial_searching.cpp
index 46aa48b3..528ec029 100644
--- a/src/Spatial_searching/example/example_spatial_searching.cpp
+++ b/src/Spatial_searching/example/example_spatial_searching.cpp
@@ -25,28 +25,28 @@ int main (void)
 
   // 10-nearest neighbor query
   std::cout << "10 nearest neighbors from points[20]:\n";
-  auto kns_range = points_ds.query_k_nearest_neighbors(points[20], 10, true);
-  for (auto const& nghb : kns_range)
+  auto knn_range = points_ds.query_k_nearest_neighbors(points[20], 10, true);
+  for (auto const& nghb : knn_range)
     std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
 
   // Incremental nearest neighbor query
   std::cout << "Incremental nearest neighbors:\n";
-  auto ins_range = points_ds.query_incremental_nearest_neighbors(points[45]);
+  auto inn_range = points_ds.query_incremental_nearest_neighbors(points[45]);
   // Get the neighbors in distance order until we hit the first point
-  for (auto ins_iterator = ins_range.begin(); ins_iterator->first != 0 ; ++ins_iterator)
+  for (auto ins_iterator = inn_range.begin(); ins_iterator->first != 0 ; ++ins_iterator)
     std::cout << ins_iterator->first << " (sq. dist. = " << ins_iterator->second << ")\n";
 
   // 10-farthest neighbor query
   std::cout << "10 farthest neighbors from points[20]:\n";
-  auto kfs_range = points_ds.query_k_farthest_neighbors(points[20], 10, true);
-  for (auto const& nghb : kfs_range)
+  auto kfn_range = points_ds.query_k_farthest_neighbors(points[20], 10, true);
+  for (auto const& nghb : kfn_range)
     std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
 
   // Incremental farthest neighbor query
   std::cout << "Incremental farthest neighbors:\n";
-  auto ifs_range = points_ds.query_incremental_farthest_neighbors(points[45]);
+  auto ifn_range = points_ds.query_incremental_farthest_neighbors(points[45]);
   // Get the neighbors in distance reverse order until we hit the first point
-  for (auto ifs_iterator = ifs_range.begin(); ifs_iterator->first != 0 ; ++ifs_iterator)
+  for (auto ifs_iterator = ifn_range.begin(); ifs_iterator->first != 0 ; ++ifs_iterator)
     std::cout << ifs_iterator->first << " (sq. dist. = " << ifs_iterator->second << ")\n";
   
   return 0;