From 10eae8e53138850e72adbba1b5ffcf3d8a4b2f1e Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Sat, 10 Mar 2018 03:13:51 -0700 Subject: [PATCH] Minor doc update to step-35. --- examples/step-35/step-35.cc | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/examples/step-35/step-35.cc b/examples/step-35/step-35.cc index 4fa0a55391..99558bb7ad 100644 --- a/examples/step-35/step-35.cc +++ b/examples/step-35/step-35.cc @@ -517,10 +517,12 @@ namespace Step35 // // To do this in practice, we declare a "synchronous" iterator -- an // object that internally consists of several (in our case two) iterators, - // and each time the synchronous iteration is moved up one step, each of - // the iterators stored internally is moved up one step as well, thereby + // and each time the synchronous iteration is moved forward one step, each of + // the iterators stored internally is moved forward one step as well, thereby // always staying in sync. As it so happens, there is a deal.II class that - // facilitates this sort of thing. + // facilitates this sort of thing. (What is important here is to know that + // two DoFHandler objects built on the same triangulation will walk over + // the cells of the triangulation in the same order.) typedef std::tuple< typename DoFHandler::active_cell_iterator, typename DoFHandler::active_cell_iterator > IteratorTuple; -- 2.39.5