From 5ae83bbfdece0c1e2bf42a972be61cfbb199f5fc Mon Sep 17 00:00:00 2001 From: Graham Harper Date: Mon, 9 Jul 2018 23:02:20 +0000 Subject: [PATCH] Fix polynomials indentation --- include/deal.II/base/polynomials_bernardi_raugel.h | 6 +++--- source/base/polynomials_bernardi_raugel.cc | 2 +- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/include/deal.II/base/polynomials_bernardi_raugel.h b/include/deal.II/base/polynomials_bernardi_raugel.h index eff77c3847..8672ab6a6c 100644 --- a/include/deal.II/base/polynomials_bernardi_raugel.h +++ b/include/deal.II/base/polynomials_bernardi_raugel.h @@ -32,7 +32,7 @@ DEAL_II_NAMESPACE_OPEN /** * This class implements the Bernardi-Raugel polynomials similarly to the * description in the Mathematics of Computation paper from 1985 by - * Christine Bernardi and Geneviève Raugel. + * Christine Bernardi and Geneviève Raugel. * * The Bernardi-Raugel polynomials are originally defined as an enrichment * of the $(P_1)^d$ elements on simplicial meshes for Stokes problems by the @@ -71,10 +71,10 @@ DEAL_II_NAMESPACE_OPEN * $z=1$ edge: $\mathbf{p}_6 = \mathbf{n}_6 (x)(1-x)(y)(1-y)(z)$ * * - * + * * Then the $BR_1(E)$ polynomials are defined on quadrilaterals and hexahedra * by $BR_1(E) = Q_1(E) \oplus \mbox{span}\{\mathbf{p}_i, i=1,...,2d\}$. - * + * * * @ingroup Polynomials * @author Graham Harper diff --git a/source/base/polynomials_bernardi_raugel.cc b/source/base/polynomials_bernardi_raugel.cc index c94ff1fb4f..793fe0f0f5 100644 --- a/source/base/polynomials_bernardi_raugel.cc +++ b/source/base/polynomials_bernardi_raugel.cc @@ -97,7 +97,7 @@ PolynomialsBernardiRaugel::compute( std::vector> bubble_fourth_derivatives; int n_bubbles = std::pow(3, dim); // size for create_polynomials_bubble - int n_q = 1 << dim; // size for create_polynomials_q + int n_q = 1 << dim; // size for create_polynomials_q // don't resize if the provided vector has 0 length Q_values.resize((values.size() == 0) ? 0 : n_q); -- 2.39.5