From b2efeb519cdb43e407be5d1c0834c5cb39cc216a Mon Sep 17 00:00:00 2001 From: cjamin Date: Thu, 30 Jun 2016 15:48:13 +0000 Subject: Doc improvements git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/subsampling_and_spatialsearching@1368 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: a55a3d2b3c378a5a6347963b40976e50a8ee7816 --- src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/Spatial_searching') diff --git a/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h b/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h index 18fb864a..016975b8 100644 --- a/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h +++ b/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h @@ -81,7 +81,7 @@ public: typedef CGAL::Orthogonal_k_neighbor_search K_neighbor_search; typedef typename K_neighbor_search::Tree Tree; typedef typename K_neighbor_search::Distance Distance; - /// The range returned by a k-nearest neighbor search. + /// \brief The range returned by a k-nearest neighbor search. /// Its value type is `std::pair` where `first` is the index /// of a point P and `second` is the squared distance between P and the query point. typedef K_neighbor_search KNS_range; @@ -89,7 +89,7 @@ public: typedef CGAL::Orthogonal_incremental_neighbor_search< STraits, Distance, CGAL::Sliding_midpoint, Tree> Incremental_neighbor_search; - /// The range returned by an incremental nearest neighbor search. + /// \brief The range returned by an incremental nearest neighbor search. /// Its value type is `std::pair` where `first` is the index /// of a point P and `second` is the squared distance between P and the query point. typedef Incremental_neighbor_search INS_range; -- cgit v1.2.3