From febc98cb37413339f41e0134ceaff5efe996ef37 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Wed, 12 Aug 2009 03:25:11 +0000 Subject: [PATCH] Use instead of . git-svn-id: https://svn.dealii.org/trunk@19228 0785d39b-7218-0410-832d-ea1e28bc413d --- .../deal.II/include/grid/filtered_iterator.h | 20 +++++++++---------- 1 file changed, 10 insertions(+), 10 deletions(-) diff --git a/deal.II/deal.II/include/grid/filtered_iterator.h b/deal.II/deal.II/include/grid/filtered_iterator.h index 35eb729111..b11fa3dc9d 100644 --- a/deal.II/deal.II/include/grid/filtered_iterator.h +++ b/deal.II/deal.II/include/grid/filtered_iterator.h @@ -216,11 +216,11 @@ namespace IteratorFilters * * The object that represent the condition an iterator has to satisfy * only have 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 - * objects where the return value of this function is false. + * 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 + * objects where the return value of this function is false. * * * An example of a simple valid predicate is the following: given the function @@ -284,7 +284,7 @@ namespace IteratorFilters * const unsigned int subdomain_id; * }; * @endcode - * Objects like SubdomainEqualTo(3) can then be used as predicates. + * Objects like SubdomainEqualTo(3) can then be used as predicates. * * Since whenever a predicate is evaluated it is checked that the * iterator checked is actually valid (i.e. not past the end), no @@ -313,8 +313,8 @@ namespace IteratorFilters * however, a value is given to the constructor, that value has either * to be past the end, or has to satisfy the predicate. For example, * if the predicate only evaluates to true if the level of an object - * is equal to three, then tria.begin_active(3) would be a valid - * choice while tria.begin() would not since the latter also + * is equal to three, then tria.begin_active(3) would be a valid + * choice while tria.begin() would not since the latter also * returns iterators to non-active cells which always start at level * 0. * @@ -326,7 +326,7 @@ namespace IteratorFilters * assign the next or last previous iterator that satisfies the * predicate, i.e. they follow the list of iterators in either * direction until they find a matching one (or the past-the-end - * iterator). Like the operator= they return the resulting value + * iterator). Like the operator= they return the resulting value * of the filtered iterator. * * @@ -378,7 +378,7 @@ namespace IteratorFilters * Since comparison between filtered and unfiltered iterators is * defined, we could as well have let the @p endc variable in the * last example be of type - * Triangulation::active_cell_iterator since it is unchanged + * Triangulation@::active_cell_iterator since it is unchanged * and its value does not depend on the filter. * * @ingroup grid -- 2.39.5