Miscallaneous fixes

diff --git a/include/deal.II/multigrid/mg_transfer_block.h b/include/deal.II/multigrid/mg_transfer_block.h
index f9792fb310540950c1874405b9ae5281a33d6f39..7c5fdcd4ab428e822e134930821a29339eb4ba34 100644 (file)
--- a/include/deal.II/multigrid/mg_transfer_block.h
+++ b/include/deal.II/multigrid/mg_transfer_block.h
@@ -367,6 +367,8 @@ public:
    * This function is a front-end for the same function in
    * MGTransferBlockBase.
    *
+   * @param dof The DoFHandler for the active degrees of freedom to use.
+   * @param mg_dof The DoFHandler for the level degrees of freedom to use.
    * @param selected Number of the block of the global vector to be copied from
    * and to the multilevel vector.
    *

diff --git a/include/deal.II/numerics/rtree.h b/include/deal.II/numerics/rtree.h
index 3a90eedd3d9d3a7f1af6710f510a9213af5764e7..4f88ebfba2ebeae3ae32230dbb02e0e7acc7e85a 100644 (file)
--- a/include/deal.II/numerics/rtree.h
+++ b/include/deal.II/numerics/rtree.h
@@ -40,7 +40,7 @@ DEAL_II_NAMESPACE_OPEN
  * values, using different balancing algorithms.
  *
  * From [Wikipedia](https://en.wikipedia.org/wiki/R-tree):
- * @quotation
+ * <blockquote>
  * R-trees are tree data structures used for spatial access methods, i.e., for
  * indexing multi-dimensional information such as geographical coordinates,
  * rectangles or polygons. The R-tree was proposed by Antonin Guttman in 1984
@@ -75,7 +75,7 @@ DEAL_II_NAMESPACE_OPEN
  * improving the way the tree is built and can be grouped into two objectives:
  * building an efficient tree from scratch (known as bulk-loading) and
  * performing changes on an existing tree (insertion and deletion).
- * @endquotation
+ * </blockquote>
  *
  * An RTree may store any type of @p LeafType as long as it is possible to extract
  * an @p Indexable that the RTree can handle and compare values. An @p Indexable