Fix the two comments from #8127.

diff --git a/include/deal.II/base/linear_index_iterator.h b/include/deal.II/base/linear_index_iterator.h
index deda04fbca409e5733c39405c444beabdfca166c..c3cc8f175ce958154f0ce7b9a1b32cba89ca680a 100644 (file)
--- a/include/deal.II/base/linear_index_iterator.h
+++ b/include/deal.II/base/linear_index_iterator.h
@@ -31,6 +31,7 @@ DEAL_II_NAMESPACE_OPEN
  * for SparseMatrix the mapping from buffer location to matrix entry
  * $\mathbf{A}(i, j)$ is more complicated. In any case, however, the
  * contiguous arrangements of elements enables random access iteration.
+ *
  * LinearIndexIterator provides most of the functionality needed to write
  * iterators for these classes. LinearIndexIterator is essentially a
  * simplified version of <code>boost::iterator_facade</code> that assumes

diff --git a/include/deal.II/optimization/rol/vector_adaptor.h b/include/deal.II/optimization/rol/vector_adaptor.h
index bb87f8083a8633d296509d18967a6d25ebd03a3a..2ce0fd15d0d8435e6aec6bd96e114752a50328c9 100644 (file)
--- a/include/deal.II/optimization/rol/vector_adaptor.h
+++ b/include/deal.II/optimization/rol/vector_adaptor.h
@@ -102,7 +102,7 @@ namespace Rol
    * @endcode
    *
    * @note The current implementation in ROL doesn't support vector sizes above
-   * the largest value of int type. Some of the vectors in deal.II (
+   * the largest value of int type. Some of the vectors in deal.II (see
    * @ref Vector)
    * may not satisfy the above requirements.
    *