Rename a function; also make it run faster.

The new name is dimension independent. The speed is gained because we do not need
to search a list from the top every time, but it is enough to start searching where
we left off previously.

diff --git a/source/grid/grid_reordering.cc b/source/grid/grid_reordering.cc
index 1b6c80397cf7d7640839fee8b7f95dc60dba00cc..d7db823bc57310bb58ca5bd1e7af1dd971d48a5e 100644 (file)
--- a/source/grid/grid_reordering.cc
+++ b/source/grid/grid_reordering.cc
@@ -463,10 +463,11 @@ namespace internal
      */
     template <int dim>
     unsigned int
-    get_next_unoriented_quad(const std::vector<Cell<dim> > &cells,
-                             const std::vector<Edge<dim> > &edges)
+    get_next_unoriented_cell(const std::vector<Cell<dim> > &cells,
+                             const std::vector<Edge<dim> > &edges,
+                             const unsigned int             current_cell)
     {
-      for (unsigned int c=0; c<cells.size(); ++c)
+      for (unsigned int c=current_cell; c<cells.size(); ++c)
         for (unsigned int l=0; l<GeometryInfo<dim>::lines_per_cell; ++l)
           if (edges[cells[c].edge_indices[l]].orientation_status == Edge<dim>::not_oriented)
             return c;
@@ -704,8 +705,10 @@ namespace internal
 
       // then loop over all cells and start orienting parallel edge sets
       // of cells that still have non-oriented edges
-      unsigned int next_cell_with_unoriented_edge;
-      while ((next_cell_with_unoriented_edge = get_next_unoriented_quad(cell_list, edge_list)) !=
+      unsigned int next_cell_with_unoriented_edge = 0;
+      while ((next_cell_with_unoriented_edge = get_next_unoriented_cell(cell_list,
+                                               edge_list,
+                                               next_cell_with_unoriented_edge)) !=
              numbers::invalid_unsigned_int)
         {
           // see which edge sets are still not oriented