From 6fab81bfeec2919a4662f16d56769715dbc40fb2 Mon Sep 17 00:00:00 2001 From: Timo Heister Date: Sat, 6 Feb 2016 18:47:33 -0500 Subject: [PATCH] more manual formatting --- include/deal.II/base/polynomials_bernstein.h | 2 +- include/deal.II/dofs/block_info.h | 4 +- include/deal.II/dofs/dof_handler.h | 3 +- include/deal.II/hp/dof_handler.h | 3 +- include/deal.II/lac/parpack_solver.h | 47 +++++++++----------- include/deal.II/lac/relaxation_block.h | 9 ++-- 6 files changed, 34 insertions(+), 34 deletions(-) diff --git a/include/deal.II/base/polynomials_bernstein.h b/include/deal.II/base/polynomials_bernstein.h index 5d5baa1ae0..be7fccc69f 100644 --- 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 0f5b5b6e95..3bf931e1d4 100644 --- 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 * DoFHandler 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)); * } - * + * @endcode * * In this * example, solution 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 0cb63a97f5..727372449b 100644 --- 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 eb75df64d1..e3bc3ceaf9 100644 --- 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 0281678bbc..30787882bf 100644 --- a/include/deal.II/lac/parpack_solver.h +++ b/include/deal.II/lac/parpack_solver.h @@ -554,24 +554,21 @@ void PArpackSolver::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::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 ipntr (14, 0); @@ -787,9 +783,8 @@ void PArpackSolver::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 6bc64515ea..9564acb94e 100644 --- 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 -- 2.39.5