From 9eaeb5892014e6c516a90a17016cf135123fcbb3 Mon Sep 17 00:00:00 2001 From: cjamin Date: Fri, 24 Jun 2016 14:27:15 +0000 Subject: Point_container => Point_range git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/subsampling_and_spatialsearching@1345 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 11cabe4d1928341da570b3eab465c3bb9ee0e46d --- src/Subsampling/include/gudhi/sparsify_point_set.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'src') diff --git a/src/Subsampling/include/gudhi/sparsify_point_set.h b/src/Subsampling/include/gudhi/sparsify_point_set.h index 09c4af13..b4536ec8 100644 --- a/src/Subsampling/include/gudhi/sparsify_point_set.h +++ b/src/Subsampling/include/gudhi/sparsify_point_set.h @@ -42,15 +42,15 @@ namespace subsampling { * */ -template +template void sparsify_point_set( - const Kernel &k, Point_container const& input_pts, + const Kernel &k, Point_range const& input_pts, typename Kernel::FT min_squared_dist, OutputIterator output_it) { typedef typename Gudhi::spatial_searching::Spatial_tree_data_structure< - Kernel, Point_container> Points_ds; + Kernel, Point_range> Points_ds; typename Kernel::Squared_distance_d sqdist = k.squared_distance_d_object(); @@ -65,7 +65,7 @@ sparsify_point_set( // Parse the input points, and add them if they are not too close to // the other points std::size_t pt_idx = 0; - for (typename Point_container::const_iterator it_pt = input_pts.begin() ; + for (typename Point_range::const_iterator it_pt = input_pts.begin() ; it_pt != input_pts.end(); ++it_pt, ++pt_idx) { -- cgit v1.2.3