* Return a reference to the i-th pattern in the tuple.
*/
const PatternBase &
- get_pattern(const unsigned int &i) const;
+ get_pattern(const unsigned int i) const;
/**
* Return the separator of the tuple entries.
*
* @param n Order of QGauss quadrature
*/
- QTrianglePolar(const unsigned int &n);
+ QTrianglePolar(const unsigned int n);
};
/**
if (pred_pair.first == false)
return;
- const unsigned int &pred_value = pred_pair.second;
- const T & coeff_value = coefficients(ind);
+ const unsigned int pred_value = pred_pair.second;
+ const T & coeff_value = coefficients(ind);
// If pred_value is not in the pred_to_values map, the element will be
// created. Otherwise a reference to the existing element is returned.
pred_to_values[pred_value].push_back(coeff_value);
Point<dim - 1>
project_real_point_to_unit_point_on_face(
const typename Triangulation<dim, spacedim>::cell_iterator &cell,
- const unsigned int & face_no,
+ const unsigned int face_no,
const Point<spacedim> & p) const;
/**
* };
*
* auto unpack = [] (const active_cell_iterator &cell,
- * const unsigned int &active_fe_index) -> void
+ * const unsigned int active_fe_index) -> void
* {
* cell->set_active_fe_index(active_fe_index);
* };
const AssembleFlags flags = assemble_own_cells,
const typename identity<std::function<void(const CellIteratorType &,
- const unsigned int &,
+ const unsigned int,
ScratchData &,
CopyData &)>>::type
&boundary_worker = std::function<void(const CellIteratorType &,
- const unsigned int &,
+ const unsigned int,
ScratchData &,
CopyData &)>(),
const typename identity<std::function<void(const CellIteratorType &,
- const unsigned int &,
- const unsigned int &,
+ const unsigned int,
+ const unsigned int,
const CellIteratorType &,
- const unsigned int &,
- const unsigned int &,
+ const unsigned int,
+ const unsigned int,
ScratchData &,
CopyData &)>>::type
&face_worker = std::function<void(const CellIteratorType &,
- const unsigned int &,
- const unsigned int &,
+ const unsigned int,
+ const unsigned int,
const CellIteratorType &,
- const unsigned int &,
- const unsigned int &,
+ const unsigned int,
+ const unsigned int,
ScratchData &,
CopyData &)>(),
// choose the one, which was computed with the higher order
// element. If both elements are of the same order, we just
// keep the first value and do not compute a second one.
- const unsigned int & n_dofs = dof_handler.n_dofs();
+ const unsigned int n_dofs = dof_handler.n_dofs();
std::vector<double> dof_values(n_dofs);
std::vector<types::global_dof_index> projected_dofs(n_dofs);
case 3:
{
- const unsigned int & n_dofs = dof_handler.n_dofs();
+ const unsigned int n_dofs = dof_handler.n_dofs();
std::vector<double> dof_values(n_dofs);
std::vector<types::global_dof_index> projected_dofs(n_dofs);
const double &initial_step_size = 1e-2,
const double &output_period = 1e-1,
// Running parameters
- const double & minimum_step_size = 1e-6,
- const unsigned int &maximum_order = 5,
- const unsigned int &maximum_non_linear_iterations = 10,
- const bool implicit_function_is_linear = false,
- const bool implicit_function_is_time_independent = false,
+ const double & minimum_step_size = 1e-6,
+ const unsigned int maximum_order = 5,
+ const unsigned int maximum_non_linear_iterations = 10,
+ const bool implicit_function_is_linear = false,
+ const bool implicit_function_is_time_independent = false,
// Error parameters
const double &absolute_tolerance = 1e-6,
const double &relative_tolerance = 1e-5)
const double &initial_step_size = 1e-2,
const double &output_period = 1e-1,
// Running parameters
- const double & minimum_step_size = 1e-6,
- const unsigned int &maximum_order = 5,
- const unsigned int &maximum_non_linear_iterations = 10,
+ const double & minimum_step_size = 1e-6,
+ const unsigned int maximum_order = 5,
+ const unsigned int maximum_non_linear_iterations = 10,
// Error parameters
const double &absolute_tolerance = 1e-6,
const double &relative_tolerance = 1e-5,
// Initial conditions parameters
const InitialConditionCorrection &ic_type = use_y_diff,
const InitialConditionCorrection &reset_type = use_y_diff,
- const unsigned int & maximum_non_linear_iterations_ic = 5)
+ const unsigned int maximum_non_linear_iterations_ic = 5)
: initial_time(initial_time)
, final_time(final_time)
, initial_step_size(initial_step_size)
AdditionalData(
// Global parameters
const SolutionStrategy &strategy = linesearch,
- const unsigned int & maximum_non_linear_iterations = 200,
+ const unsigned int maximum_non_linear_iterations = 200,
const double & function_tolerance = 0.0,
const double & step_tolerance = 0.0,
const bool & no_init_setup = false,
- const unsigned int & maximum_setup_calls = 0,
+ const unsigned int maximum_setup_calls = 0,
const double & maximum_newton_step = 0.0,
const double & dq_relative_error = 0.0,
- const unsigned int & maximum_beta_failures = 0,
- const unsigned int & anderson_subspace_size = 0)
+ const unsigned int maximum_beta_failures = 0,
+ const unsigned int anderson_subspace_size = 0)
: strategy(strategy)
, maximum_non_linear_iterations(maximum_non_linear_iterations)
, function_tolerance(function_tolerance)
const PatternBase &
- Tuple::get_pattern(const unsigned int &i) const
+ Tuple::get_pattern(const unsigned int i) const
{
return *patterns[i];
}
// and second derivatives vectors of
// <tt>polynomial_space</tt> at
// <tt>unit_point</tt>
- const unsigned int &n_basis = polynomial_space.n();
+ const unsigned int n_basis = polynomial_space.n();
std::vector<double> unit_point_values((values.size() == 0) ? 0 : n_basis);
std::vector<Tensor<1, dim>> unit_point_grads((grads.size() == 0) ? 0 :
n_basis);
-QTrianglePolar::QTrianglePolar(const unsigned int &n)
+QTrianglePolar::QTrianglePolar(const unsigned int n)
: QTrianglePolar(QGauss<1>(n), QGauss<1>(n))
{}
const dealii::Triangulation<1, spacedim> &tria =
dof_handler.get_triangulation();
- const unsigned int &dofs_per_line = dof_handler.get_fe().dofs_per_line;
- const unsigned int &n_levels = tria.n_levels();
+ const unsigned int dofs_per_line = dof_handler.get_fe().dofs_per_line;
+ const unsigned int n_levels = tria.n_levels();
for (unsigned int i = 0; i < n_levels; ++i)
{
numbers::invalid_dof_index);
}
- const unsigned int &n_vertices = tria.n_vertices();
+ const unsigned int n_vertices = tria.n_vertices();
dof_handler.mg_vertex_dofs.resize(n_vertices);
const dealii::FiniteElement<2, spacedim> &fe = dof_handler.get_fe();
const dealii::Triangulation<2, spacedim> &tria =
dof_handler.get_triangulation();
- const unsigned int &n_levels = tria.n_levels();
+ const unsigned int n_levels = tria.n_levels();
for (unsigned int i = 0; i < n_levels; ++i)
{
dof_handler.mg_faces->lines.dofs = std::vector<types::global_dof_index>(
tria.n_raw_lines() * fe.dofs_per_line, numbers::invalid_dof_index);
- const unsigned int &n_vertices = tria.n_vertices();
+ const unsigned int n_vertices = tria.n_vertices();
dof_handler.mg_vertex_dofs.resize(n_vertices);
const dealii::FiniteElement<3, spacedim> &fe = dof_handler.get_fe();
const dealii::Triangulation<3, spacedim> &tria =
dof_handler.get_triangulation();
- const unsigned int &n_levels = tria.n_levels();
+ const unsigned int n_levels = tria.n_levels();
for (unsigned int i = 0; i < n_levels; ++i)
{
dof_handler.mg_faces->quads.dofs = std::vector<types::global_dof_index>(
tria.n_raw_quads() * fe.dofs_per_quad, numbers::invalid_dof_index);
- const unsigned int &n_vertices = tria.n_vertices();
+ const unsigned int n_vertices = tria.n_vertices();
dof_handler.mg_vertex_dofs.resize(n_vertices);
// If the polynomial degree is positive
// we have support points on the faces
// and in the interior of a cell.
- const QGauss<dim> quadrature(order + 1);
- const unsigned int &n_interior_points = quadrature.size();
+ const QGauss<dim> quadrature(order + 1);
+ const unsigned int n_interior_points = quadrature.size();
this->generalized_support_points.resize(n_boundary_points +
n_interior_points);
// Initialize quadratures to obtain
// quadrature points later on.
const QGauss<1> reference_edge_quadrature(order + 1);
- const unsigned int & n_edge_points = reference_edge_quadrature.size();
+ const unsigned int n_edge_points = reference_edge_quadrature.size();
const Quadrature<dim - 1> &edge_quadrature =
QProjector<dim - 1>::project_to_all_faces(reference_edge_quadrature);
// we have support points on the edges,
// faces and in the interior of a cell.
const QGauss<dim - 1> reference_face_quadrature(order + 1);
- const unsigned int & n_face_points = reference_face_quadrature.size();
+ const unsigned int n_face_points = reference_face_quadrature.size();
const unsigned int n_boundary_points =
GeometryInfo<dim>::lines_per_cell * n_edge_points +
GeometryInfo<dim>::faces_per_cell * n_face_points;
- const QGauss<dim> quadrature(order + 1);
- const unsigned int &n_interior_points = quadrature.size();
+ const QGauss<dim> quadrature(order + 1);
+ const unsigned int n_interior_points = quadrature.size();
boundary_weights.reinit(n_edge_points + n_face_points,
2 * (order + 1) * order);
const QGauss<1> edge_quadrature(2 * this->degree);
const std::vector<Point<1>> &edge_quadrature_points =
edge_quadrature.get_points();
- const unsigned int &n_edge_quadrature_points = edge_quadrature.size();
- const unsigned int index = RefinementCase<dim>::isotropic_refinement - 1;
+ const unsigned int n_edge_quadrature_points = edge_quadrature.size();
+ const unsigned int index = RefinementCase<dim>::isotropic_refinement - 1;
switch (dim)
{
Polynomials::Lobatto::generate_complete_basis(this->degree);
const unsigned int n_boundary_dofs =
GeometryInfo<dim>::faces_per_cell * this->degree;
- const unsigned int &n_quadrature_points = quadrature.size();
+ const unsigned int n_quadrature_points = quadrature.size();
{
FullMatrix<double> assembling_matrix((this->degree - 1) *
Polynomials::Lobatto::generate_complete_basis(this->degree);
const unsigned int n_edge_dofs =
GeometryInfo<dim>::lines_per_cell * this->degree;
- const unsigned int &n_face_quadrature_points =
+ const unsigned int n_face_quadrature_points =
face_quadrature.size();
{
const unsigned int n_boundary_dofs =
2 * GeometryInfo<dim>::faces_per_cell * deg * this->degree +
n_edge_dofs;
- const unsigned int &n_quadrature_points = quadrature.size();
+ const unsigned int n_quadrature_points = quadrature.size();
{
FullMatrix<double> assembling_matrix(deg * deg * this->degree,
const QGauss<1> edge_quadrature(source_fe.degree);
const std::vector<Point<1>> &edge_quadrature_points =
edge_quadrature.get_points();
- const unsigned int &n_edge_quadrature_points = edge_quadrature.size();
+ const unsigned int n_edge_quadrature_points = edge_quadrature.size();
switch (dim)
{
source_fe.degree);
const unsigned int n_boundary_dofs =
GeometryInfo<dim>::lines_per_face * source_fe.degree;
- const unsigned int &n_quadrature_points = quadrature.size();
+ const unsigned int n_quadrature_points = quadrature.size();
{
FullMatrix<double> assembling_matrix(source_fe.degree *
// Let us begin with the
// interpolation part.
const QGauss<dim - 1> reference_edge_quadrature(this->degree);
- const unsigned int &n_edge_points = reference_edge_quadrature.size();
+ const unsigned int n_edge_points = reference_edge_quadrature.size();
for (unsigned int i = 0; i < 2; ++i)
for (unsigned int j = 0; j < 2; ++j)
// horizontal and the
// vertical, interior
// shape functions.
- const QGauss<dim> reference_quadrature(this->degree);
- const unsigned int &n_interior_points =
+ const QGauss<dim> reference_quadrature(this->degree);
+ const unsigned int n_interior_points =
reference_quadrature.size();
const std::vector<Polynomials::Polynomial<double>>
&legendre_polynomials =
{
// Let us begin with the
// interpolation part.
- const QGauss<1> reference_edge_quadrature(this->degree);
- const unsigned int &n_edge_points = reference_edge_quadrature.size();
+ const QGauss<1> reference_edge_quadrature(this->degree);
+ const unsigned int n_edge_points = reference_edge_quadrature.size();
for (unsigned int q_point = 0; q_point < n_edge_points; ++q_point)
{
// one is an FE_Nothing.
if (dynamic_cast<const FE_Q_Hierarchical<dim> *>(&fe_other) != nullptr)
{
- const unsigned int &this_dpl = this->dofs_per_line;
- const unsigned int &other_dpl = fe_other.dofs_per_line;
+ const unsigned int this_dpl = this->dofs_per_line;
+ const unsigned int other_dpl = fe_other.dofs_per_line;
// we deal with hierarchical 1d polynomials where dofs are enumerated
// increasingly. Thus we return a vector of pairs for the first N-1, where
// one is an FE_Nothing.
if (dynamic_cast<const FE_Q_Hierarchical<dim> *>(&fe_other) != nullptr)
{
- const unsigned int &this_dpq = this->dofs_per_quad;
- const unsigned int &other_dpq = fe_other.dofs_per_quad;
+ const unsigned int this_dpq = this->dofs_per_quad;
+ const unsigned int other_dpq = fe_other.dofs_per_quad;
// we deal with hierarchical 1d polynomials where dofs are enumerated
// increasingly. Thus we return a vector of pairs for the first N-1, where
Point<dim - 1>
Mapping<dim, spacedim>::project_real_point_to_unit_point_on_face(
const typename Triangulation<dim, spacedim>::cell_iterator &cell,
- const unsigned int & face_no,
+ const unsigned int face_no,
const Point<spacedim> & p) const
{
// The function doesn't make physical sense for dim=1
[&dof_handler](
const typename dealii::hp::DoFHandler<dim, spacedim>::
active_cell_iterator &cell,
- const unsigned int & active_fe_index) -> void {
+ const unsigned int active_fe_index) -> void {
// we would like to say
// cell->set_active_fe_index(active_fe_index);
// but this is not allowed on cells that are not