Indent arguments uniformly.

diff --git a/include/deal.II/grid/grid_tools.h b/include/deal.II/grid/grid_tools.h
index 38807c8455da8ae620b7e3fd8bd5e18e1793f01a..da0f37e578e2c5e2de03c4f3ce370767d05f2f15 100644 (file)
--- a/include/deal.II/grid/grid_tools.h
+++ b/include/deal.II/grid/grid_tools.h
@@ -1370,9 +1370,11 @@ namespace GridTools
   template < class MeshType >
   std::vector< BoundingBox< MeshType::space_dimension > >
   compute_mesh_predicate_bounding_box
-  ( const MeshType &mesh,
+  ( const MeshType                                                              &mesh,
     const std::function<bool (const typename MeshType::active_cell_iterator &)> &predicate,
-    const unsigned int &refinement_level = 0, const bool &allow_merge = false, const unsigned int &max_boxes = numbers::invalid_unsigned_int);
+    const unsigned int                                                          &refinement_level = 0,
+    const bool                                                                  &allow_merge = false,
+    const unsigned int                                                          &max_boxes = numbers::invalid_unsigned_int);
 
   /**
    * Given an array of points, use the global bounding box description obtained using

diff --git a/source/grid/grid_tools.cc b/source/grid/grid_tools.cc
index 80122b2fe26028a9a2fc9c879e930d165048c1bf..5d126f1c0dffeda0d9aedc5ee749c7a955cc7bba 100644 (file)
--- a/source/grid/grid_tools.cc
+++ b/source/grid/grid_tools.cc
@@ -1804,9 +1804,11 @@ next_cell:
   template < class MeshType >
   std::vector< BoundingBox<MeshType::space_dimension> >
   compute_mesh_predicate_bounding_box
-  (const MeshType &mesh,
+  (const MeshType                                                              &mesh,
    const std::function<bool (const typename MeshType::active_cell_iterator &)> &predicate,
-   const unsigned int &refinement_level,  const bool &allow_merge, const unsigned int &max_boxes)
+   const unsigned int                                                          &refinement_level,
+   const bool                                                                  &allow_merge,
+   const unsigned int                                                          &max_boxes)
   {
     // Algorithm brief description: begin with creating bounding boxes of all cells at
     // refinement_level (and coarser levels if there are active cells) which have the predicate
@@ -1853,7 +1855,7 @@ next_cell:
         std::vector<unsigned int> merged_boxes_idx;
         bool found_neighbors = true;
 
-        // We merge only nighbors which can be expressed by a single bounding box
+        // We merge only neighbors which can be expressed by a single bounding box
         // e.g. in 1d [0,1] and [1,2] can be described with [0,2] without losing anything
         while (found_neighbors)
           {