From 41d85f200afcf4e4ffb5ef1bf64ad4a421f57451 Mon Sep 17 00:00:00 2001
From: Luca Heltai <luca.heltai@sissa.it>
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<std::pair<unsigned int, double> > get_points_within_ball(const Point<dim> &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<std::pair<unsigned int, double> >  get_closest_points(const Point<dim> &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<dim>::KDTreeDistance(const unsigned int &max_leaf_size,
 
 template<int dim>
 std::vector<std::pair<unsigned int, double> > KDTreeDistance<dim>::get_points_within_ball(const Point<dim> &center,
-                                                                                          const double &radius,
-                                                                                          bool sorted) const
+    const double &radius,
+    bool sorted) const
 {
   std::vector<std::pair<unsigned int, double> > matches;
   Assert(adaptor, ExcNotInitialized());
@@ -37,7 +37,7 @@ std::vector<std::pair<unsigned int, double> > KDTreeDistance<dim>::get_points_wi
 
 template<int dim>
 std::vector<std::pair<unsigned int, double> > KDTreeDistance<dim>::get_closest_points(const Point<dim> &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<std::pair<unsigned int, double> > KDTreeDistance<dim>::get_closest_p
   std::vector<std::pair<unsigned int, double> > matches(n_points);
 
   kdtree->knnSearch(&target[0], n_points, &indices[0], &distances[0]);
-  for(unsigned int i=0; i<n_points; ++i)
+  for (unsigned int i=0; i<n_points; ++i)
     matches[i] = std::make_pair(indices[i], distances[i]);
   return matches;
 }
diff --git a/tests/numerics/kdtree_distance_01.cc b/tests/numerics/kdtree_distance_01.cc
index 3946f396dc..2c0ae731e6 100644
--- a/tests/numerics/kdtree_distance_01.cc
+++ b/tests/numerics/kdtree_distance_01.cc
@@ -43,14 +43,16 @@ int main ()
 
   kdtree.set_points(points);
 
-  for (auto &p : test_points) {
+  for (auto &p : test_points)
+    {
       auto res = kdtree.get_closest_points(p,1)[0];
-     deallog << "P: " << p << ", distance: " << res.second << ", index: " << res.first << std::endl;
+      deallog << "P: " << p << ", distance: " << res.second << ", index: " << res.first << std::endl;
     }
 
   deallog << "Consistency checking: the following are all the points in the set." << std::endl;
-  for (auto &p : points) {
-    auto res = kdtree.get_closest_points(p,1)[0];
-    deallog << "P: " << p << ", distance: " << res.second << ", index: " << res.first << std::endl;
+  for (auto &p : points)
+    {
+      auto res = kdtree.get_closest_points(p,1)[0];
+      deallog << "P: " << p << ", distance: " << res.second << ", index: " << res.first << std::endl;
     }
 }
-- 
2.39.5