more manual formatting

diff --git a/include/deal.II/base/polynomials_bernstein.h b/include/deal.II/base/polynomials_bernstein.h
index 5d5baa1ae0c4462b0b1ce62fad8bc4212c34adc3..be7fccc69fc90693ce47b887ae7c96800c8d6a74 100644 (file)
--- a/include/deal.II/base/polynomials_bernstein.h
+++ b/include/deal.II/base/polynomials_bernstein.h
@@ -26,7 +26,7 @@ public:
   /**
    * Construct the @p index -th Bernstein Polynomial of degree @p degree.
    *
-   * @f{aligned*}{
+   * @f{align*}{
    * B_{\text{index}, \text{degree}} (t)
    *   &= \text{binom}(\text{degree}, \text{index})
    *      \cdot t^{\text{index}}

diff --git a/include/deal.II/dofs/block_info.h b/include/deal.II/dofs/block_info.h
index 0f5b5b6e9574096cb4e1ee8d630d32494b2a9be8..3bf931e1d48ebb9617b4dc4b0dd5203342eb66fe 100644 (file)
--- a/include/deal.II/dofs/block_info.h
+++ b/include/deal.II/dofs/block_info.h
@@ -64,7 +64,7 @@ namespace hp
  * The most common usage for this object is initializing vectors as in the
  * following code:
  *
- * <code>
+ * @code
  * DoFHandler<dim> dof_handler(triangulation);
  * dof_handler.distribute_dofs(fe_system);
  * dof_handler.distribute_mg_dofs(fe_system);
@@ -77,7 +77,7 @@ namespace hp
  *   {
  *     mg_vector[i].reinit(dof_handler.block_info().level(i));
  *   }
- * </code>
+ * @endcode
  *
  * In this
  * example, <tt>solution</tt> obtains the block structure needed to represent

diff --git a/include/deal.II/dofs/dof_handler.h b/include/deal.II/dofs/dof_handler.h
index 0cb63a97f5c84c3c8cd1769f9a79d282f2ab42e2..727372449b51f59f9e33566470a478d77f0b7166 100644 (file)
--- a/include/deal.II/dofs/dof_handler.h
+++ b/include/deal.II/dofs/dof_handler.h
@@ -67,7 +67,8 @@ namespace internal
 /**
  * Manage the distribution and numbering of the degrees of freedom for non-
  * multigrid algorithms. This class satisfies the
- * @ref ConceptMeshType "MeshType concept" requirements.
+ * @ref ConceptMeshType "MeshType concept"
+ * requirements.
  *
  * It is first used in the step-2 tutorial program.
  *

diff --git a/include/deal.II/hp/dof_handler.h b/include/deal.II/hp/dof_handler.h
index eb75df64d143b0644c7abe44041fb1d9c5df4c87..e3bc3ceaf97ecc6326c187e0716df9b3d370acc5 100644 (file)
--- a/include/deal.II/hp/dof_handler.h
+++ b/include/deal.II/hp/dof_handler.h
@@ -70,7 +70,8 @@ namespace hp
   /**
    * Manage the distribution and numbering of the degrees of freedom for hp-
    * FEM algorithms. This class satisfies the
-   * @ref ConceptMeshType "MeshType concept" requirements.
+   * @ref ConceptMeshType "MeshType concept"
+   * requirements.
    *
    * The purpose of this class is to allow for an enumeration of degrees of
    * freedom in the same way as the ::DoFHandler class, but it allows to use a

diff --git a/include/deal.II/lac/parpack_solver.h b/include/deal.II/lac/parpack_solver.h
index 0281678bbc83110d22fc52cf4fee3734410b08eb..30787882bfd390b1136543b4f7987e38b3209aa5 100644 (file)
--- a/include/deal.II/lac/parpack_solver.h
+++ b/include/deal.II/lac/parpack_solver.h
@@ -554,24 +554,21 @@ void PArpackSolver<VectorType>::solve
   // must be zero on the first call to pdnaupd
   int ido = 0;
 
-  /**
-   * 'G' generalized eigenvalue problem
-   * 'I' standard eigenvalue problem
-   */
+  // 'G' generalized eigenvalue problem
+  // 'I' standard eigenvalue problem
   char bmat[2] = "G";
 
-  /** Specify the eigenvalues of interest,
-   *  possible parameters
-   *  "LA" algebraically largest
-   *  "SA" algebraically smallest
-   *  "LM" largest magnitude
-   *  "SM" smallest magnitude
-   *  "LR" largest real part
-   *  "SR" smallest real part
-   *  "LI" largest imaginary part
-   *  "SI" smallest imaginary part
-   *  "BE" both ends of spectrum simultaneous
-   */
+  // Specify the eigenvalues of interest, possible parameters:
+  // "LA" algebraically largest
+  // "SA" algebraically smallest
+  // "LM" largest magnitude
+  // "SM" smallest magnitude
+  // "LR" largest real part
+  // "SR" smallest real part
+  // "LI" largest imaginary part
+  // "SI" smallest imaginary part
+  // "BE" both ends of spectrum simultaneous
+  
   char which[3];
   switch (additional_data.eigenvalue_of_interest)
     {
@@ -619,13 +616,12 @@ void PArpackSolver<VectorType>::solve
   // Parpack currently works only for NB = 1
   iparam[3] = 1;
 
-  /** Sets the mode of dsaupd.
-   *  1 is exact shifting,
-   *  2 is user-supplied shifts,
-   *  3 is shift-invert mode,
-   *  4 is buckling mode,
-   *  5 is Cayley mode.
-   */
+  // Sets the mode of dsaupd:
+  // 1 is exact shifting,
+  // 2 is user-supplied shifts,
+  // 3 is shift-invert mode,
+  // 4 is buckling mode,
+  // 5 is Cayley mode.
 
   iparam[6] = mode;
   std::vector<int> ipntr (14, 0);
@@ -787,9 +783,8 @@ void PArpackSolver<VectorType>::solve
     }
   else
     {
-      /** 1 - compute eigenvectors,
-       *  0 - only eigenvalues
-       */
+      // 1 - compute eigenvectors,
+      // 0 - only eigenvalues
       int rvec = 1;
 
       // which eigenvectors

diff --git a/include/deal.II/lac/relaxation_block.h b/include/deal.II/lac/relaxation_block.h
index 6bc64515ea17c394c6d742323d40517088948fad..9564acb94e3eed59b412ae016bf11b3efd227ed3 100644 (file)
--- a/include/deal.II/lac/relaxation_block.h
+++ b/include/deal.II/lac/relaxation_block.h
@@ -235,7 +235,8 @@ protected:
  * Block Jacobi (additive Schwarz) method with possibly overlapping blocks.
  *
  * This class implements the step() and Tstep() functions expected by the
- * @ref ConceptRelaxationType "relaxation concept". They perform an additive
+ * @ref ConceptRelaxationType "relaxation concept".
+ * They perform an additive
  * Schwarz method on the blocks provided in the block list of AdditionalData.
  * Differing from PreconditionBlockJacobi, these blocks may be of varying
  * size, non- contiguous, and overlapping. On the other hand, this class does
@@ -319,7 +320,8 @@ public:
  * Block Gauss-Seidel method with possibly overlapping blocks.
  *
  * This class implements the step() and Tstep() functions expected by the
- * @ref ConceptRelaxationType "relaxation concept". They perform a
+ * @ref ConceptRelaxationType "relaxation concept".
+ * They perform a
  * multiplicative Schwarz method on the blocks provided in the block list of
  * AdditionalData.  Differing from PreconditionBlockSOR, these blocks may be
  * of varying size, non-contiguous, and overlapping. On the other hand, this
@@ -399,7 +401,8 @@ public:
  * Symmetric block Gauss-Seidel method with possibly overlapping blocks.
  *
  * This class implements the step() and Tstep() functions expected by the
- * @ref ConceptRelaxationType "relaxation concept". They perform a
+ * @ref ConceptRelaxationType "relaxation concept".
+ * They perform a
  * multiplicative Schwarz method on the blocks provided in the block list of
  * AdditionalData in symmetric fashion. Differing from PreconditionBlockSSOR,
  * these blocks may be of varying size, non-contiguous, and overlapping. On