Reference documentation for deal.II version Git 3f1f337db3 2021-10-23 13:19:02 -0600
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
polynomials_p.h
Go to the documentation of this file.
1 // ---------------------------------------------------------------------
2 //
3 // Copyright (C) 2004 - 2020 by the deal.II authors
4 //
5 // This file is part of the deal.II library.
6 //
7 // The deal.II library is free software; you can use it, redistribute
8 // it, and/or modify it under the terms of the GNU Lesser General
9 // Public License as published by the Free Software Foundation; either
10 // version 2.1 of the License, or (at your option) any later version.
11 // The full text of the license can be found in the file LICENSE.md at
12 // the top level directory of deal.II.
13 //
14 // ---------------------------------------------------------------------
15 
16 #ifndef dealii_polynomials_P_h
17 #define dealii_polynomials_P_h
18 
19 
20 #include <deal.II/base/config.h>
21 
23 #include <deal.II/base/point.h>
26 #include <deal.II/base/tensor.h>
27 
28 #include <memory>
29 #include <vector>
30 
46 template <int dim>
47 class PolynomialsP : public PolynomialSpace<dim>
48 {
49 public:
54  static const unsigned int dimension = dim;
55 
60  PolynomialsP(const unsigned int p);
61 
68  virtual unsigned int
69  degree() const override;
70 
77  std::array<unsigned int, dim>
78  directional_degrees(unsigned int n) const;
79 
80  std::unique_ptr<ScalarPolynomialsBase<dim>>
81  clone() const override
82  {
83  return std::make_unique<PolynomialsP<dim>>(*this);
84  }
85 
86 private:
90  void
91  create_polynomial_ordering(std::vector<unsigned int> &index_map) const;
92 
97  const unsigned int p;
98 };
99 
102 template <int dim>
103 inline unsigned int
105 {
106  return p;
107 }
108 
109 
110 template <int dim>
111 inline std::array<unsigned int, dim>
113 {
114  return this->compute_index(n);
115 }
116 
118 
119 #endif
std::unique_ptr< ScalarPolynomialsBase< dim > > clone() const override
Definition: polynomials_p.h:81
void create_polynomial_ordering(std::vector< unsigned int > &index_map) const
std::array< unsigned int, dim > directional_degrees(unsigned int n) const
virtual unsigned int degree() const override
#define DEAL_II_NAMESPACE_CLOSE
Definition: config.h:401
std::array< unsigned int, dim > compute_index(const unsigned int n) const
static const unsigned int dimension
Definition: polynomials_p.h:54
#define DEAL_II_NAMESPACE_OPEN
Definition: config.h:400
const unsigned int p
Definition: polynomials_p.h:97
std::vector< unsigned int > index_map
PolynomialsP(const unsigned int p)