From: Wolfgang Bangerth Date: Wed, 15 Sep 2010 11:37:02 +0000 (+0000) Subject: Indent. X-Git-Tag: v8.0.0~5492 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=6152ea3f276861e1f6551c46186c86ba5741f7c5;p=dealii.git Indent. git-svn-id: https://svn.dealii.org/trunk@21981 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/base/include/base/polynomial.h b/deal.II/base/include/base/polynomial.h index 43b5925233..7c5889558b 100644 --- a/deal.II/base/include/base/polynomial.h +++ b/deal.II/base/include/base/polynomial.h @@ -468,26 +468,35 @@ namespace Polynomials * * @author Markus Bürg, 2009 */ -class Lobatto : public Polynomial { - public: - /** - * Constructor for polynomial of degree p. There is an exception for p==0, see the general documentation. - */ + class Lobatto : public Polynomial + { + public: + /** + * Constructor for polynomial of degree + * p. There is an exception + * for p==0, see the general + * documentation. + */ Lobatto (const unsigned int p = 0); - /** - * Return the polynomials with index 0 up to degree. There is an exception for p==0, see the general - * documentation. - */ - static std::vector > generate_complete_basis (const unsigned int p); + /** + * Return the polynomials with index + * 0 up to + * degree. There is an + * exception for p==0, see the + * general documentation. + */ + static std::vector > + generate_complete_basis (const unsigned int p); - private: - /** - * Compute coefficients recursively. - */ + private: + /** + * Compute coefficients recursively. + */ std::vector compute_coefficients (const unsigned int p); -}; + }; + /** * Hierarchical polynomials of arbitrary degree on [0,1]. *