Fix polynomials indentation

diff --git a/include/deal.II/base/polynomials_bernardi_raugel.h b/include/deal.II/base/polynomials_bernardi_raugel.h
index eff77c3847592fe2ef5f158b537f7e3da4402774..8672ab6a6c06e23799e71e88aa4b74ecce6eb935 100644 (file)
--- 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 <i>Mathematics of Computation</i> 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)$
  *
  *</dl>
- * 
+ *
  * 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 c94ff1fb4f8e5eade20c5220329c2782ddd85fa6..793fe0f0f5345f8cc705df1b42eb1879645ae7b7 100644 (file)
--- a/source/base/polynomials_bernardi_raugel.cc
+++ b/source/base/polynomials_bernardi_raugel.cc
@@ -97,7 +97,7 @@ PolynomialsBernardiRaugel<dim>::compute(
   std::vector<Tensor<4, dim>> 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);