From 3dd93e4ca588c1876b3eb09e43b87eb3487702ab Mon Sep 17 00:00:00 2001 From: David Wells Date: Tue, 26 Feb 2019 20:58:14 -0500 Subject: [PATCH] Reflow comments. --- source/grid/grid_tools_dof_handlers.cc | 48 ++++++++------------------ 1 file changed, 15 insertions(+), 33 deletions(-) diff --git a/source/grid/grid_tools_dof_handlers.cc b/source/grid/grid_tools_dof_handlers.cc index 16012d59e5..208ece7de1 100644 --- a/source/grid/grid_tools_dof_handlers.cc +++ b/source/grid/grid_tools_dof_handlers.cc @@ -1136,20 +1136,12 @@ namespace GridTools ExcMessage("The two meshes must be represent triangulations that " "have the same coarse meshes")); - // the algorithm goes as follows: - // first, we fill a list with pairs - // of iterators common to the two - // meshes on the coarsest - // level. then we traverse the - // list; each time, we find a pair - // of iterators for which both - // correspond to non-active cells, - // we delete this item and push the - // pairs of iterators to their - // children to the back. if these - // again both correspond to - // non-active cells, we will get to - // the later on for further + // the algorithm goes as follows: first, we fill a list with pairs of + // iterators common to the two meshes on the coarsest level. then we + // traverse the list; each time, we find a pair of iterators for which + // both correspond to non-active cells, we delete this item and push the + // pairs of iterators to their children to the back. if these again both + // correspond to non-active cells, we will get to the later on for further // consideration using CellList = std::list>; @@ -1161,15 +1153,12 @@ namespace GridTools for (; cell_1 != mesh_1.end(0); ++cell_1, ++cell_2) cell_list.emplace_back(cell_1, cell_2); - // then traverse list as described - // above + // then traverse list as described above typename CellList::iterator cell_pair = cell_list.begin(); while (cell_pair != cell_list.end()) { - // if both cells in this pair - // have children, then erase - // this element and push their - // children instead + // if both cells in this pair have children, then erase this element + // and push their children instead if (cell_pair->first->has_children() && cell_pair->second->has_children()) { @@ -1180,28 +1169,21 @@ namespace GridTools cell_list.emplace_back(cell_pair->first->child(c), cell_pair->second->child(c)); - // erasing an iterator - // keeps other iterators - // valid, so already - // advance the present - // iterator by one and then - // delete the element we've - // visited before + // erasing an iterator keeps other iterators valid, so already + // advance the present iterator by one and then delete the element + // we've visited before const typename CellList::iterator previous_cell_pair = cell_pair; ++cell_pair; cell_list.erase(previous_cell_pair); } else - // both cells are active, do - // nothing + // both cells are active, do nothing ++cell_pair; } - // just to make sure everything is ok, - // validate that all pairs have at least one - // active iterator or have different - // refinement_cases + // just to make sure everything is ok, validate that all pairs have at + // least one active iterator or have different refinement_cases for (cell_pair = cell_list.begin(); cell_pair != cell_list.end(); ++cell_pair) Assert(cell_pair->first->active() || cell_pair->second->active() || -- 2.39.5