a few more

diff --git a/include/deal.II/algorithms/general_data_storage.h b/include/deal.II/algorithms/general_data_storage.h
index e028de135133f10b043aa6806a433e1f1ee79278..556ec7d50e9a094e633cebeae18e6d1d6c26f685 100644 (file)
--- a/include/deal.II/algorithms/general_data_storage.h
+++ b/include/deal.II/algorithms/general_data_storage.h
@@ -78,7 +78,7 @@ public:
   size() const;
 
   /**
-   *  Merge the contents of @p other_data with this object.
+   * Merge the contents of @p other_data with this object.
    */
   void
   merge(const GeneralDataStorage &other_data);

diff --git a/include/deal.II/base/data_out_base.h b/include/deal.II/base/data_out_base.h
index 2a6da9fd79e1b169fd1719ac08b7f71ca55b6e07..e98d1a41b8ac69ddadf8874eba6d8f1103225dca 100644 (file)
--- a/include/deal.II/base/data_out_base.h
+++ b/include/deal.II/base/data_out_base.h
@@ -1986,7 +1986,7 @@ namespace DataOutBase
    *
    * For more information consult the Tecplot Users and Reference manuals.
    *
-   *  @deprecated Use the version using DataComponentInterpretation instead.
+   * @deprecated Use the version using DataComponentInterpretation instead.
    */
   template <int dim, int spacedim>
   DEAL_II_DEPRECATED void

diff --git a/include/deal.II/base/linear_index_iterator.h b/include/deal.II/base/linear_index_iterator.h
index 84b264da377254e058e751a080d27d3ce8e5a105..deda04fbca409e5733c39405c444beabdfca166c 100644 (file)
--- a/include/deal.II/base/linear_index_iterator.h
+++ b/include/deal.II/base/linear_index_iterator.h
@@ -31,7 +31,6 @@ 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