* classes, whether the values in a block are stored consecutively or distributed
* (e.g. if the solution function is $u=(u_1, u_2)$, we could store the values
* in the solution vector like
- * $\ldots, u_1^m, u_2^m, u_1^{m+1}, u_2^{m+1},\ldots$ with $m$ denoting the
- * $m$th basis function, or $\ldots, u_1^m, u_1^{m+1}, u_1^{m+2}, \ldots,
- * u_2^m, u_2^{m+1}, u_2^{m+2}, \ldots$, respectively). Likewise, the
- * constraint matrix returned by DoFHandler::make_hanging_node_constraints()
- * is then
- * to be understood as a block matrix.
+ * $\ldots, u_1^m, u_2^m, u_1^{m+1}, u_2^{m+1},\ldots$ with <tt>m</tt>
+ * denoting the <tt>m</tt>th basis function, or $\ldots, u_1^m,
+ * u_1^{m+1}, u_1^{m+2}, \ldots, u_2^m, u_2^{m+1}, u_2^{m+2}, \ldots$,
+ * respectively). Likewise, the constraint matrix returned by
+ * DoFHandler::make_hanging_node_constraints() is then to be
+ * understood as a block matrix.
*
* The storage format of the degrees of freedom indices (short: DoF
* indices) is somewhat like a mirror of the data structures of the