From: Wolfgang Bangerth Date: Fri, 19 Nov 2021 18:31:59 +0000 (-0700) Subject: Update the documentation on iterator filters. X-Git-Tag: v9.4.0-rc1~800^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=refs%2Fpull%2F12972%2Fhead;p=dealii.git Update the documentation on iterator filters. --- diff --git a/include/deal.II/grid/filtered_iterator.h b/include/deal.II/grid/filtered_iterator.h index 08fbf867a8..4733739411 100644 --- a/include/deal.II/grid/filtered_iterator.h +++ b/include/deal.II/grid/filtered_iterator.h @@ -336,7 +336,7 @@ namespace IteratorFilters * DoFHandler iterators by only iterating over elements that satisfy a given * filter (called a predicate, following the notation of the C++ * standard library). Once initialized with a predicate and a value for the - * iterator, a filtered iterator hops to the next or previous element that + * iterator, a filtered iterator advances to the next or previous element that * satisfies the predicate if operators ++ or \-- are invoked. Intermediate * iterator values that lie in between but do not satisfy the predicate are * skipped. It is thus very simple to write loops over a certain class of @@ -344,6 +344,33 @@ namespace IteratorFilters * to satisfy in each loop iteration. This in particular is helpful if * functions are called with a pair of iterators denoting a range on which * they shall act, by choosing a filtered iterator instead of usual ones. + * The use of this class is particularly useful when writing "ranged-based" + * `for` loops of the form + * @code + * for (const auto &cell : ) + * { ... } + * @endcode + * An example is to write + * @code + * DoFHandler dof_handler; + * ... + * for (const auto &cell : + * dof_handler.active_cell_iterators() + * | IteratorFilters::LocallyOwnedCell() + * | IteratorFilters::AtBoundary()) + * { + * fe_values.reinit (cell); + * ...do the local integration on 'cell'...; + * } + * @endcode + * where the resulting loop iterates over all active cells that are also + * locally owned and that point to cells that are at the boundary of the + * domain. + * + * This class implements functionality comparable to what was added to C++20 + * in the form of + * [range adaptors](https://en.cppreference.com/w/cpp/ranges/filter_view) + * and the filters and filter views that represent them. * * This class is used in step-32. * @@ -351,7 +378,7 @@ namespace IteratorFilters *

Predicates

* * The object that represent the condition an iterator has to satisfy only - * have to provide an interface that allows to call the evaluation operator, + * has to provide an interface that allows to call the evaluation operator, * i.e. bool operator() (const BaseIterator&). This includes * function pointers as well as classes that implement an bool operator * ()(const BaseIterator&). Then, the FilteredIterator will skip all @@ -381,9 +408,10 @@ namespace IteratorFilters * return (static_cast(c->level()) == level); * }; * @endcode - * then + * then the lambda function * @code - * [](const BIterator& c){ return level_equal_to(c, 3);} + * [](const BIterator& c) { return level_equal_to(c, + * 3);} * @endcode * is another valid predicate (here: a function that returns true if either * the iterator is past the end or the level is equal to the second argument; @@ -852,6 +880,24 @@ namespace internal * } * @endcode * + * @note This function is obsolete and should be replaced by calling + * `operator|` instead. The latter is certainly more in the + * spirit of + * [C++20 range + * adaptors](https://en.cppreference.com/w/cpp/ranges/filter_view) and results + * in the following code instead of the one shown above: + * @code + * DoFHandler dof_handler; + * ... + * for (const auto &cell : + * dof_handler.active_cell_iterators() + * | IteratorFilters::LocallyOwnedCell()) + * { + * fe_values.reinit (cell); + * ...do the local integration on 'cell'...; + * } + * @endcode + * * @relatesalso FilteredIterator * @ingroup CPP11 */ @@ -900,6 +946,25 @@ filter_iterators(IteratorRange i, const Predicate &p) * } * @endcode * + * @note This function is obsolete and should be replaced by calling + * `operator|` once or multiple times instead. + * The latter is certainly more in the spirit of + * [C++20 range + * adaptors](https://en.cppreference.com/w/cpp/ranges/filter_view) and results + * in the following code instead of the one shown above: + * @code + * DoFHandler dof_handler; + * ... + * for (const auto &cell : + * dof_handler.active_cell_iterators() + * | IteratorFilters::LocallyOwnedCell() + * | IteratorFilters::AtBoundary()) + * { + * fe_values.reinit (cell); + * ...do the local integration on 'cell'...; + * } + * @endcode + * * @relatesalso FilteredIterator * @ingroup CPP11 */ @@ -956,6 +1021,23 @@ filter_iterators(IteratorRange i, * a range of iterators that only contains those cells that are both active * and locally owned. * + * @note The `|` operator can be applied more than once. This results in code + * such as the following: + * @code + * DoFHandler dof_handler; + * ... + * for (const auto &cell : + * dof_handler.active_cell_iterators() + * | IteratorFilters::LocallyOwnedCell() + * | IteratorFilters::AtBoundary()) + * { + * fe_values.reinit (cell); + * ...do the local integration on 'cell'...; + * } + * @endcode + * In this code, the loop executes over all active cells that are both + * locally owned and located at the boundary. + * * @relatesalso FilteredIterator * @ingroup CPP11 */