16 #ifndef dealii_fe_poly_face_h
17 #define dealii_fe_poly_face_h
20 #include <deal.II/base/qprojector.h>
21 #include <deal.II/base/std_cxx14/memory.h>
23 #include <deal.II/fe/fe.h>
26 DEAL_II_NAMESPACE_OPEN
56 template <
class PolynomialType,
57 int dim = PolynomialType::dimension + 1,
88 virtual std::unique_ptr<
98 return std_cxx14::make_unique<InternalData>();
101 std::unique_ptr<typename FiniteElement<dim, spacedim>::InternalDataBase>
103 const UpdateFlags update_flags,
112 std::unique_ptr<typename FiniteElement<dim, spacedim>::InternalDataBase>
113 data_ptr = std_cxx14::make_unique<InternalData>();
114 auto &data = dynamic_cast<InternalData &>(*data_ptr);
117 const unsigned int n_q_points = quadrature.
size();
120 std::vector<double> values(0);
121 std::vector<
Tensor<1, dim - 1>> grads(0);
122 std::vector<
Tensor<2, dim - 1>> grad_grads(0);
123 std::vector<
Tensor<3, dim - 1>> empty_vector_of_3rd_order_tensors;
124 std::vector<
Tensor<4, dim - 1>> empty_vector_of_4th_order_tensors;
129 if (data.update_each & update_values)
133 std::vector<double>(n_q_points));
134 for (
unsigned int i = 0; i < n_q_points; ++i)
140 empty_vector_of_3rd_order_tensors,
141 empty_vector_of_4th_order_tensors);
143 for (
unsigned int k = 0; k <
poly_space.n(); ++k)
144 data.shape_values[k][i] = values[k];
149 if (data.update_each & update_gradients ||
150 data.update_each & update_hessians)
158 std::unique_ptr<typename FiniteElement<dim, spacedim>::InternalDataBase>
160 const UpdateFlags update_flags,
165 &output_data)
const override
181 const ::internal::FEValuesImplementation::MappingRelatedData<dim,
187 &output_data)
const override;
192 const unsigned int face_no,
196 const ::internal::FEValuesImplementation::MappingRelatedData<dim,
202 &output_data)
const override;
205 fill_fe_subface_values(
207 const unsigned int face_no,
208 const unsigned int sub_no,
212 const ::internal::FEValuesImplementation::MappingRelatedData<dim,
218 &output_data)
const override;
254 DEAL_II_NAMESPACE_CLOSE