Point to the only tutorial program that uses this class.

diff --git a/include/deal.II/base/synchronous_iterator.h b/include/deal.II/base/synchronous_iterator.h
index cbbd2694dfa2bc64110985819575889c4c1c6c56..20e71c962cee3c8110648fed63437b74ec3b3e92 100644 (file)
--- a/include/deal.II/base/synchronous_iterator.h
+++ b/include/deal.II/base/synchronous_iterator.h
@@ -33,7 +33,8 @@ DEAL_II_NAMESPACE_OPEN
  * we have synchronous iterators marching through the containers
  * <code>a,b</code>. If an object of this type represents the end of a range,
  * only the first element is considered (we only have <code>a.end()</code>,
- * not <code>b.end()</code>)
+ * not <code>b.end()</code>). An example of how this class is used is given
+ * in step-35.
  *
  * The template argument of the current class shall be of type
  * <code>std::tuple</code> with arguments equal to the iterator types.