polynomials_p.h

Go to the documentation of this file.

// ---------------------------------------------------------------------
//
// Copyright (C) 2004 - 2022 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE.md at
// the top level directory of deal.II.
//
// ---------------------------------------------------------------------
 
#ifndef dealii_polynomials_P_h
#define dealii_polynomials_P_h
 
 
#include <deal.II/base/config.h>
 
#include <deal.II/base/exceptions.h>
#include <deal.II/base/point.h>
#include <deal.II/base/polynomial.h>
#include <deal.II/base/polynomial_space.h>
#include <deal.II/base/tensor.h>
 
#include <memory>
#include <vector>
 
DEAL_II_NAMESPACE_OPEN
template <int dim>
class PolynomialsP : public PolynomialSpace<dim>
{
public:
  static constexpr unsigned int dimension = dim;
 
  PolynomialsP(const unsigned int p);
 
  virtual unsigned int
  degree() const override;
 
  std::array<unsigned int, dim>
  directional_degrees(unsigned int n) const;
 
  std::unique_ptr<ScalarPolynomialsBase<dim>>
  clone() const override
  {
    return std::make_unique<PolynomialsP<dim>>(*this);
  }
 
private:
  void
  create_polynomial_ordering(std::vector<unsigned int> &index_map) const;
 
  const unsigned int p;
};
 
template <int dim>
inline unsigned int
PolynomialsP<dim>::degree() const
{
  return p;
}
 
 
template <int dim>
inline std::array<unsigned int, dim>
PolynomialsP<dim>::directional_degrees(unsigned int n) const
{
  return this->compute_index(n);
}
 
DEAL_II_NAMESPACE_CLOSE
 
#endif