From 41d85f200afcf4e4ffb5ef1bf64ad4a421f57451 Mon Sep 17 00:00:00 2001 From: Luca Heltai Date: Sun, 13 Aug 2017 17:35:15 -0600 Subject: [PATCH] Fixed indentation. --- include/deal.II/numerics/kdtree_distance.h | 6 +++--- source/numerics/kdtree_distance.cc | 8 ++++---- tests/numerics/kdtree_distance_01.cc | 12 +++++++----- 3 files changed, 14 insertions(+), 12 deletions(-) diff --git a/include/deal.II/numerics/kdtree_distance.h b/include/deal.II/numerics/kdtree_distance.h index 9676796531..08e048aa10 100644 --- a/include/deal.II/numerics/kdtree_distance.h +++ b/include/deal.II/numerics/kdtree_distance.h @@ -193,8 +193,8 @@ public: * @return vector of indices and distances of the matching points */ std::vector > get_points_within_ball(const Point &target, - const double &radius, - bool sorted=false) const; + const double &radius, + bool sorted=false) const; /** * Fill two vectors with the indices and distances of the closest @@ -209,7 +209,7 @@ public: * @return a vector of pairs of indices and distances of the matching points */ std::vector > get_closest_points(const Point &target, - const unsigned int n_points) const; + const unsigned int n_points) const; private: /** diff --git a/source/numerics/kdtree_distance.cc b/source/numerics/kdtree_distance.cc index 72cb1c863b..04345d5125 100644 --- a/source/numerics/kdtree_distance.cc +++ b/source/numerics/kdtree_distance.cc @@ -19,8 +19,8 @@ KDTreeDistance::KDTreeDistance(const unsigned int &max_leaf_size, template std::vector > KDTreeDistance::get_points_within_ball(const Point ¢er, - const double &radius, - bool sorted) const + const double &radius, + bool sorted) const { std::vector > matches; Assert(adaptor, ExcNotInitialized()); @@ -37,7 +37,7 @@ std::vector > KDTreeDistance::get_points_wi template std::vector > KDTreeDistance::get_closest_points(const Point &target, - const unsigned int n_points) const + const unsigned int n_points) const { Assert(adaptor, ExcNotInitialized()); Assert(kdtree, ExcInternalError()); @@ -46,7 +46,7 @@ std::vector > KDTreeDistance::get_closest_p std::vector > matches(n_points); kdtree->knnSearch(&target[0], n_points, &indices[0], &distances[0]); - for(unsigned int i=0; i