]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Apply clang-format 11108/head
authorDaniel Arndt <arndtd@ornl.gov>
Tue, 27 Jul 2021 19:24:31 +0000 (15:24 -0400)
committerDaniel Arndt <arndtd@ornl.gov>
Tue, 27 Jul 2021 19:24:31 +0000 (15:24 -0400)
392 files changed:
contrib/python-bindings/include/point_wrapper.h
contrib/python-bindings/source/point_wrapper.cc
examples/step-13/step-13.cc
examples/step-14/step-14.cc
examples/step-21/step-21.cc
examples/step-41/step-41.cc
examples/step-42/step-42.cc
examples/step-64/step-64.cu
examples/step-70/step-70.cc
include/deal.II/algorithms/general_data_storage.h
include/deal.II/base/aligned_vector.h
include/deal.II/base/array_view.h
include/deal.II/base/bounding_box.h
include/deal.II/base/data_out_base.h
include/deal.II/base/derivative_form.h
include/deal.II/base/exceptions.h
include/deal.II/base/geometry_info.h
include/deal.II/base/index_set.h
include/deal.II/base/iterator_range.h
include/deal.II/base/linear_index_iterator.h
include/deal.II/base/mg_level_object.h
include/deal.II/base/mpi.h
include/deal.II/base/mpi_compute_index_owner_internal.h
include/deal.II/base/mutable_bind.h
include/deal.II/base/numbers.h
include/deal.II/base/parallel.h
include/deal.II/base/parameter_acceptor.h
include/deal.II/base/patterns.h
include/deal.II/base/point.h
include/deal.II/base/polynomials_barycentric.h
include/deal.II/base/smartpointer.h
include/deal.II/base/symmetric_tensor.h
include/deal.II/base/symmetric_tensor.templates.h
include/deal.II/base/synchronous_iterator.h
include/deal.II/base/table.h
include/deal.II/base/table_indices.h
include/deal.II/base/tensor.h
include/deal.II/base/tensor_accessors.h
include/deal.II/base/vectorization.h
include/deal.II/base/work_stream.h
include/deal.II/differentiation/ad/ad_helpers.h
include/deal.II/differentiation/sd/symengine_number_types.h
include/deal.II/differentiation/sd/symengine_optimizer.h
include/deal.II/differentiation/sd/symengine_scalar_operations.h
include/deal.II/differentiation/sd/symengine_tensor_operations.h
include/deal.II/distributed/p4est_wrappers.h
include/deal.II/distributed/tria.h
include/deal.II/dofs/dof_accessor.h
include/deal.II/dofs/dof_accessor.templates.h
include/deal.II/dofs/dof_handler.h
include/deal.II/fe/block_mask.h
include/deal.II/fe/component_mask.h
include/deal.II/fe/fe.h
include/deal.II/fe/fe_base.h
include/deal.II/fe/fe_interface_values.h
include/deal.II/fe/fe_system.h
include/deal.II/fe/fe_tools.templates.h
include/deal.II/fe/fe_update_flags.h
include/deal.II/fe/fe_values.h
include/deal.II/grid/filtered_iterator.h
include/deal.II/grid/grid_generator.h
include/deal.II/grid/grid_tools.h
include/deal.II/grid/grid_tools_cache_update_flags.h
include/deal.II/grid/intergrid_map.h
include/deal.II/grid/reference_cell.h
include/deal.II/grid/tria_accessor.templates.h
include/deal.II/grid/tria_description.h
include/deal.II/grid/tria_iterator.h
include/deal.II/grid/tria_iterator.templates.h
include/deal.II/hp/collection.h
include/deal.II/hp/fe_collection.h
include/deal.II/hp/mapping_collection.h
include/deal.II/hp/q_collection.h
include/deal.II/integrators/patches.h
include/deal.II/lac/affine_constraints.h
include/deal.II/lac/affine_constraints.templates.h
include/deal.II/lac/block_vector_base.h
include/deal.II/lac/chunk_sparse_matrix.h
include/deal.II/lac/chunk_sparsity_pattern.h
include/deal.II/lac/cuda_kernels.templates.h
include/deal.II/lac/dynamic_sparsity_pattern.h
include/deal.II/lac/full_matrix.h
include/deal.II/lac/full_matrix.templates.h
include/deal.II/lac/la_parallel_block_vector.templates.h
include/deal.II/lac/la_parallel_vector.h
include/deal.II/lac/la_parallel_vector.templates.h
include/deal.II/lac/la_vector.h
include/deal.II/lac/la_vector.templates.h
include/deal.II/lac/linear_operator.h
include/deal.II/lac/matrix_iterator.h
include/deal.II/lac/packaged_operation.h
include/deal.II/lac/petsc_matrix_base.h
include/deal.II/lac/petsc_vector_base.h
include/deal.II/lac/precondition.h
include/deal.II/lac/precondition_block.h
include/deal.II/lac/qr.h
include/deal.II/lac/read_write_vector.h
include/deal.II/lac/relaxation_block.h
include/deal.II/lac/relaxation_block.templates.h
include/deal.II/lac/solver.h
include/deal.II/lac/solver_gmres.h
include/deal.II/lac/solver_idr.h
include/deal.II/lac/sparse_matrix.h
include/deal.II/lac/sparse_matrix_ez.h
include/deal.II/lac/trilinos_sparse_matrix.h
include/deal.II/lac/trilinos_sparsity_pattern.h
include/deal.II/lac/trilinos_tpetra_vector.templates.h
include/deal.II/lac/trilinos_vector.h
include/deal.II/lac/vector.h
include/deal.II/lac/vector.templates.h
include/deal.II/lac/vector_space_vector.h
include/deal.II/matrix_free/cuda_fe_evaluation.h
include/deal.II/matrix_free/cuda_matrix_free.h
include/deal.II/matrix_free/cuda_tensor_product_kernels.h
include/deal.II/matrix_free/evaluation_flags.h
include/deal.II/matrix_free/evaluation_kernels.h
include/deal.II/matrix_free/evaluation_template_factory.templates.h
include/deal.II/matrix_free/fe_evaluation.h
include/deal.II/matrix_free/fe_point_evaluation.h
include/deal.II/matrix_free/hanging_nodes_internal.h
include/deal.II/matrix_free/mapping_info.templates.h
include/deal.II/matrix_free/matrix_free.h
include/deal.II/matrix_free/tensor_product_kernels.h
include/deal.II/matrix_free/tools.h
include/deal.II/meshworker/assemble_flags.h
include/deal.II/meshworker/mesh_loop.h
include/deal.II/multigrid/mg_coarse.h
include/deal.II/multigrid/mg_constrained_dofs.h
include/deal.II/multigrid/mg_matrix.h
include/deal.II/numerics/history.h
include/deal.II/numerics/matrix_creator.templates.h
include/deal.II/numerics/rtree.h
include/deal.II/numerics/vector_tools_boundary.templates.h
include/deal.II/numerics/vector_tools_interpolate.templates.h
include/deal.II/numerics/vector_tools_project.h
include/deal.II/numerics/vector_tools_project.templates.h
include/deal.II/particles/particle_accessor.h
include/deal.II/particles/particle_handler.h
include/deal.II/particles/particle_iterator.h
include/deal.II/sundials/n_vector.h
include/deal.II/sundials/n_vector.templates.h
source/base/data_out_base.cc
source/base/function_lib_cutoff.cc
source/base/function_spherical.cc
source/base/index_set.cc
source/base/quadrature_lib.cc
source/base/tensor.cc
source/base/tensor_product_polynomials.cc
source/base/thread_management.cc
source/differentiation/sd/symengine_number_types.cc
source/distributed/grid_refinement.inst.in
source/distributed/p4est_wrappers.cc
source/distributed/tria.cc
source/dofs/dof_handler.cc
source/dofs/dof_handler_policy.cc
source/dofs/dof_renumbering.cc
source/fe/fe.cc
source/fe/fe_nedelec.cc
source/fe/fe_series_fourier.cc
source/fe/fe_series_legendre.cc
source/fe/fe_system.cc
source/fe/fe_values.cc
source/fe/mapping_q_cache.cc
source/grid/grid_generator.cc
source/grid/grid_generator.inst.in
source/grid/grid_out.cc
source/grid/grid_refinement.inst.in
source/grid/grid_reordering.cc
source/grid/grid_tools.cc
source/grid/grid_tools.inst.in
source/grid/grid_tools_dof_handlers.cc
source/grid/grid_tools_dof_handlers.inst.in
source/grid/intergrid_map.cc
source/grid/manifold_lib.cc
source/grid/tria.cc
source/lac/block_sparsity_pattern.cc
source/lac/cuda_vector.cu
source/lac/petsc_vector_base.cc
source/lac/trilinos_epetra_vector.cc
source/lac/trilinos_sparse_matrix.cc
source/lac/vector.cc
source/non_matching/coupling.cc
source/numerics/data_out_rotation.cc
source/numerics/error_estimator_1d.cc
source/numerics/time_dependent.cc
source/opencascade/utilities.cc
source/particles/particle.cc
tests/aniso/mesh_3d_21.cc
tests/arpack/step-36_parpack_mf.cc
tests/arpack/step-36_parpack_mf_02.cc
tests/arpack/step-36_parpack_mf_03.cc
tests/base/cell_data_storage_03.cc
tests/base/functions_04.cc
tests/base/functions_09.cc
tests/base/functions_singularity.cc
tests/base/parallel_transform_02.cc
tests/base/parallel_transform_03.cc
tests/base/qprojector.cc
tests/base/quadrature_move_01.cc
tests/base/quadrature_move_02.cc
tests/base/timer_08.cc
tests/base/timer_08_b.cc
tests/base/timer_09.cc
tests/base/timer_10.cc
tests/bits/cylinder_02.cc
tests/bits/cylinder_03.cc
tests/bits/find_cell_1.cc
tests/bits/find_cell_10a.cc
tests/bits/find_cell_13.cc
tests/bits/find_cell_2.cc
tests/bits/find_cell_3.cc
tests/bits/find_cell_4.cc
tests/bits/find_cell_5.cc
tests/bits/find_cell_6.cc
tests/bits/find_cell_7.cc
tests/bits/find_cell_8.cc
tests/bits/find_cell_9.cc
tests/bits/find_cell_alt_1.cc
tests/bits/find_cell_alt_2.cc
tests/bits/find_cell_alt_3.cc
tests/bits/find_cell_alt_4.cc
tests/bits/find_cell_alt_5.cc
tests/bits/find_cell_alt_6.cc
tests/bits/find_cell_alt_7.cc
tests/bits/find_cells_adjacent_to_vertex_1.cc
tests/bits/find_cells_adjacent_to_vertex_2.cc
tests/bits/find_cells_adjacent_to_vertex_3.cc
tests/bits/find_cells_adjacent_to_vertex_4.cc
tests/bits/find_cells_adjacent_to_vertex_5.cc
tests/bits/find_cells_adjacent_to_vertex_6.cc
tests/bits/find_closest_vertex_1.cc
tests/bits/neighboring_cells_at_two_faces.cc
tests/bits/q_points.cc
tests/bits/refine_and_coarsen_for_active_cell_index.cc
tests/bits/refine_and_coarsen_for_active_cell_index_02.cc
tests/bits/refine_and_coarsen_for_active_cell_index_03.cc
tests/bits/refine_and_coarsen_for_active_cell_index_04.cc
tests/bits/refine_and_coarsen_for_active_cell_index_05.cc
tests/bits/refine_and_coarsen_for_parents.cc
tests/bits/refine_and_coarsen_for_parents_02.cc
tests/bits/refine_and_coarsen_for_parents_03.cc
tests/bits/rt_2.cc
tests/bits/step-14.cc
tests/bits/step-2.cc
tests/codim_one/bem_integration.cc
tests/codim_one/extract_boundary_mesh_09.cc
tests/codim_one/tensor_matrix_conversion.cc
tests/cuda/coefficient_eval.cu
tests/cuda/create_mesh.h
tests/cuda/cuda_tensor_01.cu
tests/cuda/cuda_tensor_02.cu
tests/cuda/matrix_free_matrix_vector_10.cu
tests/cuda/matrix_free_matrix_vector_19.cu
tests/cuda/matrix_free_matrix_vector_25.cu
tests/cuda/matrix_vector_mf.h
tests/cuda/solver_10.cu
tests/dofs/dof_tools_21_b.cc
tests/dofs/dof_tools_21_b_x.cc
tests/dofs/dof_tools_21_b_x_q3.cc
tests/dofs/dof_tools_21_b_y.cc
tests/dofs/dof_tools_21_c.cc
tests/dofs/dof_tools_24.cc
tests/dofs/dof_tools_25.cc
tests/dofs/dof_tools_common.h
tests/dofs/dof_tools_periodic.h
tests/fail/abf_approximation_01.cc
tests/fail/hp-step-14.cc
tests/fail/rt_distorted_01.cc
tests/fail/rt_distorted_02.cc
tests/fe/abf_01.cc
tests/fe/abf_02.cc
tests/fe/bdm_2.cc
tests/fe/br_approximation_01.cc
tests/fe/deformed_projection.h
tests/fe/fe_data_test.cc
tests/fe/fe_enriched_color_07.cc
tests/fe/fe_face_orientation_nedelec.h
tests/fe/fe_face_orientation_nedelec_0.cc
tests/fe/fe_nedelec_sz_face_orientation.cc
tests/fe/fe_project_2d.cc
tests/fe/fe_project_3d.cc
tests/fe/fe_series_05.cc
tests/fe/fe_tools_test.cc
tests/fe/nedelec.cc
tests/fe/rt_2.cc
tests/fe/rt_approximation_01.cc
tests/fe/rt_bubbles_2.cc
tests/fe/rt_normal_02.cc
tests/fe/shapes.h
tests/feinterface/fe_interface_values_01.cc
tests/feinterface/fe_interface_values_02.cc
tests/feinterface/fe_interface_values_03.cc
tests/feinterface/fe_interface_values_05.cc
tests/feinterface/fe_interface_values_06.cc
tests/feinterface/fe_interface_values_07.cc
tests/feinterface/fe_interface_values_08.cc
tests/feinterface/fe_interface_values_09.cc
tests/feinterface/multigrid_01.cc
tests/grid/get_coarse_mesh_description_01.cc
tests/grid/grid_generator_10.cc
tests/grid/grid_generator_marching_cube_algorithm_01.cc
tests/grid/grid_out_gnuplot_01.cc
tests/grid/grid_out_gnuplot_02.cc
tests/grid/grid_tools_05.cc
tests/grid/grid_tools_06.cc
tests/grid/grid_tools_active_cell_layer_within_distance_02.cc
tests/grid/grid_tools_transform_01.cc
tests/grid/line_coarsening_3d.cc
tests/grid/measure_of_3d_face_01.cc
tests/grid/mesh_3d.h
tests/grid/mesh_3d_10.cc
tests/grid/mesh_3d_11.cc
tests/grid/mesh_3d_12.cc
tests/grid/mesh_3d_13.cc
tests/grid/mesh_3d_14.cc
tests/grid/mesh_3d_15.cc
tests/grid/mesh_3d_16.cc
tests/grid/mesh_3d_17.cc
tests/grid/mesh_3d_20.cc
tests/grid/mesh_3d_21.cc
tests/grid/mesh_3d_4.cc
tests/grid/mesh_3d_5.cc
tests/grid/mesh_3d_6.cc
tests/grid/mesh_3d_7.cc
tests/grid/mesh_3d_8.cc
tests/grid/mesh_3d_9.cc
tests/hp/fe_nothing_18.cc
tests/hp/step-2.cc
tests/lac/constraints.cc
tests/lac/gmres_reorthogonalize_04.cc
tests/lac/gmres_reorthogonalize_05.cc
tests/lac/utilities_02.cc
tests/manifold/elliptical_manifold_01.cc
tests/manifold/transfinite_manifold_07.cc
tests/mappings/mapping.cc
tests/mappings/mapping_q_cache_05.cc
tests/mappings/mapping_q_mixed_manifolds_02.cc
tests/matrix_free/compare_faces_by_cells.cc
tests/matrix_free/create_mesh.h
tests/matrix_free/get_functions_variants.cc
tests/matrix_free/get_functions_variants_gl.cc
tests/matrix_free/integrate_functions.cc
tests/matrix_free/integrate_functions_multife.cc
tests/matrix_free/integrate_functions_multife2.cc
tests/matrix_free/matrix_vector_faces_25.cc
tests/matrix_free/multigrid_dg_sip_02.cc
tests/matrix_free/parallel_multigrid_adaptive_08.cc
tests/matrix_free/pbc_orientation_01.cc
tests/matrix_free/point_evaluation_09.cc
tests/meshworker/mesh_loop_anistropic_01.cc
tests/mpi/cell_data_transfer_03.cc
tests/mpi/error_prediction_01.cc
tests/mpi/error_prediction_02.cc
tests/mpi/mesh_worker_matrix_01.cc
tests/mpi/parallel_partitioner_05.cc
tests/mpi/periodicity_04.cc
tests/multigrid/step-16-50-mpi-linear-operator.cc
tests/multigrid/step-16-50-mpi-smoother.cc
tests/multigrid/step-16-50-mpi.cc
tests/multigrid/step-16-50-serial.cc
tests/multigrid/step-50_02.cc
tests/multithreading/taskflow.h
tests/multithreading/threads_02.cc
tests/numerics/no_flux_10.cc
tests/numerics/project_to_surface_01.cc
tests/numerics/project_to_surface_02.cc
tests/numerics/smoothness_estimator_01.cc
tests/numerics/smoothness_estimator_02.cc
tests/opencascade/step_create.cc
tests/opencascade/step_write.cc
tests/optimization/step-44.h
tests/physics/notation-kelvin_01.cc
tests/physics/notation-kelvin_02.cc
tests/physics/notation-kelvin_03.cc
tests/physics/step-18-rotation_matrix.cc
tests/physics/step-18.cc
tests/quick_tests/tbb.cc
tests/serialization/dof_handler_01.cc
tests/serialization/hp_dof_handler_01.cc
tests/serialization/triangulation_01.cc
tests/serialization/triangulation_02.cc
tests/simplex/mapping_transformations_01.cc
tests/simplex/step-02.cc
tests/simplex/step-31.cc
tests/symengine/sd_common_tests/batch_optimizer_01.h
tests/tensors/symmetric_tensor_34.cc
tests/tensors/symmetric_tensor_36.cc
tests/tensors/symmetric_tensor_37.cc
tests/tensors/symmetric_tensor_39.cc
tests/tensors/symmetric_tensor_40.cc
tests/tensors/symmetric_tensor_41.cc
tests/tensors/symmetric_tensor_44.cc

index 8780bd0bc2e9cd2407bdba31c39d46496bb0a300..4e2b8bce9e58f41d8e4ae16e7ed4e82e6440cf93 100644 (file)
@@ -100,7 +100,8 @@ namespace python
     /**
      * Return the scalar product of the vectors representing two points.
      */
-    double operator*(const PointWrapper &p) const;
+    double
+    operator*(const PointWrapper &p) const;
 
     /**
      * Add an offset to a point.
@@ -129,7 +130,8 @@ namespace python
     /**
      * Multiply the coordinates of the point by a factor.
      */
-    PointWrapper operator*(const double factor) const;
+    PointWrapper
+    operator*(const double factor) const;
 
     /**
      * Add another point.
index 8d895835dd9072caff5313496871d109ee7e1788..feac3415f09ac6eab45c32b784772998d1144889 100644 (file)
@@ -298,7 +298,8 @@ namespace python
 
 
 
-  double PointWrapper::operator*(const PointWrapper &p) const
+  double
+  PointWrapper::operator*(const PointWrapper &p) const
   {
     AssertThrow(p.get_dim() == dim,
                 ExcMessage("The points do not have the same dimension."));
@@ -378,7 +379,8 @@ namespace python
   }
 
 
-  PointWrapper PointWrapper::operator*(const double factor) const
+  PointWrapper
+  PointWrapper::operator*(const double factor) const
   {
     if (dim == 2)
       return PointWrapper(
index fd3f204a850dad2f5c4d45a1e75f54d3b62ba6da..9b1617ff23b70a2474a69da3382fd27d911ee0f3 100644 (file)
@@ -199,9 +199,9 @@ namespace Step13
     // Now for the function that is mainly of interest in this class, the
     // computation of the point value:
     template <int dim>
-    void PointValueEvaluation<dim>::
-         operator()(const DoFHandler<dim> &dof_handler,
-               const Vector<double> & solution) const
+    void
+    PointValueEvaluation<dim>::operator()(const DoFHandler<dim> &dof_handler,
+                                          const Vector<double> & solution) const
     {
       // First allocate a variable that will hold the point value. Initialize
       // it with a value that is clearly bogus, so that if we fail to set it
index f53d7a37b69d49d7442eeca61c4eb1f2c385a864..c717830becab0f7b062ec0c833e81d8879ef13b0 100644 (file)
@@ -123,9 +123,9 @@ namespace Step14
 
 
     template <int dim>
-    void PointValueEvaluation<dim>::
-         operator()(const DoFHandler<dim> &dof_handler,
-               const Vector<double> & solution) const
+    void
+    PointValueEvaluation<dim>::operator()(const DoFHandler<dim> &dof_handler,
+                                          const Vector<double> & solution) const
     {
       double point_value = 1e20;
 
@@ -192,9 +192,9 @@ namespace Step14
     // The more interesting things happen inside the function doing the actual
     // evaluation:
     template <int dim>
-    void PointXDerivativeEvaluation<dim>::
-         operator()(const DoFHandler<dim> &dof_handler,
-               const Vector<double> & solution) const
+    void PointXDerivativeEvaluation<dim>::operator()(
+      const DoFHandler<dim> &dof_handler,
+      const Vector<double> & solution) const
     {
       // This time initialize the return value with something useful, since we
       // will have to add up a number of contributions and take the mean value
index 7e71c293034a147d632b7daa65b5766bd63cce2c..cd96bfdec31251585faa2f524c9a2fc858055e4c 100644 (file)
@@ -647,7 +647,7 @@ namespace Step21
     std::vector<Tensor<2, dim>> k_inverse_values(n_q_points);
 
     std::vector<Vector<double>>              old_solution_values(n_q_points,
-                                                                 Vector<double>(dim + 2));
+                                                    Vector<double>(dim + 2));
     std::vector<std::vector<Tensor<1, dim>>> old_solution_grads(
       n_q_points, std::vector<Tensor<1, dim>>(dim + 2));
 
index a63b05727eccfdddbbf05a03c0e095724dae0381..b8ee77ee61dbd1d4b48977671f1a6083a624cc97 100644 (file)
@@ -82,7 +82,7 @@ namespace Step41
     void setup_system();
     void assemble_system();
     void
-         assemble_mass_matrix_diagonal(TrilinosWrappers::SparseMatrix &mass_matrix);
+    assemble_mass_matrix_diagonal(TrilinosWrappers::SparseMatrix &mass_matrix);
     void update_solution_and_constraints();
     void solve();
     void output_results(const unsigned int iteration) const;
index a17ed310468a64671442d6d3fc93f0315be203b4..3e9fdeaea0e91aba179c13394b200ebd22b61fb7 100644 (file)
@@ -612,7 +612,7 @@ namespace Step42
     void compute_dirichlet_constraints();
     void update_solution_and_constraints();
     void
-         assemble_mass_matrix_diagonal(TrilinosWrappers::SparseMatrix &mass_matrix);
+    assemble_mass_matrix_diagonal(TrilinosWrappers::SparseMatrix &mass_matrix);
     void assemble_newton_system(
       const TrilinosWrappers::MPI::Vector &linearization_point);
     void compute_nonlinear_residual(
index 20e06b3cb27e7a0473d0099189b4e0de86a54a7f..d163532ba7fde51b0111323b17920888f61a76bd 100644 (file)
@@ -149,8 +149,8 @@ namespace Step64
   // the two terms on the left-hand side correspond to the two function calls
   // here:
   template <int dim, int fe_degree>
-  __device__ void HelmholtzOperatorQuad<dim, fe_degree>::
-                  operator()(CUDAWrappers::FEEvaluation<dim, fe_degree> *fe_eval) const
+  __device__ void HelmholtzOperatorQuad<dim, fe_degree>::operator()(
+    CUDAWrappers::FEEvaluation<dim, fe_degree> *fe_eval) const
   {
     fe_eval->submit_value(coef * fe_eval->get_value());
     fe_eval->submit_gradient(fe_eval->get_gradient());
@@ -366,7 +366,7 @@ namespace Step64
     // In addition, we also keep a solution vector with CPU storage such that we
     // can view and display the solution as usual.
     LinearAlgebra::distributed::Vector<double, MemorySpace::Host>
-                                                                  ghost_solution_host;
+      ghost_solution_host;
     LinearAlgebra::distributed::Vector<double, MemorySpace::CUDA> solution_dev;
     LinearAlgebra::distributed::Vector<double, MemorySpace::CUDA>
       system_rhs_dev;
index a91f6492692f116d228b1548ff1a9cd0d85d3da3..79212bec0bed7a93246002a2b48a75adfe6b7b97 100644 (file)
@@ -282,7 +282,7 @@ namespace Step70
     std::string arguments_for_solid_grid = spacedim == 2 ?
                                              "-.5, -.1: .5, .1: false" :
                                              "-.5, -.1, -.1: .5, .1, .1: false";
-    std::string name_of_particle_grid = "hyper_ball";
+    std::string name_of_particle_grid    = "hyper_ball";
     std::string arguments_for_particle_grid =
       spacedim == 2 ? "0.3, 0.3: 0.1: false" : "0.3, 0.3, 0.3 : 0.1: false";
 
index 1092020bbd21dde8cd7b588f874fc8917209239e..c6797d4dcb41b1e468200de6294cbb3d8a8c7123 100644 (file)
@@ -246,7 +246,7 @@ public:
   Type &
   get_or_add_object_with_name(const std::string &name,
                               Arg &              argument,
-                              Args &... arguments);
+                              Args &...arguments);
 
   /**
    * Return a reference to the object with given name. If the object does
@@ -273,7 +273,7 @@ public:
   Type &
   get_or_add_object_with_name(const std::string &name,
                               Arg &&             argument,
-                              Args &&... arguments);
+                              Args &&...arguments);
 
   /**
    * Return a reference to the object with given name. If the object does
@@ -492,7 +492,7 @@ template <typename Type, typename Arg, typename... Args>
 Type &
 GeneralDataStorage::get_or_add_object_with_name(const std::string &name,
                                                 Arg &              argument,
-                                                Args &... arguments)
+                                                Args &...arguments)
 {
   if (!stores_object_with_name(name))
     add_unique_copy(name, Type(argument, arguments...));
@@ -519,7 +519,7 @@ template <typename Type, typename Arg, typename... Args>
 Type &
 GeneralDataStorage::get_or_add_object_with_name(const std::string &name,
                                                 Arg &&             argument,
-                                                Args &&... arguments)
+                                                Args &&...arguments)
 {
   if (!stores_object_with_name(name))
     add_unique_copy(name,
index 4260619aa23364b1bf757c15e3c9327340511318..de72cb524bfae1f32b000c85196ea0ca0f62513a 100644 (file)
@@ -377,12 +377,14 @@ public:
   /**
    * Read-write access to entry @p index in the vector.
    */
-  reference operator[](const size_type index);
+  reference
+  operator[](const size_type index);
 
   /**
    * Read-only access to entry @p index in the vector.
    */
-  const_reference operator[](const size_type index) const;
+  const_reference
+  operator[](const size_type index) const;
 
   /**
    * Return a pointer to the underlying data buffer.
@@ -1683,8 +1685,8 @@ AlignedVector<T>::capacity() const
 
 
 template <class T>
-inline typename AlignedVector<T>::reference AlignedVector<T>::
-                                            operator[](const size_type index)
+inline typename AlignedVector<T>::reference
+AlignedVector<T>::operator[](const size_type index)
 {
   AssertIndexRange(index, size());
   return elements[index];
@@ -1693,8 +1695,8 @@ inline typename AlignedVector<T>::reference AlignedVector<T>::
 
 
 template <class T>
-inline typename AlignedVector<T>::const_reference AlignedVector<T>::
-                                                  operator[](const size_type index) const
+inline typename AlignedVector<T>::const_reference
+AlignedVector<T>::operator[](const size_type index) const
 {
   AssertIndexRange(index, size());
   return elements[index];
index d370dc6fc3f23897d1679bd59299d341adfa504b..af39436d06e58936b1bd552f32e3a6a9104fea09 100644 (file)
@@ -322,7 +322,8 @@ public:
    * This function is only allowed to be called if the underlying data is indeed
    * stored in CPU memory.
    */
-  value_type &operator[](const std::size_t i) const;
+  value_type &
+  operator[](const std::size_t i) const;
 
 private:
   /**
@@ -515,8 +516,8 @@ inline ArrayView<ElementType, MemorySpaceType>::ArrayView(
 
 template <typename ElementType, typename MemorySpaceType>
 inline bool
-ArrayView<ElementType, MemorySpaceType>::
-operator==(const ArrayView<const value_type, MemorySpaceType> &other_view) const
+ArrayView<ElementType, MemorySpaceType>::operator==(
+  const ArrayView<const value_type, MemorySpaceType> &other_view) const
 {
   return (other_view.data() == starting_element) &&
          (other_view.size() == n_elements);
@@ -526,9 +527,9 @@ operator==(const ArrayView<const value_type, MemorySpaceType> &other_view) const
 
 template <typename ElementType, typename MemorySpaceType>
 inline bool
-ArrayView<ElementType, MemorySpaceType>::
-operator==(const ArrayView<typename std::remove_cv<value_type>::type,
-                           MemorySpaceType> &other_view) const
+ArrayView<ElementType, MemorySpaceType>::operator==(
+  const ArrayView<typename std::remove_cv<value_type>::type, MemorySpaceType>
+    &other_view) const
 {
   return (other_view.data() == starting_element) &&
          (other_view.size() == n_elements);
@@ -538,8 +539,8 @@ operator==(const ArrayView<typename std::remove_cv<value_type>::type,
 
 template <typename ElementType, typename MemorySpaceType>
 inline bool
-ArrayView<ElementType, MemorySpaceType>::
-operator!=(const ArrayView<const value_type, MemorySpaceType> &other_view) const
+ArrayView<ElementType, MemorySpaceType>::operator!=(
+  const ArrayView<const value_type, MemorySpaceType> &other_view) const
 {
   return !(*this == other_view);
 }
@@ -560,9 +561,9 @@ ArrayView<ElementType, MemorySpaceType>::data() const noexcept
 
 template <typename ElementType, typename MemorySpaceType>
 inline bool
-ArrayView<ElementType, MemorySpaceType>::
-operator!=(const ArrayView<typename std::remove_cv<value_type>::type,
-                           MemorySpaceType> &other_view) const
+ArrayView<ElementType, MemorySpaceType>::operator!=(
+  const ArrayView<typename std::remove_cv<value_type>::type, MemorySpaceType>
+    &other_view) const
 {
   return !(*this == other_view);
 }
@@ -616,7 +617,7 @@ ArrayView<ElementType, MemorySpaceType>::cend() const
 
 template <typename ElementType, typename MemorySpaceType>
 inline typename ArrayView<ElementType, MemorySpaceType>::value_type &
-  ArrayView<ElementType, MemorySpaceType>::operator[](const std::size_t i) const
+ArrayView<ElementType, MemorySpaceType>::operator[](const std::size_t i) const
 {
   AssertIndexRange(i, n_elements);
   Assert(
@@ -1072,8 +1073,8 @@ make_array_view(const std::vector<ElementType> &vector,
  */
 template <typename ElementType>
 inline ArrayView<ElementType>
-  make_array_view(Table<2, ElementType> &                         table,
-                  const typename Table<2, ElementType>::size_type row)
+make_array_view(Table<2, ElementType> &                         table,
+                const typename Table<2, ElementType>::size_type row)
 {
   AssertIndexRange(row, table.size()[0]);
   return ArrayView<ElementType>(&table[row][0], table.size()[1]);
@@ -1098,7 +1099,8 @@ inline ArrayView<ElementType>
  * @relatesalso ArrayView
  */
 template <typename ElementType>
-inline ArrayView<ElementType> make_array_view(Table<2, ElementType> &table)
+inline ArrayView<ElementType>
+make_array_view(Table<2, ElementType> &table)
 {
   return ArrayView<ElementType>(&table[0][0], table.n_elements());
 }
@@ -1227,11 +1229,11 @@ make_array_view(const Table<2, ElementType> &                   table,
  * @relatesalso ArrayView
  */
 template <typename ElementType>
-inline ArrayView<ElementType> make_array_view(
-  Table<2, ElementType> &                         table,
-  const typename Table<2, ElementType>::size_type row,
-  const typename Table<2, ElementType>::size_type starting_column,
-  const std::size_t                               size_of_view)
+inline ArrayView<ElementType>
+make_array_view(Table<2, ElementType> &                         table,
+                const typename Table<2, ElementType>::size_type row,
+                const typename Table<2, ElementType>::size_type starting_column,
+                const std::size_t                               size_of_view)
 {
   AssertIndexRange(row, table.size()[0]);
   AssertIndexRange(starting_column, table.size()[1]);
index 2964fef07680992005f4b0a604b38030e5d49e30..01dd0c0d5011b0307f0cf9488e55cda48be61cbe 100644 (file)
@@ -467,8 +467,8 @@ BoundingBox<spacedim, Number>::get_boundary_points() const
 
 template <int spacedim, typename Number>
 inline bool
-BoundingBox<spacedim, Number>::
-operator==(const BoundingBox<spacedim, Number> &box) const
+BoundingBox<spacedim, Number>::operator==(
+  const BoundingBox<spacedim, Number> &box) const
 {
   return boundary_points == box.boundary_points;
 }
@@ -477,8 +477,8 @@ operator==(const BoundingBox<spacedim, Number> &box) const
 
 template <int spacedim, typename Number>
 inline bool
-BoundingBox<spacedim, Number>::
-operator!=(const BoundingBox<spacedim, Number> &box) const
+BoundingBox<spacedim, Number>::operator!=(
+  const BoundingBox<spacedim, Number> &box) const
 {
   return boundary_points != box.boundary_points;
 }
index dab3f2df5aef1abced3e29a17fab234fb168a714..5738b918b3ecb71f744ce31c72e4c4be1217589d 100644 (file)
@@ -501,7 +501,8 @@ namespace DataOutBase
     /**
      * Swap the current object's contents with those of the given argument.
      */
-    void swap(Patch<0, spacedim> &other_patch);
+    void
+    swap(Patch<0, spacedim> &other_patch);
 
     /**
      * Value to be used if this patch has no neighbor on one side.
index 8c70216894cdf22cd064a4855f3168da5e3a4877..ffdb5c49b91a5a6f2a6c1222232228c2d504208b 100644 (file)
@@ -76,12 +76,14 @@ public:
   /**
    * Read-Write access operator.
    */
-  Tensor<order, dim, Number> &operator[](const unsigned int i);
+  Tensor<order, dim, Number> &
+  operator[](const unsigned int i);
 
   /**
    * Read-only access operator.
    */
-  const Tensor<order, dim, Number> &operator[](const unsigned int i) const;
+  const Tensor<order, dim, Number> &
+  operator[](const unsigned int i) const;
 
   /**
    * Assignment operator.
@@ -207,8 +209,8 @@ inline DerivativeForm<order, dim, spacedim, Number>::DerivativeForm(
 
 template <int order, int dim, int spacedim, typename Number>
 inline DerivativeForm<order, dim, spacedim, Number> &
-DerivativeForm<order, dim, spacedim, Number>::
-operator=(const Tensor<order + 1, dim, Number> &ta)
+DerivativeForm<order, dim, spacedim, Number>::operator=(
+  const Tensor<order + 1, dim, Number> &ta)
 {
   Assert((dim == spacedim), ExcMessage("Only allowed when dim==spacedim."));
 
@@ -222,8 +224,8 @@ operator=(const Tensor<order + 1, dim, Number> &ta)
 
 template <int order, int dim, int spacedim, typename Number>
 inline DerivativeForm<order, dim, spacedim, Number> &
-DerivativeForm<order, dim, spacedim, Number>::
-operator=(const Tensor<order, spacedim, Tensor<1, dim, Number>> &T)
+DerivativeForm<order, dim, spacedim, Number>::operator=(
+  const Tensor<order, spacedim, Tensor<1, dim, Number>> &T)
 {
   for (unsigned int j = 0; j < spacedim; ++j)
     (*this)[j] = T[j];
@@ -234,8 +236,8 @@ operator=(const Tensor<order, spacedim, Tensor<1, dim, Number>> &T)
 
 template <int order, int dim, int spacedim, typename Number>
 inline DerivativeForm<order, dim, spacedim, Number> &
-DerivativeForm<order, dim, spacedim, Number>::
-operator=(const Tensor<1, dim, Number> &T)
+DerivativeForm<order, dim, spacedim, Number>::operator=(
+  const Tensor<1, dim, Number> &T)
 {
   Assert((1 == spacedim) && (order == 1),
          ExcMessage("Only allowed for spacedim==1 and order==1."));
@@ -249,7 +251,7 @@ operator=(const Tensor<1, dim, Number> &T)
 
 template <int order, int dim, int spacedim, typename Number>
 inline Tensor<order, dim, Number> &
-  DerivativeForm<order, dim, spacedim, Number>::operator[](const unsigned int i)
+DerivativeForm<order, dim, spacedim, Number>::operator[](const unsigned int i)
 {
   AssertIndexRange(i, spacedim);
 
@@ -260,8 +262,8 @@ inline Tensor<order, dim, Number> &
 
 template <int order, int dim, int spacedim, typename Number>
 inline const Tensor<order, dim, Number> &
-  DerivativeForm<order, dim, spacedim, Number>::
-  operator[](const unsigned int i) const
+DerivativeForm<order, dim, spacedim, Number>::operator[](
+  const unsigned int i) const
 {
   AssertIndexRange(i, spacedim);
 
index 01b6ae86e0fc99df35c8cc51f06e37c93a6058a2..16018caa0724ab1352bad0fe2a8a09e1daaca032 100644 (file)
@@ -1355,7 +1355,8 @@ namespace deal_II_exceptions
                          const char *      function,
                          const char *      cond,
                          const char *      exc_name,
-                         ExceptionType     e) {
+                         ExceptionType     e)
+    {
       // Fill the fields of the exception object
       e.set_fields(file, line, function, cond, exc_name);
 
@@ -1385,7 +1386,8 @@ namespace deal_II_exceptions
     /**
      * Internal function that does the work of issue_error_nothrow.
      */
-    void do_issue_error_nothrow(const ExceptionBase &e) noexcept;
+    void
+    do_issue_error_nothrow(const ExceptionBase &e) noexcept;
 
     /**
      * Exception generation mechanism in case we must not throw.
index c2fa647ee2e418c0d84efdad37668e4d675e6a06..361b60b6e56c8740c0032d1c193619050d095534 100644 (file)
@@ -832,7 +832,8 @@ public:
    * Return the intersection of the refinement flags represented by the
    * current object and the one given as argument.
    */
-  RefinementCase operator&(const RefinementCase &r) const;
+  RefinementCase
+  operator&(const RefinementCase &r) const;
 
   /**
    * Return the negation of the refinement flags represented by the current
@@ -2826,8 +2827,8 @@ RefinementCase<dim>::operator|(const RefinementCase<dim> &r) const
 
 
 template <int dim>
-inline RefinementCase<dim> RefinementCase<dim>::
-                           operator&(const RefinementCase<dim> &r) const
+inline RefinementCase<dim>
+RefinementCase<dim>::operator&(const RefinementCase<dim> &r) const
 {
   return RefinementCase<dim>(static_cast<std::uint8_t>(value & r.value));
 }
index 3d3e1150b29b17252989940058d1d08327a77e66..5d05fe75cde10f3a405157cbc5e286ebdd333c4b 100644 (file)
@@ -324,7 +324,8 @@ public:
    * sets must have the same size (though of course they do not have to have
    * the same number of indices).
    */
-  IndexSet operator&(const IndexSet &is) const;
+  IndexSet
+  operator&(const IndexSet &is) const;
 
   /**
    * This command takes an interval <tt>[begin, end)</tt> and returns the
@@ -658,12 +659,14 @@ public:
     /**
      * Dereferencing operator, returns an IntervalAccessor.
      */
-    const IntervalAccessor &operator*() const;
+    const IntervalAccessor &
+    operator*() const;
 
     /**
      * Dereferencing operator, returns a pointer to an IntervalAccessor.
      */
-    const IntervalAccessor *operator->() const;
+    const IntervalAccessor *
+    operator->() const;
 
     /**
      * Comparison.
@@ -734,7 +737,8 @@ public:
      * Dereferencing operator. The returned value is the index of the element
      * inside the IndexSet.
      */
-    size_type operator*() const;
+    size_type
+    operator*() const;
 
     /**
      * Does this iterator point to an existing element?
@@ -1116,8 +1120,8 @@ IndexSet::IntervalAccessor::operator=(const IndexSet::IntervalAccessor &other)
 
 
 inline bool
-IndexSet::IntervalAccessor::
-operator==(const IndexSet::IntervalAccessor &other) const
+IndexSet::IntervalAccessor::operator==(
+  const IndexSet::IntervalAccessor &other) const
 {
   Assert(index_set == other.index_set,
          ExcMessage(
@@ -1128,8 +1132,8 @@ operator==(const IndexSet::IntervalAccessor &other) const
 
 
 inline bool
-IndexSet::IntervalAccessor::
-operator<(const IndexSet::IntervalAccessor &other) const
+IndexSet::IntervalAccessor::operator<(
+  const IndexSet::IntervalAccessor &other) const
 {
   Assert(index_set == other.index_set,
          ExcMessage(
@@ -1195,16 +1199,16 @@ IndexSet::IntervalIterator::operator++(int)
 
 
 
-inline const IndexSet::IntervalAccessor &IndexSet::IntervalIterator::
-                                         operator*() const
+inline const IndexSet::IntervalAccessor &
+IndexSet::IntervalIterator::operator*() const
 {
   return accessor;
 }
 
 
 
-inline const IndexSet::IntervalAccessor *IndexSet::IntervalIterator::
-                                         operator->() const
+inline const IndexSet::IntervalAccessor *
+IndexSet::IntervalIterator::operator->() const
 {
   return &accessor;
 }
@@ -1212,8 +1216,8 @@ inline const IndexSet::IntervalAccessor *IndexSet::IntervalIterator::
 
 
 inline bool
-IndexSet::IntervalIterator::
-operator==(const IndexSet::IntervalIterator &other) const
+IndexSet::IntervalIterator::operator==(
+  const IndexSet::IntervalIterator &other) const
 {
   return accessor == other.accessor;
 }
@@ -1221,8 +1225,8 @@ operator==(const IndexSet::IntervalIterator &other) const
 
 
 inline bool
-IndexSet::IntervalIterator::
-operator!=(const IndexSet::IntervalIterator &other) const
+IndexSet::IntervalIterator::operator!=(
+  const IndexSet::IntervalIterator &other) const
 {
   return !(*this == other);
 }
@@ -1230,8 +1234,8 @@ operator!=(const IndexSet::IntervalIterator &other) const
 
 
 inline bool
-IndexSet::IntervalIterator::
-operator<(const IndexSet::IntervalIterator &other) const
+IndexSet::IntervalIterator::operator<(
+  const IndexSet::IntervalIterator &other) const
 {
   return accessor < other.accessor;
 }
@@ -1239,8 +1243,8 @@ operator<(const IndexSet::IntervalIterator &other) const
 
 
 inline int
-IndexSet::IntervalIterator::
-operator-(const IndexSet::IntervalIterator &other) const
+IndexSet::IntervalIterator::operator-(
+  const IndexSet::IntervalIterator &other) const
 {
   Assert(accessor.index_set == other.accessor.index_set,
          ExcMessage(
@@ -1307,7 +1311,8 @@ IndexSet::ElementIterator::is_valid() const
 
 
 
-inline IndexSet::size_type IndexSet::ElementIterator::operator*() const
+inline IndexSet::size_type
+IndexSet::ElementIterator::operator*() const
 {
   Assert(
     is_valid(),
@@ -1319,8 +1324,8 @@ inline IndexSet::size_type IndexSet::ElementIterator::operator*() const
 
 
 inline bool
-IndexSet::ElementIterator::
-operator==(const IndexSet::ElementIterator &other) const
+IndexSet::ElementIterator::operator==(
+  const IndexSet::ElementIterator &other) const
 {
   Assert(index_set == other.index_set,
          ExcMessage(
@@ -1379,8 +1384,8 @@ IndexSet::ElementIterator::operator++(int)
 
 
 inline bool
-IndexSet::ElementIterator::
-operator!=(const IndexSet::ElementIterator &other) const
+IndexSet::ElementIterator::operator!=(
+  const IndexSet::ElementIterator &other) const
 {
   return !(*this == other);
 }
@@ -1388,8 +1393,8 @@ operator!=(const IndexSet::ElementIterator &other) const
 
 
 inline bool
-IndexSet::ElementIterator::
-operator<(const IndexSet::ElementIterator &other) const
+IndexSet::ElementIterator::operator<(
+  const IndexSet::ElementIterator &other) const
 {
   Assert(index_set == other.index_set,
          ExcMessage(
@@ -1401,8 +1406,8 @@ operator<(const IndexSet::ElementIterator &other) const
 
 
 inline std::ptrdiff_t
-IndexSet::ElementIterator::
-operator-(const IndexSet::ElementIterator &other) const
+IndexSet::ElementIterator::operator-(
+  const IndexSet::ElementIterator &other) const
 {
   Assert(index_set == other.index_set,
          ExcMessage(
index a128394bd696073eae9211e5330801b5711f05f8..5d8043308a796a184d42a165649bde551a927b0f 100644 (file)
@@ -217,13 +217,15 @@ public:
    * Dereferencing operator.
    * @return The iterator within the collection currently pointed to.
    */
-  const BaseIterator &operator*() const;
+  const BaseIterator &
+  operator*() const;
 
   /**
    * Dereferencing operator.
    * @return The iterator within the collection currently pointed to.
    */
-  const BaseIterator *operator->() const;
+  const BaseIterator *
+  operator->() const;
 
   /**
    * Prefix increment operator. Move the current iterator to the next
@@ -311,7 +313,7 @@ inline IteratorOverIterators<Iterator>::IteratorOverIterators(
 
 template <typename Iterator>
 inline const typename IteratorOverIterators<Iterator>::BaseIterator &
-  IteratorOverIterators<Iterator>::operator*() const
+IteratorOverIterators<Iterator>::operator*() const
 {
   return element_of_iterator_collection;
 }
@@ -320,7 +322,7 @@ inline const typename IteratorOverIterators<Iterator>::BaseIterator &
 
 template <typename Iterator>
 inline const typename IteratorOverIterators<Iterator>::BaseIterator *
-  IteratorOverIterators<Iterator>::operator->() const
+IteratorOverIterators<Iterator>::operator->() const
 {
   return &element_of_iterator_collection;
 }
@@ -350,8 +352,8 @@ IteratorOverIterators<Iterator>::operator++(int)
 
 template <typename Iterator>
 inline bool
-IteratorOverIterators<Iterator>::
-operator!=(const IteratorOverIterators &i_o_i) const
+IteratorOverIterators<Iterator>::operator!=(
+  const IteratorOverIterators &i_o_i) const
 {
   return element_of_iterator_collection != i_o_i.element_of_iterator_collection;
 }
index ba5505b93b9c5394b111c8b00bacd5b228b0f84e..f50f53268887262f290f740b8ad0ad49ff39310d 100644 (file)
@@ -236,12 +236,14 @@ public:
   /**
    * Dereferencing operator.
    */
-  reference operator*() const;
+  reference
+  operator*() const;
 
   /**
    * Dereferencing operator.
    */
-  pointer operator->() const;
+  pointer
+  operator->() const;
 
   /**
    * Comparison operator. Returns <code>true</code> if both iterators point to
@@ -328,8 +330,8 @@ protected:
 
 template <class DerivedIterator, class AccessorType>
 inline DerivedIterator &
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator=(const DerivedIterator &it)
+LinearIndexIterator<DerivedIterator, AccessorType>::operator=(
+  const DerivedIterator &it)
 {
   accessor.container    = it.container;
   accessor.linear_index = it.linear_index;
@@ -380,8 +382,8 @@ LinearIndexIterator<DerivedIterator, AccessorType>::operator--(int)
 
 template <class DerivedIterator, class AccessorType>
 inline DerivedIterator
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator+(const difference_type n) const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator+(
+  const difference_type n) const
 {
   DerivedIterator copy(this->accessor);
   copy += n;
@@ -392,8 +394,8 @@ operator+(const difference_type n) const
 
 template <class DerivedIterator, class AccessorType>
 inline DerivedIterator
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator-(const difference_type n) const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator-(
+  const difference_type n) const
 {
   DerivedIterator copy(this->accessor);
   copy += -n;
@@ -404,8 +406,8 @@ operator-(const difference_type n) const
 
 template <class DerivedIterator, class AccessorType>
 inline DerivedIterator &
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator+=(const difference_type n)
+LinearIndexIterator<DerivedIterator, AccessorType>::operator+=(
+  const difference_type n)
 {
   accessor.linear_index += n;
   return static_cast<DerivedIterator &>(*this);
@@ -415,8 +417,8 @@ operator+=(const difference_type n)
 
 template <class DerivedIterator, class AccessorType>
 inline DerivedIterator &
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator-=(const difference_type n)
+LinearIndexIterator<DerivedIterator, AccessorType>::operator-=(
+  const difference_type n)
 {
   return operator+=(-n);
 }
@@ -426,8 +428,8 @@ operator-=(const difference_type n)
 template <class DerivedIterator, class AccessorType>
 inline
   typename LinearIndexIterator<DerivedIterator, AccessorType>::difference_type
-  LinearIndexIterator<DerivedIterator, AccessorType>::
-  operator-(const DerivedIterator &other) const
+  LinearIndexIterator<DerivedIterator, AccessorType>::operator-(
+    const DerivedIterator &other) const
 {
   Assert(this->accessor.container == other.accessor.container,
          ExcMessage(
@@ -439,7 +441,7 @@ inline
 
 template <class DerivedIterator, class AccessorType>
 inline typename LinearIndexIterator<DerivedIterator, AccessorType>::reference
-  LinearIndexIterator<DerivedIterator, AccessorType>::operator*() const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator*() const
 {
   return accessor;
 }
@@ -448,7 +450,7 @@ inline typename LinearIndexIterator<DerivedIterator, AccessorType>::reference
 
 template <class DerivedIterator, class AccessorType>
 inline typename LinearIndexIterator<DerivedIterator, AccessorType>::pointer
-  LinearIndexIterator<DerivedIterator, AccessorType>::operator->() const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator->() const
 {
   return &accessor;
 }
@@ -457,8 +459,8 @@ inline typename LinearIndexIterator<DerivedIterator, AccessorType>::pointer
 
 template <class DerivedIterator, class AccessorType>
 inline bool
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator<=(const DerivedIterator &other) const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator<=(
+  const DerivedIterator &other) const
 {
   return (*this == other) || (*this < other);
 }
@@ -467,8 +469,8 @@ operator<=(const DerivedIterator &other) const
 
 template <class DerivedIterator, class AccessorType>
 inline bool
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator>=(const DerivedIterator &other) const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator>=(
+  const DerivedIterator &other) const
 {
   return !(*this < other);
 }
@@ -477,8 +479,8 @@ operator>=(const DerivedIterator &other) const
 
 template <class DerivedIterator, class AccessorType>
 inline bool
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator<(const DerivedIterator &other) const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator<(
+  const DerivedIterator &other) const
 {
   Assert(this->accessor.container == other.accessor.container,
          ExcMessage(
@@ -490,8 +492,8 @@ operator<(const DerivedIterator &other) const
 
 template <class DerivedIterator, class AccessorType>
 inline bool
-LinearIndexIterator<DerivedIterator, AccessorType>::
-operator>(const DerivedIterator &other) const
+LinearIndexIterator<DerivedIterator, AccessorType>::operator>(
+  const DerivedIterator &other) const
 {
   return other < static_cast<const DerivedIterator &>(*this);
 }
index f8788fe120a1434d577aa975c4e108a9a4ebefc2..6303e04d2fd40372a78e0baefbd0840bdff8c962 100644 (file)
@@ -73,7 +73,7 @@ public:
   template <class... Args>
   MGLevelObject(const unsigned int minlevel,
                 const unsigned int maxlevel,
-                Args &&... args);
+                Args &&...args);
 
   /**
    * Constructor. Same as above but without arguments to be forwarded to the
@@ -85,7 +85,8 @@ public:
   /**
    * Access object on level @p level.
    */
-  Object &operator[](const unsigned int level);
+  Object &
+  operator[](const unsigned int level);
 
   /**
    * Access object on level @p level.
@@ -93,7 +94,8 @@ public:
    * This function can be called on a @p const object, and
    * consequently returns a @p const reference.
    */
-  const Object &operator[](const unsigned int level) const;
+  const Object &
+  operator[](const unsigned int level) const;
 
   /**
    * Delete all previous contents of this object and reset its size according
@@ -112,7 +114,7 @@ public:
   void
   resize(const unsigned int new_minlevel,
          const unsigned int new_maxlevel,
-         Args &&... args);
+         Args &&...args);
 
   /**
    * Call <tt>operator = (s)</tt> on all objects stored by this object.
@@ -186,7 +188,7 @@ template <class Object>
 template <class... Args>
 MGLevelObject<Object>::MGLevelObject(const unsigned int min,
                                      const unsigned int max,
-                                     Args &&... args)
+                                     Args &&...args)
   : minlevel(0)
 {
   resize(min, max, std::forward<Args>(args)...);
@@ -203,7 +205,8 @@ MGLevelObject<Object>::MGLevelObject(const unsigned int min,
 
 
 template <class Object>
-Object &MGLevelObject<Object>::operator[](const unsigned int i)
+Object &
+MGLevelObject<Object>::operator[](const unsigned int i)
 {
   Assert((i >= minlevel) && (i < minlevel + objects.size()),
          ExcIndexRange(i, minlevel, minlevel + objects.size()));
@@ -212,7 +215,8 @@ Object &MGLevelObject<Object>::operator[](const unsigned int i)
 
 
 template <class Object>
-const Object &MGLevelObject<Object>::operator[](const unsigned int i) const
+const Object &
+MGLevelObject<Object>::operator[](const unsigned int i) const
 {
   Assert((i >= minlevel) && (i < minlevel + objects.size()),
          ExcIndexRange(i, minlevel, minlevel + objects.size()));
@@ -225,7 +229,7 @@ template <class... Args>
 void
 MGLevelObject<Object>::resize(const unsigned int new_minlevel,
                               const unsigned int new_maxlevel,
-                              Args &&... args)
+                              Args &&...args)
 {
   Assert(new_minlevel <= new_maxlevel, ExcInternalError());
   // note that on clear(), the
index 978041f7624e86867e9d26316c0898e9aaca8d9c..33eb2c1dfe01b78597144e391a181e5ef0c097b6 100644 (file)
@@ -285,7 +285,8 @@ namespace Utilities
       /**
        * Access the stored communicator.
        */
-      const MPI_Comm &operator*() const
+      const MPI_Comm &
+      operator*() const
       {
         return comm;
       }
index 71cdc86d2144709fd4395aca4dad55d79595b367..93008991c035b46a138b89165533df5c269364cc 100644 (file)
@@ -268,7 +268,7 @@ namespace Utilities
                 // ranks. Here, we process the interval by breaking into
                 // smaller pieces in terms of the dictionary number.
                 std::pair<types::global_dof_index, types::global_dof_index>
-                                   index_range(*interval->begin(), interval->last() + 1);
+                  index_range(*interval->begin(), interval->last() + 1);
                 const unsigned int owner_last =
                   dof_to_dict_rank(interval->last());
                 unsigned int owner_first = numbers::invalid_unsigned_int;
index 2300c067975cc1b10ae5359e66d32cc2eb99b184..53e40c96af4321405a9ddd7ab7b67cf3fb0f768f 100644 (file)
@@ -94,7 +94,7 @@ namespace Utilities
      * each arguments separately.
      */
     template <class FunctionType>
-    MutableBind(FunctionType function, FunctionArgs &&... arguments);
+    MutableBind(FunctionType function, FunctionArgs &&...arguments);
 
     /**
      * Construct a MutableBind object specifying the function, and
@@ -129,7 +129,7 @@ namespace Utilities
      * operator()() is called, using move semantic.
      */
     void
-    set_arguments(FunctionArgs &&... arguments);
+    set_arguments(FunctionArgs &&...arguments);
 
     /**
      * Parse the arguments to use in @p function from a string, for next time
@@ -186,7 +186,7 @@ namespace Utilities
   template <typename ReturnType, class... FunctionArgs>
   MutableBind<ReturnType, FunctionArgs...>
   mutable_bind(ReturnType (*function)(FunctionArgs...),
-               typename identity<FunctionArgs>::type &&... arguments);
+               typename identity<FunctionArgs>::type &&...arguments);
 
   /**
    * Same as above, using a std::function object.
@@ -194,7 +194,7 @@ namespace Utilities
   template <typename ReturnType, class... FunctionArgs>
   MutableBind<ReturnType, FunctionArgs...>
   mutable_bind(std::function<ReturnType(FunctionArgs...)>,
-               typename identity<FunctionArgs>::type &&... arguments);
+               typename identity<FunctionArgs>::type &&...arguments);
 
   /**
    * Create a MutableBind object from a function pointer, with uninitialized
@@ -224,7 +224,7 @@ namespace Utilities
   template <class FunctionType>
   MutableBind<ReturnType, FunctionArgs...>::MutableBind(
     FunctionType function,
-    FunctionArgs &&... arguments)
+    FunctionArgs &&...arguments)
     : function(function)
     , arguments(std::make_tuple(std::move(arguments)...))
   {}
@@ -261,7 +261,7 @@ namespace Utilities
   template <typename ReturnType, class... FunctionArgs>
   void
   MutableBind<ReturnType, FunctionArgs...>::set_arguments(
-    FunctionArgs &&... args)
+    FunctionArgs &&...args)
   {
     arguments = std::make_tuple(std::move(args)...);
   }
@@ -292,7 +292,7 @@ namespace Utilities
   template <typename ReturnType, class... FunctionArgs>
   MutableBind<ReturnType, FunctionArgs...>
   mutable_bind(ReturnType (*function)(FunctionArgs...),
-               typename identity<FunctionArgs>::type &&... arguments)
+               typename identity<FunctionArgs>::type &&...arguments)
   {
     return MutableBind<ReturnType, FunctionArgs...>(function,
                                                     std::move(arguments)...);
@@ -312,7 +312,7 @@ namespace Utilities
   template <typename ReturnType, class... FunctionArgs>
   MutableBind<ReturnType, FunctionArgs...>
   mutable_bind(std::function<ReturnType(FunctionArgs...)> function,
-               typename identity<FunctionArgs>::type &&... arguments)
+               typename identity<FunctionArgs>::type &&...arguments)
   {
     return MutableBind<ReturnType, FunctionArgs...>(function,
                                                     std::move(arguments)...);
index 32ccde7d29538b93640366df5fb6f422d1026ed0..9e73871ca099cbecab25563c29bb4e98c1c29f74 100644 (file)
@@ -571,7 +571,7 @@ namespace numbers
 
   template <typename number>
   constexpr DEAL_II_CUDA_HOST_DEV const number &
-                                        NumberTraits<number>::conjugate(const number &x)
+  NumberTraits<number>::conjugate(const number &x)
   {
     return x;
   }
@@ -700,7 +700,7 @@ namespace internal
   struct NumberType
   {
     static constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV const T &
-                                                                       value(const T &t)
+    value(const T &t)
     {
       return t;
     }
@@ -715,8 +715,8 @@ namespace internal
     // Type T is constructible from F.
     template <typename F>
     static constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV T
-                                                                 value(const F &f,
-                                                                       typename std::enable_if<
+    value(const F &f,
+          typename std::enable_if<
             !std::is_same<typename std::decay<T>::type,
                           typename std::decay<F>::type>::value &&
             std::is_constructible<T, F>::value>::type * = nullptr)
@@ -727,8 +727,8 @@ namespace internal
     // Type T is explicitly convertible (but not constructible) from F.
     template <typename F>
     static constexpr DEAL_II_ALWAYS_INLINE T
-                                           value(const F &f,
-                                                 typename std::enable_if<
+    value(const F &f,
+          typename std::enable_if<
             !std::is_same<typename std::decay<T>::type,
                           typename std::decay<F>::type>::value &&
             !std::is_constructible<T, F>::value &&
index 9f039db23480d548bbb0cf9bd6ad0cfcd9628494..bef3174dd1ee291591c4539ddbaee2e75980bef9 100644 (file)
@@ -456,13 +456,13 @@ namespace parallel
 
     f(begin, end);
 #else
-    internal::parallel_for(begin,
-                           end,
-                           [&f](const tbb::blocked_range<RangeType> &range) {
-                             internal::apply_to_subranges<RangeType, Function>(
-                               range, f);
-                           },
-                           grainsize);
+    internal::parallel_for(
+      begin,
+      end,
+      [&f](const tbb::blocked_range<RangeType> &range) {
+        internal::apply_to_subranges<RangeType, Function>(range, f);
+      },
+      grainsize);
 #endif
   }
 
index c21b30fec9631e7dd9997706da9db371cfce3ee9..86ca5b74a71dd9d49c454b85dd3db74f4c4b52e1 100644 (file)
@@ -401,7 +401,7 @@ public:
   initialize(const std::string &filename        = "",
              const std::string &output_filename = "",
              const ParameterHandler::OutputStyle
-                                                 output_style_for_output_filename = ParameterHandler::Short,
+               output_style_for_output_filename      = ParameterHandler::Short,
              ParameterHandler &                  prm = ParameterAcceptor::prm,
              const ParameterHandler::OutputStyle output_style_for_filename =
                ParameterHandler::DefaultStyle);
index 8cc66785b79796d94692d83ed6b6a183bc2ab130..8c9547c3d42fab5b19c324439eebfae87881e597 100644 (file)
@@ -799,7 +799,7 @@ namespace Patterns
      * @param patterns The list of patterns to use
      */
     template <class... PatternTypes>
-    Tuple(const std::string &separator, const PatternTypes &... patterns);
+    Tuple(const std::string &separator, const PatternTypes &...patterns);
 
     /**
      * Constructor. This is needed to allow users to specify
@@ -809,7 +809,7 @@ namespace Patterns
      * specialization, the compiler will fail with cryptic errors.
      */
     template <class... PatternTypes>
-    Tuple(const char *separator, const PatternTypes &... patterns);
+    Tuple(const char *separator, const PatternTypes &...patterns);
 
     /**
      * Constructor. Same as above, using the default separator.
@@ -817,7 +817,7 @@ namespace Patterns
      * @param patterns The list of patterns to use
      */
     template <typename... Patterns>
-    Tuple(const Patterns &... patterns);
+    Tuple(const Patterns &...patterns);
 
     /**
      * Copy constructor.
@@ -1413,7 +1413,7 @@ namespace Patterns
 namespace Patterns
 {
   template <class... PatternTypes>
-  Tuple::Tuple(const char *separator, const PatternTypes &... ps)
+  Tuple::Tuple(const char *separator, const PatternTypes &...ps)
     : // forward to the version with std::string argument
     Tuple(std::string(separator), ps...)
   {}
@@ -1421,7 +1421,7 @@ namespace Patterns
 
 
   template <class... PatternTypes>
-  Tuple::Tuple(const std::string &separator, const PatternTypes &... ps)
+  Tuple::Tuple(const std::string &separator, const PatternTypes &...ps)
     : separator(separator)
   {
     static_assert(is_base_of_all<PatternBase, PatternTypes...>::value,
@@ -1437,7 +1437,7 @@ namespace Patterns
 
 
   template <class... PatternTypes>
-  Tuple::Tuple(const PatternTypes &... ps)
+  Tuple::Tuple(const PatternTypes &...ps)
     : // forward to the version with the separator argument
     Tuple(std::string(":"), ps...)
   {}
index c261b9ef83449328f59d194443543a9f19aea23a..785935bc050102e57b2298eb9abbb131dd64705a 100644 (file)
@@ -185,7 +185,7 @@ public:
    * @note This function can also be used in CUDA device code.
    */
   DEAL_II_CUDA_HOST_DEV Number
-                        operator()(const unsigned int index) const;
+  operator()(const unsigned int index) const;
 
   /**
    * Read and write access to the <tt>index</tt>th coordinate.
@@ -288,7 +288,8 @@ public:
    *
    * @note This function can also be used in CUDA device code.
    */
-  DEAL_II_CUDA_HOST_DEV Number operator*(const Tensor<1, dim, Number> &p) const;
+  DEAL_II_CUDA_HOST_DEV Number
+  operator*(const Tensor<1, dim, Number> &p) const;
 
   /**
    * Return the scalar product of this point vector with itself, i.e. the
@@ -548,10 +549,10 @@ Point<dim, Number>::operator-() const
 template <int dim, typename Number>
 template <typename OtherNumber>
 inline DEAL_II_CUDA_HOST_DEV
-    Point<dim,
+  Point<dim,
         typename ProductType<Number,
                              typename EnableIfScalar<OtherNumber>::type>::type>
-    Point<dim, Number>::operator*(const OtherNumber factor) const
+  Point<dim, Number>::operator*(const OtherNumber factor) const
 {
   Point<dim, typename ProductType<Number, OtherNumber>::type> tmp;
   for (unsigned int i = 0; i < dim; ++i)
@@ -580,8 +581,8 @@ inline DEAL_II_CUDA_HOST_DEV
 
 
 template <int dim, typename Number>
-inline DEAL_II_CUDA_HOST_DEV Number Point<dim, Number>::
-                                    operator*(const Tensor<1, dim, Number> &p) const
+inline DEAL_II_CUDA_HOST_DEV Number
+Point<dim, Number>::operator*(const Tensor<1, dim, Number> &p) const
 {
   Number res = Number();
   for (unsigned int i = 0; i < dim; ++i)
index 14c8349537d8e21c31170833ece5a15b97873c26..c2736486f51f6a9238588b2090704d6c4045937f 100644 (file)
@@ -137,7 +137,8 @@ public:
    * Multiply by a scalar.
    */
   template <typename Number2>
-  BarycentricPolynomial<dim, Number> operator*(const Number2 &a) const;
+  BarycentricPolynomial<dim, Number>
+  operator*(const Number2 &a) const;
 
   /**
    * Divide by a scalar.
@@ -234,7 +235,8 @@ public:
   /**
    * Access operator.
    */
-  const BarycentricPolynomial<dim> &operator[](const std::size_t i) const;
+  const BarycentricPolynomial<dim> &
+  operator[](const std::size_t i) const;
 
   /**
    * @copydoc ScalarPolynomialsBase::evaluate()
@@ -489,8 +491,8 @@ BarycentricPolynomial<dim, Number>::operator-(const Number2 &a) const
 
 template <int dim, typename Number>
 template <typename Number2>
-BarycentricPolynomial<dim, Number> BarycentricPolynomial<dim, Number>::
-                                   operator*(const Number2 &a) const
+BarycentricPolynomial<dim, Number>
+BarycentricPolynomial<dim, Number>::operator*(const Number2 &a) const
 {
   if (a == Number2())
     {
@@ -522,8 +524,8 @@ BarycentricPolynomial<dim, Number>::operator/(const Number2 &a) const
 
 template <int dim, typename Number>
 BarycentricPolynomial<dim, Number>
-BarycentricPolynomial<dim, Number>::
-operator+(const BarycentricPolynomial<dim, Number> &augend) const
+BarycentricPolynomial<dim, Number>::operator+(
+  const BarycentricPolynomial<dim, Number> &augend) const
 {
   TableIndices<dim + 1> deg;
   for (unsigned int d = 0; d < dim + 1; ++d)
@@ -550,8 +552,8 @@ operator+(const BarycentricPolynomial<dim, Number> &augend) const
 
 template <int dim, typename Number>
 BarycentricPolynomial<dim, Number>
-BarycentricPolynomial<dim, Number>::
-operator-(const BarycentricPolynomial<dim, Number> &augend) const
+BarycentricPolynomial<dim, Number>::operator-(
+  const BarycentricPolynomial<dim, Number> &augend) const
 {
   return *this + (-augend);
 }
@@ -559,8 +561,9 @@ operator-(const BarycentricPolynomial<dim, Number> &augend) const
 
 
 template <int dim, typename Number>
-BarycentricPolynomial<dim, Number> BarycentricPolynomial<dim, Number>::
-                                   operator*(const BarycentricPolynomial<dim, Number> &multiplicand) const
+BarycentricPolynomial<dim, Number>
+BarycentricPolynomial<dim, Number>::operator*(
+  const BarycentricPolynomial<dim, Number> &multiplicand) const
 {
   TableIndices<dim + 1> deg;
   for (unsigned int d = 0; d < dim + 1; ++d)
@@ -697,8 +700,8 @@ BarycentricPolynomial<dim, Number>::index_to_indices(
 }
 
 template <int dim>
-const BarycentricPolynomial<dim> &BarycentricPolynomials<dim>::
-                                  operator[](const std::size_t i) const
+const BarycentricPolynomial<dim> &
+BarycentricPolynomials<dim>::operator[](const std::size_t i) const
 {
   AssertIndexRange(i, polys.size());
   return polys[i];
index 37395820679ee8d6c22e41bd07158c022f252427..5c8bb95fe118c5c08e3651d41b030b8d78e98073 100644 (file)
@@ -148,13 +148,15 @@ public:
    * Dereferencing operator. This operator throws an ExcNotInitialized() if the
    * pointer is a null pointer.
    */
-  T &operator*() const;
+  T &
+  operator*() const;
 
   /**
    * Dereferencing operator. This operator throws an ExcNotInitializedi() if the
    * pointer is a null pointer.
    */
-  T *operator->() const;
+  T *
+  operator->() const;
 
   /**
    * Exchange the pointers of this object and the argument. Since both the
@@ -363,7 +365,8 @@ inline SmartPointer<T, P>::operator T *() const
 
 
 template <typename T, typename P>
-inline T &SmartPointer<T, P>::operator*() const
+inline T &
+SmartPointer<T, P>::operator*() const
 {
   Assert(t != nullptr, ExcNotInitialized());
   Assert(pointed_to_object_is_alive,
@@ -374,7 +377,8 @@ inline T &SmartPointer<T, P>::operator*() const
 
 
 template <typename T, typename P>
-inline T *SmartPointer<T, P>::operator->() const
+inline T *
+SmartPointer<T, P>::operator->() const
 {
   Assert(t != nullptr, ExcNotInitialized());
   Assert(pointed_to_object_is_alive,
index 2c77a22314266e5b86780ffe9340d6dd6d189308..02cb46de8ba86387b538acffc6583856a63be746 100644 (file)
@@ -129,15 +129,15 @@ constexpr DEAL_II_ALWAYS_INLINE SymmetricTensor<4, dim, Number>
 
 template <int dim2, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number
-                                       trace(const SymmetricTensor<2, dim2, Number> &);
+trace(const SymmetricTensor<2, dim2, Number> &);
 
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<2, dim, Number>
-                                       deviator(const SymmetricTensor<2, dim, Number> &);
+deviator(const SymmetricTensor<2, dim, Number> &);
 
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number
-                                       determinant(const SymmetricTensor<2, dim, Number> &);
+determinant(const SymmetricTensor<2, dim, Number> &);
 
 
 
@@ -213,9 +213,9 @@ namespace internal
      * invalid state.
      */
     DEAL_II_CONSTEXPR inline DEAL_II_ALWAYS_INLINE TableIndices<2>
-                                                   merge(const TableIndices<2> &previous_indices,
-                                                         const unsigned int     new_index,
-                                                         const unsigned int     position)
+    merge(const TableIndices<2> &previous_indices,
+          const unsigned int     new_index,
+          const unsigned int     position)
     {
       AssertIndexRange(position, 2);
 
@@ -234,9 +234,9 @@ namespace internal
      * invalid state.
      */
     DEAL_II_CONSTEXPR inline DEAL_II_ALWAYS_INLINE TableIndices<4>
-                                                   merge(const TableIndices<4> &previous_indices,
-                                                         const unsigned int     new_index,
-                                                         const unsigned int     position)
+    merge(const TableIndices<4> &previous_indices,
+          const unsigned int     new_index,
+          const unsigned int     position)
     {
       AssertIndexRange(position, 4);
 
@@ -563,12 +563,14 @@ namespace internal
       /**
        * Index operator.
        */
-      constexpr reference operator[](const unsigned int);
+      constexpr reference
+      operator[](const unsigned int);
 
       /**
        * Index operator.
        */
-      constexpr reference operator[](const unsigned int) const;
+      constexpr reference
+      operator[](const unsigned int) const;
 
     private:
       /**
@@ -912,14 +914,16 @@ public:
    *
    * Exactly the same as operator().
    */
-  constexpr const Number &operator[](const TableIndices<rank_> &indices) const;
+  constexpr const Number &
+  operator[](const TableIndices<rank_> &indices) const;
 
   /**
    * Return a read-write reference to the indicated element.
    *
    * Exactly the same as operator().
    */
-  constexpr Number &operator[](const TableIndices<rank_> &indices);
+  constexpr Number &
+  operator[](const TableIndices<rank_> &indices);
 
   /**
    * Access to an element according to unrolled index. The function
@@ -1086,9 +1090,9 @@ namespace internal
 
     template <int rank_, int dim, bool constness, int P, typename Number>
     constexpr inline DEAL_II_ALWAYS_INLINE
-        Accessor<rank_, dim, constness, P - 1, Number>
-        Accessor<rank_, dim, constness, P, Number>::
-        operator[](const unsigned int i)
+      Accessor<rank_, dim, constness, P - 1, Number>
+      Accessor<rank_, dim, constness, P, Number>::operator[](
+        const unsigned int i)
     {
       return Accessor<rank_, dim, constness, P - 1, Number>(
         tensor, merge(previous_indices, i, rank_ - P));
@@ -1098,9 +1102,9 @@ namespace internal
 
     template <int rank_, int dim, bool constness, int P, typename Number>
     constexpr DEAL_II_ALWAYS_INLINE
-        Accessor<rank_, dim, constness, P - 1, Number>
-        Accessor<rank_, dim, constness, P, Number>::
-        operator[](const unsigned int i) const
+      Accessor<rank_, dim, constness, P - 1, Number>
+      Accessor<rank_, dim, constness, P, Number>::operator[](
+        const unsigned int i) const
     {
       return Accessor<rank_, dim, constness, P - 1, Number>(
         tensor, merge(previous_indices, i, rank_ - P));
@@ -1122,8 +1126,8 @@ namespace internal
     template <int rank_, int dim, bool constness, typename Number>
     constexpr inline DEAL_II_ALWAYS_INLINE
       typename Accessor<rank_, dim, constness, 1, Number>::reference
-        Accessor<rank_, dim, constness, 1, Number>::
-        operator[](const unsigned int i)
+      Accessor<rank_, dim, constness, 1, Number>::operator[](
+        const unsigned int i)
     {
       return tensor(merge(previous_indices, i, rank_ - 1));
     }
@@ -1132,8 +1136,8 @@ namespace internal
     template <int rank_, int dim, bool constness, typename Number>
     constexpr DEAL_II_ALWAYS_INLINE
       typename Accessor<rank_, dim, constness, 1, Number>::reference
-        Accessor<rank_, dim, constness, 1, Number>::
-        operator[](const unsigned int i) const
+      Accessor<rank_, dim, constness, 1, Number>::operator[](
+        const unsigned int i) const
     {
       return tensor(merge(previous_indices, i, rank_ - 1));
     }
@@ -1191,8 +1195,8 @@ SymmetricTensor<rank_, dim, Number>::SymmetricTensor(
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number> &
-                                       SymmetricTensor<rank_, dim, Number>::
-                                       operator=(const SymmetricTensor<rank_, dim, OtherNumber> &t)
+SymmetricTensor<rank_, dim, Number>::operator=(
+  const SymmetricTensor<rank_, dim, OtherNumber> &t)
 {
   data = t.data;
   return *this;
@@ -1220,7 +1224,7 @@ namespace internal
   {
     template <int dim, typename Number>
     constexpr inline DEAL_II_ALWAYS_INLINE dealii::Tensor<2, dim, Number>
-                                           convert_to_tensor(const dealii::SymmetricTensor<2, dim, Number> &s)
+    convert_to_tensor(const dealii::SymmetricTensor<2, dim, Number> &s)
     {
       dealii::Tensor<2, dim, Number> t;
 
@@ -1563,8 +1567,9 @@ namespace internal
 
 
 template <int rank_, int dim, typename Number>
-constexpr DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>::
-                                operator Tensor<rank_, dim, Number>() const
+constexpr DEAL_II_ALWAYS_INLINE
+  SymmetricTensor<rank_, dim, Number>::operator Tensor<rank_, dim, Number>()
+    const
 {
   return internal::SymmetricTensorImplementation::convert_to_tensor(*this);
 }
@@ -1573,8 +1578,8 @@ constexpr DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>::
 
 template <int rank_, int dim, typename Number>
 constexpr bool
-SymmetricTensor<rank_, dim, Number>::
-operator==(const SymmetricTensor<rank_, dim, Number> &t) const
+SymmetricTensor<rank_, dim, Number>::operator==(
+  const SymmetricTensor<rank_, dim, Number> &t) const
 {
   return data == t.data;
 }
@@ -1583,8 +1588,8 @@ operator==(const SymmetricTensor<rank_, dim, Number> &t) const
 
 template <int rank_, int dim, typename Number>
 constexpr bool
-SymmetricTensor<rank_, dim, Number>::
-operator!=(const SymmetricTensor<rank_, dim, Number> &t) const
+SymmetricTensor<rank_, dim, Number>::operator!=(
+  const SymmetricTensor<rank_, dim, Number> &t) const
 {
   return data != t.data;
 }
@@ -1594,8 +1599,8 @@ operator!=(const SymmetricTensor<rank_, dim, Number> &t) const
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number> &
-                                       SymmetricTensor<rank_, dim, Number>::
-                                       operator+=(const SymmetricTensor<rank_, dim, OtherNumber> &t)
+SymmetricTensor<rank_, dim, Number>::operator+=(
+  const SymmetricTensor<rank_, dim, OtherNumber> &t)
 {
   data += t.data;
   return *this;
@@ -1606,8 +1611,8 @@ constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number> &
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number> &
-                                       SymmetricTensor<rank_, dim, Number>::
-                                       operator-=(const SymmetricTensor<rank_, dim, OtherNumber> &t)
+SymmetricTensor<rank_, dim, Number>::operator-=(
+  const SymmetricTensor<rank_, dim, OtherNumber> &t)
 {
   data -= t.data;
   return *this;
@@ -1815,8 +1820,8 @@ template <typename OtherNumber>
 DEAL_II_CONSTEXPR inline DEAL_II_ALWAYS_INLINE
   typename internal::SymmetricTensorAccessors::
     double_contraction_result<rank_, 2, dim, Number, OtherNumber>::type
-      SymmetricTensor<rank_, dim, Number>::
-      operator*(const SymmetricTensor<2, dim, OtherNumber> &s) const
+    SymmetricTensor<rank_, dim, Number>::operator*(
+      const SymmetricTensor<2, dim, OtherNumber> &s) const
 {
   // need to have two different function calls
   // because a scalar and rank-2 tensor are not
@@ -1832,8 +1837,8 @@ template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 DEAL_II_CONSTEXPR inline typename internal::SymmetricTensorAccessors::
   double_contraction_result<rank_, 4, dim, Number, OtherNumber>::type
-    SymmetricTensor<rank_, dim, Number>::
-    operator*(const SymmetricTensor<4, dim, OtherNumber> &s) const
+  SymmetricTensor<rank_, dim, Number>::operator*(
+    const SymmetricTensor<4, dim, OtherNumber> &s) const
 {
   typename internal::SymmetricTensorAccessors::
     double_contraction_result<rank_, 4, dim, Number, OtherNumber>::type tmp;
@@ -1872,9 +1877,9 @@ namespace internal
 
   template <int dim, typename Number>
   constexpr inline DEAL_II_ALWAYS_INLINE Number &
-                                         symmetric_tensor_access(const TableIndices<2> &indices,
-                                                                 typename SymmetricTensorAccessors::
-                                                                   StorageType<2, dim, Number>::base_tensor_type &data)
+  symmetric_tensor_access(const TableIndices<2> &indices,
+                          typename SymmetricTensorAccessors::
+                            StorageType<2, dim, Number>::base_tensor_type &data)
   {
     // 1d is very simple and done first
     if (dim == 1)
@@ -1918,9 +1923,9 @@ namespace internal
 
   template <int dim, typename Number>
   constexpr inline DEAL_II_ALWAYS_INLINE const Number &
-                                               symmetric_tensor_access(const TableIndices<2> &indices,
-                                                                       const typename SymmetricTensorAccessors::
-                                                                         StorageType<2, dim, Number>::base_tensor_type &data)
+  symmetric_tensor_access(const TableIndices<2> &indices,
+                          const typename SymmetricTensorAccessors::
+                            StorageType<2, dim, Number>::base_tensor_type &data)
   {
     // 1d is very simple and done first
     if (dim == 1)
@@ -2011,9 +2016,9 @@ namespace internal
 
   template <int dim, typename Number>
   constexpr inline DEAL_II_ALWAYS_INLINE const Number &
-                                               symmetric_tensor_access(const TableIndices<4> &indices,
-                                                                       const typename SymmetricTensorAccessors::
-                                                                         StorageType<4, dim, Number>::base_tensor_type &data)
+  symmetric_tensor_access(const TableIndices<4> &indices,
+                          const typename SymmetricTensorAccessors::
+                            StorageType<4, dim, Number>::base_tensor_type &data)
   {
     switch (dim)
       {
@@ -2061,8 +2066,8 @@ namespace internal
 
 template <int rank_, int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number &
-                                       SymmetricTensor<rank_, dim, Number>::
-                                       operator()(const TableIndices<rank_> &indices)
+SymmetricTensor<rank_, dim, Number>::operator()(
+  const TableIndices<rank_> &indices)
 {
   for (unsigned int r = 0; r < rank; ++r)
     AssertIndexRange(indices[r], dimension);
@@ -2073,8 +2078,8 @@ constexpr inline DEAL_II_ALWAYS_INLINE Number &
 
 template <int rank_, int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE const Number &
-                                             SymmetricTensor<rank_, dim, Number>::
-                                             operator()(const TableIndices<rank_> &indices) const
+SymmetricTensor<rank_, dim, Number>::operator()(
+  const TableIndices<rank_> &indices) const
 {
   for (unsigned int r = 0; r < rank; ++r)
     AssertIndexRange(indices[r], dimension);
@@ -2113,8 +2118,7 @@ namespace internal
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE internal::SymmetricTensorAccessors::
   Accessor<rank_, dim, true, rank_ - 1, Number>
-    SymmetricTensor<rank_, dim, Number>::
-    operator[](const unsigned int row) const
+  SymmetricTensor<rank_, dim, Number>::operator[](const unsigned int row) const
 {
   return internal::SymmetricTensorAccessors::
     Accessor<rank_, dim, true, rank_ - 1, Number>(
@@ -2128,7 +2132,7 @@ constexpr DEAL_II_ALWAYS_INLINE internal::SymmetricTensorAccessors::
 template <int rank_, int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE internal::SymmetricTensorAccessors::
   Accessor<rank_, dim, false, rank_ - 1, Number>
-    SymmetricTensor<rank_, dim, Number>::operator[](const unsigned int row)
+  SymmetricTensor<rank_, dim, Number>::operator[](const unsigned int row)
 {
   return internal::SymmetricTensorAccessors::
     Accessor<rank_, dim, false, rank_ - 1, Number>(
@@ -2141,8 +2145,8 @@ constexpr inline DEAL_II_ALWAYS_INLINE internal::SymmetricTensorAccessors::
 
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE const Number &
-                                      SymmetricTensor<rank_, dim, Number>::
-                                      operator[](const TableIndices<rank_> &indices) const
+SymmetricTensor<rank_, dim, Number>::operator[](
+  const TableIndices<rank_> &indices) const
 {
   return operator()(indices);
 }
@@ -2151,8 +2155,8 @@ constexpr DEAL_II_ALWAYS_INLINE const Number &
 
 template <int rank_, int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number &
-                                       SymmetricTensor<rank_, dim, Number>::
-                                       operator[](const TableIndices<rank_> &indices)
+SymmetricTensor<rank_, dim, Number>::operator[](
+  const TableIndices<rank_> &indices)
 {
   return operator()(indices);
 }
@@ -2452,8 +2456,8 @@ namespace internal
     // this function is for rank-2 tensors
     template <int dim>
     constexpr inline DEAL_II_ALWAYS_INLINE TableIndices<2>
-                                           unrolled_to_component_indices(const unsigned int i,
-                                                                         const std::integral_constant<int, 2> &)
+    unrolled_to_component_indices(const unsigned int i,
+                                  const std::integral_constant<int, 2> &)
     {
       Assert(
         (i < dealii::SymmetricTensor<2, dim, double>::n_independent_components),
@@ -2533,7 +2537,7 @@ namespace internal
 
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE TableIndices<rank_>
-                                SymmetricTensor<rank_, dim, Number>::unrolled_to_component_indices(
+SymmetricTensor<rank_, dim, Number>::unrolled_to_component_indices(
   const unsigned int i)
 {
   return internal::SymmetricTensorImplementation::unrolled_to_component_indices<
@@ -2690,7 +2694,7 @@ constexpr DEAL_II_ALWAYS_INLINE
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number
-                                       determinant(const SymmetricTensor<2, dim, Number> &t)
+determinant(const SymmetricTensor<2, dim, Number> &t)
 {
   switch (dim)
     {
@@ -2730,7 +2734,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE Number
  */
 template <int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                third_invariant(const SymmetricTensor<2, dim, Number> &t)
+third_invariant(const SymmetricTensor<2, dim, Number> &t)
 {
   return determinant(t);
 }
@@ -2748,7 +2752,7 @@ constexpr DEAL_II_ALWAYS_INLINE Number
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number
-                                       trace(const SymmetricTensor<2, dim, Number> &d)
+trace(const SymmetricTensor<2, dim, Number> &d)
 {
   Number t = d.data[0];
   for (unsigned int i = 1; i < dim; ++i)
@@ -2789,7 +2793,7 @@ first_invariant(const SymmetricTensor<2, dim, Number> &t)
  */
 template <typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                second_invariant(const SymmetricTensor<2, 1, Number> &)
+second_invariant(const SymmetricTensor<2, 1, Number> &)
 {
   return internal::NumberType<Number>::value(0.0);
 }
@@ -2816,7 +2820,7 @@ constexpr DEAL_II_ALWAYS_INLINE Number
  */
 template <typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                second_invariant(const SymmetricTensor<2, 2, Number> &t)
+second_invariant(const SymmetricTensor<2, 2, Number> &t)
 {
   return t[0][0] * t[1][1] - t[0][1] * t[0][1];
 }
@@ -2833,7 +2837,7 @@ constexpr DEAL_II_ALWAYS_INLINE Number
  */
 template <typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                second_invariant(const SymmetricTensor<2, 3, Number> &t)
+second_invariant(const SymmetricTensor<2, 3, Number> &t)
 {
   return (t[0][0] * t[1][1] + t[1][1] * t[2][2] + t[2][2] * t[0][0] -
           t[0][1] * t[0][1] - t[0][2] * t[0][2] - t[1][2] * t[1][2]);
@@ -3046,7 +3050,7 @@ namespace internal
      */
     template <int dim, typename Number>
     std::array<std::pair<Number, Tensor<1, dim, Number>>, dim>
-      jacobi(dealii::SymmetricTensor<2, dim, Number> A);
+    jacobi(dealii::SymmetricTensor<2, dim, Number> A);
 
 
 
@@ -3238,7 +3242,7 @@ eigenvectors(const SymmetricTensor<2, dim, Number> &T,
  */
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>
-                                transpose(const SymmetricTensor<rank_, dim, Number> &t)
+transpose(const SymmetricTensor<rank_, dim, Number> &t)
 {
   return t;
 }
@@ -3257,7 +3261,7 @@ constexpr DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<2, dim, Number>
-                                       deviator(const SymmetricTensor<2, dim, Number> &t)
+deviator(const SymmetricTensor<2, dim, Number> &t)
 {
   SymmetricTensor<2, dim, Number> tmp = t;
 
@@ -3441,7 +3445,7 @@ outer_product(const SymmetricTensor<2, dim, Number> &t1,
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<2, dim, Number>
-                                       symmetrize(const Tensor<2, dim, Number> &t)
+symmetrize(const Tensor<2, dim, Number> &t)
 {
   SymmetricTensor<2, dim, Number> result;
   for (unsigned int d = 0; d < dim; ++d)
@@ -3465,7 +3469,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<2, dim, Number>
  */
 template <int rank_, int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>
-                                       operator*(const SymmetricTensor<rank_, dim, Number> &t, const Number &factor)
+operator*(const SymmetricTensor<rank_, dim, Number> &t, const Number &factor)
 {
   SymmetricTensor<rank_, dim, Number> tt = t;
   tt *= factor;
@@ -3483,7 +3487,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>
  */
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim, Number>
-                                operator*(const Number &factor, const SymmetricTensor<rank_, dim, Number> &t)
+operator*(const Number &factor, const SymmetricTensor<rank_, dim, Number> &t)
 {
   // simply forward to the other operator
   return t * factor;
@@ -3591,7 +3595,7 @@ operator/(const SymmetricTensor<rank_, dim, Number> &t,
  */
 template <int rank_, int dim>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim>
-                                       operator*(const SymmetricTensor<rank_, dim> &t, const double factor)
+operator*(const SymmetricTensor<rank_, dim> &t, const double factor)
 {
   SymmetricTensor<rank_, dim> tt(t);
   tt *= factor;
@@ -3608,7 +3612,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim>
  */
 template <int rank_, int dim>
 constexpr inline DEAL_II_ALWAYS_INLINE SymmetricTensor<rank_, dim>
-                                       operator*(const double factor, const SymmetricTensor<rank_, dim> &t)
+operator*(const double factor, const SymmetricTensor<rank_, dim> &t)
 {
   SymmetricTensor<rank_, dim> tt(t);
   tt *= factor;
@@ -3714,7 +3718,8 @@ scalar_product(const Tensor<2, dim, Number> &              t1,
  * @relatesalso SymmetricTensor
  */
 template <typename Number, typename OtherNumber>
-constexpr inline DEAL_II_ALWAYS_INLINE void double_contract(
+constexpr inline DEAL_II_ALWAYS_INLINE void
+double_contract(
   SymmetricTensor<2, 1, typename ProductType<Number, OtherNumber>::type> &tmp,
   const SymmetricTensor<4, 1, Number> &                                   t,
   const SymmetricTensor<2, 1, OtherNumber> &                              s)
@@ -3739,7 +3744,8 @@ constexpr inline DEAL_II_ALWAYS_INLINE void double_contract(
  * @relatesalso SymmetricTensor
  */
 template <typename Number, typename OtherNumber>
-constexpr inline void double_contract(
+constexpr inline void
+double_contract(
   SymmetricTensor<2, 1, typename ProductType<Number, OtherNumber>::type> &tmp,
   const SymmetricTensor<2, 1, Number> &                                   s,
   const SymmetricTensor<4, 1, OtherNumber> &                              t)
@@ -3764,7 +3770,8 @@ constexpr inline void double_contract(
  * @relatesalso SymmetricTensor
  */
 template <typename Number, typename OtherNumber>
-constexpr inline void double_contract(
+constexpr inline void
+double_contract(
   SymmetricTensor<2, 2, typename ProductType<Number, OtherNumber>::type> &tmp,
   const SymmetricTensor<4, 2, Number> &                                   t,
   const SymmetricTensor<2, 2, OtherNumber> &                              s)
@@ -3794,7 +3801,8 @@ constexpr inline void double_contract(
  * @relatesalso SymmetricTensor
  */
 template <typename Number, typename OtherNumber>
-constexpr inline void double_contract(
+constexpr inline void
+double_contract(
   SymmetricTensor<2, 2, typename ProductType<Number, OtherNumber>::type> &tmp,
   const SymmetricTensor<2, 2, Number> &                                   s,
   const SymmetricTensor<4, 2, OtherNumber> &                              t)
@@ -3824,7 +3832,8 @@ constexpr inline void double_contract(
  * @relatesalso SymmetricTensor
  */
 template <typename Number, typename OtherNumber>
-constexpr inline void double_contract(
+constexpr inline void
+double_contract(
   SymmetricTensor<2, 3, typename ProductType<Number, OtherNumber>::type> &tmp,
   const SymmetricTensor<4, 3, Number> &                                   t,
   const SymmetricTensor<2, 3, OtherNumber> &                              s)
@@ -3855,7 +3864,8 @@ constexpr inline void double_contract(
  * @relatesalso SymmetricTensor
  */
 template <typename Number, typename OtherNumber>
-constexpr inline void double_contract(
+constexpr inline void
+double_contract(
   SymmetricTensor<2, 3, typename ProductType<Number, OtherNumber>::type> &tmp,
   const SymmetricTensor<2, 3, Number> &                                   s,
   const SymmetricTensor<4, 3, OtherNumber> &                              t)
index 830e33195204dc0b6749487512ede3ed007d1dd2..51175264eb6d66ff7b6c0e0a9487e2e33e68dc56 100644 (file)
@@ -376,7 +376,7 @@ namespace internal
 
     template <int dim, typename Number>
     std::array<std::pair<Number, Tensor<1, dim, Number>>, dim>
-      jacobi(dealii::SymmetricTensor<2, dim, Number> A)
+    jacobi(dealii::SymmetricTensor<2, dim, Number> A)
     {
       static_assert(numbers::NumberTraits<Number>::is_complex == false,
                     "This implementation of the Jacobi algorithm does "
index c5b70f4441b88a7caf1647950105fcc8efaa06eb..ef80b4f6fdc1fb458060a25ff6e66b42f6a577c4 100644 (file)
@@ -58,13 +58,15 @@ struct SynchronousIterators
    * Dereference const operator. Returns a const reference to the iterators
    * represented by the current class.
    */
-  const Iterators &operator*() const;
+  const Iterators &
+  operator*() const;
 
   /**
    * Dereference operator. Returns a reference to the iterators
    * represented by the current class.
    */
-  Iterators &operator*();
+  Iterators &
+  operator*();
 
 private:
   /**
@@ -83,7 +85,8 @@ inline SynchronousIterators<Iterators>::SynchronousIterators(const Iterators &i)
 
 
 template <typename Iterators>
-inline const Iterators &SynchronousIterators<Iterators>::operator*() const
+inline const Iterators &
+SynchronousIterators<Iterators>::operator*() const
 {
   return iterators;
 }
@@ -91,7 +94,8 @@ inline const Iterators &SynchronousIterators<Iterators>::operator*() const
 
 
 template <typename Iterators>
-inline Iterators &SynchronousIterators<Iterators>::operator*()
+inline Iterators &
+SynchronousIterators<Iterators>::operator*()
 {
   return iterators;
 }
index 05908968691e99280d8c3a3248bae973fcb2c13e..0ed61dfea25f2294f1a21ee369d6ee9ecd3f6fec 100644 (file)
@@ -189,7 +189,8 @@ namespace internal
       /**
        * Index operator. Performs a range check.
        */
-      Accessor<N, T, C, P - 1> operator[](const size_type i) const;
+      Accessor<N, T, C, P - 1>
+      operator[](const size_type i) const;
 
       /**
        * Exception for range check. Do not use global exception since this way
@@ -285,7 +286,8 @@ namespace internal
       /**
        * Index operator. Performs a range check.
        */
-      reference operator[](const size_type) const;
+      reference
+      operator[](const size_type) const;
 
       /**
        * Return the length of one row, i.e. the number of elements
@@ -893,7 +895,8 @@ public:
    * Access operator. Since this is a one-dimensional object, this simply
    * accesses the requested data element. Returns a read-write reference.
    */
-  typename AlignedVector<T>::reference operator[](const size_type i);
+  typename AlignedVector<T>::reference
+  operator[](const size_type i);
 
   /**
    * Access operator. Since this is a one-dimensional object, this simply
@@ -2208,8 +2211,8 @@ namespace internal
 
 
     template <int N, typename T, bool C, unsigned int P>
-    inline Accessor<N, T, C, P - 1> Accessor<N, T, C, P>::
-                                    operator[](const size_type i) const
+    inline Accessor<N, T, C, P - 1>
+    Accessor<N, T, C, P>::operator[](const size_type i) const
     {
       AssertIndexRange(i, table.size()[N - P]);
 
@@ -2251,8 +2254,8 @@ namespace internal
 
 
     template <int N, typename T, bool C>
-    inline typename Accessor<N, T, C, 1>::reference Accessor<N, T, C, 1>::
-                                                    operator[](const size_type i) const
+    inline typename Accessor<N, T, C, 1>::reference
+    Accessor<N, T, C, 1>::operator[](const size_type i) const
     {
       AssertIndexRange(i, table.size()[N - 1]);
       return *(data + i);
@@ -2635,8 +2638,8 @@ inline Table<1, T>::Table(const size_type size,
 
 
 template <typename T>
-inline typename AlignedVector<T>::const_reference Table<1, T>::
-                                                  operator[](const size_type i) const
+inline typename AlignedVector<T>::const_reference
+Table<1, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   return this->values[i];
@@ -2645,8 +2648,8 @@ inline typename AlignedVector<T>::const_reference Table<1, T>::
 
 
 template <typename T>
-inline typename AlignedVector<T>::reference Table<1, T>::
-                                            operator[](const size_type i)
+inline typename AlignedVector<T>::reference
+Table<1, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   return this->values[i];
@@ -2709,7 +2712,7 @@ Table<2, T>::reinit(const size_type size1,
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<2, T, true, 1>
-  Table<2, T>::operator[](const size_type i) const
+Table<2, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   return dealii::internal::TableBaseAccessors::Accessor<2, T, true, 1>(
@@ -2720,7 +2723,7 @@ inline dealii::internal::TableBaseAccessors::Accessor<2, T, true, 1>
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<2, T, false, 1>
-  Table<2, T>::operator[](const size_type i)
+Table<2, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   return dealii::internal::TableBaseAccessors::Accessor<2, T, false, 1>(
@@ -3222,7 +3225,7 @@ inline Table<3, T>::Table(const size_type size1,
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<3, T, true, 2>
-  Table<3, T>::operator[](const size_type i) const
+Table<3, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size =
@@ -3235,7 +3238,7 @@ inline dealii::internal::TableBaseAccessors::Accessor<3, T, true, 2>
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<3, T, false, 2>
-  Table<3, T>::operator[](const size_type i)
+Table<3, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size =
@@ -3248,8 +3251,9 @@ inline dealii::internal::TableBaseAccessors::Accessor<3, T, false, 2>
 
 template <typename T>
 inline typename AlignedVector<T>::const_reference
-Table<3, T>::
-operator()(const size_type i, const size_type j, const size_type k) const
+Table<3, T>::operator()(const size_type i,
+                        const size_type j,
+                        const size_type k) const
 {
   AssertIndexRange(i, this->table_size[0]);
   AssertIndexRange(j, this->table_size[1]);
@@ -3287,7 +3291,7 @@ inline Table<4, T>::Table(const size_type size1,
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<4, T, true, 3>
-  Table<4, T>::operator[](const size_type i) const
+Table<4, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size =
@@ -3300,7 +3304,7 @@ inline dealii::internal::TableBaseAccessors::Accessor<4, T, true, 3>
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<4, T, false, 3>
-  Table<4, T>::operator[](const size_type i)
+Table<4, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size =
@@ -3364,7 +3368,7 @@ inline Table<5, T>::Table(const size_type size1,
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<5, T, true, 4>
-  Table<5, T>::operator[](const size_type i) const
+Table<5, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size = size_type(this->table_size[1]) *
@@ -3378,7 +3382,7 @@ inline dealii::internal::TableBaseAccessors::Accessor<5, T, true, 4>
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<5, T, false, 4>
-  Table<5, T>::operator[](const size_type i)
+Table<5, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size = size_type(this->table_size[1]) *
@@ -3462,7 +3466,7 @@ inline Table<6, T>::Table(const size_type size1,
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<6, T, true, 5>
-  Table<6, T>::operator[](const size_type i) const
+Table<6, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size = size_type(this->table_size[1]) *
@@ -3476,7 +3480,7 @@ inline dealii::internal::TableBaseAccessors::Accessor<6, T, true, 5>
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<6, T, false, 5>
-  Table<6, T>::operator[](const size_type i)
+Table<6, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size = size_type(this->table_size[1]) *
@@ -3570,7 +3574,7 @@ inline Table<7, T>::Table(const size_type size1,
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<7, T, true, 6>
-  Table<7, T>::operator[](const size_type i) const
+Table<7, T>::operator[](const size_type i) const
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size =
@@ -3584,7 +3588,7 @@ inline dealii::internal::TableBaseAccessors::Accessor<7, T, true, 6>
 
 template <typename T>
 inline dealii::internal::TableBaseAccessors::Accessor<7, T, false, 6>
-  Table<7, T>::operator[](const size_type i)
+Table<7, T>::operator[](const size_type i)
 {
   AssertIndexRange(i, this->table_size[0]);
   const size_type subobject_size =
index f60a3dd4ff79ff4ff8b2206ef25f32d0e7df7658..435063080a3b91dc8b1df8e3a16702d495185ecf 100644 (file)
@@ -66,12 +66,14 @@ public:
   /**
    * Read-only access the value of the <tt>i</tt>th index.
    */
-  constexpr std::size_t operator[](const unsigned int i) const;
+  constexpr std::size_t
+  operator[](const unsigned int i) const;
 
   /**
    * Write access the value of the <tt>i</tt>th index.
    */
-  constexpr std::size_t &operator[](const unsigned int i);
+  constexpr std::size_t &
+  operator[](const unsigned int i);
 
   /**
    * Compare two index fields for equality.
@@ -125,8 +127,8 @@ constexpr TableIndices<N>::TableIndices(const T... args)
 
 
 template <int N>
-constexpr inline std::size_t TableIndices<N>::
-                             operator[](const unsigned int i) const
+constexpr inline std::size_t
+TableIndices<N>::operator[](const unsigned int i) const
 {
   AssertIndexRange(i, N);
   return indices[i];
@@ -134,7 +136,8 @@ constexpr inline std::size_t TableIndices<N>::
 
 
 template <int N>
-constexpr inline std::size_t &TableIndices<N>::operator[](const unsigned int i)
+constexpr inline std::size_t &
+TableIndices<N>::operator[](const unsigned int i)
 {
   AssertIndexRange(i, N);
   return indices[i];
index 89c4a04df3939886a24bed5491573b0f977e04db..a6617dd6a95b46fa31862716551efc789a866ea7 100644 (file)
@@ -177,7 +177,7 @@ public:
    * Move constructor
    */
   constexpr DEAL_II_CUDA_HOST_DEV
-    Tensor(Tensor<0, dim, Number> &&other) noexcept;
+  Tensor(Tensor<0, dim, Number> &&other) noexcept;
 #endif
 
   /**
@@ -214,7 +214,8 @@ public:
    *
    * @note This function can also be used in CUDA device code.
    */
-  constexpr DEAL_II_CUDA_HOST_DEV operator Number &();
+  constexpr DEAL_II_CUDA_HOST_DEV
+  operator Number &();
 
   /**
    * Return a reference to the encapsulated Number object. Since rank-0
@@ -235,7 +236,7 @@ public:
    */
   template <typename OtherNumber>
   constexpr DEAL_II_CUDA_HOST_DEV Tensor &
-                                  operator=(const Tensor<0, dim, OtherNumber> &rhs);
+  operator=(const Tensor<0, dim, OtherNumber> &rhs);
 
 #if defined(__INTEL_COMPILER) || defined(DEAL_II_DELETED_MOVE_CONSTRUCTOR_BUG)
   /**
@@ -255,7 +256,7 @@ public:
    * Move assignment operator
    */
   constexpr DEAL_II_CUDA_HOST_DEV Tensor<0, dim, Number> &
-                                  operator=(Tensor<0, dim, Number> &&other) noexcept;
+  operator=(Tensor<0, dim, Number> &&other) noexcept;
 #endif
 
   /**
@@ -289,7 +290,7 @@ public:
    */
   template <typename OtherNumber>
   constexpr DEAL_II_CUDA_HOST_DEV Tensor &
-                                  operator+=(const Tensor<0, dim, OtherNumber> &rhs);
+  operator+=(const Tensor<0, dim, OtherNumber> &rhs);
 
   /**
    * Subtract another scalar.
@@ -298,7 +299,7 @@ public:
    */
   template <typename OtherNumber>
   constexpr DEAL_II_CUDA_HOST_DEV Tensor &
-                                  operator-=(const Tensor<0, dim, OtherNumber> &rhs);
+  operator-=(const Tensor<0, dim, OtherNumber> &rhs);
 
   /**
    * Multiply the scalar with a <tt>factor</tt>.
@@ -324,7 +325,7 @@ public:
    * @note This function can also be used in CUDA device code.
    */
   constexpr DEAL_II_CUDA_HOST_DEV Tensor
-                                  operator-() const;
+  operator-() const;
 
   /**
    * Reset all values to zero.
@@ -356,7 +357,7 @@ public:
    * @note This function can also be used in CUDA device code.
    */
   constexpr DEAL_II_CUDA_HOST_DEV real_type
-                                  norm_square() const;
+  norm_square() const;
 
   /**
    * Read or write the data of this object to or from a stream for the purpose
@@ -517,7 +518,7 @@ public:
    * @note This function can also be used in CUDA device code.
    */
   constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                  Tensor();
+  Tensor();
 
   /**
    * A constructor where the data is copied from a C-style array.
@@ -586,7 +587,8 @@ public:
    *
    * @note This function can also be used in CUDA device code.
    */
-  constexpr DEAL_II_CUDA_HOST_DEV value_type &operator[](const unsigned int i);
+  constexpr DEAL_II_CUDA_HOST_DEV value_type &
+                                  operator[](const unsigned int i);
 
   /**
    * Read-only access operator.
@@ -599,12 +601,14 @@ public:
   /**
    * Read access using TableIndices <tt>indices</tt>
    */
-  constexpr const Number &operator[](const TableIndices<rank_> &indices) const;
+  constexpr const Number &
+  operator[](const TableIndices<rank_> &indices) const;
 
   /**
    * Read and write access using TableIndices <tt>indices</tt>
    */
-  constexpr Number &operator[](const TableIndices<rank_> &indices);
+  constexpr Number &
+  operator[](const TableIndices<rank_> &indices);
 
   /**
    * Return a pointer to the first element of the underlying storage.
@@ -639,7 +643,7 @@ public:
    */
   template <typename OtherNumber>
   constexpr DEAL_II_CUDA_HOST_DEV Tensor &
-                                  operator=(const Tensor<rank_, dim, OtherNumber> &rhs);
+  operator=(const Tensor<rank_, dim, OtherNumber> &rhs);
 
   /**
    * This operator assigns a scalar to a tensor. To avoid confusion with what
@@ -685,7 +689,7 @@ public:
    */
   template <typename OtherNumber>
   constexpr DEAL_II_CUDA_HOST_DEV Tensor &
-                                  operator+=(const Tensor<rank_, dim, OtherNumber> &);
+  operator+=(const Tensor<rank_, dim, OtherNumber> &);
 
   /**
    * Subtract another tensor.
@@ -694,7 +698,7 @@ public:
    */
   template <typename OtherNumber>
   constexpr DEAL_II_CUDA_HOST_DEV Tensor &
-                                  operator-=(const Tensor<rank_, dim, OtherNumber> &);
+  operator-=(const Tensor<rank_, dim, OtherNumber> &);
 
   /**
    * Scale the tensor by <tt>factor</tt>, i.e. multiply all components by
@@ -721,7 +725,7 @@ public:
    * @note This function can also be used in CUDA device code.
    */
   constexpr DEAL_II_CUDA_HOST_DEV Tensor
-                                  operator-() const;
+  operator-() const;
 
   /**
    * Reset all values to zero.
@@ -887,7 +891,7 @@ namespace internal
   struct NumberType<Tensor<rank, dim, T>>
   {
     static constexpr DEAL_II_ALWAYS_INLINE const Tensor<rank, dim, T> &
-                                                 value(const Tensor<rank, dim, T> &t)
+    value(const Tensor<rank, dim, T> &t)
     {
       return t;
     }
@@ -908,7 +912,7 @@ namespace internal
 
 template <int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, Number>::Tensor()
+Tensor<0, dim, Number>::Tensor()
   // Some auto-differentiable numbers need explicit
   // zero initialization such as adtl::adouble.
   : Tensor{0.0}
@@ -919,7 +923,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 template <int dim, typename Number>
 template <typename OtherNumber>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, Number>::Tensor(const OtherNumber &initializer)
+Tensor<0, dim, Number>::Tensor(const OtherNumber &initializer)
   : value(internal::NumberType<Number>::value(initializer))
 {}
 
@@ -928,7 +932,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 template <int dim, typename Number>
 template <typename OtherNumber>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, Number>::Tensor(const Tensor<0, dim, OtherNumber> &p)
+Tensor<0, dim, Number>::Tensor(const Tensor<0, dim, OtherNumber> &p)
   : Tensor{p.value}
 {}
 
@@ -936,7 +940,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 #  ifdef DEAL_II_DELETED_MOVE_CONSTRUCTOR_BUG
 template <int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, Number>::Tensor(const Tensor<0, dim, Number> &other)
+Tensor<0, dim, Number>::Tensor(const Tensor<0, dim, Number> &other)
   : value{other.value}
 {}
 
@@ -944,7 +948,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 
 template <int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, Number>::Tensor(Tensor<0, dim, Number> &&other) noexcept
+Tensor<0, dim, Number>::Tensor(Tensor<0, dim, Number> &&other) noexcept
   : value{std::move(other.value)}
 {}
 #  endif
@@ -987,8 +991,8 @@ Tensor<0, dim, Number>::end_raw() const
 
 
 template <int dim, typename Number>
-constexpr inline DEAL_II_ALWAYS_INLINE
-  DEAL_II_CUDA_HOST_DEV Tensor<0, dim, Number>::operator Number &()
+constexpr inline DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
+Tensor<0, dim, Number>::operator Number &()
 {
   // We cannot use Assert inside a CUDA kernel
 #  ifndef __CUDA_ARCH__
@@ -1037,7 +1041,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE
 #  ifdef DEAL_II_DELETED_MOVE_CONSTRUCTOR_BUG
 template <int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV Tensor<0, dim, Number> &
-  Tensor<0, dim, Number>::operator=(Tensor<0, dim, Number> &&other) noexcept
+Tensor<0, dim, Number>::operator=(Tensor<0, dim, Number> &&other) noexcept
 {
   value = std::move(other.value);
   return *this;
@@ -1112,7 +1116,7 @@ namespace internal
   {
     template <typename Number, typename OtherNumber>
     constexpr inline DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV void
-                                           multiply_assign_scalar(Number &val, const OtherNumber &s)
+    multiply_assign_scalar(Number &val, const OtherNumber &s)
     {
       val *= s;
     }
@@ -1120,7 +1124,7 @@ namespace internal
 #  ifdef __CUDA_ARCH__
     template <typename Number, typename OtherNumber>
     constexpr inline DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV void
-                                           multiply_assign_scalar(std::complex<Number> &, const OtherNumber &)
+    multiply_assign_scalar(std::complex<Number> &, const OtherNumber &)
     {
       printf("This function is not implemented for std::complex<Number>!\n");
       assert(false);
@@ -1225,7 +1229,7 @@ constexpr unsigned int Tensor<0, dim, Number>::n_independent_components;
 template <int rank_, int dim, typename Number>
 template <typename ArrayLike, std::size_t... indices>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<rank_, dim, Number>::Tensor(const ArrayLike &initializer,
+Tensor<rank_, dim, Number>::Tensor(const ArrayLike &initializer,
                                    std::index_sequence<indices...>)
   : values{Tensor<rank_ - 1, dim, Number>(initializer[indices])...}
 {
@@ -1237,7 +1241,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<rank_, dim, Number>::Tensor()
+Tensor<rank_, dim, Number>::Tensor()
   // We would like to use =default, but this causes compile errors with some
   // MSVC versions and internal compiler errors with -O1 in gcc 5.4.
   : values{}
@@ -1247,7 +1251,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<rank_, dim, Number>::Tensor(const array_type &initializer)
+Tensor<rank_, dim, Number>::Tensor(const array_type &initializer)
   : Tensor(initializer, std::make_index_sequence<dim>{})
 {}
 
@@ -1256,7 +1260,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 template <int rank_, int dim, typename Number>
 template <typename ElementType, typename MemorySpace>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<rank_, dim, Number>::Tensor(
+Tensor<rank_, dim, Number>::Tensor(
   const ArrayView<ElementType, MemorySpace> &initializer)
 {
   AssertDimension(initializer.size(), n_independent_components);
@@ -1270,7 +1274,7 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<rank_, dim, Number>::Tensor(
+Tensor<rank_, dim, Number>::Tensor(
   const Tensor<rank_, dim, OtherNumber> &initializer)
   : Tensor(initializer, std::make_index_sequence<dim>{})
 {}
@@ -1290,7 +1294,7 @@ Tensor<rank_, dim, Number>::Tensor(
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr DEAL_II_ALWAYS_INLINE Tensor<rank_, dim, Number>::
-                                operator Tensor<1, dim, Tensor<rank_ - 1, dim, OtherNumber>>() const
+operator Tensor<1, dim, Tensor<rank_ - 1, dim, OtherNumber>>() const
 {
   return Tensor<1, dim, Tensor<rank_ - 1, dim, Number>>(values);
 }
@@ -1370,9 +1374,9 @@ namespace internal
 
 
 template <int rank_, int dim, typename Number>
-constexpr inline DEAL_II_ALWAYS_INLINE             DEAL_II_CUDA_HOST_DEV
-  typename Tensor<rank_, dim, Number>::value_type &Tensor<rank_, dim, Number>::
-                                                   operator[](const unsigned int i)
+constexpr inline DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
+  typename Tensor<rank_, dim, Number>::value_type &
+  Tensor<rank_, dim, Number>::operator[](const unsigned int i)
 {
   return dealii::internal::TensorSubscriptor::subscript(
     values, i, std::integral_constant<int, dim>());
@@ -1381,8 +1385,8 @@ constexpr inline DEAL_II_ALWAYS_INLINE             DEAL_II_CUDA_HOST_DEV
 
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE
-    DEAL_II_CUDA_HOST_DEV const typename Tensor<rank_, dim, Number>::value_type &
-    Tensor<rank_, dim, Number>::operator[](const unsigned int i) const
+  DEAL_II_CUDA_HOST_DEV const typename Tensor<rank_, dim, Number>::value_type &
+  Tensor<rank_, dim, Number>::operator[](const unsigned int i) const
 {
 #  ifndef DEAL_II_COMPILER_CUDA_AWARE
   AssertIndexRange(i, dim);
@@ -1394,8 +1398,7 @@ constexpr DEAL_II_ALWAYS_INLINE
 
 template <int rank_, int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE const Number &
-                                             Tensor<rank_, dim, Number>::
-                                             operator[](const TableIndices<rank_> &indices) const
+Tensor<rank_, dim, Number>::operator[](const TableIndices<rank_> &indices) const
 {
 #  ifndef DEAL_II_COMPILER_CUDA_AWARE
   Assert(dim != 0,
@@ -1408,8 +1411,8 @@ constexpr inline DEAL_II_ALWAYS_INLINE const Number &
 
 
 template <int rank_, int dim, typename Number>
-constexpr inline DEAL_II_ALWAYS_INLINE Number &Tensor<rank_, dim, Number>::
-                                               operator[](const TableIndices<rank_> &indices)
+constexpr inline DEAL_II_ALWAYS_INLINE Number &
+Tensor<rank_, dim, Number>::operator[](const TableIndices<rank_> &indices)
 {
 #  ifndef DEAL_II_COMPILER_CUDA_AWARE
   Assert(dim != 0,
@@ -1500,8 +1503,8 @@ Tensor<rank_, dim, Number>::operator=(const Tensor<rank_, dim, Number> &other)
 
 template <int rank_, int dim, typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Tensor<rank_, dim, Number> &
-                                Tensor<rank_, dim, Number>::
-                                operator=(Tensor<rank_, dim, Number> &&other) noexcept
+Tensor<rank_, dim, Number>::operator=(
+  Tensor<rank_, dim, Number> &&other) noexcept
 {
   for (unsigned int i = 0; i < dim; ++i)
     values[i] = other.values[i];
@@ -1513,8 +1516,8 @@ constexpr DEAL_II_ALWAYS_INLINE Tensor<rank_, dim, Number> &
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr inline bool
-Tensor<rank_, dim, Number>::
-operator==(const Tensor<rank_, dim, OtherNumber> &p) const
+Tensor<rank_, dim, Number>::operator==(
+  const Tensor<rank_, dim, OtherNumber> &p) const
 {
   for (unsigned int i = 0; i < dim; ++i)
     if (values[i] != p.values[i])
@@ -1540,8 +1543,8 @@ Tensor<1, 0, double>::operator==(const Tensor<1, 0, double> &) const
 template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr bool
-Tensor<rank_, dim, Number>::
-operator!=(const Tensor<rank_, dim, OtherNumber> &p) const
+Tensor<rank_, dim, Number>::operator!=(
+  const Tensor<rank_, dim, OtherNumber> &p) const
 {
   return !((*this) == p);
 }
@@ -1551,8 +1554,8 @@ template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr inline DEAL_II_ALWAYS_INLINE
   DEAL_II_CUDA_HOST_DEV Tensor<rank_, dim, Number> &
-                        Tensor<rank_, dim, Number>::
-                        operator+=(const Tensor<rank_, dim, OtherNumber> &p)
+  Tensor<rank_, dim, Number>::operator+=(
+    const Tensor<rank_, dim, OtherNumber> &p)
 {
   for (unsigned int i = 0; i < dim; ++i)
     values[i] += p.values[i];
@@ -1564,8 +1567,8 @@ template <int rank_, int dim, typename Number>
 template <typename OtherNumber>
 constexpr inline DEAL_II_ALWAYS_INLINE
   DEAL_II_CUDA_HOST_DEV Tensor<rank_, dim, Number> &
-                        Tensor<rank_, dim, Number>::
-                        operator-=(const Tensor<rank_, dim, OtherNumber> &p)
+  Tensor<rank_, dim, Number>::operator-=(
+    const Tensor<rank_, dim, OtherNumber> &p)
 {
   for (unsigned int i = 0; i < dim; ++i)
     values[i] -= p.values[i];
@@ -1945,8 +1948,8 @@ DEAL_II_CUDA_HOST_DEV constexpr DEAL_II_ALWAYS_INLINE
  */
 template <int dim, typename Number, typename OtherNumber>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, typename ProductType<Number, OtherNumber>::type>
-                                operator+(const Tensor<0, dim, Number> &     p,
+  Tensor<0, dim, typename ProductType<Number, OtherNumber>::type>
+  operator+(const Tensor<0, dim, Number> &     p,
             const Tensor<0, dim, OtherNumber> &q)
 {
   return static_cast<const Number &>(p) + static_cast<const OtherNumber &>(q);
@@ -1962,8 +1965,8 @@ constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
  */
 template <int dim, typename Number, typename OtherNumber>
 constexpr DEAL_II_ALWAYS_INLINE DEAL_II_CUDA_HOST_DEV
-                                Tensor<0, dim, typename ProductType<Number, OtherNumber>::type>
-                                operator-(const Tensor<0, dim, Number> &     p,
+  Tensor<0, dim, typename ProductType<Number, OtherNumber>::type>
+  operator-(const Tensor<0, dim, Number> &     p,
             const Tensor<0, dim, OtherNumber> &q)
 {
   return static_cast<const Number &>(p) - static_cast<const OtherNumber &>(q);
@@ -2466,8 +2469,10 @@ constexpr inline DEAL_II_ALWAYS_INLINE
  * @relatesalso Tensor
  */
 template <template <int, int, typename> class TensorT1,
-          template <int, int, typename> class TensorT2,
-          template <int, int, typename> class TensorT3,
+          template <int, int, typename>
+          class TensorT2,
+          template <int, int, typename>
+          class TensorT3,
           int rank_1,
           int rank_2,
           int dim,
@@ -2536,7 +2541,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Tensor<1, dim, Number>
-                                       cross_product_2d(const Tensor<1, dim, Number> &src)
+cross_product_2d(const Tensor<1, dim, Number> &src)
 {
   Assert(dim == 2, ExcInternalError());
 
@@ -2595,7 +2600,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number
-                                       determinant(const Tensor<2, dim, Number> &t)
+determinant(const Tensor<2, dim, Number> &t)
 {
   // Compute the determinant using the Laplace expansion of the
   // determinant. We expand along the last row.
@@ -2623,7 +2628,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE Number
  */
 template <typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                determinant(const Tensor<2, 1, Number> &t)
+determinant(const Tensor<2, 1, Number> &t)
 {
   return t[0][0];
 }
@@ -2635,7 +2640,7 @@ constexpr DEAL_II_ALWAYS_INLINE Number
  */
 template <typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                determinant(const Tensor<2, 2, Number> &t)
+determinant(const Tensor<2, 2, Number> &t)
 {
   // hard-coded for efficiency reasons
   return t[0][0] * t[1][1] - t[1][0] * t[0][1];
@@ -2648,7 +2653,7 @@ constexpr DEAL_II_ALWAYS_INLINE Number
  */
 template <typename Number>
 constexpr DEAL_II_ALWAYS_INLINE Number
-                                determinant(const Tensor<2, 3, Number> &t)
+determinant(const Tensor<2, 3, Number> &t)
 {
   // hard-coded for efficiency reasons
   const Number C0 = internal::NumberType<Number>::value(t[1][1] * t[2][2]) -
@@ -2669,7 +2674,7 @@ constexpr DEAL_II_ALWAYS_INLINE Number
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Number
-                                       trace(const Tensor<2, dim, Number> &d)
+trace(const Tensor<2, dim, Number> &d)
 {
   Number t = d[0][0];
   for (unsigned int i = 1; i < dim; ++i)
@@ -2775,7 +2780,7 @@ constexpr inline DEAL_II_ALWAYS_INLINE Tensor<2, 3, Number>
  */
 template <int dim, typename Number>
 constexpr inline DEAL_II_ALWAYS_INLINE Tensor<2, dim, Number>
-                                       transpose(const Tensor<2, dim, Number> &t)
+transpose(const Tensor<2, dim, Number> &t)
 {
   Tensor<2, dim, Number> tt;
   for (unsigned int i = 0; i < dim; ++i)
index 7f3b29e2ed84bf68f11a3f957a1b64353f6908e6..5787a1cf3fafa8763451a7b42100861317d7330a 100644 (file)
@@ -412,7 +412,7 @@ namespace TensorAccessors
 
       // Recurse by applying index j directly:
       constexpr DEAL_II_ALWAYS_INLINE value_type
-                                      operator[](unsigned int j) const
+      operator[](unsigned int j) const
       {
         return value_type(t_[j]);
       }
@@ -443,7 +443,7 @@ namespace TensorAccessors
       using value_type = StoreIndex<rank - 1, internal::Identity<T>>;
 
       constexpr DEAL_II_ALWAYS_INLINE value_type
-                                      operator[](unsigned int j) const
+      operator[](unsigned int j) const
       {
         return value_type(Identity<T>(t_), j);
       }
@@ -467,7 +467,7 @@ namespace TensorAccessors
         typename ReferenceType<typename ValueType<T>::value_type>::type;
 
       constexpr DEAL_II_ALWAYS_INLINE value_type
-                                      operator[](unsigned int j) const
+      operator[](unsigned int j) const
       {
         return t_[j];
       }
@@ -521,7 +521,7 @@ namespace TensorAccessors
       using value_type = StoreIndex<rank - 1, StoreIndex<rank, S>>;
 
       constexpr DEAL_II_ALWAYS_INLINE value_type
-                                      operator[](unsigned int j) const
+      operator[](unsigned int j) const
       {
         return value_type(*this, j);
       }
index c6f92dcfb0c32cb3838ad5112e5a8407797453a8..868c239c1b01a1335557f1c5527850a98c88d6cb 100644 (file)
@@ -142,7 +142,8 @@ public:
    * Dereferencing operator (const version): returns the value of the current
    * lane.
    */
-  const typename T::value_type &operator*() const
+  const typename T::value_type &
+  operator*() const
   {
     AssertIndexRange(lane, T::size());
     return (*data)[lane];
@@ -428,7 +429,8 @@ public:
    * specialization).
    */
   DEAL_II_ALWAYS_INLINE
-  Number &operator[](const unsigned int comp)
+  Number &
+  operator[](const unsigned int comp)
   {
     (void)comp;
     AssertIndexRange(comp, 1);
@@ -440,7 +442,8 @@ public:
    * without specialization).
    */
   DEAL_II_ALWAYS_INLINE
-  const Number &operator[](const unsigned int comp) const
+  const Number &
+  operator[](const unsigned int comp) const
   {
     (void)comp;
     AssertIndexRange(comp, 1);
@@ -719,7 +722,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             make_vectorized_array(const typename VectorizedArrayType::value_type &u)
+make_vectorized_array(const typename VectorizedArrayType::value_type &u)
 {
   static_assert(
     std::is_same<VectorizedArrayType,
@@ -955,7 +958,8 @@ public:
    * Access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  double &operator[](const unsigned int comp)
+  double &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 8);
     return *(reinterpret_cast<double *>(&data) + comp);
@@ -965,7 +969,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const double &operator[](const unsigned int comp) const
+  const double &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 8);
     return *(reinterpret_cast<const double *>(&data) + comp);
@@ -1502,7 +1507,8 @@ public:
    * Access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  float &operator[](const unsigned int comp)
+  float &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 16);
     return *(reinterpret_cast<float *>(&data) + comp);
@@ -1512,7 +1518,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const float &operator[](const unsigned int comp) const
+  const float &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 16);
     return *(reinterpret_cast<const float *>(&data) + comp);
@@ -2145,7 +2152,8 @@ public:
    * Access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  double &operator[](const unsigned int comp)
+  double &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 4);
     return *(reinterpret_cast<double *>(&data) + comp);
@@ -2155,7 +2163,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const double &operator[](const unsigned int comp) const
+  const double &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 4);
     return *(reinterpret_cast<const double *>(&data) + comp);
@@ -2651,7 +2660,8 @@ public:
    * Access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  float &operator[](const unsigned int comp)
+  float &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 8);
     return *(reinterpret_cast<float *>(&data) + comp);
@@ -2661,7 +2671,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const float &operator[](const unsigned int comp) const
+  const float &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 8);
     return *(reinterpret_cast<const float *>(&data) + comp);
@@ -3191,7 +3202,8 @@ public:
    * Access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  double &operator[](const unsigned int comp)
+  double &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 2);
     return *(reinterpret_cast<double *>(&data) + comp);
@@ -3201,7 +3213,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const double &operator[](const unsigned int comp) const
+  const double &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 2);
     return *(reinterpret_cast<const double *>(&data) + comp);
@@ -3628,7 +3641,8 @@ public:
    * Access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  float &operator[](const unsigned int comp)
+  float &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 4);
     return *(reinterpret_cast<float *>(&data) + comp);
@@ -3638,7 +3652,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const float &operator[](const unsigned int comp) const
+  const float &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 4);
     return *(reinterpret_cast<const float *>(&data) + comp);
@@ -4106,7 +4121,8 @@ public:
    * Access operator. The component must be either 0 or 1.
    */
   DEAL_II_ALWAYS_INLINE
-  double &operator[](const unsigned int comp)
+  double &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 2);
     return *(reinterpret_cast<double *>(&data) + comp);
@@ -4116,7 +4132,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const double &operator[](const unsigned int comp) const
+  const double &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 2);
     return *(reinterpret_cast<const double *>(&data) + comp);
@@ -4340,7 +4357,8 @@ public:
    * Access operator. The component must be between 0 and 3.
    */
   DEAL_II_ALWAYS_INLINE
-  float &operator[](const unsigned int comp)
+  float &
+  operator[](const unsigned int comp)
   {
     AssertIndexRange(comp, 4);
     return *(reinterpret_cast<float *>(&data) + comp);
@@ -4350,7 +4368,8 @@ public:
    * Constant access operator.
    */
   DEAL_II_ALWAYS_INLINE
-  const float &operator[](const unsigned int comp) const
+  const float &
+  operator[](const unsigned int comp) const
   {
     AssertIndexRange(comp, 4);
     return *(reinterpret_cast<const float *>(&data) + comp);
@@ -4621,7 +4640,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator+(const Number &u, const VectorizedArray<Number, width> &v)
+operator+(const Number &u, const VectorizedArray<Number, width> &v)
 {
   VectorizedArray<Number, width> tmp = u;
   return tmp += v;
@@ -4637,7 +4656,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator+(const double u, const VectorizedArray<float, width> &v)
+operator+(const double u, const VectorizedArray<float, width> &v)
 {
   VectorizedArray<float, width> tmp = u;
   return tmp += v;
@@ -4651,7 +4670,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator+(const VectorizedArray<Number, width> &v, const Number &u)
+operator+(const VectorizedArray<Number, width> &v, const Number &u)
 {
   return u + v;
 }
@@ -4666,7 +4685,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator+(const VectorizedArray<float, width> &v, const double u)
+operator+(const VectorizedArray<float, width> &v, const double u)
 {
   return u + v;
 }
@@ -4679,7 +4698,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator-(const Number &u, const VectorizedArray<Number, width> &v)
+operator-(const Number &u, const VectorizedArray<Number, width> &v)
 {
   VectorizedArray<Number, width> tmp = u;
   return tmp -= v;
@@ -4695,7 +4714,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator-(const double u, const VectorizedArray<float, width> &v)
+operator-(const double u, const VectorizedArray<float, width> &v)
 {
   VectorizedArray<float, width> tmp = static_cast<float>(u);
   return tmp -= v;
@@ -4709,7 +4728,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator-(const VectorizedArray<Number, width> &v, const Number &u)
+operator-(const VectorizedArray<Number, width> &v, const Number &u)
 {
   VectorizedArray<Number, width> tmp = u;
   return v - tmp;
@@ -4725,7 +4744,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator-(const VectorizedArray<float, width> &v, const double u)
+operator-(const VectorizedArray<float, width> &v, const double u)
 {
   VectorizedArray<float, width> tmp = static_cast<float>(u);
   return v - tmp;
@@ -4739,7 +4758,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator*(const Number &u, const VectorizedArray<Number, width> &v)
+operator*(const Number &u, const VectorizedArray<Number, width> &v)
 {
   VectorizedArray<Number, width> tmp = u;
   return tmp *= v;
@@ -4755,7 +4774,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator*(const double u, const VectorizedArray<float, width> &v)
+operator*(const double u, const VectorizedArray<float, width> &v)
 {
   VectorizedArray<float, width> tmp = static_cast<float>(u);
   return tmp *= v;
@@ -4769,7 +4788,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator*(const VectorizedArray<Number, width> &v, const Number &u)
+operator*(const VectorizedArray<Number, width> &v, const Number &u)
 {
   return u * v;
 }
@@ -4784,7 +4803,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator*(const VectorizedArray<float, width> &v, const double u)
+operator*(const VectorizedArray<float, width> &v, const double u)
 {
   return u * v;
 }
@@ -4797,7 +4816,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator/(const Number &u, const VectorizedArray<Number, width> &v)
+operator/(const Number &u, const VectorizedArray<Number, width> &v)
 {
   VectorizedArray<Number, width> tmp = u;
   return tmp /= v;
@@ -4813,7 +4832,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator/(const double u, const VectorizedArray<float, width> &v)
+operator/(const double u, const VectorizedArray<float, width> &v)
 {
   VectorizedArray<float, width> tmp = static_cast<float>(u);
   return tmp /= v;
@@ -4827,7 +4846,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
  */
 template <typename Number, std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
-                             operator/(const VectorizedArray<Number, width> &v, const Number &u)
+operator/(const VectorizedArray<Number, width> &v, const Number &u)
 {
   VectorizedArray<Number, width> tmp = u;
   return v / tmp;
@@ -4843,7 +4862,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArray<Number, width>
  */
 template <std::size_t width>
 inline DEAL_II_ALWAYS_INLINE VectorizedArray<float, width>
-                             operator/(const VectorizedArray<float, width> &v, const double u)
+operator/(const VectorizedArray<float, width> &v, const double u)
 {
   VectorizedArray<float, width> tmp = static_cast<float>(u);
   return v / tmp;
index cdf9f3dd12eb82613cdd3e2c4c7a582b275bbe3d..a3f0c8c7d04e7904e44cb10d5b6173655d43a646 100644 (file)
@@ -1434,20 +1434,21 @@ namespace WorkStream
       const unsigned int chunk_size   = 8)
   {
     // forward to the other function
-    run(begin,
-        end,
-        [&main_object, worker](const Iterator &iterator,
-                               ScratchData &   scratch_data,
-                               CopyData &      copy_data) {
-          (main_object.*worker)(iterator, scratch_data, copy_data);
-        },
-        [&main_object, copier](const CopyData &copy_data) {
-          (main_object.*copier)(copy_data);
-        },
-        sample_scratch_data,
-        sample_copy_data,
-        queue_length,
-        chunk_size);
+    run(
+      begin,
+      end,
+      [&main_object, worker](const Iterator &iterator,
+                             ScratchData &   scratch_data,
+                             CopyData &      copy_data) {
+        (main_object.*worker)(iterator, scratch_data, copy_data);
+      },
+      [&main_object, copier](const CopyData &copy_data) {
+        (main_object.*copier)(copy_data);
+      },
+      sample_scratch_data,
+      sample_copy_data,
+      queue_length,
+      chunk_size);
   }
 
 
@@ -1467,20 +1468,21 @@ namespace WorkStream
       const unsigned int chunk_size   = 8)
   {
     // forward to the other function
-    run(begin,
-        end,
-        [&main_object, worker](const Iterator &iterator,
-                               ScratchData &   scratch_data,
-                               CopyData &      copy_data) {
-          (main_object.*worker)(iterator, scratch_data, copy_data);
-        },
-        [&main_object, copier](const CopyData &copy_data) {
-          (main_object.*copier)(copy_data);
-        },
-        sample_scratch_data,
-        sample_copy_data,
-        queue_length,
-        chunk_size);
+    run(
+      begin,
+      end,
+      [&main_object, worker](const Iterator &iterator,
+                             ScratchData &   scratch_data,
+                             CopyData &      copy_data) {
+        (main_object.*worker)(iterator, scratch_data, copy_data);
+      },
+      [&main_object, copier](const CopyData &copy_data) {
+        (main_object.*copier)(copy_data);
+      },
+      sample_scratch_data,
+      sample_copy_data,
+      queue_length,
+      chunk_size);
   }
 
 
index 6ccf66bdd72277bcc6f8fe03c429306e500b58ee..f10042a429b4eb784d5f54f97d14d4155a8f7445 100644 (file)
@@ -2449,9 +2449,10 @@ namespace Differentiation
        * @p t to the given @p value.
        */
       template <int dim, typename NumberType>
-      inline void set_tensor_entry(Tensor<0, dim, NumberType> &t,
-                                   const unsigned int          unrolled_index,
-                                   const NumberType &          value)
+      inline void
+      set_tensor_entry(Tensor<0, dim, NumberType> &t,
+                       const unsigned int          unrolled_index,
+                       const NumberType &          value)
       {
         AssertIndexRange(unrolled_index, 1);
         (void)unrolled_index;
@@ -2482,10 +2483,11 @@ namespace Differentiation
        * @p t to the given @p value.
        */
       template <int dim, typename NumberType>
-      inline void set_tensor_entry(SymmetricTensor<4, dim, NumberType> &t,
-                                   const unsigned int unrolled_index_row,
-                                   const unsigned int unrolled_index_col,
-                                   const NumberType & value)
+      inline void
+      set_tensor_entry(SymmetricTensor<4, dim, NumberType> &t,
+                       const unsigned int                   unrolled_index_row,
+                       const unsigned int                   unrolled_index_col,
+                       const NumberType &                   value)
       {
         // Fourth order symmetric tensors require a specialized interface
         // to extract values.
@@ -2510,7 +2512,8 @@ namespace Differentiation
       template <int rank,
                 int dim,
                 typename NumberType,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       inline NumberType
       get_tensor_entry(const TensorType<rank, dim, NumberType> &t,
                        const unsigned int                       unrolled_index)
@@ -2528,7 +2531,8 @@ namespace Differentiation
        */
       template <int dim,
                 typename NumberType,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       inline NumberType
       get_tensor_entry(const TensorType<0, dim, NumberType> &t,
                        const unsigned int                    unrolled_index)
@@ -2561,7 +2565,8 @@ namespace Differentiation
       template <int rank,
                 int dim,
                 typename NumberType,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       inline NumberType &
       get_tensor_entry(TensorType<rank, dim, NumberType> &t,
                        const unsigned int                 unrolled_index)
@@ -2579,9 +2584,11 @@ namespace Differentiation
        */
       template <int dim,
                 typename NumberType,
-                template <int, int, typename> class TensorType>
-      NumberType &get_tensor_entry(TensorType<0, dim, NumberType> &t,
-                                   const unsigned int              index)
+                template <int, int, typename>
+                class TensorType>
+      NumberType &
+      get_tensor_entry(TensorType<0, dim, NumberType> &t,
+                       const unsigned int              index)
       {
         AssertIndexRange(index, 1);
         (void)index;
index 533a2e6001c960252f565795d5058b4d1507f77d..7470ecdd55246fe1fda83f20dfac44bebf982db5 100644 (file)
@@ -986,7 +986,8 @@ namespace Differentiation
      * @note This operator can only be applied on boolean and conditional
      * expressions.
      */
-    Expression operator!(const Expression &expression);
+    Expression
+    operator!(const Expression &expression);
 
     /**
      * Logical and operator.
@@ -994,7 +995,8 @@ namespace Differentiation
      * @note This operator can only be applied on boolean and conditional
      * expressions.
      */
-    Expression operator&(const Expression &lhs, const Expression &rhs);
+    Expression
+    operator&(const Expression &lhs, const Expression &rhs);
 
     /**
      * Logical inclusive or operator.
@@ -1062,7 +1064,8 @@ namespace Differentiation
      *
      * Return the result of multiplying the @p lhs by the @p rhs.
      */
-    Expression operator*(Expression lhs, const Expression &rhs);
+    Expression
+    operator*(Expression lhs, const Expression &rhs);
 
     /**
      * Division operator.
@@ -1151,7 +1154,8 @@ namespace Differentiation
     template <typename NumberType,
               typename = typename std::enable_if<
                 std::is_constructible<Expression, NumberType>::value>::type>
-    inline Expression operator*(const NumberType &lhs, const Expression &rhs)
+    inline Expression
+    operator*(const NumberType &lhs, const Expression &rhs)
     {
       return Expression(lhs) * rhs;
     }
@@ -1167,7 +1171,8 @@ namespace Differentiation
     template <typename NumberType,
               typename = typename std::enable_if<
                 std::is_constructible<Expression, NumberType>::value>::type>
-    inline Expression operator*(const Expression &lhs, const NumberType &rhs)
+    inline Expression
+    operator*(const Expression &lhs, const NumberType &rhs)
     {
       return lhs * Expression(rhs);
     }
index 85bb03d5ae16630ddf957e8b8776488c87decf3b..89e203c647938056fdfb5ff0dfb407c5242cfd35 100644 (file)
@@ -208,8 +208,8 @@ namespace Differentiation
     // <tt>operator |</tt> would be an integer which would in turn trigger a
     // compiler warning when we tried to assign it to an object of type
     // OptimizationFlags.
-    inline OptimizationFlags operator&(const OptimizationFlags f1,
-                                       const OptimizationFlags f2)
+    inline OptimizationFlags
+    operator&(const OptimizationFlags f1, const OptimizationFlags f2)
     {
       return static_cast<OptimizationFlags>(static_cast<unsigned int>(f1) &
                                             static_cast<unsigned int>(f2));
@@ -1137,7 +1137,8 @@ namespace Differentiation
       template <typename NumberType,
                 int rank,
                 int dim,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, NumberType>
       tensor_evaluate_optimized(
         const TensorType<rank, dim, Expression> &symbol_tensor,
@@ -1278,7 +1279,7 @@ namespace Differentiation
       void
       register_functions(BatchOptimizer<NumberType> &optimizer,
                          const T &                   function,
-                         const Args &... other_functions)
+                         const Args &...other_functions)
       {
         register_functions(optimizer, function);
         register_functions(optimizer, other_functions...);
@@ -1298,7 +1299,8 @@ namespace Differentiation
        */
       template <int rank,
                 int dim,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       types::symbol_vector
       unroll_to_expression_vector(
         const TensorType<rank, dim, Expression> &symbol_tensor)
@@ -1704,7 +1706,7 @@ namespace Differentiation
        */
       template <typename T, typename... Args>
       void
-      register_functions(const T &functions, const Args &... other_functions);
+      register_functions(const T &functions, const Args &...other_functions);
 
       /**
        * Return a vector of expressions that have been registered as dependent
@@ -2489,7 +2491,7 @@ namespace Differentiation
     void
     BatchOptimizer<ReturnType>::register_functions(
       const T &functions,
-      const Args &... other_functions)
+      const Args &...other_functions)
     {
       internal::register_functions(*this, functions);
       internal::register_functions(*this, other_functions...);
index 554ccc59920fb9b590241fad78bc4c33890b6c9c..f26c2f2eaa4e07baef1c2d5e7cb018f637155194 100644 (file)
@@ -229,7 +229,7 @@ namespace Differentiation
               typename SymbolicType,
               typename... Args>
     types::substitution_map
-    make_symbol_map(const SymbolicType &symbol, const Args &... other_symbols);
+    make_symbol_map(const SymbolicType &symbol, const Args &...other_symbols);
 
     /**
      * A convenience function for adding an empty entry, with the key value
@@ -417,7 +417,7 @@ namespace Differentiation
     void
     add_to_symbol_map(types::substitution_map &symbol_map,
                       const SymbolicType &     symbol,
-                      const Args &... other_symbols);
+                      const Args &...other_symbols);
 
     /**
      * Find the entry for @p symbol in the @p substitution_map and set its
@@ -551,7 +551,7 @@ namespace Differentiation
     set_value_in_symbol_map(
       types::substitution_map &                 substitution_map,
       const std::pair<SymbolicType, ValueType> &symbol_value,
-      const Args &... other_symbol_values);
+      const Args &...other_symbol_values);
 
     /**
      * Find the entries for @p symbols in the @p substitution_map and set their
@@ -780,7 +780,7 @@ namespace Differentiation
     types::substitution_map
     make_substitution_map(
       const std::pair<ExpressionType, ValueType> &symbol_value,
-      const Args &... other_symbol_values);
+      const Args &...other_symbol_values);
 
     //@}
 
@@ -1121,7 +1121,7 @@ namespace Differentiation
     add_to_substitution_map(
       types::substitution_map &                   substitution_map,
       const std::pair<ExpressionType, ValueType> &symbol_value,
-      const Args &... other_symbol_values);
+      const Args &...other_symbol_values);
 
     /**
      * Concatenate two symbolic maps, merging a second map @p substitution_map_in
@@ -1148,7 +1148,7 @@ namespace Differentiation
     void
     merge_substitution_maps(types::substitution_map &      substitution_map_out,
                             const types::substitution_map &substitution_map_in,
-                            const Args &... other_substitution_maps_in);
+                            const Args &...other_substitution_maps_in);
 
     /**
      * Concatenate multiple symbolic maps, merging the maps @p substitution_map_in
@@ -1160,7 +1160,7 @@ namespace Differentiation
     template <typename... Args>
     types::substitution_map
     merge_substitution_maps(const types::substitution_map &substitution_map_in,
-                            const Args &... other_substitution_maps_in);
+                            const Args &...other_substitution_maps_in);
 
     //@}
 
@@ -1355,7 +1355,7 @@ namespace Differentiation
      */
     template <typename ExpressionType, typename... Args>
     ExpressionType
-    substitute(const ExpressionType &expression, const Args &... symbol_values);
+    substitute(const ExpressionType &expression, const Args &...symbol_values);
 
     /**
      * Perform a single substitution sweep of a set of symbols into the given
@@ -1421,7 +1421,7 @@ namespace Differentiation
     template <typename ValueType, typename... Args>
     ValueType
     substitute_and_evaluate(const Expression &expression,
-                            const Args &... symbol_values);
+                            const Args &...symbol_values);
 
     //@}
 
@@ -1459,7 +1459,7 @@ namespace Differentiation
               typename SymbolicType,
               typename... Args>
     types::substitution_map
-    make_symbol_map(const SymbolicType &symbol, const Args &... other_symbols)
+    make_symbol_map(const SymbolicType &symbol, const Args &...other_symbols)
     {
       types::substitution_map symbol_map;
       add_to_symbol_map<ignore_invalid_symbols, ValueType>(symbol_map,
@@ -1541,7 +1541,7 @@ namespace Differentiation
     void
     add_to_symbol_map(types::substitution_map &symbol_map,
                       const SymbolicType &     symbol,
-                      const Args &... other_symbols)
+                      const Args &...other_symbols)
     {
       add_to_symbol_map<ignore_invalid_symbols, ValueType>(symbol_map, symbol);
       add_to_symbol_map<ignore_invalid_symbols, ValueType>(symbol_map,
@@ -1601,7 +1601,7 @@ namespace Differentiation
     set_value_in_symbol_map(
       types::substitution_map &                 substitution_map,
       const std::pair<SymbolicType, ValueType> &symbol_value,
-      const Args &... other_symbol_values)
+      const Args &...other_symbol_values)
     {
       set_value_in_symbol_map(substitution_map, symbol_value);
       set_value_in_symbol_map(substitution_map, other_symbol_values...);
@@ -1670,7 +1670,7 @@ namespace Differentiation
     types::substitution_map
     make_substitution_map(
       const std::pair<ExpressionType, ValueType> &symbol_value,
-      const Args &... other_symbol_values)
+      const Args &...other_symbol_values)
     {
       types::substitution_map substitution_map;
       add_to_substitution_map(substitution_map,
@@ -1834,7 +1834,7 @@ namespace Differentiation
     add_to_substitution_map(
       types::substitution_map &                   substitution_map,
       const std::pair<ExpressionType, ValueType> &symbol_value,
-      const Args &... other_symbol_values)
+      const Args &...other_symbol_values)
     {
       add_to_substitution_map<ignore_invalid_symbols>(substitution_map,
                                                       symbol_value);
@@ -1847,7 +1847,7 @@ namespace Differentiation
     types::substitution_map
     merge_substitution_maps(
       const types::substitution_map &substitution_map_in_1,
-      const Args &... other_substitution_maps_in)
+      const Args &...other_substitution_maps_in)
     {
       types::substitution_map substitution_map_out = substitution_map_in_1;
       merge_substitution_maps(substitution_map_out,
@@ -1861,7 +1861,7 @@ namespace Differentiation
     merge_substitution_maps(
       types::substitution_map &      substitution_map_out,
       const types::substitution_map &substitution_map_in_1,
-      const Args &... other_substitution_maps_in)
+      const Args &...other_substitution_maps_in)
     {
       merge_substitution_maps(substitution_map_out, substitution_map_in_1);
       merge_substitution_maps(substitution_map_out,
@@ -1895,7 +1895,7 @@ namespace Differentiation
 
     template <typename ExpressionType, typename... Args>
     ExpressionType
-    substitute(const ExpressionType &expression, const Args &... symbol_values)
+    substitute(const ExpressionType &expression, const Args &...symbol_values)
     {
       // Call other function
       return substitute(expression, make_substitution_map(symbol_values...));
@@ -1914,7 +1914,7 @@ namespace Differentiation
     template <typename ValueType, typename... Args>
     ValueType
     substitute_and_evaluate(const Expression &expression,
-                            const Args &... symbol_values)
+                            const Args &...symbol_values)
     {
       // Call other function
       return substitute_and_evaluate<ValueType>(
index 9631db6ffe766ca1054a5a8ef07719a61fe4228b..38415873b9a4b48c7fae1476c778ce0131d30db8 100644 (file)
@@ -853,7 +853,8 @@ namespace Differentiation
 
       template <int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<0, dim, ValueType>
       scalar_diff_tensor(const ValueType &                    func,
                          const TensorType<0, dim, ValueType> &op)
@@ -865,7 +866,8 @@ namespace Differentiation
       template <int rank,
                 int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, ValueType>
       scalar_diff_tensor(const ValueType &                       func,
                          const TensorType<rank, dim, ValueType> &op)
@@ -888,7 +890,8 @@ namespace Differentiation
       template <int rank,
                 int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, ValueType>
       tensor_diff_tensor(const TensorType<0, dim, ValueType> &   func,
                          const TensorType<rank, dim, ValueType> &op)
@@ -910,7 +913,8 @@ namespace Differentiation
       template <int rank,
                 int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, ValueType>
       tensor_diff_scalar(const TensorType<rank, dim, ValueType> &funcs,
                          const ValueType &                       op)
@@ -930,7 +934,8 @@ namespace Differentiation
       template <int rank,
                 int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, ValueType>
       tensor_diff_tensor(const TensorType<rank, dim, ValueType> &funcs,
                          const TensorType<0, dim, ValueType> &   op)
@@ -951,7 +956,8 @@ namespace Differentiation
                 int rank_2,
                 int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank_1 + rank_2, dim, ValueType>
       tensor_diff_tensor(const TensorType<rank_1, dim, ValueType> &funcs,
                          const TensorType<rank_2, dim, ValueType> &op)
@@ -987,8 +993,10 @@ namespace Differentiation
                 int rank_2,
                 int dim,
                 typename ValueType = Expression,
-                template <int, int, typename> class TensorType_1,
-                template <int, int, typename> class TensorType_2>
+                template <int, int, typename>
+                class TensorType_1,
+                template <int, int, typename>
+                class TensorType_2>
       Tensor<rank_1 + rank_2, dim, ValueType>
       tensor_diff_tensor(const TensorType_1<rank_1, dim, ValueType> &funcs,
                          const TensorType_2<rank_2, dim, ValueType> &op)
@@ -1166,7 +1174,8 @@ namespace Differentiation
                 typename ValueType,
                 int rank,
                 int dim,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       void
       set_tensor_value_in_symbol_map(
         types::substitution_map &                  substitution_map,
@@ -1303,7 +1312,8 @@ namespace Differentiation
                 int dim,
                 typename ExpressionType,
                 typename ValueType,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       std::vector<std::pair<ExpressionType, ValueType>>
       make_tensor_entries_for_substitution_map(
         const TensorType<rank, dim, ExpressionType> &symbol_tensor,
@@ -1401,7 +1411,8 @@ namespace Differentiation
     {
       template <int rank,
                 int dim,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, Expression>
       substitute_tensor(
         const TensorType<rank, dim, Expression> &expression_tensor,
@@ -1455,7 +1466,8 @@ namespace Differentiation
       template <typename ValueType,
                 int rank,
                 int dim,
-                template <int, int, typename> class TensorType>
+                template <int, int, typename>
+                class TensorType>
       TensorType<rank, dim, ValueType>
       substitute_and_evaluate_tensor(
         const TensorType<rank, dim, Expression> &expression_tensor,
index 305cb095fc99b027809d08faf723da70a143608c..21410aa792d8549e8590cc3fba05d99c6b7d0dd6 100644 (file)
@@ -261,9 +261,9 @@ namespace internal
 
       template <int spacedim>
       static void
-        iterate(dealii::internal::p4est::types<2>::forest *parallel_forest,
-                dealii::internal::p4est::types<2>::ghost * parallel_ghost,
-                void *                                     user_data);
+      iterate(dealii::internal::p4est::types<2>::forest *parallel_forest,
+              dealii::internal::p4est::types<2>::ghost * parallel_ghost,
+              void *                                     user_data);
 
       static constexpr unsigned int max_level = P4EST_MAXLEVEL;
 
index 5883275c2bc3c900564f3331e57631efdaa55abb..65860b9fcc976754332afa71bf21516cdacca0ba 100644 (file)
@@ -363,8 +363,8 @@ namespace parallel
       explicit Triangulation(
         const MPI_Comm &mpi_communicator,
         const typename dealii::Triangulation<dim, spacedim>::MeshSmoothing
-                       smooth_grid = (dealii::Triangulation<dim, spacedim>::none),
-        const Settings settings    = default_setting);
+          smooth_grid           = (dealii::Triangulation<dim, spacedim>::none),
+        const Settings settings = default_setting);
 
       /**
        * Destructor.
@@ -762,10 +762,8 @@ namespace parallel
        *
        * This function exists in 2d and 3d variants.
        */
-      void
-      copy_new_triangulation_to_p4est(std::integral_constant<int, 2>);
-      void
-      copy_new_triangulation_to_p4est(std::integral_constant<int, 3>);
+      void copy_new_triangulation_to_p4est(std::integral_constant<int, 2>);
+      void copy_new_triangulation_to_p4est(std::integral_constant<int, 3>);
 
       /**
        * Copy the local part of the refined forest from p4est into the
index 39d95fc4652800b2e51d1c13d7daa0c7d01ca613..9d81ce0749ddf68fca03c752b0872363781fb924 100644 (file)
@@ -912,8 +912,9 @@ public:
   /**
    * Move assignment operator.
    */
-  DoFAccessor<0, 1, spacedim, level_dof_access> &operator      =(
-    DoFAccessor<0, 1, spacedim, level_dof_access> &&) noexcept = default;
+  DoFAccessor<0, 1, spacedim, level_dof_access> &
+  operator=(DoFAccessor<0, 1, spacedim, level_dof_access> &&) noexcept =
+    default;
 
   /**
    * @}
@@ -1199,7 +1200,8 @@ protected:
   /**
    * Reset the DoF handler pointer.
    */
-  void set_dof_handler(DoFHandler<1, spacedim> *dh);
+  void
+  set_dof_handler(DoFHandler<1, spacedim> *dh);
 
   /**
    * Set the index of the <i>i</i>th degree of freedom of this object to @p
index a9cb05bf2978ab90c0e5ce53691a6150785d79c8..d360a2642a9f845e89cd483bf8e903c9e6c9dc0b 100644 (file)
@@ -1009,12 +1009,13 @@ namespace internal
               dof_processor);
 
         // 4) INNER dofs
-        dof_operation.process_dofs(accessor,
-                                   [&](const auto d) { return d; },
-                                   index,
-                                   dof_indices,
-                                   fe_index,
-                                   dof_processor);
+        dof_operation.process_dofs(
+          accessor,
+          [&](const auto d) { return d; },
+          index,
+          dof_indices,
+          fe_index,
+          dof_processor);
 
         AssertDimension(n_dof_indices(accessor, fe_index, count_level_dofs),
                         index);
@@ -1059,18 +1060,19 @@ namespace internal
               DoFHandler<dim, spacedim>::default_fe_index :
               fe_index_;
 
-          process_object(accessor.get_dof_handler(),
-                         0,
-                         accessor.vertex_index(vertex),
-                         fe_index,
-                         [](const auto d) {
-                           Assert(false, ExcInternalError());
-                           return d;
-                         },
-                         std::integral_constant<int, 0>(),
-                         index_value,
-                         index,
-                         dof_processor);
+          process_object(
+            accessor.get_dof_handler(),
+            0,
+            accessor.vertex_index(vertex),
+            fe_index,
+            [](const auto d) {
+              Assert(false, ExcInternalError());
+              return d;
+            },
+            std::integral_constant<int, 0>(),
+            index_value,
+            index,
+            dof_processor);
         }
 
         /**
@@ -1868,7 +1870,8 @@ inline DoFAccessor<0, 1, spacedim, level_dof_access>::DoFAccessor(
 
 
 template <int spacedim, bool level_dof_access>
-inline void DoFAccessor<0, 1, spacedim, level_dof_access>::set_dof_handler(
+inline void
+DoFAccessor<0, 1, spacedim, level_dof_access>::set_dof_handler(
   DoFHandler<1, spacedim> *dh)
 {
   Assert(dh != nullptr, ExcInvalidObject());
index 44b5790bb48b3a90b0095a3ad519eb7bed9c5520..17524137829dec55627202fdaa14b1ff8d9d2cd9 100644 (file)
@@ -2018,14 +2018,14 @@ DoFHandler<dim, spacedim>::save(Archive &ar, const unsigned int) const
 {
   if (this->hp_capability_enabled)
     {
-      ar & this->object_dof_indices;
-      ar & this->object_dof_ptr;
+      ar &this->object_dof_indices;
+      ar &this->object_dof_ptr;
 
-      ar & this->cell_dof_cache_indices;
-      ar & this->cell_dof_cache_ptr;
+      ar &this->cell_dof_cache_indices;
+      ar &this->cell_dof_cache_ptr;
 
-      ar & this->hp_cell_active_fe_indices;
-      ar & this->hp_cell_future_fe_indices;
+      ar &this->hp_cell_active_fe_indices;
+      ar &this->hp_cell_future_fe_indices;
 
       ar &hp_object_fe_ptr;
       ar &hp_object_fe_indices;
@@ -2045,14 +2045,14 @@ DoFHandler<dim, spacedim>::save(Archive &ar, const unsigned int) const
     }
   else
     {
-      ar & this->block_info_object;
+      ar &this->block_info_object;
       ar &number_cache;
 
-      ar & this->object_dof_indices;
-      ar & this->object_dof_ptr;
+      ar &this->object_dof_indices;
+      ar &this->object_dof_ptr;
 
-      ar & this->cell_dof_cache_indices;
-      ar & this->cell_dof_cache_ptr;
+      ar &this->cell_dof_cache_indices;
+      ar &this->cell_dof_cache_ptr;
 
       // write out the number of triangulation cells and later check during
       // loading that this number is indeed correct; same with something that
@@ -2074,14 +2074,14 @@ DoFHandler<dim, spacedim>::load(Archive &ar, const unsigned int)
 {
   if (this->hp_capability_enabled)
     {
-      ar & this->object_dof_indices;
-      ar & this->object_dof_ptr;
+      ar &this->object_dof_indices;
+      ar &this->object_dof_ptr;
 
-      ar & this->cell_dof_cache_indices;
-      ar & this->cell_dof_cache_ptr;
+      ar &this->cell_dof_cache_indices;
+      ar &this->cell_dof_cache_ptr;
 
-      ar & this->hp_cell_active_fe_indices;
-      ar & this->hp_cell_future_fe_indices;
+      ar &this->hp_cell_active_fe_indices;
+      ar &this->hp_cell_future_fe_indices;
 
       ar &hp_object_fe_ptr;
       ar &hp_object_fe_indices;
@@ -2112,18 +2112,18 @@ DoFHandler<dim, spacedim>::load(Archive &ar, const unsigned int)
     }
   else
     {
-      ar & this->block_info_object;
+      ar &this->block_info_object;
       ar &number_cache;
 
       object_dof_indices.clear();
 
       object_dof_ptr.clear();
 
-      ar & this->object_dof_indices;
-      ar & this->object_dof_ptr;
+      ar &this->object_dof_indices;
+      ar &this->object_dof_ptr;
 
-      ar & this->cell_dof_cache_indices;
-      ar & this->cell_dof_cache_ptr;
+      ar &this->cell_dof_cache_indices;
+      ar &this->cell_dof_cache_ptr;
 
       // these are the checks that correspond to the last block in the save()
       // function
index d186954e9f4bc398a569dc9fe55d31d11018c922..6ac55e8eeb030083c3332f0c576c30217b641106 100644 (file)
@@ -125,7 +125,8 @@ public:
    * given index needs to be between zero and the number of blocks that this
    * mask represents.
    */
-  bool operator[](const unsigned int block_index) const;
+  bool
+  operator[](const unsigned int block_index) const;
 
   /**
    * Return whether this block mask represents a mask with exactly
@@ -185,7 +186,8 @@ public:
    * Return a block mask that has only those elements set that are set both in
    * the current object as well as the one passed as an argument.
    */
-  BlockMask operator&(const BlockMask &mask) const;
+  BlockMask
+  operator&(const BlockMask &mask) const;
 
   /**
    * Return whether this object and the argument are identical.
@@ -253,7 +255,8 @@ BlockMask::size() const
 }
 
 
-inline bool BlockMask::operator[](const unsigned int block_index) const
+inline bool
+BlockMask::operator[](const unsigned int block_index) const
 {
   // if the mask represents the all-block mask
   // then always return true
@@ -347,7 +350,8 @@ BlockMask::operator|(const BlockMask &mask) const
 }
 
 
-inline BlockMask BlockMask::operator&(const BlockMask &mask) const
+inline BlockMask
+BlockMask::operator&(const BlockMask &mask) const
 {
   // if one of the two masks denotes the all-block mask,
   // then return the other one
index 4689536e8b26c4967eeb073db8b019bb2f128278..922434c39b708ca4ae8cf22021e5c48e52f49e1f 100644 (file)
@@ -140,7 +140,8 @@ public:
    * Otherwise, the given index needs to be between zero and the number of
    * components that this mask represents.
    */
-  bool operator[](const unsigned int component_index) const;
+  bool
+  operator[](const unsigned int component_index) const;
 
   /**
    * Return whether this component mask represents a mask with exactly
@@ -200,7 +201,8 @@ public:
    * Return a component mask that has only those elements set that are set
    * both in the current object as well as the one passed as an argument.
    */
-  ComponentMask operator&(const ComponentMask &mask) const;
+  ComponentMask
+  operator&(const ComponentMask &mask) const;
 
   /**
    * Return whether this object and the argument are identical.
@@ -283,7 +285,8 @@ ComponentMask::set(const unsigned int index, const bool value)
 }
 
 
-inline bool ComponentMask::operator[](const unsigned int component_index) const
+inline bool
+ComponentMask::operator[](const unsigned int component_index) const
 {
   // if the mask represents the all-component mask
   // then always return true
@@ -377,7 +380,8 @@ ComponentMask::operator|(const ComponentMask &mask) const
 }
 
 
-inline ComponentMask ComponentMask::operator&(const ComponentMask &mask) const
+inline ComponentMask
+ComponentMask::operator&(const ComponentMask &mask) const
 {
   // if one of the two masks denotes the all-component mask,
   // then return the other one
index aed320ca2c8ada01ea5a8d62c6eb016af73315ad..08489c54a7cc5c2666436c7a3fc3c66250836db3 100644 (file)
@@ -3084,8 +3084,8 @@ protected:
 
 
 template <int dim, int spacedim>
-inline const FiniteElement<dim, spacedim> &FiniteElement<dim, spacedim>::
-                                           operator[](const unsigned int fe_index) const
+inline const FiniteElement<dim, spacedim> &
+FiniteElement<dim, spacedim>::operator[](const unsigned int fe_index) const
 {
   (void)fe_index;
   Assert(fe_index == 0,
index 20a1380f3a8b71a99156e2baec2bce419f219cc2..5dd296ec5de52745ae872f23411ba01c046d71c1 100644 (file)
@@ -125,7 +125,8 @@ namespace FiniteElementDomination
    * <code>other_element_dominates</code>, then the returned value is
    * <code>neither_element_dominates</code>.
    */
-  inline Domination operator&(const Domination d1, const Domination d2);
+  inline Domination
+  operator&(const Domination d1, const Domination d2);
 } // namespace FiniteElementDomination
 
 namespace internal
@@ -698,7 +699,8 @@ namespace internal
 
 namespace FiniteElementDomination
 {
-  inline Domination operator&(const Domination d1, const Domination d2)
+  inline Domination
+  operator&(const Domination d1, const Domination d2)
   {
     // go through the entire list of possibilities. note that if we were into
     // speed, obfuscation and cared enough, we could implement this operator
index 8b37ce13a91ab97f6834c7ddd31d7b7fb2508187..9fdd415972d1bea1b26cd92d933a2ab90bb7e379 100644 (file)
@@ -1399,8 +1399,8 @@ FEInterfaceValues<dim, spacedim>::jump_3rd_derivative(
 /*------------ Inline functions: FEInterfaceValues------------*/
 template <int dim, int spacedim>
 inline const FEInterfaceViews::Scalar<dim, spacedim>
-  FEInterfaceValues<dim, spacedim>::
-  operator[](const FEValuesExtractors::Scalar &scalar) const
+FEInterfaceValues<dim, spacedim>::operator[](
+  const FEValuesExtractors::Scalar &scalar) const
 {
   AssertIndexRange(scalar.component, this->get_fe().n_components());
   return FEInterfaceViews::Scalar<dim, spacedim>(*this, scalar.component);
@@ -1410,8 +1410,8 @@ inline const FEInterfaceViews::Scalar<dim, spacedim>
 
 template <int dim, int spacedim>
 inline const FEInterfaceViews::Vector<dim, spacedim>
-  FEInterfaceValues<dim, spacedim>::
-  operator[](const FEValuesExtractors::Vector &vector) const
+FEInterfaceValues<dim, spacedim>::operator[](
+  const FEValuesExtractors::Vector &vector) const
 {
   const FiniteElement<dim, spacedim> &fe = this->get_fe();
   const unsigned int                  n_vectors =
index 70c6e9b8f01ded60172e25e2e7a07baa80fb1248..37f2fbbc0be13f0243af867dc529d4b3f8e77c37 100644 (file)
@@ -549,7 +549,7 @@ public:
                               unsigned int>>::value ||
        std::is_base_of<FiniteElement<dim, spacedim>,
                        typename std::decay<FEPairs>::type>::value)...>::type>
-  FESystem(FEPairs &&... fe_pairs);
+  FESystem(FEPairs &&...fe_pairs);
 
   /**
    * Same as above allowing the following syntax:
@@ -1358,7 +1358,7 @@ namespace internal
 // of the std::enable_if.
 template <int dim, int spacedim>
 template <class... FEPairs, typename>
-FESystem<dim, spacedim>::FESystem(FEPairs &&... fe_pairs)
+FESystem<dim, spacedim>::FESystem(FEPairs &&...fe_pairs)
   : FESystem<dim, spacedim>(
       {internal::FESystemImplementation::promote_to_fe_pair<dim, spacedim>(
         std::forward<FEPairs>(fe_pairs))...})
index a3ed30800b6d8883296ee930918fa18c6be44868..1d09fd36cd0054cf605f8af29768512552c34dc4 100644 (file)
@@ -2216,8 +2216,8 @@ namespace FETools
     // finally loop over all possible refinement cases
     Threads::TaskGroup<> tasks;
     unsigned int         ref_case = (isotropic_only) ?
-                              RefinementCase<dim>::isotropic_refinement :
-                              RefinementCase<dim>::cut_x;
+                                      RefinementCase<dim>::isotropic_refinement :
+                                      RefinementCase<dim>::cut_x;
     for (; ref_case <= RefinementCase<dim>::isotropic_refinement; ++ref_case)
       tasks += Threads::new_task([&, ref_case]() {
         compute_one_case(ref_case, mass, matrices[ref_case - 1]);
index a94474d320c2a46ca0c9643d42d9f1dd1747ec4f..17efa23e187fb2d852ae0b34b20e50bdf7af1b50 100644 (file)
@@ -325,7 +325,8 @@ operator|=(UpdateFlags &f1, const UpdateFlags f2)
  *
  * @ref UpdateFlags
  */
-inline UpdateFlags operator&(const UpdateFlags f1, const UpdateFlags f2)
+inline UpdateFlags
+operator&(const UpdateFlags f1, const UpdateFlags f2)
 {
   return static_cast<UpdateFlags>(static_cast<unsigned int>(f1) &
                                   static_cast<unsigned int>(f2));
index 4714b8f5b95d6b66adb022bcadf04102a1558e17..a945b4e707c118b67b2b22a386f94719f61952c5 100644 (file)
@@ -5439,8 +5439,9 @@ namespace FEValuesViews
 
 
 template <int dim, int spacedim>
-inline const FEValuesViews::Scalar<dim, spacedim> &FEValuesBase<dim, spacedim>::
-                                                   operator[](const FEValuesExtractors::Scalar &scalar) const
+inline const FEValuesViews::Scalar<dim, spacedim> &
+FEValuesBase<dim, spacedim>::operator[](
+  const FEValuesExtractors::Scalar &scalar) const
 {
   AssertIndexRange(scalar.component, fe_values_views_cache.scalars.size());
 
@@ -5450,8 +5451,9 @@ inline const FEValuesViews::Scalar<dim, spacedim> &FEValuesBase<dim, spacedim>::
 
 
 template <int dim, int spacedim>
-inline const FEValuesViews::Vector<dim, spacedim> &FEValuesBase<dim, spacedim>::
-                                                   operator[](const FEValuesExtractors::Vector &vector) const
+inline const FEValuesViews::Vector<dim, spacedim> &
+FEValuesBase<dim, spacedim>::operator[](
+  const FEValuesExtractors::Vector &vector) const
 {
   AssertIndexRange(vector.first_vector_component,
                    fe_values_views_cache.vectors.size());
@@ -5463,8 +5465,8 @@ inline const FEValuesViews::Vector<dim, spacedim> &FEValuesBase<dim, spacedim>::
 
 template <int dim, int spacedim>
 inline const FEValuesViews::SymmetricTensor<2, dim, spacedim> &
-  FEValuesBase<dim, spacedim>::
-  operator[](const FEValuesExtractors::SymmetricTensor<2> &tensor) const
+FEValuesBase<dim, spacedim>::operator[](
+  const FEValuesExtractors::SymmetricTensor<2> &tensor) const
 {
   Assert(
     tensor.first_tensor_component <
@@ -5481,8 +5483,8 @@ inline const FEValuesViews::SymmetricTensor<2, dim, spacedim> &
 
 template <int dim, int spacedim>
 inline const FEValuesViews::Tensor<2, dim, spacedim> &
-  FEValuesBase<dim, spacedim>::
-  operator[](const FEValuesExtractors::Tensor<2> &tensor) const
+FEValuesBase<dim, spacedim>::operator[](
+  const FEValuesExtractors::Tensor<2> &tensor) const
 {
   AssertIndexRange(tensor.first_tensor_component,
                    fe_values_views_cache.second_order_tensors.size());
index 40b4aa5e4b74e1b30bdba2357d9d1259e5ae9dda..e2a9857c3d3a8653c61e5afa57a62e89ccb947e5 100644 (file)
@@ -1131,8 +1131,8 @@ inline FilteredIterator<BaseIterator>::PredicateTemplate<
 template <typename BaseIterator>
 template <typename Predicate>
 bool
-FilteredIterator<BaseIterator>::PredicateTemplate<Predicate>::
-operator()(const BaseIterator &bi) const
+FilteredIterator<BaseIterator>::PredicateTemplate<Predicate>::operator()(
+  const BaseIterator &bi) const
 {
   return predicate(bi);
 }
index b76fb37852621b768c5a66bca2548adc0bf78c40..9615723ac2779a6965d793bb96bd83b63a55560e 100644 (file)
@@ -798,9 +798,10 @@ namespace GridGenerator
    * @param[in] rotate_right_square <code>true</code> if the right square is
    * rotated by $\pi/2$.
    */
-  void non_standard_orientation_mesh(Triangulation<2> &tria,
-                                     const bool        rotate_left_square,
-                                     const bool        rotate_right_square);
+  void
+  non_standard_orientation_mesh(Triangulation<2> &tria,
+                                const bool        rotate_left_square,
+                                const bool        rotate_right_square);
 
   /**
    * Generate a 3D mesh consisting of the unit cube joined with a copy shifted
@@ -823,11 +824,12 @@ namespace GridGenerator
    * @param[in] manipulate_left_cube <code>true</code> if the left cube is
    * to be re-ordered. If `false`, it is the right cube.
    */
-  void non_standard_orientation_mesh(Triangulation<3> &tria,
-                                     const bool        face_orientation,
-                                     const bool        face_flip,
-                                     const bool        face_rotation,
-                                     const bool        manipulate_left_cube);
+  void
+  non_standard_orientation_mesh(Triangulation<3> &tria,
+                                const bool        face_orientation,
+                                const bool        face_flip,
+                                const bool        face_rotation,
+                                const bool        manipulate_left_cube);
 
 
   /**
@@ -856,9 +858,10 @@ namespace GridGenerator
    * this function.
    */
   template <int spacedim>
-  void hyper_sphere(Triangulation<spacedim - 1, spacedim> &tria,
-                    const Point<spacedim> &center = Point<spacedim>(),
-                    const double           radius = 1.);
+  void
+  hyper_sphere(Triangulation<spacedim - 1, spacedim> &tria,
+               const Point<spacedim> &center = Point<spacedim>(),
+               const double           radius = 1.);
 
   /**
    * This function produces a hyper-ball intersected with the positive orthant
@@ -1569,11 +1572,12 @@ namespace GridGenerator
    * of the torus containing the loop of cells. Must be greater than @p r.
    * @param r           The radius of the cylinder bent together as a loop.
    */
-  void moebius(Triangulation<3, 3> &tria,
-               const unsigned int   n_cells,
-               const unsigned int   n_rotations,
-               const double         R,
-               const double         r);
+  void
+  moebius(Triangulation<3, 3> &tria,
+          const unsigned int   n_cells,
+          const unsigned int   n_rotations,
+          const double         R,
+          const double         r);
 
   /**
    * Call one of the other GridGenerator functions, parsing the name of the
@@ -2464,49 +2468,55 @@ namespace GridGenerator
   // These functions are only implemented with specializations; declare them
   // here
   template <>
-  void hyper_cube_with_cylindrical_hole(Triangulation<1> &,
-                                        const double,
-                                        const double,
-                                        const double,
-                                        const unsigned int,
-                                        const bool);
+  void
+  hyper_cube_with_cylindrical_hole(Triangulation<1> &,
+                                   const double,
+                                   const double,
+                                   const double,
+                                   const unsigned int,
+                                   const bool);
 
   template <>
-  void hyper_cube_with_cylindrical_hole(Triangulation<2> &,
-                                        const double,
-                                        const double,
-                                        const double,
-                                        const unsigned int,
-                                        const bool);
+  void
+  hyper_cube_with_cylindrical_hole(Triangulation<2> &,
+                                   const double,
+                                   const double,
+                                   const double,
+                                   const unsigned int,
+                                   const bool);
 
   template <>
-  void hyper_cube_with_cylindrical_hole(Triangulation<3> &,
-                                        const double,
-                                        const double,
-                                        const double,
-                                        const unsigned int,
-                                        const bool);
+  void
+  hyper_cube_with_cylindrical_hole(Triangulation<3> &,
+                                   const double,
+                                   const double,
+                                   const double,
+                                   const unsigned int,
+                                   const bool);
 
   template <>
-  void channel_with_cylinder(Triangulation<1> &,
-                             const double,
-                             const unsigned int,
-                             const double,
-                             const bool);
+  void
+  channel_with_cylinder(Triangulation<1> &,
+                        const double,
+                        const unsigned int,
+                        const double,
+                        const bool);
 
   template <>
-  void channel_with_cylinder(Triangulation<2> &,
-                             const double,
-                             const unsigned int,
-                             const double,
-                             const bool);
+  void
+  channel_with_cylinder(Triangulation<2> &,
+                        const double,
+                        const unsigned int,
+                        const double,
+                        const bool);
 
   template <>
-  void channel_with_cylinder(Triangulation<3> &,
-                             const double,
-                             const unsigned int,
-                             const double,
-                             const bool);
+  void
+  channel_with_cylinder(Triangulation<3> &,
+                        const double,
+                        const unsigned int,
+                        const double,
+                        const bool);
 #endif
 } // namespace GridGenerator
 
index 2fa4e1413d66c4ac126f895ae250db37076cf6bf..b639f59453f3739bd35cd9a41bd795dd91a8f8b3 100644 (file)
@@ -1463,7 +1463,7 @@ namespace GridTools
     const Cache<dim, spacedim> &cache,
     const Point<spacedim> &     p,
     const typename Triangulation<dim, spacedim>::active_cell_iterator &
-                             cell_hint = typename Triangulation<dim, spacedim>::active_cell_iterator(),
+      cell_hint = typename Triangulation<dim, spacedim>::active_cell_iterator(),
     const std::vector<bool> &marked_vertices = {},
     const double             tolerance       = 1.e-10);
 
@@ -2737,7 +2737,8 @@ namespace GridTools
    * article.
    */
   template <typename FaceIterator>
-  bool orthogonal_equality(
+  bool
+  orthogonal_equality(
     std::bitset<3> &                                              orientation,
     const FaceIterator &                                          face1,
     const FaceIterator &                                          face2,
@@ -4352,7 +4353,7 @@ namespace GridTools
       std::vector<std::vector<typename CellId::binary_type>> cell_data_to_send(
         ghost_owners.size());
       std::vector<std::vector<types::global_dof_index>>
-                                     send_dof_numbers_and_indices(ghost_owners.size());
+        send_dof_numbers_and_indices(ghost_owners.size());
       std::vector<MPI_Request>       reply_requests(ghost_owners.size());
       std::vector<std::vector<char>> sendbuffers(ghost_owners.size());
 
index d8d861dc60f69baf231d7866aee1010d9e950214..fa1ec4829b17af22ea8b585380833e6c897918e4 100644 (file)
@@ -168,8 +168,8 @@ namespace GridTools
    *
    * @ref CacheUpdateFlags
    */
-  inline CacheUpdateFlags operator&(const CacheUpdateFlags f1,
-                                    const CacheUpdateFlags f2)
+  inline CacheUpdateFlags
+  operator&(const CacheUpdateFlags f1, const CacheUpdateFlags f2)
   {
     return static_cast<CacheUpdateFlags>(static_cast<unsigned int>(f1) &
                                          static_cast<unsigned int>(f2));
index 4e25a25525f07e1b8626634c18168b61674ccce2..d8929711799622484c7d90313aca5b20c0e59c71 100644 (file)
@@ -136,7 +136,8 @@ public:
    * refined cell of which the source cell would be created if it were further
    * refined.
    */
-  cell_iterator operator[](const cell_iterator &source_cell) const;
+  cell_iterator
+  operator[](const cell_iterator &source_cell) const;
 
   /**
    * Delete all data of this class.
index 65298d787d1f7822b592f333bf97519bb6da8171..20f02a614d515bde8de28e5ba6c4bbf820007666 100644 (file)
@@ -569,7 +569,7 @@ private:
    * called by anyone, but at least hidden in an internal namespace.
    */
   friend DEAL_II_CONSTEXPR ReferenceCell
-                           internal::ReferenceCell::make_reference_cell_from_int(const std::uint8_t);
+  internal::ReferenceCell::make_reference_cell_from_int(const std::uint8_t);
 };
 
 
@@ -608,7 +608,7 @@ namespace internal
   namespace ReferenceCell
   {
     inline DEAL_II_CONSTEXPR dealii::ReferenceCell
-                             make_reference_cell_from_int(const std::uint8_t kind)
+    make_reference_cell_from_int(const std::uint8_t kind)
     {
       // Make sure these are the only indices from which objects can be
       // created.
index 8f263b9870d974ce7ff753e63b06578d24106126..f2d9f45c0d1735b2fbdbbee03fc804a982868d6c 100644 (file)
@@ -176,8 +176,8 @@ TriaAccessorBase<structdim, dim, spacedim>::copy_from(
 
 template <int structdim, int dim, int spacedim>
 inline TriaAccessorBase<structdim, dim, spacedim> &
-TriaAccessorBase<structdim, dim, spacedim>::
-operator=(const TriaAccessorBase<structdim, dim, spacedim> &a)
+TriaAccessorBase<structdim, dim, spacedim>::operator=(
+  const TriaAccessorBase<structdim, dim, spacedim> &a)
 {
   present_level = a.present_level;
   present_index = a.present_index;
@@ -196,8 +196,8 @@ operator=(const TriaAccessorBase<structdim, dim, spacedim> &a)
 
 template <int structdim, int dim, int spacedim>
 inline bool
-TriaAccessorBase<structdim, dim, spacedim>::
-operator==(const TriaAccessorBase<structdim, dim, spacedim> &a) const
+TriaAccessorBase<structdim, dim, spacedim>::operator==(
+  const TriaAccessorBase<structdim, dim, spacedim> &a) const
 {
   Assert(tria == a.tria || tria == nullptr || a.tria == nullptr,
          TriaAccessorExceptions::ExcCantCompareIterators());
@@ -209,8 +209,8 @@ operator==(const TriaAccessorBase<structdim, dim, spacedim> &a) const
 
 template <int structdim, int dim, int spacedim>
 inline bool
-TriaAccessorBase<structdim, dim, spacedim>::
-operator!=(const TriaAccessorBase<structdim, dim, spacedim> &a) const
+TriaAccessorBase<structdim, dim, spacedim>::operator!=(
+  const TriaAccessorBase<structdim, dim, spacedim> &a) const
 {
   Assert(tria == a.tria || tria == nullptr || a.tria == nullptr,
          TriaAccessorExceptions::ExcCantCompareIterators());
@@ -222,8 +222,8 @@ operator!=(const TriaAccessorBase<structdim, dim, spacedim> &a) const
 
 template <int structdim, int dim, int spacedim>
 inline bool
-TriaAccessorBase<structdim, dim, spacedim>::
-operator<(const TriaAccessorBase<structdim, dim, spacedim> &other) const
+TriaAccessorBase<structdim, dim, spacedim>::operator<(
+  const TriaAccessorBase<structdim, dim, spacedim> &other) const
 {
   Assert(tria == other.tria, TriaAccessorExceptions::ExcCantCompareIterators());
 
@@ -423,8 +423,8 @@ InvalidAccessor<structdim, dim, spacedim>::copy_from(const InvalidAccessor &)
 
 template <int structdim, int dim, int spacedim>
 bool
-InvalidAccessor<structdim, dim, spacedim>::
-operator==(const InvalidAccessor &) const
+InvalidAccessor<structdim, dim, spacedim>::operator==(
+  const InvalidAccessor &) const
 {
   // nothing to do here. we could
   // throw an exception but we can't
@@ -438,8 +438,8 @@ operator==(const InvalidAccessor &) const
 
 template <int structdim, int dim, int spacedim>
 bool
-InvalidAccessor<structdim, dim, spacedim>::
-operator!=(const InvalidAccessor &) const
+InvalidAccessor<structdim, dim, spacedim>::operator!=(
+  const InvalidAccessor &) const
 {
   // nothing to do here. we could
   // throw an exception but we can't
@@ -2334,8 +2334,8 @@ TriaAccessor<0, dim, spacedim>::copy_from(const TriaAccessor &t)
 
 template <int dim, int spacedim>
 inline bool
-TriaAccessor<0, dim, spacedim>::
-operator<(const TriaAccessor<0, dim, spacedim> &other) const
+TriaAccessor<0, dim, spacedim>::operator<(
+  const TriaAccessor<0, dim, spacedim> &other) const
 {
   Assert(tria == other.tria, TriaAccessorExceptions::ExcCantCompareIterators());
 
@@ -2749,8 +2749,8 @@ TriaAccessor<0, 1, spacedim>::copy_from(const TriaAccessor &t)
 
 template <int spacedim>
 inline bool
-TriaAccessor<0, 1, spacedim>::
-operator<(const TriaAccessor<0, 1, spacedim> &other) const
+TriaAccessor<0, 1, spacedim>::operator<(
+  const TriaAccessor<0, 1, spacedim> &other) const
 {
   Assert(tria == other.tria, TriaAccessorExceptions::ExcCantCompareIterators());
 
index e7c9d4c3f073243bcfb70f978771f49ce087ffcf..1b1edad1d54d5cdf6107663982653fc04f895082 100644 (file)
@@ -582,8 +582,8 @@ namespace TriangulationDescription
 
   template <int dim, int spacedim>
   bool
-  Description<dim, spacedim>::
-  operator==(const Description<dim, spacedim> &other) const
+  Description<dim, spacedim>::operator==(
+    const Description<dim, spacedim> &other) const
   {
     if (this->coarse_cells != other.coarse_cells)
       return false;
index 6217caaba0abd815a53915be63af4d4311f51d10..086193f7863e8d1fc8206a46dd42961b241cccfa 100644 (file)
@@ -332,12 +332,14 @@ public:
    *
    * You must not dereference invalid or past the end iterators.
    */
-  const Accessor &operator*() const;
+  const Accessor &
+  operator*() const;
 
   /**
    * Dereferencing operator, non-@p const version.
    */
-  Accessor &operator*();
+  Accessor &
+  operator*();
 
   /**
    * Dereferencing operator, returns a reference of the cell pointed to. Usage
@@ -345,12 +347,14 @@ public:
    *
    * There is a @p const and a non-@p const version.
    */
-  const Accessor *operator->() const;
+  const Accessor *
+  operator->() const;
 
   /**
    * Dereferencing operator, non-@p const version.
    */
-  Accessor *operator->();
+  Accessor *
+  operator->();
 
 
   /**
@@ -991,7 +995,8 @@ inline TriaRawIterator<Accessor>::TriaRawIterator(
 
 
 template <typename Accessor>
-inline const Accessor &TriaRawIterator<Accessor>::operator*() const
+inline const Accessor &
+TriaRawIterator<Accessor>::operator*() const
 {
   Assert(Accessor::structure_dimension != Accessor::dimension ||
            state() == IteratorState::valid,
@@ -1006,7 +1011,8 @@ inline const Accessor &TriaRawIterator<Accessor>::operator*() const
 
 
 template <typename Accessor>
-inline Accessor &TriaRawIterator<Accessor>::operator*()
+inline Accessor &
+TriaRawIterator<Accessor>::operator*()
 {
   Assert(Accessor::structure_dimension != Accessor::dimension ||
            state() == IteratorState::valid,
@@ -1030,7 +1036,8 @@ TriaRawIterator<Accessor>::access_any() const
 
 
 template <typename Accessor>
-inline const Accessor *TriaRawIterator<Accessor>::operator->() const
+inline const Accessor *
+TriaRawIterator<Accessor>::operator->() const
 {
   return &(this->operator*());
 }
@@ -1038,7 +1045,8 @@ inline const Accessor *TriaRawIterator<Accessor>::operator->() const
 
 
 template <typename Accessor>
-inline Accessor *TriaRawIterator<Accessor>::operator->()
+inline Accessor *
+TriaRawIterator<Accessor>::operator->()
 {
   return &(this->operator*());
 }
@@ -1056,8 +1064,8 @@ TriaRawIterator<Accessor>::state() const
 
 template <typename Accessor>
 inline bool
-TriaRawIterator<Accessor>::
-operator<(const TriaRawIterator<Accessor> &other) const
+TriaRawIterator<Accessor>::operator<(
+  const TriaRawIterator<Accessor> &other) const
 {
   Assert(state() != IteratorState::invalid,
          ExcDereferenceInvalidObject(accessor));
@@ -1080,8 +1088,8 @@ operator<(const TriaRawIterator<Accessor> &other) const
 
 template <typename Accessor>
 inline bool
-TriaRawIterator<Accessor>::
-operator>(const TriaRawIterator<Accessor> &other) const
+TriaRawIterator<Accessor>::operator>(
+  const TriaRawIterator<Accessor> &other) const
 {
   return (other < *this);
 }
index cabc88d9a76cc0f7a51a2e44fe967e84fa9cc709..bfb73a635b67001e222a79bef027ab59922835de 100644 (file)
@@ -86,8 +86,8 @@ template <typename OtherAccessor>
 inline
   typename std::enable_if<std::is_convertible<OtherAccessor, Accessor>::value,
                           bool>::type
-  TriaRawIterator<Accessor>::
-  operator==(const TriaRawIterator<OtherAccessor> &other) const
+  TriaRawIterator<Accessor>::operator==(
+    const TriaRawIterator<OtherAccessor> &other) const
 {
   return accessor == other.accessor;
 }
@@ -95,8 +95,8 @@ inline
 
 template <typename Accessor>
 inline bool
-TriaRawIterator<Accessor>::
-operator!=(const TriaRawIterator<Accessor> &other) const
+TriaRawIterator<Accessor>::operator!=(
+  const TriaRawIterator<Accessor> &other) const
 {
   return !(*this == other);
 }
@@ -412,8 +412,8 @@ TriaActiveIterator<Accessor>::operator=(const TriaActiveIterator<Accessor> &i)
 template <typename Accessor>
 template <class OtherAccessor>
 inline TriaActiveIterator<Accessor> &
-TriaActiveIterator<Accessor>::
-operator=(const TriaActiveIterator<OtherAccessor> &i)
+TriaActiveIterator<Accessor>::operator=(
+  const TriaActiveIterator<OtherAccessor> &i)
 {
   this->accessor.copy_from(i.accessor);
   return *this;
index 47e0bc502344c599ffb9ec12f8c3788dc548a420..3c1c3ef17e1d125b8345e9f651839f76b0d7e091 100644 (file)
@@ -59,7 +59,8 @@ namespace hp
      * @pre @p index must be between zero and the number of elements of the
      * collection.
      */
-    const T &operator[](const unsigned int index) const;
+    const T &
+    operator[](const unsigned int index) const;
 
     /**
      * Return the number of objects stored in this container.
@@ -114,7 +115,8 @@ namespace hp
 
 
   template <typename T>
-  inline const T &Collection<T>::operator[](const unsigned int index) const
+  inline const T &
+  Collection<T>::operator[](const unsigned int index) const
   {
     AssertIndexRange(index, entries.size());
     return *entries[index];
index f87540a35fd93d733c1b3aebe4094dfb8fd368d6..1331776fe307f2ae5a89f5f46f03581d13a54776 100644 (file)
@@ -116,7 +116,7 @@ namespace hp
      * from class FiniteElement<dim,spacedim>.
      */
     template <class... FETypes>
-    explicit FECollection(const FETypes &... fes);
+    explicit FECollection(const FETypes &...fes);
 
     /**
      * Constructor. Same as above but for any number of elements. Pointers to
@@ -765,7 +765,7 @@ namespace hp
 
   template <int dim, int spacedim>
   template <class... FETypes>
-  FECollection<dim, spacedim>::FECollection(const FETypes &... fes)
+  FECollection<dim, spacedim>::FECollection(const FETypes &...fes)
   {
     static_assert(
       is_base_of_all<FiniteElement<dim, spacedim>, FETypes...>::value,
@@ -804,8 +804,8 @@ namespace hp
 
   template <int dim, int spacedim>
   inline bool
-  FECollection<dim, spacedim>::
-  operator==(const FECollection<dim, spacedim> &fe_collection) const
+  FECollection<dim, spacedim>::operator==(
+    const FECollection<dim, spacedim> &fe_collection) const
   {
     const unsigned int n_elements = this->size();
     if (n_elements != fe_collection.size())
@@ -822,8 +822,8 @@ namespace hp
 
   template <int dim, int spacedim>
   inline bool
-  FECollection<dim, spacedim>::
-  operator!=(const FECollection<dim, spacedim> &fe_collection) const
+  FECollection<dim, spacedim>::operator!=(
+    const FECollection<dim, spacedim> &fe_collection) const
   {
     return !(*this == fe_collection);
   }
index a78059e8f1106573232dfe11baf65b0811699981..5b309eb4012f5f7de3ae61d2fb48a7a474115eab 100644 (file)
@@ -83,7 +83,7 @@ namespace hp
      * from class Mapping<dim,spacedim>.
      */
     template <class... MappingTypes>
-    explicit MappingCollection(const MappingTypes &... mappings);
+    explicit MappingCollection(const MappingTypes &...mappings);
 
     /**
      * Add a new mapping to the MappingCollection. Generally, you will
@@ -134,7 +134,7 @@ namespace hp
   template <int dim, int spacedim>
   template <class... MappingTypes>
   MappingCollection<dim, spacedim>::MappingCollection(
-    const MappingTypes &... mappings)
+    const MappingTypes &...mappings)
   {
     static_assert(
       is_base_of_all<Mapping<dim, spacedim>, MappingTypes...>::value,
index 8f77b795a4823cc8a478e10bf9c8048d5631cf59..bc53eea112913d477ba5fad4d1052704d83957cf 100644 (file)
@@ -74,7 +74,7 @@ namespace hp
      * from class Quadrature<dim>.
      */
     template <class... QTypes>
-    explicit QCollection(const QTypes &... quadrature_objects);
+    explicit QCollection(const QTypes &...quadrature_objects);
 
     /**
      * Add a new quadrature rule to the QCollection. In most cases, you will
@@ -149,7 +149,7 @@ namespace hp
 
   template <int dim>
   template <class... QTypes>
-  QCollection<dim>::QCollection(const QTypes &... quadrature_objects)
+  QCollection<dim>::QCollection(const QTypes &...quadrature_objects)
   {
     // loop over all of the given arguments and add the quadrature objects to
     // this collection. Inlining the definition of q_pointers causes internal
index dca4240a223e2048f7ec3922ed8f4a8aa4bb2bc5..f7c5324b4153a7c02a5936ecbdcabf75127e329d 100644 (file)
@@ -38,9 +38,9 @@ namespace LocalIntegrators
   {
     template <int dim>
     inline void
-      points_and_values(Table<2, double> &                          result,
-                        const FEValuesBase<dim> &                   fe,
-                        const ArrayView<const std::vector<double>> &input)
+    points_and_values(Table<2, double> &                          result,
+                      const FEValuesBase<dim> &                   fe,
+                      const ArrayView<const std::vector<double>> &input)
     {
       const unsigned int n_comp = fe.get_fe().n_components();
       AssertVectorVectorDimension(input, n_comp, fe.n_quadrature_points);
index f324dd3930378866ae05dd34e70ab3ed412b983a..5baafd9eb0a774e8f8669a99318e919c3caffadf 100644 (file)
@@ -2549,8 +2549,8 @@ inline AffineConstraints<number>::ConstraintLine::ConstraintLine(
 template <typename number>
 template <typename ConstraintLineType>
 inline typename AffineConstraints<number>::ConstraintLine &
-AffineConstraints<number>::ConstraintLine::
-operator=(const ConstraintLineType &other)
+AffineConstraints<number>::ConstraintLine::operator=(
+  const ConstraintLineType &other)
 {
   this->index = other.index;
 
index 4b113e64376c14a0da9fb01313b42e0f27a3ecc5..83ce3beb9c595d91201078bc9de39e129e994ad0 100644 (file)
@@ -65,8 +65,8 @@ DEAL_II_NAMESPACE_OPEN
 
 template <typename number>
 bool
-AffineConstraints<number>::ConstraintLine::
-operator<(const ConstraintLine &a) const
+AffineConstraints<number>::ConstraintLine::operator<(
+  const ConstraintLine &a) const
 {
   return index < a.index;
 }
@@ -75,8 +75,8 @@ operator<(const ConstraintLine &a) const
 
 template <typename number>
 bool
-AffineConstraints<number>::ConstraintLine::
-operator==(const ConstraintLine &a) const
+AffineConstraints<number>::ConstraintLine::operator==(
+  const ConstraintLine &a) const
 {
   return index == a.index;
 }
@@ -3117,7 +3117,8 @@ namespace internal
       /**
        * Dereferencing operator.
        */
-      ScratchData<number> &operator*()
+      ScratchData<number> &
+      operator*()
       {
         return *my_scratch_data;
       }
@@ -3125,7 +3126,8 @@ namespace internal
       /**
        * Dereferencing operator.
        */
-      ScratchData<number> *operator->()
+      ScratchData<number> *
+      operator->()
       {
         return my_scratch_data;
       }
index ce4a478c6e826b419c5376f2d109045ac1c04968..015da300fa0db155def7fc9a661ca7127d86961c 100644 (file)
@@ -211,13 +211,15 @@ namespace internal
        * is <tt>true</tt>, then no writing to the result is possible, making
        * this a const_iterator.
        */
-      dereference_type operator*() const;
+      dereference_type
+      operator*() const;
 
       /**
        * Random access operator, grant access to arbitrary elements relative
        * to the one presently pointed to.
        */
-      dereference_type operator[](const difference_type d) const;
+      dereference_type
+      operator[](const difference_type d) const;
 
       /**
        * Prefix increment operator. This operator advances the iterator to the
@@ -614,14 +616,16 @@ public:
    *
    * Exactly the same as operator().
    */
-  value_type operator[](const size_type i) const;
+  value_type
+  operator[](const size_type i) const;
 
   /**
    * Access components, returns U(i) as a writeable reference.
    *
    * Exactly the same as operator().
    */
-  reference operator[](const size_type i);
+  reference
+  operator[](const size_type i);
 
   /**
    * Instead of getting individual elements of a vector via operator(),
@@ -721,7 +725,8 @@ public:
   /**
    * $U = U * V$: scalar product.
    */
-  value_type operator*(const BlockVectorBase &V) const;
+  value_type
+  operator*(const BlockVectorBase &V) const;
 
   /**
    * Return the square of the $l_2$-norm.
@@ -1042,7 +1047,7 @@ namespace internal
 
     template <class BlockVectorType, bool Constness>
     inline typename Iterator<BlockVectorType, Constness>::dereference_type
-      Iterator<BlockVectorType, Constness>::operator*() const
+    Iterator<BlockVectorType, Constness>::operator*() const
     {
       return parent->block(current_block)(index_within_block);
     }
@@ -1051,8 +1056,8 @@ namespace internal
 
     template <class BlockVectorType, bool Constness>
     inline typename Iterator<BlockVectorType, Constness>::dereference_type
-      Iterator<BlockVectorType, Constness>::
-      operator[](const difference_type d) const
+    Iterator<BlockVectorType, Constness>::operator[](
+      const difference_type d) const
     {
       // if the index pointed to is
       // still within the block we
@@ -1120,8 +1125,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline bool
-    Iterator<BlockVectorType, Constness>::
-    operator==(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator==(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1133,8 +1138,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline bool
-    Iterator<BlockVectorType, Constness>::
-    operator!=(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator!=(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1146,8 +1151,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline bool
-    Iterator<BlockVectorType, Constness>::
-    operator<(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator<(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1159,8 +1164,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline bool
-    Iterator<BlockVectorType, Constness>::
-    operator<=(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator<=(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1172,8 +1177,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline bool
-    Iterator<BlockVectorType, Constness>::
-    operator>(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator>(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1185,8 +1190,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline bool
-    Iterator<BlockVectorType, Constness>::
-    operator>=(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator>=(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1198,8 +1203,8 @@ namespace internal
     template <class BlockVectorType, bool Constness>
     template <bool OtherConstness>
     inline typename Iterator<BlockVectorType, Constness>::difference_type
-    Iterator<BlockVectorType, Constness>::
-    operator-(const Iterator<BlockVectorType, OtherConstness> &i) const
+    Iterator<BlockVectorType, Constness>::operator-(
+      const Iterator<BlockVectorType, OtherConstness> &i) const
     {
       Assert(parent == i.parent, ExcPointerToDifferentVectors());
 
@@ -1211,8 +1216,8 @@ namespace internal
 
     template <class BlockVectorType, bool Constness>
     inline Iterator<BlockVectorType, Constness>
-    Iterator<BlockVectorType, Constness>::
-    operator+(const difference_type &d) const
+    Iterator<BlockVectorType, Constness>::operator+(
+      const difference_type &d) const
     {
       // if the index pointed to is
       // still within the block we
@@ -1238,8 +1243,8 @@ namespace internal
 
     template <class BlockVectorType, bool Constness>
     inline Iterator<BlockVectorType, Constness>
-    Iterator<BlockVectorType, Constness>::
-    operator-(const difference_type &d) const
+    Iterator<BlockVectorType, Constness>::operator-(
+      const difference_type &d) const
     {
       // if the index pointed to is
       // still within the block we
@@ -1606,8 +1611,9 @@ BlockVectorBase<VectorType>::is_non_negative() const
 
 
 template <class VectorType>
-typename BlockVectorBase<VectorType>::value_type BlockVectorBase<VectorType>::
-                                                 operator*(const BlockVectorBase<VectorType> &v) const
+typename BlockVectorBase<VectorType>::value_type
+BlockVectorBase<VectorType>::operator*(
+  const BlockVectorBase<VectorType> &v) const
 {
   Assert(n_blocks() == v.n_blocks(),
          ExcDimensionMismatch(n_blocks(), v.n_blocks()));
@@ -2040,8 +2046,8 @@ BlockVectorBase<VectorType>::operator=(const VectorType &v)
 template <class VectorType>
 template <class VectorType2>
 inline bool
-BlockVectorBase<VectorType>::
-operator==(const BlockVectorBase<VectorType2> &v) const
+BlockVectorBase<VectorType>::operator==(
+  const BlockVectorBase<VectorType2> &v) const
 {
   Assert(block_indices == v.block_indices, ExcDifferentBlockIndices());
 
@@ -2108,7 +2114,7 @@ BlockVectorBase<VectorType>::operator()(const size_type i)
 
 template <class VectorType>
 inline typename BlockVectorBase<VectorType>::value_type
-  BlockVectorBase<VectorType>::operator[](const size_type i) const
+BlockVectorBase<VectorType>::operator[](const size_type i) const
 {
   return operator()(i);
 }
@@ -2117,7 +2123,7 @@ inline typename BlockVectorBase<VectorType>::value_type
 
 template <class VectorType>
 inline typename BlockVectorBase<VectorType>::reference
-  BlockVectorBase<VectorType>::operator[](const size_type i)
+BlockVectorBase<VectorType>::operator[](const size_type i)
 {
   return operator()(i);
 }
index eee98f3a06ba1200b2f67f6eb45567bcbf6056ff..402a0c92a489c7bccdd18ed0e174732e32450c95 100644 (file)
@@ -339,12 +339,14 @@ namespace ChunkSparseMatrixIterators
     /**
      * Dereferencing operator.
      */
-    const Accessor<number, Constness> &operator*() const;
+    const Accessor<number, Constness> &
+    operator*() const;
 
     /**
      * Dereferencing operator.
      */
-    const Accessor<number, Constness> *operator->() const;
+    const Accessor<number, Constness> *
+    operator->() const;
 
     /**
      * Comparison. True, if both iterators point to the same matrix position.
@@ -1874,16 +1876,16 @@ namespace ChunkSparseMatrixIterators
 
 
   template <typename number, bool Constness>
-  inline const Accessor<number, Constness> &Iterator<number, Constness>::
-                                            operator*() const
+  inline const Accessor<number, Constness> &
+  Iterator<number, Constness>::operator*() const
   {
     return accessor;
   }
 
 
   template <typename number, bool Constness>
-  inline const Accessor<number, Constness> *Iterator<number, Constness>::
-                                            operator->() const
+  inline const Accessor<number, Constness> *
+  Iterator<number, Constness>::operator->() const
   {
     return &accessor;
   }
index 0074599c47738886f4d6b120915ac32e50606086..db8d605c28d3f8320f06cfae7bdf6a170340f266 100644 (file)
@@ -192,12 +192,14 @@ namespace ChunkSparsityPatternIterators
     /**
      * Dereferencing operator.
      */
-    const Accessor &operator*() const;
+    const Accessor &
+    operator*() const;
 
     /**
      * Dereferencing operator.
      */
-    const Accessor *operator->() const;
+    const Accessor *
+    operator->() const;
 
     /**
      * Comparison. True, if both iterators point to the same matrix position.
@@ -1062,14 +1064,16 @@ namespace ChunkSparsityPatternIterators
 
 
 
-  inline const Accessor &Iterator::operator*() const
+  inline const Accessor &
+  Iterator::operator*() const
   {
     return accessor;
   }
 
 
 
-  inline const Accessor *Iterator::operator->() const
+  inline const Accessor *
+  Iterator::operator->() const
   {
     return &accessor;
   }
index 572654026a262653e52df9464c388de88f51685a..247b0b00b1ad2587aedf4d7af1183c260d0a7f35 100644 (file)
@@ -82,7 +82,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 ElemSum<Number>::reduction_op(const Number a, const Number b)
+      ElemSum<Number>::reduction_op(const Number a, const Number b)
       {
         return (a + b);
       }
@@ -91,7 +91,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 ElemSum<Number>::atomic_op(Number *dst, const Number a)
+      ElemSum<Number>::atomic_op(Number *dst, const Number a)
       {
         return atomicAdd(dst, a);
       }
@@ -100,7 +100,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 ElemSum<Number>::element_wise_op(const Number a)
+      ElemSum<Number>::element_wise_op(const Number a)
       {
         return a;
       }
@@ -109,7 +109,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 ElemSum<Number>::null_value()
+      ElemSum<Number>::null_value()
       {
         return Number();
       }
@@ -118,7 +118,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 L1Norm<Number>::reduction_op(const Number a, const Number b)
+      L1Norm<Number>::reduction_op(const Number a, const Number b)
       {
         return (a + b);
       }
@@ -127,7 +127,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 L1Norm<Number>::atomic_op(Number *dst, const Number a)
+      L1Norm<Number>::atomic_op(Number *dst, const Number a)
       {
         return atomicAdd(dst, a);
       }
@@ -136,7 +136,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 L1Norm<Number>::element_wise_op(const Number a)
+      L1Norm<Number>::element_wise_op(const Number a)
       {
         return std::fabs(a);
       }
@@ -145,7 +145,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 L1Norm<Number>::null_value()
+      L1Norm<Number>::null_value()
       {
         return Number();
       }
@@ -154,7 +154,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 LInfty<Number>::reduction_op(const Number a, const Number b)
+      LInfty<Number>::reduction_op(const Number a, const Number b)
       {
         if (a > b)
           return a;
@@ -166,7 +166,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 LInfty<Number>::atomic_op(Number *dst, const Number a)
+      LInfty<Number>::atomic_op(Number *dst, const Number a)
       {
         return atomicMax_wrapper(dst, a);
       }
@@ -175,7 +175,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 LInfty<Number>::element_wise_op(const Number a)
+      LInfty<Number>::element_wise_op(const Number a)
       {
         return std::fabs(a);
       }
@@ -184,7 +184,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 LInfty<Number>::null_value()
+      LInfty<Number>::null_value()
       {
         return Number();
       }
@@ -249,7 +249,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 DotProduct<Number>::binary_op(const Number a, const Number b)
+      DotProduct<Number>::binary_op(const Number a, const Number b)
       {
         return a * b;
       }
@@ -258,7 +258,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 DotProduct<Number>::reduction_op(const Number a, const Number b)
+      DotProduct<Number>::reduction_op(const Number a, const Number b)
       {
         return a + b;
       }
@@ -267,7 +267,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 DotProduct<Number>::atomic_op(Number *dst, const Number a)
+      DotProduct<Number>::atomic_op(Number *dst, const Number a)
       {
         return atomicAdd(dst, a);
       }
@@ -276,7 +276,7 @@ namespace LinearAlgebra
 
       template <typename Number>
       __device__ Number
-                 DotProduct<Number>::null_value()
+      DotProduct<Number>::null_value()
       {
         return Number();
       }
index f85c4904fd6098bbcd7518742748044ffbe4e019..8fe7a38671aea94b28369ecafbe6fdcde887d829 100644 (file)
@@ -225,12 +225,14 @@ namespace DynamicSparsityPatternIterators
     /**
      * Dereferencing operator.
      */
-    const Accessor &operator*() const;
+    const Accessor &
+    operator*() const;
 
     /**
      * Dereferencing operator.
      */
-    const Accessor *operator->() const;
+    const Accessor *
+    operator->() const;
 
     /**
      * Comparison. True, if both iterators point to the same matrix position.
@@ -934,14 +936,16 @@ namespace DynamicSparsityPatternIterators
 
 
 
-  inline const Accessor &Iterator::operator*() const
+  inline const Accessor &
+  Iterator::operator*() const
   {
     return accessor;
   }
 
 
 
-  inline const Accessor *Iterator::operator->() const
+  inline const Accessor *
+  Iterator::operator->() const
   {
     return &accessor;
   }
index 6cc0fa2d1e531fa8f3cb611c9a28ac218959d808..a8834abe0cb99206b8f9f806cd9efce86aa7d96d 100644 (file)
@@ -244,13 +244,14 @@ public:
    * matrix coincide.
    */
   template <int dim>
-  void copy_to(Tensor<2, dim> &   T,
-               const size_type    src_r_i = 0,
-               const size_type    src_r_j = dim - 1,
-               const size_type    src_c_i = 0,
-               const size_type    src_c_j = dim - 1,
-               const unsigned int dst_r   = 0,
-               const unsigned int dst_c   = 0) const;
+  void
+  copy_to(Tensor<2, dim> &   T,
+          const size_type    src_r_i = 0,
+          const size_type    src_r_j = dim - 1,
+          const size_type    src_c_i = 0,
+          const size_type    src_c_j = dim - 1,
+          const unsigned int dst_r   = 0,
+          const unsigned int dst_c   = 0) const;
 
   /**
    * Copy a subset of the rows and columns of another matrix into the current
index 54a6111d47f33521dfeaf16e598dbe99f50c7b3c..de60920244c070a10158f094e75e85b974ecf138 100644 (file)
@@ -1697,13 +1697,14 @@ FullMatrix<number>::copy_from(const Tensor<2, dim> &T,
 
 template <typename number>
 template <int dim>
-void FullMatrix<number>::copy_to(Tensor<2, dim> &   T,
-                                 const size_type    src_r_i,
-                                 const size_type    src_r_j,
-                                 const size_type    src_c_i,
-                                 const size_type    src_c_j,
-                                 const unsigned int dst_r,
-                                 const unsigned int dst_c) const
+void
+FullMatrix<number>::copy_to(Tensor<2, dim> &   T,
+                            const size_type    src_r_i,
+                            const size_type    src_r_j,
+                            const size_type    src_c_i,
+                            const size_type    src_c_j,
+                            const unsigned int dst_r,
+                            const unsigned int dst_c) const
 {
   Assert(!this->empty(), ExcEmptyMatrix());
   AssertIndexRange(src_r_j - src_r_i, dim - dst_r);
index cf9cb10a716e4c9615facfc5f8fc654fc8959e8f..f6b94b649fe39ec5e23d9904935b044295505aa3 100644 (file)
@@ -247,8 +247,8 @@ namespace LinearAlgebra
 
     template <typename Number>
     BlockVector<Number> &
-    BlockVector<Number>::
-    operator=(const PETScWrappers::MPI::BlockVector &petsc_vec)
+    BlockVector<Number>::operator=(
+      const PETScWrappers::MPI::BlockVector &petsc_vec)
     {
       AssertDimension(this->n_blocks(), petsc_vec.n_blocks());
       for (unsigned int i = 0; i < this->n_blocks(); ++i)
@@ -296,8 +296,8 @@ namespace LinearAlgebra
 
     template <typename Number>
     BlockVector<Number> &
-    BlockVector<Number>::
-    operator=(const TrilinosWrappers::MPI::BlockVector &trilinos_vec)
+    BlockVector<Number>::operator=(
+      const TrilinosWrappers::MPI::BlockVector &trilinos_vec)
     {
       AssertDimension(this->n_blocks(), trilinos_vec.n_blocks());
       for (unsigned int i = 0; i < this->n_blocks(); ++i)
@@ -641,8 +641,8 @@ namespace LinearAlgebra
 
 
     template <typename Number>
-    Number BlockVector<Number>::
-           operator*(const VectorSpaceVector<Number> &vv) const
+    Number
+    BlockVector<Number>::operator*(const VectorSpaceVector<Number> &vv) const
     {
       Assert(this->n_blocks() > 0, ExcEmptyObject());
 
index a55921da4fe78b410ad22ba8b9f62d7900e1331e..09794599bf60956c701bee12245e187b2ee4c511 100644 (file)
@@ -1033,7 +1033,8 @@ namespace LinearAlgebra
        *
        * This function does the same thing as operator().
        */
-      Number operator[](const size_type global_index) const;
+      Number
+      operator[](const size_type global_index) const;
       /**
        * Read and write access to the data in the position corresponding to @p
        * global_index. The index must be either in the local range of the
@@ -1041,7 +1042,8 @@ namespace LinearAlgebra
        *
        * This function does the same thing as operator().
        */
-      Number &operator[](const size_type global_index);
+      Number &
+      operator[](const size_type global_index);
 
       /**
        * Read access to the data field specified by @p local_index. Locally
@@ -1676,8 +1678,8 @@ namespace LinearAlgebra
 
 
     template <typename Number, typename MemorySpace>
-    inline Number Vector<Number, MemorySpace>::
-                  operator[](const size_type global_index) const
+    inline Number
+    Vector<Number, MemorySpace>::operator[](const size_type global_index) const
     {
       return operator()(global_index);
     }
@@ -1685,8 +1687,8 @@ namespace LinearAlgebra
 
 
     template <typename Number, typename MemorySpace>
-    inline Number &Vector<Number, MemorySpace>::
-                   operator[](const size_type global_index)
+    inline Number &
+    Vector<Number, MemorySpace>::operator[](const size_type global_index)
     {
       return operator()(global_index);
     }
index 57e1d9b4d82192e6ead9bfbab8813ec7701044a2..6c27adf248b24bee2f7364a4ed3f968a977af500 100644 (file)
@@ -785,8 +785,8 @@ namespace LinearAlgebra
 
     template <typename Number, typename MemorySpaceType>
     inline Vector<Number, MemorySpaceType> &
-    Vector<Number, MemorySpaceType>::
-    operator=(const Vector<Number, MemorySpaceType> &c)
+    Vector<Number, MemorySpaceType>::operator=(
+      const Vector<Number, MemorySpaceType> &c)
     {
 #ifdef _MSC_VER
       return this->operator=<Number>(c);
@@ -800,8 +800,8 @@ namespace LinearAlgebra
     template <typename Number, typename MemorySpaceType>
     template <typename Number2>
     inline Vector<Number, MemorySpaceType> &
-    Vector<Number, MemorySpaceType>::
-    operator=(const Vector<Number2, MemorySpaceType> &c)
+    Vector<Number, MemorySpaceType>::operator=(
+      const Vector<Number2, MemorySpaceType> &c)
     {
       Assert(c.partitioner.get() != nullptr, ExcNotInitialized());
 
@@ -1475,8 +1475,8 @@ namespace LinearAlgebra
 
     template <typename Number, typename MemorySpaceType>
     Vector<Number, MemorySpaceType> &
-    Vector<Number, MemorySpaceType>::
-    operator+=(const VectorSpaceVector<Number> &vv)
+    Vector<Number, MemorySpaceType>::operator+=(
+      const VectorSpaceVector<Number> &vv)
     {
       // Downcast. Throws an exception if invalid.
       using VectorType = Vector<Number, MemorySpaceType>;
@@ -1503,8 +1503,8 @@ namespace LinearAlgebra
 
     template <typename Number, typename MemorySpaceType>
     Vector<Number, MemorySpaceType> &
-    Vector<Number, MemorySpaceType>::
-    operator-=(const VectorSpaceVector<Number> &vv)
+    Vector<Number, MemorySpaceType>::operator-=(
+      const VectorSpaceVector<Number> &vv)
     {
       // Downcast. Throws an exception if invalid.
       using VectorType = Vector<Number, MemorySpaceType>;
@@ -1819,8 +1819,9 @@ namespace LinearAlgebra
 
 
     template <typename Number, typename MemorySpaceType>
-    Number Vector<Number, MemorySpaceType>::
-           operator*(const VectorSpaceVector<Number> &vv) const
+    Number
+    Vector<Number, MemorySpaceType>::operator*(
+      const VectorSpaceVector<Number> &vv) const
     {
       // Downcast. Throws an exception if invalid.
       using VectorType = Vector<Number, MemorySpaceType>;
index 7e2e729da05b8037ec0a9df380ae8cc346608a35..008c95734de8e055f3b854ae81258500c82c8bc0 100644 (file)
@@ -214,7 +214,8 @@ namespace LinearAlgebra
     /**
      * Return the scalar product of two vectors.
      */
-    virtual Number operator*(const VectorSpaceVector<Number> &V) const override;
+    virtual Number
+    operator*(const VectorSpaceVector<Number> &V) const override;
 
     /**
      * This function is not implemented and will throw an exception.
@@ -485,7 +486,7 @@ namespace LinearAlgebra
   {
     size_type current_size = this->size();
     ar &static_cast<Subscriptor &>(*this);
-    ar & this->stored_elements;
+    ar &this->stored_elements;
     // If necessary, resize the vector during a read operation
     if (this->size() != current_size)
       this->reinit(this->size());
index 440fc882278be2ed2c22ff0d559d0d278c76b861..c8713aea5bc4f10c16e8d96609e273abb8212e65 100644 (file)
@@ -226,7 +226,8 @@ namespace LinearAlgebra
 
 
   template <typename Number>
-  Number Vector<Number>::operator*(const VectorSpaceVector<Number> &V) const
+  Number
+  Vector<Number>::operator*(const VectorSpaceVector<Number> &V) const
   {
     // Check that casting will work.
     Assert(dynamic_cast<const Vector<Number> *>(&V) != nullptr,
index 5ea32ba7bfb61082fe9905f983d8e55a93ea5a6a..137edca19bb1a19336817c51e9dc570f52876373 100644 (file)
@@ -1146,7 +1146,8 @@ namespace internal
      * Operator that returns a payload configured to support the
      * multiplication of two LinearOperators
      */
-    inline EmptyPayload operator*(const EmptyPayload &, const EmptyPayload &)
+    inline EmptyPayload
+    operator*(const EmptyPayload &, const EmptyPayload &)
     {
       return {};
     }
index 0bef1a2e8ca212e14d0157520a2f48fe2d3891cb..c014ed49f217eac54f1d20c0d0c36bb4e2fe926e 100644 (file)
@@ -75,12 +75,14 @@ public:
   /**
    * Dereferencing operator.
    */
-  const ACCESSOR &operator*() const;
+  const ACCESSOR &
+  operator*() const;
 
   /**
    * Dereferencing operator.
    */
-  const ACCESSOR *operator->() const;
+  const ACCESSOR *
+  operator->() const;
 
   /**
    * Comparison. True, if both accessors are equal.
@@ -160,14 +162,16 @@ MatrixIterator<ACCESSOR>::operator++(int)
 
 
 template <class ACCESSOR>
-inline const ACCESSOR &MatrixIterator<ACCESSOR>::operator*() const
+inline const ACCESSOR &
+MatrixIterator<ACCESSOR>::operator*() const
 {
   return accessor;
 }
 
 
 template <class ACCESSOR>
-inline const ACCESSOR *MatrixIterator<ACCESSOR>::operator->() const
+inline const ACCESSOR *
+MatrixIterator<ACCESSOR>::operator->() const
 {
   return &accessor;
 }
index eb2818a2da7c585cc9c85b812c747c8dd6ca23c9..275609b10537254d3dee9762425d2b358bbd45ec 100644 (file)
@@ -360,8 +360,9 @@ operator-(const PackagedOperation<Range> &first_comp,
  * @ingroup LAOperators
  */
 template <typename Range>
-PackagedOperation<Range> operator*(const PackagedOperation<Range> &comp,
-                                   typename Range::value_type      number)
+PackagedOperation<Range>
+operator*(const PackagedOperation<Range> &comp,
+          typename Range::value_type      number)
 {
   PackagedOperation<Range> return_comp;
 
@@ -400,8 +401,9 @@ PackagedOperation<Range> operator*(const PackagedOperation<Range> &comp,
  * @ingroup LAOperators
  */
 template <typename Range>
-PackagedOperation<Range> operator*(typename Range::value_type      number,
-                                   const PackagedOperation<Range> &comp)
+PackagedOperation<Range>
+operator*(typename Range::value_type      number,
+          const PackagedOperation<Range> &comp)
 {
   return comp * number;
 }
@@ -614,8 +616,8 @@ template <typename Range,
           typename = typename std::enable_if<
             internal::PackagedOperationImplementation::has_vector_interface<
               Range>::type::value>::type>
-PackagedOperation<Range> operator*(const Range &              u,
-                                   typename Range::value_type number)
+PackagedOperation<Range>
+operator*(const Range &u, typename Range::value_type number)
 {
   return PackagedOperation<Range>(u) * number;
 }
@@ -639,8 +641,8 @@ template <typename Range,
           typename = typename std::enable_if<
             internal::PackagedOperationImplementation::has_vector_interface<
               Range>::type::value>::type>
-PackagedOperation<Range> operator*(typename Range::value_type number,
-                                   const Range &              u)
+PackagedOperation<Range>
+operator*(typename Range::value_type number, const Range &u)
 {
   return number * PackagedOperation<Range>(u);
 }
index 0f97ba8fd3f46a762ab37b199fd2b973b5fc151d..f0e94b0531ae9b271be642bd4c6997e8455c27ab 100644 (file)
@@ -202,12 +202,14 @@ namespace PETScWrappers
       /**
        * Dereferencing operator.
        */
-      const Accessor &operator*() const;
+      const Accessor &
+      operator*() const;
 
       /**
        * Dereferencing operator.
        */
-      const Accessor *operator->() const;
+      const Accessor *
+      operator->() const;
 
       /**
        * Comparison. True, if both iterators point to the same matrix
@@ -1160,13 +1162,15 @@ namespace PETScWrappers
     }
 
 
-    inline const const_iterator::Accessor &const_iterator::operator*() const
+    inline const const_iterator::Accessor &
+    const_iterator::operator*() const
     {
       return accessor;
     }
 
 
-    inline const const_iterator::Accessor *const_iterator::operator->() const
+    inline const const_iterator::Accessor *
+    const_iterator::operator->() const
     {
       return &accessor;
     }
index f7f927c9660c62ad0a90b214131a4f2b937197b0..b6282216813c09b552026b08291aaab47b43a577 100644 (file)
@@ -444,14 +444,16 @@ namespace PETScWrappers
      *
      * Exactly the same as operator().
      */
-    reference operator[](const size_type index);
+    reference
+    operator[](const size_type index);
 
     /**
      * Provide read-only access to an element.
      *
      * Exactly the same as operator().
      */
-    PetscScalar operator[](const size_type index) const;
+    PetscScalar
+    operator[](const size_type index) const;
 
     /**
      * A collective set operation: instead of setting individual elements of a
@@ -547,7 +549,8 @@ namespace PETScWrappers
      *
      * For complex valued vector, this gives$\left(v^\ast,vec\right)$.
      */
-    PetscScalar operator*(const VectorBase &vec) const;
+    PetscScalar
+    operator*(const VectorBase &vec) const;
 
     /**
      * Return the square of the $l_2$-norm.
@@ -1128,14 +1131,16 @@ namespace PETScWrappers
 
 
 
-  inline internal::VectorReference VectorBase::operator[](const size_type index)
+  inline internal::VectorReference
+  VectorBase::operator[](const size_type index)
   {
     return operator()(index);
   }
 
 
 
-  inline PetscScalar VectorBase::operator[](const size_type index) const
+  inline PetscScalar
+  VectorBase::operator[](const size_type index) const
   {
     return operator()(index);
   }
index 6eb34add861deb0400e54acbbd3a0bc16654df30..a1048a9636666e15a56c6d9df1e0e944db6fdc0f 100644 (file)
@@ -2196,7 +2196,7 @@ template <typename MatrixType, class VectorType, typename PreconditionerType>
 inline typename PreconditionChebyshev<MatrixType,
                                       VectorType,
                                       PreconditionerType>::AdditionalData &
-                  PreconditionChebyshev<MatrixType, VectorType, PreconditionerType>::
+PreconditionChebyshev<MatrixType, VectorType, PreconditionerType>::
   AdditionalData::operator=(const AdditionalData &other_data)
 {
   degree              = other_data.degree;
index e7812e6d8a77a88a6b3e456f9a4edc1472e81dcb..c004bf2f77a2d5a7dbcbee126b120aa9d898802a 100644 (file)
@@ -475,12 +475,14 @@ public:
     /**
      * Dereferencing operator.
      */
-    const Accessor &operator*() const;
+    const Accessor &
+    operator*() const;
 
     /**
      * Dereferencing operator.
      */
-    const Accessor *operator->() const;
+    const Accessor *
+    operator->() const;
 
     /**
      * Comparison. True, if both iterators point to the same matrix position.
@@ -993,10 +995,9 @@ inline PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
 
 
 template <typename MatrixType, typename inverse_type>
-inline
-  typename PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator &
-  PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
-  operator++()
+inline typename PreconditionBlockJacobi<MatrixType,
+                                        inverse_type>::const_iterator &
+PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::operator++()
 {
   Assert(*this != accessor.matrix->end(), ExcIteratorPastEnd());
 
@@ -1019,8 +1020,8 @@ inline
 template <typename MatrixType, typename inverse_type>
 inline const typename PreconditionBlockJacobi<MatrixType, inverse_type>::
   const_iterator::Accessor &
-    PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
-    operator*() const
+  PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::operator*()
+    const
 {
   return accessor;
 }
@@ -1029,8 +1030,8 @@ inline const typename PreconditionBlockJacobi<MatrixType, inverse_type>::
 template <typename MatrixType, typename inverse_type>
 inline const typename PreconditionBlockJacobi<MatrixType, inverse_type>::
   const_iterator::Accessor *
-    PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
-    operator->() const
+  PreconditionBlockJacobi<MatrixType,
+                          inverse_type>::const_iterator::operator->() const
 {
   return &accessor;
 }
@@ -1038,8 +1039,8 @@ inline const typename PreconditionBlockJacobi<MatrixType, inverse_type>::
 
 template <typename MatrixType, typename inverse_type>
 inline bool
-PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
-operator==(const const_iterator &other) const
+PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::operator==(
+  const const_iterator &other) const
 {
   if (accessor.a_block == accessor.matrix->size() &&
       accessor.a_block == other.accessor.a_block)
@@ -1055,8 +1056,8 @@ operator==(const const_iterator &other) const
 
 template <typename MatrixType, typename inverse_type>
 inline bool
-PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
-operator!=(const const_iterator &other) const
+PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::operator!=(
+  const const_iterator &other) const
 {
   return !(*this == other);
 }
@@ -1064,8 +1065,8 @@ operator!=(const const_iterator &other) const
 
 template <typename MatrixType, typename inverse_type>
 inline bool
-PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::
-operator<(const const_iterator &other) const
+PreconditionBlockJacobi<MatrixType, inverse_type>::const_iterator::operator<(
+  const const_iterator &other) const
 {
   return (accessor.row() < other.accessor.row() ||
           (accessor.row() == other.accessor.row() &&
index 805812a605e428c1b23f1ea42b41629c0d3ca538..6b692202dd85819c9f9628d20ee745856ab4c7e3 100644 (file)
@@ -623,7 +623,7 @@ ImplicitQR<VectorType>::append_column(const VectorType &column)
       const Number rho2            = column_norm_sqr - u.norm_sqr();
       const bool   linearly_independent =
         column_signal.empty() ? rho2 > 0 :
-                                column_signal(u, rho2, column_norm_sqr).get();
+                                  column_signal(u, rho2, column_norm_sqr).get();
 
       // bail out if it turns out to be linearly dependent
       if (!linearly_independent)
index 967c3961c9a4940ff0e0112b7c2d3cfe45482818..9ac4e5c3112fe6ae2af1a589f784a02e781b1086 100644 (file)
@@ -502,7 +502,8 @@ namespace LinearAlgebra
      *
      * This function does the same thing as operator().
      */
-    Number operator[](const size_type global_index) const;
+    Number
+    operator[](const size_type global_index) const;
 
     /**
      * Read and write access to the data in the position corresponding to @p
@@ -511,7 +512,8 @@ namespace LinearAlgebra
      *
      * This function does the same thing as operator().
      */
-    Number &operator[](const size_type global_index);
+    Number &
+    operator[](const size_type global_index);
 
     /**
      * Instead of getting individual elements of a vector via operator(),
@@ -928,8 +930,8 @@ namespace LinearAlgebra
 
 
   template <typename Number>
-  inline Number ReadWriteVector<Number>::
-                operator[](const size_type global_index) const
+  inline Number
+  ReadWriteVector<Number>::operator[](const size_type global_index) const
   {
     return operator()(global_index);
   }
@@ -937,8 +939,8 @@ namespace LinearAlgebra
 
 
   template <typename Number>
-  inline Number &ReadWriteVector<Number>::
-                 operator[](const size_type global_index)
+  inline Number &
+  ReadWriteVector<Number>::operator[](const size_type global_index)
   {
     return operator()(global_index);
   }
@@ -1062,8 +1064,9 @@ namespace LinearAlgebra
   template <typename Number>
   template <typename Functor>
   void
-  ReadWriteVector<Number>::FunctorTemplate<Functor>::
-  operator()(const size_type begin, const size_type end)
+  ReadWriteVector<Number>::FunctorTemplate<Functor>::operator()(
+    const size_type begin,
+    const size_type end)
   {
     for (size_type i = begin; i < end; ++i)
       functor(parent.values[i]);
index 499f1a479c76fc0e042142bebf7624da4ab1e41b..64c9153f97b6fca05f478ed9523501658360e801 100644 (file)
@@ -90,7 +90,7 @@ public:
       const bool   invert_diagonal = true,
       const bool   same_diagonal   = false,
       const typename PreconditionBlockBase<InverseNumberType>::Inversion
-                   inversion = PreconditionBlockBase<InverseNumberType>::gauss_jordan,
+        inversion = PreconditionBlockBase<InverseNumberType>::gauss_jordan,
       const double threshold         = 0.,
       VectorType * temp_ghost_vector = nullptr);
 
index 3118a61858075d7fbb6ebb623e673f39ed1a74af..5ca6b8d668ce0d52335a1ba4816ffe8e556d603f 100644 (file)
@@ -99,13 +99,13 @@ RelaxationBlock<MatrixType, InverseNumberType, VectorType>::invert_diagblocks()
   else
     {
       // compute blocks in parallel
-      parallel::apply_to_subranges(0,
-                                   this->additional_data->block_list.n_rows(),
-                                   [this](const size_type block_begin,
-                                          const size_type block_end) {
-                                     this->block_kernel(block_begin, block_end);
-                                   },
-                                   16);
+      parallel::apply_to_subranges(
+        0,
+        this->additional_data->block_list.n_rows(),
+        [this](const size_type block_begin, const size_type block_end) {
+          this->block_kernel(block_begin, block_end);
+        },
+        16);
     }
   this->inverses_computed(true);
 }
index e7be171c26784330b902cd414ecef0ba3f066067..63631e0329e2b5dbc963255a0e4f3aba9d8c540a 100644 (file)
@@ -478,9 +478,9 @@ protected:
 
 template <class VectorType>
 inline SolverControl::State
-SolverBase<VectorType>::StateCombiner::
-operator()(const SolverControl::State state1,
-           const SolverControl::State state2) const
+SolverBase<VectorType>::StateCombiner::operator()(
+  const SolverControl::State state1,
+  const SolverControl::State state2) const
 {
   if ((state1 == SolverControl::failure) || (state2 == SolverControl::failure))
     return SolverControl::failure;
index ff6113d56ca43768ec4277ffc091b271eb65d1f5..91b4fa1d3782a36537f1e64922c9b19a27c10c09 100644 (file)
@@ -74,7 +74,8 @@ namespace internal
        * Get vector number @p i. If this vector was unused before, an error
        * occurs.
        */
-      VectorType &operator[](const unsigned int i) const;
+      VectorType &
+      operator[](const unsigned int i) const;
 
       /**
        * Get vector number @p i. Allocate it if necessary.
@@ -537,8 +538,8 @@ namespace internal
 
 
     template <class VectorType>
-    inline VectorType &TmpVectors<VectorType>::
-                       operator[](const unsigned int i) const
+    inline VectorType &
+    TmpVectors<VectorType>::operator[](const unsigned int i) const
     {
       AssertIndexRange(i, data.size());
 
index a37426f6a3f9db8ab6dcf8be5ded49122ee2632f..346dab072bc13ed6c9ad0cdf2d5c028c82664a6d 100644 (file)
@@ -65,7 +65,8 @@ namespace internal
        * Get vector number @p i. If this vector was unused before, an error
        * occurs.
        */
-      VectorType &operator[](const unsigned int i) const;
+      VectorType &
+      operator[](const unsigned int i) const;
 
       /**
        * Get vector number @p i. Allocate it if necessary.
@@ -199,8 +200,8 @@ namespace internal
 
 
     template <class VectorType>
-    inline VectorType &TmpVectors<VectorType>::
-                       operator[](const unsigned int i) const
+    inline VectorType &
+    TmpVectors<VectorType>::operator[](const unsigned int i) const
     {
       AssertIndexRange(i, data.size());
 
index c837a507f57018a720cfd6ac6efe4b726f362a64..8e9bab90781193c9502172a0f59fb1f4cec6b20a 100644 (file)
@@ -398,12 +398,14 @@ namespace SparseMatrixIterators
     /**
      * Dereferencing operator.
      */
-    const Accessor<number, Constness> &operator*() const;
+    const Accessor<number, Constness> &
+    operator*() const;
 
     /**
      * Dereferencing operator.
      */
-    const Accessor<number, Constness> *operator->() const;
+    const Accessor<number, Constness> *
+    operator->() const;
 
     /**
      * Comparison. True, if both iterators point to the same matrix position.
@@ -2277,8 +2279,8 @@ namespace SparseMatrixIterators
 
   template <typename number, bool Constness>
   inline const Iterator<number, Constness> &
-  Iterator<number, Constness>::
-  operator=(const SparseMatrixIterators::Iterator<number, false> &i)
+  Iterator<number, Constness>::operator=(
+    const SparseMatrixIterators::Iterator<number, false> &i)
   {
     accessor = *i;
     return *this;
@@ -2306,16 +2308,16 @@ namespace SparseMatrixIterators
 
 
   template <typename number, bool Constness>
-  inline const Accessor<number, Constness> &Iterator<number, Constness>::
-                                            operator*() const
+  inline const Accessor<number, Constness> &
+  Iterator<number, Constness>::operator*() const
   {
     return accessor;
   }
 
 
   template <typename number, bool Constness>
-  inline const Accessor<number, Constness> *Iterator<number, Constness>::
-                                            operator->() const
+  inline const Accessor<number, Constness> *
+  Iterator<number, Constness>::operator->() const
   {
     return &accessor;
   }
index 0580e0b4571db61664d466155a9662d0666dd6b8..9368a7e7e89852c0405259fc1bce32033581bec6 100644 (file)
@@ -253,12 +253,14 @@ public:
     /**
      * Dereferencing operator.
      */
-    const Accessor &operator*() const;
+    const Accessor &
+    operator*() const;
 
     /**
      * Dereferencing operator.
      */
-    const Accessor *operator->() const;
+    const Accessor *
+    operator->() const;
 
     /**
      * Comparison. True, if both iterators point to the same matrix position.
@@ -1042,7 +1044,7 @@ SparseMatrixEZ<number>::const_iterator::operator++()
 
 template <typename number>
 inline const typename SparseMatrixEZ<number>::const_iterator::Accessor &
-  SparseMatrixEZ<number>::const_iterator::operator*() const
+SparseMatrixEZ<number>::const_iterator::operator*() const
 {
   return accessor;
 }
@@ -1050,7 +1052,7 @@ inline const typename SparseMatrixEZ<number>::const_iterator::Accessor &
 
 template <typename number>
 inline const typename SparseMatrixEZ<number>::const_iterator::Accessor *
-  SparseMatrixEZ<number>::const_iterator::operator->() const
+SparseMatrixEZ<number>::const_iterator::operator->() const
 {
   return &accessor;
 }
@@ -1058,8 +1060,8 @@ inline const typename SparseMatrixEZ<number>::const_iterator::Accessor *
 
 template <typename number>
 inline bool
-SparseMatrixEZ<number>::const_iterator::
-operator==(const const_iterator &other) const
+SparseMatrixEZ<number>::const_iterator::operator==(
+  const const_iterator &other) const
 {
   return (accessor.row() == other.accessor.row() &&
           accessor.index() == other.accessor.index());
@@ -1068,8 +1070,8 @@ operator==(const const_iterator &other) const
 
 template <typename number>
 inline bool
-SparseMatrixEZ<number>::const_iterator::
-operator!=(const const_iterator &other) const
+SparseMatrixEZ<number>::const_iterator::operator!=(
+  const const_iterator &other) const
 {
   return !(*this == other);
 }
@@ -1077,8 +1079,8 @@ operator!=(const const_iterator &other) const
 
 template <typename number>
 inline bool
-SparseMatrixEZ<number>::const_iterator::
-operator<(const const_iterator &other) const
+SparseMatrixEZ<number>::const_iterator::operator<(
+  const const_iterator &other) const
 {
   return (accessor.row() < other.accessor.row() ||
           (accessor.row() == other.accessor.row() &&
index c73d4e4a3659c986a8e58eb6cec90d682e128876..a8a5566c8f287fd1f959d71b7df6071d8d8f53e0 100644 (file)
@@ -387,12 +387,14 @@ namespace TrilinosWrappers
       /**
        * Dereferencing operator.
        */
-      const Accessor<Constness> &operator*() const;
+      const Accessor<Constness> &
+      operator*() const;
 
       /**
        * Dereferencing operator.
        */
-      const Accessor<Constness> *operator->() const;
+      const Accessor<Constness> *
+      operator->() const;
 
       /**
        * Comparison. True, if both iterators point to the same matrix
@@ -2392,8 +2394,9 @@ namespace TrilinosWrappers
        * Return an operator that returns a payload configured to support the
        * multiplication of two LinearOperators
        */
-      TrilinosPayload operator*(const TrilinosPayload &first_op,
-                                const TrilinosPayload &second_op);
+      TrilinosPayload
+      operator*(const TrilinosPayload &first_op,
+                const TrilinosPayload &second_op);
 
     } // namespace LinearOperatorImplementation
   }   /* namespace internal */
@@ -2598,7 +2601,8 @@ namespace TrilinosWrappers
 
 
     template <bool Constness>
-    inline const Accessor<Constness> &Iterator<Constness>::operator*() const
+    inline const Accessor<Constness> &
+    Iterator<Constness>::operator*() const
     {
       return accessor;
     }
@@ -2606,7 +2610,8 @@ namespace TrilinosWrappers
 
 
     template <bool Constness>
-    inline const Accessor<Constness> *Iterator<Constness>::operator->() const
+    inline const Accessor<Constness> *
+    Iterator<Constness>::operator->() const
     {
       return &accessor;
     }
index 4241dfa9d06422c7ef6907d5bb4cfe73b80af184..80c733e1bcf9ef10dd7da70f6b179ea7b649e6b1 100644 (file)
@@ -203,12 +203,14 @@ namespace TrilinosWrappers
       /**
        * Dereferencing operator.
        */
-      const Accessor &operator*() const;
+      const Accessor &
+      operator*() const;
 
       /**
        * Dereferencing operator.
        */
-      const Accessor *operator->() const;
+      const Accessor *
+      operator->() const;
 
       /**
        * Comparison. True, if both iterators point to the same matrix
@@ -1114,14 +1116,16 @@ namespace TrilinosWrappers
 
 
 
-    inline const Accessor &Iterator::operator*() const
+    inline const Accessor &
+    Iterator::operator*() const
     {
       return accessor;
     }
 
 
 
-    inline const Accessor *Iterator::operator->() const
+    inline const Accessor *
+    Iterator::operator->() const
     {
       return &accessor;
     }
index 20ff03151c927fcd531fa625c9176e212506a236..c355e610dd620b1c17a1492d81fd39810fd867a5 100644 (file)
@@ -300,7 +300,8 @@ namespace LinearAlgebra
 
 
     template <typename Number>
-    Number Vector<Number>::operator*(const VectorSpaceVector<Number> &V) const
+    Number
+    Vector<Number>::operator*(const VectorSpaceVector<Number> &V) const
     {
       // Check that casting will work.
       Assert(dynamic_cast<const Vector<Number> *>(&V) != nullptr,
index c7a7239f8ecefe84ec6ffd7190a3a906a3033ea3..b65e50c1e6f17dfe54adb97fb3c51803f43b759d 100644 (file)
@@ -821,7 +821,8 @@ namespace TrilinosWrappers
        * Return the scalar (inner) product of two vectors. The vectors must have
        * the same size.
        */
-      TrilinosScalar operator*(const Vector &vec) const;
+      TrilinosScalar
+      operator*(const Vector &vec) const;
 
       /**
        * Return the square of the $l_2$-norm.
@@ -943,14 +944,16 @@ namespace TrilinosWrappers
        *
        * Exactly the same as operator().
        */
-      reference operator[](const size_type index);
+      reference
+      operator[](const size_type index);
 
       /**
        * Provide read-only access to an element.
        *
        * Exactly the same as operator().
        */
-      TrilinosScalar operator[](const size_type index) const;
+      TrilinosScalar
+      operator[](const size_type index) const;
 
       /**
        * Instead of getting individual elements of a vector via operator(),
@@ -1494,14 +1497,16 @@ namespace TrilinosWrappers
 
 
 
-    inline internal::VectorReference Vector::operator[](const size_type index)
+    inline internal::VectorReference
+    Vector::operator[](const size_type index)
     {
       return operator()(index);
     }
 
 
 
-    inline TrilinosScalar Vector::operator[](const size_type index) const
+    inline TrilinosScalar
+    Vector::operator[](const size_type index) const
     {
       return operator()(index);
     }
@@ -1775,7 +1780,8 @@ namespace TrilinosWrappers
 
 
 
-    inline TrilinosScalar Vector::operator*(const Vector &vec) const
+    inline TrilinosScalar
+    Vector::operator*(const Vector &vec) const
     {
       Assert(vector->Map().SameAs(vec.vector->Map()),
              ExcDifferentParallelPartitioning());
index e5565822c349f21b8702d467c7bca01c2f4da36c..d273fbb4475d8768a75fcac23e95ba6b0878d23b 100644 (file)
@@ -474,7 +474,8 @@ public:
    * repeatable results from one run to another.
    */
   template <typename Number2>
-  Number operator*(const Vector<Number2> &V) const;
+  Number
+  operator*(const Vector<Number2> &V) const;
 
   /**
    * Return the square of the $l_2$-norm.
@@ -625,14 +626,16 @@ public:
    *
    * Exactly the same as operator().
    */
-  Number operator[](const size_type i) const;
+  Number
+  operator[](const size_type i) const;
 
   /**
    * Access the @p ith component as a writeable reference.
    *
    * Exactly the same as operator().
    */
-  Number &operator[](const size_type i);
+  Number &
+  operator[](const size_type i);
 
   /**
    * Instead of getting individual elements of a vector via operator(),
@@ -1192,7 +1195,8 @@ Vector<Number>::operator()(const size_type i)
 
 
 template <typename Number>
-inline Number Vector<Number>::operator[](const size_type i) const
+inline Number
+Vector<Number>::operator[](const size_type i) const
 {
   return operator()(i);
 }
@@ -1200,7 +1204,8 @@ inline Number Vector<Number>::operator[](const size_type i) const
 
 
 template <typename Number>
-inline Number &Vector<Number>::operator[](const size_type i)
+inline Number &
+Vector<Number>::operator[](const size_type i)
 {
   return operator()(i);
 }
index 41aedb7a48a8f0c75aaccac229d31cf24f15d068..e0672ea5104e7821185049ab0a7c37180ae47cc0 100644 (file)
@@ -367,7 +367,8 @@ Vector<Number>::sadd(const Number x, const Number a, const Vector<Number> &v)
 
 template <typename Number>
 template <typename Number2>
-Number Vector<Number>::operator*(const Vector<Number2> &v) const
+Number
+Vector<Number>::operator*(const Vector<Number2> &v) const
 {
   Assert(size() != 0, ExcEmptyObject());
 
index d0b6e5f9af4e7899a6276c3ddec383259f20c245..8817eb6ec36f9cfa6aad46ff6cab10cae825ca73 100644 (file)
@@ -115,7 +115,8 @@ namespace LinearAlgebra
     /**
      * Return the scalar product of two vectors.
      */
-    virtual Number operator*(const VectorSpaceVector<Number> &V) const = 0;
+    virtual Number
+    operator*(const VectorSpaceVector<Number> &V) const = 0;
 
     /**
      * Add @p a to all components. Note that @p a is a scalar not a vector.
index cf4195a9dc3eb48d40898b537929b8f3100fd7e3..01928dc8c7f0ecebaf7b03f5f3f6fe0d5603d071 100644 (file)
@@ -48,12 +48,11 @@ namespace CUDAWrappers
     __device__ inline unsigned int
     compute_index()
     {
-      return (dim == 1 ?
-                threadIdx.x % n_points_1d :
-                dim == 2 ?
-                threadIdx.x % n_points_1d + n_points_1d * threadIdx.y :
-                threadIdx.x % n_points_1d +
-                    n_points_1d * (threadIdx.y + n_points_1d * threadIdx.z));
+      return (dim == 1 ? threadIdx.x % n_points_1d :
+              dim == 2 ? threadIdx.x % n_points_1d + n_points_1d * threadIdx.y :
+                         threadIdx.x % n_points_1d +
+                           n_points_1d *
+                             (threadIdx.y + n_points_1d * threadIdx.z));
     }
   } // namespace internal
 
@@ -180,14 +179,14 @@ namespace CUDAWrappers
      * id.
      */
     __device__ value_type
-               get_value() const;
+    get_value() const;
 
     /**
      * Same as above, except that the local dof index is computed from the
      * thread id.
      */
     __device__ value_type
-               get_dof_value() const;
+    get_dof_value() const;
 
     /**
      * Same as above, except that the quadrature point is computed from the
@@ -208,7 +207,7 @@ namespace CUDAWrappers
      * thread id.
      */
     __device__ gradient_type
-               get_gradient() const;
+    get_gradient() const;
 
     /**
      * Same as above, except that the quadrature point is computed from the
index 664a895b9e802007c091f9dd7947ea7fa48a5f44..3181bb014b74ede7be3ee57ed2daae113e7fa9db 100644 (file)
@@ -690,7 +690,7 @@ namespace CUDAWrappers
   // time (by virtue of being 'constexpr')
   // TODO this function should be rewritten using meta-programming
   __host__ __device__ constexpr unsigned int
-           cells_per_block_shmem(int dim, int fe_degree)
+  cells_per_block_shmem(int dim, int fe_degree)
   {
     /* clang-format off */
     // We are limiting the number of threads according to the
@@ -719,12 +719,11 @@ namespace CUDAWrappers
   __device__ inline unsigned int
   q_point_id_in_cell(const unsigned int n_q_points_1d)
   {
-    return (dim == 1 ?
-              threadIdx.x % n_q_points_1d :
-              dim == 2 ?
-              threadIdx.x % n_q_points_1d + n_q_points_1d * threadIdx.y :
-              threadIdx.x % n_q_points_1d +
-                  n_q_points_1d * (threadIdx.y + n_q_points_1d * threadIdx.z));
+    return (
+      dim == 1 ? threadIdx.x % n_q_points_1d :
+      dim == 2 ? threadIdx.x % n_q_points_1d + n_q_points_1d * threadIdx.y :
+                 threadIdx.x % n_q_points_1d +
+                   n_q_points_1d * (threadIdx.y + n_q_points_1d * threadIdx.z));
   }
 
 
index d4a8a0db7abff41077d80356e78b3b8f58870c34..ff7a8d3152a03732b66a5785825b82c04c71bd6f 100644 (file)
@@ -212,9 +212,9 @@ namespace CUDAWrappers
     {
       const unsigned int i = (dim == 1) ? 0 : threadIdx.x % n_q_points_1d;
       const unsigned int j = (dim == 3) ? threadIdx.y : 0;
-      const unsigned int q = (dim == 1) ?
-                               (threadIdx.x % n_q_points_1d) :
-                               (dim == 2) ? threadIdx.y : threadIdx.z;
+      const unsigned int q = (dim == 1) ? (threadIdx.x % n_q_points_1d) :
+                             (dim == 2) ? threadIdx.y :
+                                          threadIdx.z;
 
       // This loop simply multiply the shape function at the quadrature point by
       // the value finite element coefficient.
@@ -224,10 +224,9 @@ namespace CUDAWrappers
           const unsigned int shape_idx =
             dof_to_quad ? (q + k * n_q_points_1d) : (k + q * n_q_points_1d);
           const unsigned int source_idx =
-            (direction == 0) ?
-              (k + n_q_points_1d * (i + n_q_points_1d * j)) :
-              (direction == 1) ? (i + n_q_points_1d * (k + n_q_points_1d * j)) :
-                                 (i + n_q_points_1d * (j + n_q_points_1d * k));
+            (direction == 0) ? (k + n_q_points_1d * (i + n_q_points_1d * j)) :
+            (direction == 1) ? (i + n_q_points_1d * (k + n_q_points_1d * j)) :
+                               (i + n_q_points_1d * (j + n_q_points_1d * k));
           t += shape_data[shape_idx] *
                (in_place ? out[source_idx] : in[source_idx]);
         }
@@ -236,10 +235,9 @@ namespace CUDAWrappers
         __syncthreads();
 
       const unsigned int destination_idx =
-        (direction == 0) ?
-          (q + n_q_points_1d * (i + n_q_points_1d * j)) :
-          (direction == 1) ? (i + n_q_points_1d * (q + n_q_points_1d * j)) :
-                             (i + n_q_points_1d * (j + n_q_points_1d * q));
+        (direction == 0) ? (q + n_q_points_1d * (i + n_q_points_1d * j)) :
+        (direction == 1) ? (i + n_q_points_1d * (q + n_q_points_1d * j)) :
+                           (i + n_q_points_1d * (j + n_q_points_1d * q));
 
       if (add)
         out[destination_idx] += t;
index 14dad2145a7c417c4f7602ae4c3c937a70d9ab26..cfb86590c08b339598c76e83c512276b418aa43d 100644 (file)
@@ -101,8 +101,8 @@ namespace EvaluationFlags
    *
    * @ref EvaluationFlags
    */
-  inline EvaluationFlags operator&(const EvaluationFlags f1,
-                                   const EvaluationFlags f2)
+  inline EvaluationFlags
+  operator&(const EvaluationFlags f1, const EvaluationFlags f2)
   {
     return static_cast<EvaluationFlags>(static_cast<unsigned int>(f1) &
                                         static_cast<unsigned int>(f2));
index 7e8bb94e4f0fdb8146edff62f31bb6a329f2555d..8a978f403d48521eaa73b7474fcf0e7e00d0fbe9 100644 (file)
@@ -2330,9 +2330,9 @@ namespace internal
                   n_points_1d,
                   0);
 
-          const unsigned int in_stride = do_evaluate ?
-                                           dofs_per_component_on_cell :
-                                           dofs_per_component_on_face;
+          const unsigned int in_stride  = do_evaluate ?
+                                            dofs_per_component_on_cell :
+                                            dofs_per_component_on_face;
           const unsigned int out_stride = do_evaluate ?
                                             dofs_per_component_on_face :
                                             dofs_per_component_on_cell;
index db988b6bc433aa4f8218f2a3ca356771b5e7b795..027aa939997c18e7b82217575e4a5ed007a31f93 100644 (file)
@@ -37,7 +37,7 @@ namespace internal
   bool
   instantiation_helper_run(const unsigned int given_degree,
                            const unsigned int n_q_points_1d,
-                           Args &... args)
+                           Args &...args)
   {
     if (given_degree == degree)
       {
index ff59b31588d553392f885ea6f4e199829a663a04..c1eb1afd98fa577c7d83a7409e9ec76807de48ab 100644 (file)
@@ -3724,7 +3724,7 @@ FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::get_dof_info()
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, dim, VectorizedArrayType>
-                             FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::
+FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::
   get_normal_vector(const unsigned int q_point) const
 {
   AssertIndexRange(q_point, n_quadrature_points);
@@ -3741,7 +3741,7 @@ inline DEAL_II_ALWAYS_INLINE Tensor<1, dim, VectorizedArrayType>
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::JxW(
+FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::JxW(
   const unsigned int q_point) const
 {
   AssertIndexRange(q_point, n_quadrature_points);
@@ -3761,7 +3761,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<2, dim, VectorizedArrayType>
-                             FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::
+FEEvaluationBaseData<dim, Number, is_face, VectorizedArrayType>::
   inverse_jacobian(const unsigned int q_point) const
 {
   AssertIndexRange(q_point, n_quadrature_points);
@@ -5580,7 +5580,7 @@ template <int dim,
           bool is_face,
           typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, n_components_, VectorizedArrayType>
-                             FEEvaluationBase<dim, n_components_, Number, is_face, VectorizedArrayType>::
+FEEvaluationBase<dim, n_components_, Number, is_face, VectorizedArrayType>::
   get_dof_value(const unsigned int dof) const
 {
   AssertIndexRange(dof, this->data->dofs_per_component_on_cell);
@@ -5598,7 +5598,7 @@ template <int dim,
           bool is_face,
           typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, n_components_, VectorizedArrayType>
-                             FEEvaluationBase<dim, n_components_, Number, is_face, VectorizedArrayType>::
+FEEvaluationBase<dim, n_components_, Number, is_face, VectorizedArrayType>::
   get_value(const unsigned int q_point) const
 {
 #  ifdef DEBUG
@@ -5674,7 +5674,7 @@ template <int dim,
           bool is_face,
           typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, n_components_, VectorizedArrayType>
-                             FEEvaluationBase<dim, n_components_, Number, is_face, VectorizedArrayType>::
+FEEvaluationBase<dim, n_components_, Number, is_face, VectorizedArrayType>::
   get_normal_derivative(const unsigned int q_point) const
 {
   AssertIndexRange(q_point, this->n_quadrature_points);
@@ -6403,8 +6403,9 @@ inline FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType> &
 FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::operator=(
   const FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType> &other)
 {
-  this->FEEvaluationBase<dim, 1, Number, is_face, VectorizedArrayType>::
-  operator=(other);
+  this
+    ->FEEvaluationBase<dim, 1, Number, is_face, VectorizedArrayType>::operator=(
+      other);
   return *this;
 }
 
@@ -6412,7 +6413,7 @@ FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::operator=(
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_dof_value(
+FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_dof_value(
   const unsigned int dof) const
 {
   AssertIndexRange(dof, this->data->dofs_per_component_on_cell);
@@ -6423,7 +6424,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_value(
+FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_value(
   const unsigned int q_point) const
 {
 #  ifdef DEBUG
@@ -6438,7 +6439,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::
   get_normal_derivative(const unsigned int q_point) const
 {
   return BaseClass::get_normal_derivative(q_point)[0];
@@ -6448,7 +6449,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, dim, VectorizedArrayType>
-                             FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_gradient(
+FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_gradient(
   const unsigned int q_point) const
 {
   // could use the base class gradient, but that involves too many expensive
@@ -6524,7 +6525,7 @@ FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::get_laplacian(
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline void DEAL_II_ALWAYS_INLINE
-            FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::
   submit_dof_value(const VectorizedArrayType val_in, const unsigned int dof)
 {
 #  ifdef DEBUG
@@ -6538,7 +6539,7 @@ inline void DEAL_II_ALWAYS_INLINE
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline void DEAL_II_ALWAYS_INLINE
-            FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::submit_value(
+FEEvaluationAccess<dim, 1, Number, is_face, VectorizedArrayType>::submit_value(
   const VectorizedArrayType val_in,
   const unsigned int        q_point)
 {
@@ -6726,7 +6727,7 @@ FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::operator=(
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<2, dim, VectorizedArrayType>
-                             FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
   get_gradient(const unsigned int q_point) const
 {
   return BaseClass::get_gradient(q_point);
@@ -6736,7 +6737,7 @@ inline DEAL_II_ALWAYS_INLINE Tensor<2, dim, VectorizedArrayType>
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
   get_divergence(const unsigned int q_point) const
 {
 #  ifdef DEBUG
@@ -6781,7 +6782,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE SymmetricTensor<2, dim, VectorizedArrayType>
-                             FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
   get_symmetric_gradient(const unsigned int q_point) const
 {
   // copy from generic function into dim-specialization function
@@ -6848,7 +6849,7 @@ inline DEAL_II_ALWAYS_INLINE
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<2, dim, VectorizedArrayType>
-                             FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::
   get_hessian_diagonal(const unsigned int q_point) const
 {
   return BaseClass::get_hessian_diagonal(q_point);
@@ -6858,7 +6859,7 @@ inline DEAL_II_ALWAYS_INLINE Tensor<2, dim, VectorizedArrayType>
 
 template <int dim, typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<3, dim, VectorizedArrayType>
-                             FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::get_hessian(
+FEEvaluationAccess<dim, dim, Number, is_face, VectorizedArrayType>::get_hessian(
   const unsigned int q_point) const
 {
 #  ifdef DEBUG
@@ -7134,7 +7135,7 @@ FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::operator=(
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_dof_value(
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_dof_value(
   const unsigned int dof) const
 {
   AssertIndexRange(dof, this->data->dofs_per_component_on_cell);
@@ -7145,7 +7146,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_value(
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_value(
   const unsigned int q_point) const
 {
 #  ifdef DEBUG
@@ -7160,7 +7161,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, 1, VectorizedArrayType>
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_gradient(
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_gradient(
   const unsigned int q_point) const
 {
   // could use the base class gradient, but that involves too many inefficient
@@ -7187,7 +7188,7 @@ inline DEAL_II_ALWAYS_INLINE Tensor<1, 1, VectorizedArrayType>
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_divergence(
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_divergence(
   const unsigned int q_point) const
 {
   return get_gradient(q_point)[0];
@@ -7197,7 +7198,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::
   get_normal_derivative(const unsigned int q_point) const
 {
   return BaseClass::get_normal_derivative(q_point)[0];
@@ -7207,7 +7208,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<2, 1, VectorizedArrayType>
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_hessian(
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_hessian(
   const unsigned int q_point) const
 {
   return BaseClass::get_hessian(q_point)[0];
@@ -7217,7 +7218,7 @@ inline DEAL_II_ALWAYS_INLINE Tensor<2, 1, VectorizedArrayType>
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE Tensor<1, 1, VectorizedArrayType>
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::
   get_hessian_diagonal(const unsigned int q_point) const
 {
   return BaseClass::get_hessian_diagonal(q_point)[0];
@@ -7227,7 +7228,7 @@ inline DEAL_II_ALWAYS_INLINE Tensor<1, 1, VectorizedArrayType>
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
-                             FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_laplacian(
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::get_laplacian(
   const unsigned int q_point) const
 {
   return BaseClass::get_laplacian(q_point)[0];
@@ -7237,7 +7238,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType
 
 template <typename Number, bool is_face, typename VectorizedArrayType>
 inline DEAL_II_ALWAYS_INLINE void DEAL_II_ALWAYS_INLINE
-                                  FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::
+FEEvaluationAccess<1, 1, Number, is_face, VectorizedArrayType>::
   submit_dof_value(const VectorizedArrayType val_in, const unsigned int dof)
 {
 #  ifdef DEBUG
index 1c3c90c3ff8cbfc4f73f45d28862c051d09429eb..ca6d095d41debf30e93c013d0a1c57f65e499002 100644 (file)
@@ -78,7 +78,8 @@ namespace internal
             result[i][d] = value[d][i][vector_lane];
       }
 
-      static void get_gradient(
+      static void
+      get_gradient(
         Tensor<1, dim, Tensor<1, n_components, VectorizedArray<Number>>> &value,
         const unsigned int   vector_lane,
         const gradient_type &result)
@@ -98,17 +99,18 @@ namespace internal
       }
 
       static void
-        get_value(Tensor<1, n_components, VectorizedArray<Number>> &value,
-                  const unsigned int                                vector_lane,
-                  const value_type &                                result)
+      get_value(Tensor<1, n_components, VectorizedArray<Number>> &value,
+                const unsigned int                                vector_lane,
+                const value_type &                                result)
       {
         for (unsigned int i = 0; i < n_components; ++i)
           value[i][vector_lane] = result[i];
       }
 
       template <typename Number2>
-      static Number2 &access(Tensor<1, n_components, Number2> &value,
-                             const unsigned int                component)
+      static Number2 &
+      access(Tensor<1, n_components, Number2> &value,
+             const unsigned int                component)
       {
         return value[component];
       }
@@ -153,9 +155,10 @@ namespace internal
           result[d] = value[d][vector_lane];
       }
 
-      static void get_gradient(Tensor<1, dim, VectorizedArray<Number>> &value,
-                               const unsigned int   vector_lane,
-                               const gradient_type &result)
+      static void
+      get_gradient(Tensor<1, dim, VectorizedArray<Number>> &value,
+                   const unsigned int                       vector_lane,
+                   const gradient_type &                    result)
       {
         for (unsigned int d = 0; d < dim; ++d)
           value[d][vector_lane] = result[d];
@@ -225,7 +228,8 @@ namespace internal
             result[i][d] = value[d][i][vector_lane];
       }
 
-      static void get_gradient(
+      static void
+      get_gradient(
         Tensor<1, dim, Tensor<1, dim, VectorizedArray<Number>>> &value,
         const unsigned int                                       vector_lane,
         const gradient_type &                                    result)
@@ -244,9 +248,10 @@ namespace internal
           result[i] = value[i][vector_lane];
       }
 
-      static void get_value(Tensor<1, dim, VectorizedArray<Number>> &value,
-                            const unsigned int vector_lane,
-                            const value_type & result)
+      static void
+      get_value(Tensor<1, dim, VectorizedArray<Number>> &value,
+                const unsigned int                       vector_lane,
+                const value_type &                       result)
       {
         for (unsigned int i = 0; i < dim; ++i)
           value[i][vector_lane] = result[i];
@@ -307,9 +312,10 @@ namespace internal
         result[0] = value[0][vector_lane];
       }
 
-      static void get_gradient(Tensor<1, 1, VectorizedArray<Number>> &value,
-                               const unsigned int   vector_lane,
-                               const gradient_type &result)
+      static void
+      get_gradient(Tensor<1, 1, VectorizedArray<Number>> &value,
+                   const unsigned int                     vector_lane,
+                   const gradient_type &                  result)
       {
         value[0][vector_lane] = result[0];
       }
index bb8a5eea233d02334555add02b6af6278f7abedb..daf01606ccb0f65f2b50fe42ccf8172ec9c8b680 100644 (file)
@@ -704,10 +704,12 @@ namespace internal
 
       if (local_line < 8)
         {
-          x =
-            (local_line % 4 == 0) ? 0 : (local_line % 4 == 1) ? fe_degree : dof;
-          y =
-            (local_line % 4 == 2) ? 0 : (local_line % 4 == 3) ? fe_degree : dof;
+          x = (local_line % 4 == 0) ? 0 :
+              (local_line % 4 == 1) ? fe_degree :
+                                      dof;
+          y = (local_line % 4 == 2) ? 0 :
+              (local_line % 4 == 3) ? fe_degree :
+                                      dof;
           z = (local_line / 4) * fe_degree;
         }
       else
@@ -910,19 +912,19 @@ namespace CUDAWrappers
       const unsigned int this_type =
         (direction == 0) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_x :
-          (direction == 1) ?
+        (direction == 1) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_y :
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_z;
       const unsigned int face1_type =
         (direction == 0) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_y :
-          (direction == 1) ?
+        (direction == 1) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_z :
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_x;
       const unsigned int face2_type =
         (direction == 0) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_z :
-          (direction == 1) ?
+        (direction == 1) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_x :
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::type_y;
 
@@ -931,30 +933,33 @@ namespace CUDAWrappers
       const unsigned int face1 =
         (direction == 0) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::face_y :
-          (direction == 1) ?
+        (direction == 1) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::face_z :
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::face_x;
       const unsigned int face2 =
         (direction == 0) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::face_z :
-          (direction == 1) ?
+        (direction == 1) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::face_x :
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::face_y;
       const unsigned int edge =
         (direction == 0) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::edge_yz :
-          (direction == 1) ?
+        (direction == 1) ?
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::edge_zx :
           dealii::internal::MatrixFreeFunctions::ConstraintTypes::edge_xy;
       const unsigned int constrained_face =
         constraint_mask & (face1 | face2 | edge);
 
-      const unsigned int interp_idx =
-        (direction == 0) ? x_idx : (direction == 1) ? y_idx : z_idx;
-      const unsigned int face1_idx =
-        (direction == 0) ? y_idx : (direction == 1) ? z_idx : x_idx;
-      const unsigned int face2_idx =
-        (direction == 0) ? z_idx : (direction == 1) ? x_idx : y_idx;
+      const unsigned int interp_idx = (direction == 0) ? x_idx :
+                                      (direction == 1) ? y_idx :
+                                                         z_idx;
+      const unsigned int face1_idx  = (direction == 0) ? y_idx :
+                                      (direction == 1) ? z_idx :
+                                                         x_idx;
+      const unsigned int face2_idx  = (direction == 0) ? z_idx :
+                                      (direction == 1) ? x_idx :
+                                                         y_idx;
 
       Number     t        = 0;
       const bool on_face1 = (constraint_mask & face1_type) ?
@@ -977,8 +982,7 @@ namespace CUDAWrappers
                 {
                   const unsigned int real_idx =
                     (direction == 0) ? index3<fe_degree + 1>(i, y_idx, z_idx) :
-                                       (direction == 1) ?
-                                       index3<fe_degree + 1>(x_idx, i, z_idx) :
+                    (direction == 1) ? index3<fe_degree + 1>(x_idx, i, z_idx) :
                                        index3<fe_degree + 1>(x_idx, y_idx, i);
 
                   const Number w =
@@ -994,8 +998,7 @@ namespace CUDAWrappers
                 {
                   const unsigned int real_idx =
                     (direction == 0) ? index3<fe_degree + 1>(i, y_idx, z_idx) :
-                                       (direction == 1) ?
-                                       index3<fe_degree + 1>(x_idx, i, z_idx) :
+                    (direction == 1) ? index3<fe_degree + 1>(x_idx, i, z_idx) :
                                        index3<fe_degree + 1>(x_idx, y_idx, i);
 
                   const Number w =
index b10c90a197a55ed53948d9aa016a50a5ba6bce84..474d02b171d3a47284ff5b4491aa9d81ee2dfdd1 100644 (file)
@@ -3368,9 +3368,9 @@ namespace internal
 
     template <typename Number, typename VectorizedArrayType>
     bool
-    FPArrayComparator<Number, VectorizedArrayType>::
-    operator()(const std::vector<Number> &v1,
-               const std::vector<Number> &v2) const
+    FPArrayComparator<Number, VectorizedArrayType>::operator()(
+      const std::vector<Number> &v1,
+      const std::vector<Number> &v2) const
     {
       const unsigned int s1 = v1.size(), s2 = v2.size();
       if (s1 < s2)
@@ -3390,9 +3390,9 @@ namespace internal
 
     template <typename Number, typename VectorizedArrayType>
     bool
-    FPArrayComparator<Number, VectorizedArrayType>::
-    operator()(const Tensor<1, VectorizedArrayType::size(), Number> &t1,
-               const Tensor<1, VectorizedArrayType::size(), Number> &t2) const
+    FPArrayComparator<Number, VectorizedArrayType>::operator()(
+      const Tensor<1, VectorizedArrayType::size(), Number> &t1,
+      const Tensor<1, VectorizedArrayType::size(), Number> &t2) const
     {
       for (unsigned int k = 0; k < VectorizedArrayType::size(); ++k)
         if (t1[k] < t2[k] - tolerance)
@@ -3446,9 +3446,9 @@ namespace internal
     template <typename Number, typename VectorizedArrayType>
     template <int dim>
     bool
-    FPArrayComparator<Number, VectorizedArrayType>::
-    operator()(const std::array<Tensor<2, dim, Number>, dim + 1> &t1,
-               const std::array<Tensor<2, dim, Number>, dim + 1> &t2) const
+    FPArrayComparator<Number, VectorizedArrayType>::operator()(
+      const std::array<Tensor<2, dim, Number>, dim + 1> &t1,
+      const std::array<Tensor<2, dim, Number>, dim + 1> &t2) const
     {
       for (unsigned int i = 0; i < t1.size(); ++i)
         for (unsigned int d = 0; d < dim; ++d)
index d3221b30a8f5a3e22320c8da1c15f3ded754d303..936de13d324ecb10b9dda7f424fec4374ee32469 100644 (file)
@@ -1726,7 +1726,7 @@ public:
    */
   template <typename DoFHandlerType>
   DEAL_II_DEPRECATED const DoFHandlerType &
-                           get_dof_handler(const unsigned int dof_handler_index = 0) const;
+  get_dof_handler(const unsigned int dof_handler_index = 0) const;
 
   /**
    * Return the cell iterator in deal.II speak to a given cell batch
index dccd6a4d22b6c2c70b1d2be8251a24986c58edf5..ae7c1c81e3851a83c6aa80fe09460bed7dfc110c 100644 (file)
@@ -313,7 +313,7 @@ namespace internal
               bool lex_faces = false>
     void
     apply_face(const Number *DEAL_II_RESTRICT in,
-               Number *DEAL_II_RESTRICT out) const;
+               Number *DEAL_II_RESTRICT       out) const;
 
     const Number2 *shape_values;
     const Number2 *shape_gradients;
@@ -335,9 +335,9 @@ namespace internal
                          n_columns,
                          Number,
                          Number2>::apply(const Number2 *DEAL_II_RESTRICT
-                                                        shape_data,
-                                         const Number * in,
-                                         Number *       out)
+                                                       shape_data,
+                                         const Number *in,
+                                         Number *      out)
   {
     static_assert(one_line == false || direction == dim - 1,
                   "Single-line evaluation only works for direction=dim-1.");
@@ -420,7 +420,7 @@ namespace internal
                          Number,
                          Number2>::apply_face(const Number *DEAL_II_RESTRICT in,
                                               Number *DEAL_II_RESTRICT
-                                                      out) const
+                                                out) const
   {
     Assert(dim > 0 && (lex_faces || dim < 4),
            ExcMessage("Only dim=1,2,3 supported"));
@@ -701,7 +701,7 @@ namespace internal
               bool lex_faces = false>
     void
     apply_face(const Number *DEAL_II_RESTRICT in,
-               Number *DEAL_II_RESTRICT out) const;
+               Number *DEAL_II_RESTRICT       out) const;
 
     const Number2 *    shape_values;
     const Number2 *    shape_gradients;
@@ -867,7 +867,7 @@ namespace internal
   inline void
   EvaluatorTensorProduct<evaluate_general, dim, 0, 0, Number, Number2>::
     apply_face(const Number *DEAL_II_RESTRICT in,
-               Number *DEAL_II_RESTRICT out) const
+               Number *DEAL_II_RESTRICT       out) const
   {
     static_assert(lex_faces == false, "Not implemented yet.");
 
index 7e6b25cf4c2d196a5e75ac5c671783dd8622c939..f1c7188de578940005d3d37df13c11bc102fcfa5 100644 (file)
@@ -761,7 +761,7 @@ namespace MatrixFreeTools
     const unsigned int first_selected_component)
   {
     std::unique_ptr<AffineConstraints<typename MatrixType::value_type>>
-                                                              constraints_for_matrix;
+      constraints_for_matrix;
     const AffineConstraints<typename MatrixType::value_type> &constraints =
       internal::create_new_affine_constraints_if_needed(matrix,
                                                         constraints_in,
@@ -879,15 +879,14 @@ namespace MatrixFreeTools
                    n_components,
                    Number,
                    VectorizedArrayType,
-                   MatrixType>(matrix_free,
-                               constraints,
-                               matrix,
-                               [&](auto &feeval) {
-                                 (owning_class->*cell_operation)(feeval);
-                               },
-                               dof_no,
-                               quad_no,
-                               first_selected_component);
+                   MatrixType>(
+      matrix_free,
+      constraints,
+      matrix,
+      [&](auto &feeval) { (owning_class->*cell_operation)(feeval); },
+      dof_no,
+      quad_no,
+      first_selected_component);
   }
 
 #endif // DOXYGEN
index 5295b60033ccd54484aedf890f882f01240efb1e..a2b25dff6f58db10271d4354d46ff95d53843b98 100644 (file)
@@ -173,7 +173,8 @@ namespace MeshWorker
    *
    * @ref AssembleFlags
    */
-  inline AssembleFlags operator&(AssembleFlags f1, AssembleFlags f2)
+  inline AssembleFlags
+  operator&(AssembleFlags f1, AssembleFlags f2)
   {
     return static_cast<AssembleFlags>(static_cast<unsigned int>(f1) &
                                       static_cast<unsigned int>(f2));
index f3af7a6fc7dd35a69b48c1e1a38a4e3685c459dc..f46c737c2a2e613372965ad990b23200be71f48c 100644 (file)
@@ -911,19 +911,20 @@ namespace MeshWorker
                                   copy_data);
       };
 
-    mesh_loop(begin,
-              end,
-              f_cell_worker,
-              [&main_class, copier](const CopyData &copy_data) {
-                (main_class.*copier)(copy_data);
-              },
-              sample_scratch_data,
-              sample_copy_data,
-              flags,
-              f_boundary_worker,
-              f_face_worker,
-              queue_length,
-              chunk_size);
+    mesh_loop(
+      begin,
+      end,
+      f_cell_worker,
+      [&main_class, copier](const CopyData &copy_data) {
+        (main_class.*copier)(copy_data);
+      },
+      sample_scratch_data,
+      sample_copy_data,
+      flags,
+      f_boundary_worker,
+      f_face_worker,
+      queue_length,
+      chunk_size);
   }
 
   /**
index 735fd9151919e143efc6b8aad879eef46be5d543..0642ba6a2428285c04bde6f63f51f01598ca5d19 100644 (file)
@@ -413,13 +413,13 @@ template <class VectorType,
           class MatrixType,
           class PreconditionerType>
 void
-MGCoarseGridIterativeSolver<VectorType,
-                            SolverType,
-                            MatrixType,
-                            PreconditionerType>::
-operator()(const unsigned int /*level*/,
-           VectorType &      dst,
-           const VectorType &src) const
+                       MGCoarseGridIterativeSolver<
+                         VectorType,
+                         SolverType,
+                         MatrixType,
+                         PreconditionerType>::operator()(const unsigned int /*level*/,
+                                  VectorType &      dst,
+                                  const VectorType &src) const
 {
   Assert(solver != nullptr, ExcNotInitialized());
   Assert(matrix != nullptr, ExcNotInitialized());
@@ -455,10 +455,10 @@ MGCoarseGridHouseholder<number, VectorType>::initialize(
 
 template <typename number, class VectorType>
 void
-MGCoarseGridHouseholder<number, VectorType>::
-operator()(const unsigned int /*level*/,
-           VectorType &      dst,
-           const VectorType &src) const
+MGCoarseGridHouseholder<number, VectorType>::operator()(
+  const unsigned int /*level*/,
+  VectorType &      dst,
+  const VectorType &src) const
 {
   householder.least_squares(dst, src);
 }
index 6d8b19d3c22e56d6951074c4ec283230ba7714db..6c2a667310ca0d57770b9889751e385e8338c6ed 100644 (file)
@@ -247,7 +247,7 @@ MGConstrainedDoFs::initialize(
   const unsigned int max_level = (level_relevant_dofs.max_level() == 0) ?
                                    nlevels - 1 :
                                    level_relevant_dofs.max_level();
-  const bool user_level_dofs =
+  const bool         user_level_dofs =
     (level_relevant_dofs.max_level() == 0) ? false : true;
 
   // At this point level_constraint and refinement_edge_indices are empty.
index f9415f32eb3ad4acf69a813ee72bdc7eea774730..7831c9086332ddb6b0acff663d15506c91985271 100644 (file)
@@ -73,7 +73,8 @@ namespace mg
     /**
      * Access matrix on a level.
      */
-    const LinearOperator<VectorType> &operator[](unsigned int level) const;
+    const LinearOperator<VectorType> &
+    operator[](unsigned int level) const;
 
     virtual void
     vmult(const unsigned int level,
@@ -235,8 +236,8 @@ namespace mg
 
 
   template <typename VectorType>
-  inline const LinearOperator<VectorType> &Matrix<VectorType>::
-                                           operator[](unsigned int level) const
+  inline const LinearOperator<VectorType> &
+  Matrix<VectorType>::operator[](unsigned int level) const
   {
     return matrices[level];
   }
index 6a6476b0df73d393f8656f7a0648a3894ec0b2a3..9e6dae057a218978c59ac631794f3c9e1accff0d 100644 (file)
@@ -83,14 +83,16 @@ public:
    * counting from the last added element.
    * `index==0` therefore corresponds to the newset element.
    */
-  T &operator[](const std::size_t index);
+  T &
+  operator[](const std::size_t index);
 
   /**
    * Read access to an element with index @p index,
    * counting from the last added element.
    * `index==0` therefore corresponds to the newset element.
    */
-  const T &operator[](const std::size_t index) const;
+  const T &
+  operator[](const std::size_t index) const;
 
   /**
    * Return the current size of the history.
@@ -203,7 +205,8 @@ FiniteSizeHistory<T>::add(const T &element)
 
 
 template <typename T>
-T &FiniteSizeHistory<T>::operator[](const std::size_t ind)
+T &
+FiniteSizeHistory<T>::operator[](const std::size_t ind)
 {
   AssertIndexRange(ind, data.size());
   return *data[ind];
@@ -212,7 +215,8 @@ T &FiniteSizeHistory<T>::operator[](const std::size_t ind)
 
 
 template <typename T>
-const T &FiniteSizeHistory<T>::operator[](const std::size_t ind) const
+const T &
+FiniteSizeHistory<T>::operator[](const std::size_t ind) const
 {
   AssertIndexRange(ind, data.size());
   return *data[ind];
index 544f21f2f1432b092a365d773de3e66b198cf919..586ca63beb39d9f2b67cb54048476008596f8752 100644 (file)
@@ -719,7 +719,7 @@ namespace MatrixCreator
     hp::QCollection<dim>                 q_collection(q);
     hp::MappingCollection<dim, spacedim> mapping_collection(mapping);
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, number>
-                                                             assembler_data(fe_collection,
+      assembler_data(fe_collection,
                      update_values | update_JxW_values |
                        update_quadrature_points,
                      coefficient,
@@ -793,7 +793,7 @@ namespace MatrixCreator
            ExcDimensionMismatch(matrix.n(), dof.n_dofs()));
 
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, number>
-                                                             assembler_data(dof.get_fe_collection(),
+      assembler_data(dof.get_fe_collection(),
                      update_values | update_JxW_values |
                        (coefficient != nullptr ? update_quadrature_points :
                                                  UpdateFlags(0)),
@@ -864,7 +864,7 @@ namespace MatrixCreator
            ExcDimensionMismatch(matrix.n(), dof.n_dofs()));
 
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, number>
-                                                             assembler_data(dof.get_fe_collection(),
+      assembler_data(dof.get_fe_collection(),
                      update_values | update_JxW_values |
                        update_quadrature_points,
                      coefficient,
@@ -1875,7 +1875,7 @@ namespace MatrixCreator
     hp::QCollection<dim>                 q_collection(q);
     hp::MappingCollection<dim, spacedim> mapping_collection(mapping);
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, double>
-                                                             assembler_data(fe_collection,
+      assembler_data(fe_collection,
                      update_gradients | update_JxW_values |
                        (coefficient != nullptr ? update_quadrature_points :
                                                  UpdateFlags(0)),
@@ -1948,7 +1948,7 @@ namespace MatrixCreator
     hp::QCollection<dim>                 q_collection(q);
     hp::MappingCollection<dim, spacedim> mapping_collection(mapping);
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, double>
-                                                             assembler_data(fe_collection,
+      assembler_data(fe_collection,
                      update_gradients | update_values | update_JxW_values |
                        update_quadrature_points,
                      coefficient,
@@ -2021,7 +2021,7 @@ namespace MatrixCreator
            ExcDimensionMismatch(matrix.n(), dof.n_dofs()));
 
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, double>
-                                                             assembler_data(dof.get_fe_collection(),
+      assembler_data(dof.get_fe_collection(),
                      update_gradients | update_JxW_values |
                        (coefficient != nullptr ? update_quadrature_points :
                                                  UpdateFlags(0)),
@@ -2092,7 +2092,7 @@ namespace MatrixCreator
            ExcDimensionMismatch(matrix.n(), dof.n_dofs()));
 
     MatrixCreator::internal::AssemblerData::Scratch<dim, spacedim, double>
-                                                             assembler_data(dof.get_fe_collection(),
+      assembler_data(dof.get_fe_collection(),
                      update_gradients | update_values | update_JxW_values |
                        update_quadrature_points,
                      coefficient,
index 1b9d04dacd8ae63a5c31ce885e865d70095e2659..9dd40916e9fffa5920e8fe4d9ccc5c5a0e72a3fe 100644 (file)
@@ -498,8 +498,8 @@ template <typename Value,
           typename Box,
           typename Allocators>
 void
-ExtractLevelVisitor<Value, Options, Translator, Box, Allocators>::
-operator()(const ExtractLevelVisitor::InternalNode &node)
+ExtractLevelVisitor<Value, Options, Translator, Box, Allocators>::operator()(
+  const ExtractLevelVisitor::InternalNode &node)
 {
   using ElmentsType =
     typename boost::geometry::index::detail::rtree::elements_type<
@@ -542,8 +542,8 @@ template <typename Value,
           typename Box,
           typename Allocators>
 void
-ExtractLevelVisitor<Value, Options, Translator, Box, Allocators>::
-operator()(const ExtractLevelVisitor::Leaf &)
+ExtractLevelVisitor<Value, Options, Translator, Box, Allocators>::operator()(
+  const ExtractLevelVisitor::Leaf &)
 {}
 
 
index e7e456aedd55cae2463faf772ff9f32adbce221f..eac520203ea229d39aca18460fbd2f641315c1fe 100644 (file)
@@ -52,7 +52,8 @@ namespace VectorTools
     template <int dim,
               int spacedim,
               typename number,
-              template <int, int> class M_or_MC>
+              template <int, int>
+              class M_or_MC>
     static inline void
     do_interpolate_boundary_values(
       const M_or_MC<dim, spacedim> &   mapping,
@@ -690,8 +691,10 @@ namespace VectorTools
 
     template <int dim,
               int spacedim,
-              template <int, int> class M_or_MC,
-              template <int> class Q_or_QC,
+              template <int, int>
+              class M_or_MC,
+              template <int>
+              class Q_or_QC,
               typename number>
     void
     do_project_boundary_values(
@@ -1528,9 +1531,8 @@ namespace VectorTools
               const unsigned int lines_per_face =
                 GeometryInfo<dim>::lines_per_face;
               std::vector<std::vector<unsigned int>>
-                                        associated_edge_dof_to_face_dof(lines_per_face,
-                                                                        std::vector<unsigned int>(degree +
-                                                                        1));
+                associated_edge_dof_to_face_dof(
+                  lines_per_face, std::vector<unsigned int>(degree + 1));
               std::vector<unsigned int> associated_edge_dofs(lines_per_face);
 
               for (unsigned int line = 0; line < lines_per_face; ++line)
@@ -2170,7 +2172,7 @@ namespace VectorTools
       const FiniteElement<2> &         fe      = cell->get_fe();
       const std::vector<Tensor<1, 2>> &normals = fe_values.get_normal_vectors();
       const unsigned int
-                                  face_coordinate_direction[GeometryInfo<2>::faces_per_cell] = {1,
+        face_coordinate_direction[GeometryInfo<2>::faces_per_cell] = {1,
                                                                       1,
                                                                       0,
                                                                       0};
index 195b9a3b653fb3599ca4e8494494282211a0b6e1..ae84b35528508e9751aa48c984b77a80f893136c 100644 (file)
@@ -492,10 +492,10 @@ namespace VectorTools
 
     // Create a small lambda capture wrapping function and call the
     // internal implementation
-    const auto function_map = [&function](
-      const typename DoFHandler<dim, spacedim>::active_cell_iterator &)
-      -> const Function<spacedim, typename VectorType::value_type> *
-    {
+    const auto function_map =
+      [&function](
+        const typename DoFHandler<dim, spacedim>::active_cell_iterator &)
+      -> const Function<spacedim, typename VectorType::value_type> * {
       return &function;
     };
 
@@ -824,10 +824,10 @@ namespace VectorTools
   {
     // Create a small lambda capture wrapping the function map and call the
     // internal implementation
-    const auto function_map = [&functions](
-      const typename DoFHandler<dim, spacedim>::active_cell_iterator &cell)
-      -> const Function<spacedim, typename VectorType::value_type> *
-    {
+    const auto function_map =
+      [&functions](
+        const typename DoFHandler<dim, spacedim>::active_cell_iterator &cell)
+      -> const Function<spacedim, typename VectorType::value_type> * {
       const auto function = functions.find(cell->material_id());
       if (function != functions.end())
         return function->second;
index f9d7a2395a37db744a86d1cddb916988834615dc..552d3c78d9a5a8581d981986eb6ba65b4c4569ea 100644 (file)
@@ -146,8 +146,8 @@ namespace VectorTools
           VectorType &                                               vec,
           const bool                 enforce_zero_boundary     = false,
           const Quadrature<dim - 1> &q_boundary                = (dim > 1 ?
-                                                     QGauss<dim - 1>(2) :
-                                                     Quadrature<dim - 1>(0)),
+                                                                    QGauss<dim - 1>(2) :
+                                                                    Quadrature<dim - 1>(0)),
           const bool                 project_to_boundary_first = false);
 
   /**
@@ -163,8 +163,8 @@ namespace VectorTools
           VectorType &                                               vec,
           const bool                 enforce_zero_boundary     = false,
           const Quadrature<dim - 1> &q_boundary                = (dim > 1 ?
-                                                     QGauss<dim - 1>(2) :
-                                                     Quadrature<dim - 1>(0)),
+                                                                    QGauss<dim - 1>(2) :
+                                                                    Quadrature<dim - 1>(0)),
           const bool                 project_to_boundary_first = false);
 
   /**
index b61b56ec1bf7af66d6bd212b492494b982706433..a3348f0c5a4f4df328f0ef405710a8eb2789bf04 100644 (file)
@@ -103,8 +103,10 @@ namespace VectorTools
      */
     template <int dim,
               int spacedim,
-              template <int, int> class M_or_MC,
-              template <int> class Q_or_QC,
+              template <int, int>
+              class M_or_MC,
+              template <int>
+              class Q_or_QC,
               typename number>
     void
     project_compute_b_v(
@@ -407,8 +409,10 @@ namespace VectorTools
     template <int dim,
               int spacedim,
               typename VectorType,
-              template <int, int> class M_or_MC,
-              template <int> class Q_or_QC>
+              template <int, int>
+              class M_or_MC,
+              template <int>
+              class Q_or_QC>
     void
     do_project(
       const M_or_MC<dim, spacedim> &                             mapping,
index 48f3d339318983c5fcb14fb69fd165864f748c23..cad3ca321c94e3b77ca9db01f00050677b4cf5d1 100644 (file)
@@ -820,8 +820,8 @@ namespace Particles
 
   template <int dim, int spacedim>
   inline bool
-  ParticleAccessor<dim, spacedim>::
-  operator!=(const ParticleAccessor<dim, spacedim> &other) const
+  ParticleAccessor<dim, spacedim>::operator!=(
+    const ParticleAccessor<dim, spacedim> &other) const
   {
     return !(*this == other);
   }
@@ -830,8 +830,8 @@ namespace Particles
 
   template <int dim, int spacedim>
   inline bool
-  ParticleAccessor<dim, spacedim>::
-  operator==(const ParticleAccessor<dim, spacedim> &other) const
+  ParticleAccessor<dim, spacedim>::operator==(
+    const ParticleAccessor<dim, spacedim> &other) const
   {
     return (property_pool == other.property_pool) && (cell == other.cell) &&
            (particle_index_within_cell == other.particle_index_within_cell);
index 8f19a6fbc18a46d368257ac5929f3c4cbcb344ca..f2f8dd5b0f40381276262a99a4a270752ed580bb 100644 (file)
@@ -633,7 +633,7 @@ namespace Particles
      * @deprecated Use locally_owned_particle_ids() instead.
      */
     DEAL_II_DEPRECATED IndexSet
-                       locally_relevant_ids() const;
+    locally_relevant_ids() const;
 
     /**
      * Extract an IndexSet with global dimensions equal to
@@ -1261,7 +1261,7 @@ namespace Particles
     for (auto &p : *this)
       {
         auto       new_point(displace_particles ? p.get_location() :
-                                            Point<spacedim>());
+                                                  Point<spacedim>());
         const auto id = p.get_id();
         for (unsigned int i = 0; i < spacedim; ++i)
           new_point[i] += input_vector[id * spacedim + i];
index 0e81a5e4de5c69a250a9d0e495f961685a876251..0c3b415df2b6bb8c5b4044451408428f88fec4ab 100644 (file)
@@ -65,12 +65,14 @@ namespace Particles
      * Dereferencing operator, returns a reference to an accessor. Usage is thus
      * like <tt>(*i).get_id ();</tt>
      */
-    const ParticleAccessor<dim, spacedim> &operator*() const;
+    const ParticleAccessor<dim, spacedim> &
+    operator*() const;
 
     /**
      * Dereferencing operator, non-@p const version.
      */
-    ParticleAccessor<dim, spacedim> &operator*();
+    ParticleAccessor<dim, spacedim> &
+    operator*();
 
     /**
      * Dereferencing operator, returns a pointer of the particle pointed to.
@@ -78,12 +80,14 @@ namespace Particles
      *
      * There is a @p const and a non-@p const version.
      */
-    const ParticleAccessor<dim, spacedim> *operator->() const;
+    const ParticleAccessor<dim, spacedim> *
+    operator->() const;
 
     /**
      * Dereferencing operator, non-@p const version.
      */
-    ParticleAccessor<dim, spacedim> *operator->();
+    ParticleAccessor<dim, spacedim> *
+    operator->();
 
     /**
      * Compare for equality.
@@ -169,8 +173,8 @@ namespace Particles
 
 
   template <int dim, int spacedim>
-  inline ParticleAccessor<dim, spacedim> &ParticleIterator<dim, spacedim>::
-                                          operator*()
+  inline ParticleAccessor<dim, spacedim> &
+  ParticleIterator<dim, spacedim>::operator*()
   {
     return accessor;
   }
@@ -178,8 +182,8 @@ namespace Particles
 
 
   template <int dim, int spacedim>
-  inline ParticleAccessor<dim, spacedim> *ParticleIterator<dim, spacedim>::
-                                          operator->()
+  inline ParticleAccessor<dim, spacedim> *
+  ParticleIterator<dim, spacedim>::operator->()
   {
     return &(this->operator*());
   }
@@ -188,7 +192,7 @@ namespace Particles
 
   template <int dim, int spacedim>
   inline const ParticleAccessor<dim, spacedim> &
-    ParticleIterator<dim, spacedim>::operator*() const
+  ParticleIterator<dim, spacedim>::operator*() const
   {
     return accessor;
   }
@@ -197,7 +201,7 @@ namespace Particles
 
   template <int dim, int spacedim>
   inline const ParticleAccessor<dim, spacedim> *
-    ParticleIterator<dim, spacedim>::operator->() const
+  ParticleIterator<dim, spacedim>::operator->() const
   {
     return &(this->operator*());
   }
@@ -206,8 +210,8 @@ namespace Particles
 
   template <int dim, int spacedim>
   inline bool
-  ParticleIterator<dim, spacedim>::
-  operator!=(const ParticleIterator<dim, spacedim> &other) const
+  ParticleIterator<dim, spacedim>::operator!=(
+    const ParticleIterator<dim, spacedim> &other) const
   {
     return accessor != other.accessor;
   }
@@ -216,8 +220,8 @@ namespace Particles
 
   template <int dim, int spacedim>
   inline bool
-  ParticleIterator<dim, spacedim>::
-  operator==(const ParticleIterator<dim, spacedim> &other) const
+  ParticleIterator<dim, spacedim>::operator==(
+    const ParticleIterator<dim, spacedim> &other) const
   {
     return accessor == other.accessor;
   }
index 1b0353fa07e97ce1bbb0cf94557638b414f4735d..df2c27f1298f6e4795de940f10be2fdd494c39c8 100644 (file)
@@ -170,7 +170,8 @@ namespace SUNDIALS
       /**
        * Access the N_Vector that is viewed by this object.
        */
-      N_Vector operator->() const;
+      N_Vector
+      operator->() const;
 
     private:
       /**
index ee6294cd6da36b49c81410a23da6a16cc34fccab..8498f81405701376da38615737d40e2d1edb1f93 100644 (file)
@@ -403,7 +403,8 @@ SUNDIALS::internal::NVectorView<VectorType>::operator N_Vector() const
 
 
 template <typename VectorType>
-N_Vector SUNDIALS::internal::NVectorView<VectorType>::operator->() const
+N_Vector
+SUNDIALS::internal::NVectorView<VectorType>::operator->() const
 {
   Assert(vector_ptr != nullptr, ExcNotInitialized());
   return vector_ptr.get();
index a4427526446f312a35e4cf63d9e1a11fae3ccaab..5b799956862f432db1f3bae62e3480b1f588dc07 100644 (file)
@@ -2094,7 +2094,8 @@ namespace DataOutBase
 
 
   template <int spacedim>
-  void Patch<0, spacedim>::swap(Patch<0, spacedim> &other_patch)
+  void
+  Patch<0, spacedim>::swap(Patch<0, spacedim> &other_patch)
   {
     std::swap(vertices, other_patch.vertices);
     std::swap(patch_index, other_patch.patch_index);
@@ -2904,11 +2905,12 @@ namespace DataOutBase
      * camera_horizontal, necessary for the correct alignment of the
      * later images), and the focus of the camera (float camera_focus).
      */
-    Point<2> svg_project_point(Point<3> point,
-                               Point<3> camera_position,
-                               Point<3> camera_direction,
-                               Point<3> camera_horizontal,
-                               float    camera_focus)
+    Point<2>
+    svg_project_point(Point<3> point,
+                      Point<3> camera_position,
+                      Point<3> camera_direction,
+                      Point<3> camera_horizontal,
+                      float    camera_focus)
     {
       Point<3> camera_vertical;
       camera_vertical[0] = camera_horizontal[1] * camera_direction[2] -
@@ -2961,7 +2963,8 @@ namespace DataOutBase
      * Function to compute the gradient parameters for a triangle with given
      * values for the vertices.
      */
-    Point<6> svg_get_gradient_parameters(Point<3> points[])
+    Point<6>
+    svg_get_gradient_parameters(Point<3> points[])
     {
       Point<3> v_min, v_max, v_inter;
 
index 03922d8d46c1f99188d43873124e4420bd1a57b5..4a32cd03cb8911ff5cb3462b12a76ad70b11ebd7 100644 (file)
@@ -324,8 +324,8 @@ namespace Functions
         {
           const double d = this->center.distance(points[i]);
           values[i]      = ((d < this->radius) ?
-                         (this->radius - d) / this->radius * this->rescaling :
-                         0.);
+                              (this->radius - d) / this->radius * this->rescaling :
+                              0.);
         }
     else
       std::fill(values.begin(), values.end(), 0.);
index 2c08d33be2eba60aa6fc3cb8fbc81d36eb431251..0259a785c56583c685fd53b5b72a02cb554451de 100644 (file)
@@ -124,10 +124,11 @@ namespace Functions
      * calculates out[i][j] += v*(in1[i]*in2[j]+in1[j]*in2[i])
      */
     template <int dim>
-    void add_outer_product(SymmetricTensor<2, dim> &out,
-                           const double             val,
-                           const Tensor<1, dim> &   in1,
-                           const Tensor<1, dim> &   in2)
+    void
+    add_outer_product(SymmetricTensor<2, dim> &out,
+                      const double             val,
+                      const Tensor<1, dim> &   in1,
+                      const Tensor<1, dim> &   in2)
     {
       if (val != 0.)
         for (unsigned int i = 0; i < dim; i++)
@@ -139,9 +140,10 @@ namespace Functions
      * calculates out[i][j] += v*in[i]in[j]
      */
     template <int dim>
-    void add_outer_product(SymmetricTensor<2, dim> &out,
-                           const double             val,
-                           const Tensor<1, dim> &   in)
+    void
+    add_outer_product(SymmetricTensor<2, dim> &out,
+                      const double             val,
+                      const Tensor<1, dim> &   in)
     {
       if (val != 0.)
         for (unsigned int i = 0; i < dim; i++)
index 8815d6919b5c9f30d246da8cadc98da5c82ffe4d..2386bf86d2d097cd5bced4a5c8a0f749de963b4c 100644 (file)
@@ -160,7 +160,8 @@ IndexSet::do_compress() const
 
 
 #ifndef DOXYGEN
-IndexSet IndexSet::operator&(const IndexSet &is) const
+IndexSet
+IndexSet::operator&(const IndexSet &is) const
 {
   Assert(size() == is.size(), ExcDimensionMismatch(size(), is.size()));
 
index dd213ecb89734b411deb54a7c3673d3e53003116..2332afe1df74f3b437d2f8ed9daac04901e5289a 100644 (file)
@@ -870,7 +870,7 @@ QTelles<dim>::QTelles(const Quadrature<1> &base_quad,
     dim == 2 ?
       QAnisotropic<dim>(QTelles<1>(base_quad, Point<1>(singularity[0])),
                         QTelles<1>(base_quad, Point<1>(singularity[1]))) :
-      dim == 3 ?
+    dim == 3 ?
       QAnisotropic<dim>(QTelles<1>(base_quad, Point<1>(singularity[0])),
                         QTelles<1>(base_quad, Point<1>(singularity[1])),
                         QTelles<1>(base_quad, Point<1>(singularity[2]))) :
index 563ba50e717ca5d274ab1816198208ba5742c347..6dc6f6e8a5b66e4cf19fab856b779f8bda5b6238 100644 (file)
@@ -23,8 +23,9 @@ DEAL_II_NAMESPACE_OPEN
 namespace
 {
   template <int dim, typename Number>
-  void calculate_svd_in_place(Tensor<2, dim, Number> &A_in_VT_out,
-                              Tensor<2, dim, Number> &U)
+  void
+  calculate_svd_in_place(Tensor<2, dim, Number> &A_in_VT_out,
+                         Tensor<2, dim, Number> &U)
   {
     // inputs: A
     // outputs: V^T, U
index 280f51b806ff3bf08e1c567848be1f1dcc52f197..1aa78fd6d1b8b792adb2402bd6ca50a2ccaafe7e 100644 (file)
@@ -549,8 +549,7 @@ AnisotropicPolynomials<dim>::compute_index(
 #endif
 
   if (dim == 0)
-    {
-    }
+    {}
   else if (dim == 1)
     internal::compute_tensor_index(i,
                                    polynomials[0].size(),
index 0647b74afb96ff2d2c46040aff59666d4909ec2d..5fa731a0840a0aae1ce3d01e14516ba26776ea32 100644 (file)
@@ -32,7 +32,8 @@ namespace Threads
   namespace internal
   {
     [[noreturn]] void
-    handle_std_exception(const std::exception &exc) {
+    handle_std_exception(const std::exception &exc)
+    {
       // lock the following context
       // to ensure that we don't
       // print things over each other
@@ -70,7 +71,8 @@ namespace Threads
 
 
 
-      [[noreturn]] void handle_unknown_exception()
+    [[noreturn]] void
+    handle_unknown_exception()
     {
       // lock the following context
       // to ensure that we don't
index a7063bab270ebc33fed3d0e13751474bf2f8e127..86437226606c92ef7ef266fd9a6e444f806f63fb 100644 (file)
@@ -435,7 +435,8 @@ namespace Differentiation
     }
 
 
-    Expression operator!(const Expression &expression)
+    Expression
+    operator!(const Expression &expression)
     {
       Assert(SE::is_a_Boolean(expression.get_value()),
              ExcMessage("The expression must return a boolean type."));
@@ -447,7 +448,8 @@ namespace Differentiation
     }
 
 
-    Expression operator&(const Expression &lhs, const Expression &rhs)
+    Expression
+    operator&(const Expression &lhs, const Expression &rhs)
     {
       Assert(SE::is_a_Boolean(lhs.get_value()),
              ExcMessage("The lhs expression must return a boolean type."));
@@ -527,7 +529,8 @@ namespace Differentiation
     }
 
 
-    Expression operator*(Expression lhs, const Expression &rhs)
+    Expression
+    operator*(Expression lhs, const Expression &rhs)
     {
       lhs *= rhs;
       return lhs;
index 1f5372af68552aeefd6036852d9437f52a376049..10edf695e52798706f54bc2d3cd414be52f36397 100644 (file)
@@ -93,9 +93,10 @@ for (S : REAL_SCALARS; deal_II_dimension : DIMENSIONS)
       \{
         namespace GridRefinement
         \{
-          template void refine_and_coarsen_fixed_number<deal_II_dimension - 1,
-                                                        S,
-                                                        deal_II_dimension>(
+          template void
+          refine_and_coarsen_fixed_number<deal_II_dimension - 1,
+                                          S,
+                                          deal_II_dimension>(
             parallel::distributed::Triangulation<deal_II_dimension - 1,
                                                  deal_II_dimension> &,
             const dealii::Vector<S> &,
@@ -103,9 +104,10 @@ for (S : REAL_SCALARS; deal_II_dimension : DIMENSIONS)
             const double,
             const types::global_cell_index);
 
-          template void refine_and_coarsen_fixed_fraction<deal_II_dimension - 1,
-                                                          S,
-                                                          deal_II_dimension>(
+          template void
+          refine_and_coarsen_fixed_fraction<deal_II_dimension - 1,
+                                            S,
+                                            deal_II_dimension>(
             parallel::distributed::Triangulation<deal_II_dimension - 1,
                                                  deal_II_dimension> &,
             const dealii::Vector<S> &,
index b6b55b4e90c4afc6fc18d049afcaaf4d782afe6e..785e0bc9abe4df0ee28acedfcee1046e1e32b382 100644 (file)
@@ -878,8 +878,9 @@ namespace internal
 
 
     template <>
-    bool quadrant_is_ancestor<1>(types<1>::quadrant const &q1,
-                                 types<1>::quadrant const &q2)
+    bool
+    quadrant_is_ancestor<1>(types<1>::quadrant const &q1,
+                            types<1>::quadrant const &q2)
     {
       // determine level of quadrants
       const int level_1 = (q1 << types<1>::max_n_child_indices_bits) >>
@@ -926,7 +927,8 @@ namespace internal
 
 
     template <>
-    void init_coarse_quadrant<1>(typename types<1>::quadrant &quad)
+    void
+    init_coarse_quadrant<1>(typename types<1>::quadrant &quad)
     {
       quad = 0;
     }
index 6c660395ebc0e6fac65a8c5c4375633618636319..333e12acc5e05e0136cfeb6c5a68a71d94f02096 100644 (file)
@@ -1706,8 +1706,7 @@ namespace parallel
 #  ifndef DOXYGEN
 
     template <>
-    void
-    Triangulation<2, 2>::copy_new_triangulation_to_p4est(
+    void Triangulation<2, 2>::copy_new_triangulation_to_p4est(
       std::integral_constant<int, 2>)
     {
       const unsigned int dim = 2, spacedim = 2;
@@ -1773,8 +1772,7 @@ namespace parallel
     // TODO: This is a verbatim copy of the 2,2 case. However, we can't just
     // specialize the dim template argument, but let spacedim open
     template <>
-    void
-    Triangulation<2, 3>::copy_new_triangulation_to_p4est(
+    void Triangulation<2, 3>::copy_new_triangulation_to_p4est(
       std::integral_constant<int, 2>)
     {
       const unsigned int dim = 2, spacedim = 3;
@@ -1838,8 +1836,7 @@ namespace parallel
 
 
     template <>
-    void
-    Triangulation<3, 3>::copy_new_triangulation_to_p4est(
+    void Triangulation<3, 3>::copy_new_triangulation_to_p4est(
       std::integral_constant<int, 3>)
     {
       const int dim = 3, spacedim = 3;
@@ -2349,7 +2346,7 @@ namespace parallel
                   // comes out of this cell.
 
                   typename dealii::internal::p4est::types<dim>::quadrant
-                                                                      p4est_coarse_cell;
+                    p4est_coarse_cell;
                   typename dealii::internal::p4est::types<dim>::tree *tree =
                     init_tree(cell->index());
 
@@ -3144,7 +3141,7 @@ namespace parallel
               const unsigned int     second_dealii_idx_on_face =
                 lower_idx == 0 ? left_to_right[face_pair.orientation.to_ulong()]
                                               [first_dealii_idx_on_face] :
-                                 right_to_left[face_pair.orientation.to_ulong()]
+                                     right_to_left[face_pair.orientation.to_ulong()]
                                               [first_dealii_idx_on_face];
               const unsigned int second_dealii_idx_on_cell =
                 GeometryInfo<dim>::face_to_cell_vertices(
index ade43ed966780625bbcd72dbcc6a71a0ab8fc510..e403dd2dfe2f6c3a7929222d6f414cc4b0bbcdf9 100644 (file)
@@ -444,7 +444,8 @@ namespace internal
       }
 
       template <int spacedim>
-      static void reserve_space_mg(DoFHandler<1, spacedim> &dof_handler)
+      static void
+      reserve_space_mg(DoFHandler<1, spacedim> &dof_handler)
       {
         Assert(dof_handler.get_triangulation().n_levels() > 0,
                ExcMessage("Invalid triangulation"));
@@ -513,7 +514,8 @@ namespace internal
       }
 
       template <int spacedim>
-      static void reserve_space_mg(DoFHandler<2, spacedim> &dof_handler)
+      static void
+      reserve_space_mg(DoFHandler<2, spacedim> &dof_handler)
       {
         Assert(dof_handler.get_triangulation().n_levels() > 0,
                ExcMessage("Invalid triangulation"));
@@ -589,7 +591,8 @@ namespace internal
       }
 
       template <int spacedim>
-      static void reserve_space_mg(DoFHandler<3, spacedim> &dof_handler)
+      static void
+      reserve_space_mg(DoFHandler<3, spacedim> &dof_handler)
       {
         Assert(dof_handler.get_triangulation().n_levels() > 0,
                ExcMessage("Invalid triangulation"));
@@ -1451,7 +1454,8 @@ namespace internal
          * selected when calling @p distribute_dofs the last time.
          */
         template <int spacedim>
-        static void reserve_space(dealii::DoFHandler<1, spacedim> &dof_handler)
+        static void
+        reserve_space(dealii::DoFHandler<1, spacedim> &dof_handler)
         {
           Assert(dof_handler.fe_collection.size() > 0,
                  (typename dealii::DoFHandler<1, spacedim>::ExcNoFESelected()));
@@ -1475,7 +1479,8 @@ namespace internal
 
 
         template <int spacedim>
-        static void reserve_space(dealii::DoFHandler<2, spacedim> &dof_handler)
+        static void
+        reserve_space(dealii::DoFHandler<2, spacedim> &dof_handler)
         {
           Assert(dof_handler.fe_collection.size() > 0,
                  (typename dealii::DoFHandler<1, spacedim>::ExcNoFESelected()));
@@ -1501,7 +1506,8 @@ namespace internal
 
 
         template <int spacedim>
-        static void reserve_space(dealii::DoFHandler<3, spacedim> &dof_handler)
+        static void
+        reserve_space(dealii::DoFHandler<3, spacedim> &dof_handler)
         {
           Assert(dof_handler.fe_collection.size() > 0,
                  (typename dealii::DoFHandler<1, spacedim>::ExcNoFESelected()));
index afd2b02e33451448f82488575a034e38a4664d60..7bd7d3699adb5bc9b467b9f1c4db6ad653a9818e 100644 (file)
@@ -1216,7 +1216,8 @@ namespace internal
          * by a dominating valid one.
          */
         template <int spacedim>
-        static void merge_invalid_line_dofs_on_ghost_interfaces(
+        static void
+        merge_invalid_line_dofs_on_ghost_interfaces(
           DoFHandler<1, spacedim> &dof_handler)
         {
           (void)dof_handler;
@@ -1505,7 +1506,8 @@ namespace internal
 
 
         template <int spacedim>
-        static void merge_invalid_quad_dofs_on_ghost_interfaces(
+        static void
+        merge_invalid_quad_dofs_on_ghost_interfaces(
           DoFHandler<3, spacedim> &dof_handler)
         {
           Assert(dof_handler.hp_capability_enabled == true,
index 16d1f304cd45da65066e1a75a4b6f44b5c6c8891..46a67c8d9b1ea70dd663fa180f4ab2f967c4880d 100644 (file)
@@ -601,7 +601,7 @@ namespace DoFRenumbering
               my_new_indices.size());
             {
               std::set<types::global_dof_index>::const_iterator
-                                      next_erased_index = erase_these_indices.begin();
+                next_erased_index = erase_these_indices.begin();
               types::global_dof_index next_new_index = 0;
               for (unsigned int i = 0; i < translate_indices.size(); ++i)
                 if ((next_erased_index != erase_these_indices.end()) &&
index f6ff33e1c087c22c472e78117416e82464434b53..e58b252a73a7e906f34f6ea83a801b39179c4316 100644 (file)
@@ -1021,8 +1021,8 @@ FiniteElement<dim, spacedim>::compare_for_domination(
 
 template <int dim, int spacedim>
 bool
-FiniteElement<dim, spacedim>::
-operator==(const FiniteElement<dim, spacedim> &f) const
+FiniteElement<dim, spacedim>::operator==(
+  const FiniteElement<dim, spacedim> &f) const
 {
   // Compare fields in roughly increasing order of how expensive the
   // comparison is
@@ -1036,8 +1036,8 @@ operator==(const FiniteElement<dim, spacedim> &f) const
 
 template <int dim, int spacedim>
 bool
-FiniteElement<dim, spacedim>::
-operator!=(const FiniteElement<dim, spacedim> &f) const
+FiniteElement<dim, spacedim>::operator!=(
+  const FiniteElement<dim, spacedim> &f) const
 {
   return !(*this == f);
 }
index 8677b5dbad71d373e6c8e64d38ade00afcda3def..677fa68973dace9f687cc0876ab198015d08ec42 100644 (file)
@@ -3238,7 +3238,7 @@ FE_Nedelec<dim>::convert_generalized_support_point_values_to_dof_values(
               system_matrix_inv.invert(system_matrix);
 
               const unsigned int
-                             line_coordinate[GeometryInfo<2>::lines_per_cell] = {1, 1, 0, 0};
+                line_coordinate[GeometryInfo<2>::lines_per_cell] = {1, 1, 0, 0};
               Vector<double> system_rhs(system_matrix.m());
               Vector<double> solution(system_rhs.size());
 
index cbd57264a651df405cc23651a112b17d39b336ce..465883228ce96ca33dd3bf1366ac1a5516f5d19c 100644 (file)
@@ -27,14 +27,16 @@ DEAL_II_NAMESPACE_OPEN
 
 namespace
 {
-  void set_k_vectors(Table<1, Tensor<1, 1>> &k_vectors, const unsigned int N)
+  void
+  set_k_vectors(Table<1, Tensor<1, 1>> &k_vectors, const unsigned int N)
   {
     k_vectors.reinit(TableIndices<1>(N));
     for (unsigned int i = 0; i < N; ++i)
       k_vectors(i)[0] = 2. * numbers::PI * i;
   }
 
-  void set_k_vectors(Table<2, Tensor<1, 2>> &k_vectors, const unsigned int N)
+  void
+  set_k_vectors(Table<2, Tensor<1, 2>> &k_vectors, const unsigned int N)
   {
     k_vectors.reinit(TableIndices<2>(N, N));
     for (unsigned int i = 0; i < N; ++i)
@@ -45,7 +47,8 @@ namespace
         }
   }
 
-  void set_k_vectors(Table<3, Tensor<1, 3>> &k_vectors, const unsigned int N)
+  void
+  set_k_vectors(Table<3, Tensor<1, 3>> &k_vectors, const unsigned int N)
   {
     k_vectors.reinit(TableIndices<3>(N, N, N));
     for (unsigned int i = 0; i < N; ++i)
@@ -224,8 +227,8 @@ namespace FESeries
 
   template <int dim, int spacedim>
   inline bool
-  Fourier<dim, spacedim>::
-  operator==(const Fourier<dim, spacedim> &fourier) const
+  Fourier<dim, spacedim>::operator==(
+    const Fourier<dim, spacedim> &fourier) const
   {
     return (
       (n_coefficients_per_direction == fourier.n_coefficients_per_direction) &&
index 14200e6f526cda0f10e299b9e40bc2582cc05de9..10558399dbb6d61825a8cffaf3b235032d4d496a 100644 (file)
@@ -233,8 +233,8 @@ namespace FESeries
 
   template <int dim, int spacedim>
   inline bool
-  Legendre<dim, spacedim>::
-  operator==(const Legendre<dim, spacedim> &legendre) const
+  Legendre<dim, spacedim>::operator==(
+    const Legendre<dim, spacedim> &legendre) const
   {
     return (
       (n_coefficients_per_direction == legendre.n_coefficients_per_direction) &&
index 9c53bb9a4878d5fe439e22b5f3b30d22beb5df60..5aeb6c603d2b57a47f67bb1a8223a2723d0d67db 100644 (file)
@@ -1242,8 +1242,8 @@ FESystem<dim, spacedim>::compute_fill(
         const hp::QCollection<dim - 1> *face_quadrature     = nullptr;
         const Quadrature<dim - 1> *     sub_face_quadrature = nullptr;
         const unsigned int              n_q_points = quadrature.size() == 1 ?
-                                          quadrature[0].size() :
-                                          quadrature[face_no].size();
+                                                       quadrature[0].size() :
+                                                       quadrature[face_no].size();
 
         // static cast to the common base class of quadrature being either
         // Quadrature<dim> or Quadrature<dim-1>:
index 4a058f1f3e1b0d2f382f84e82e023d57ed1b64f1..c67f21b627979dad1f614cb50c3db9db0747cdd4 100644 (file)
@@ -2765,8 +2765,8 @@ FEValuesBase<dim, spacedim>::CellIterator<CI>::CellIterator(const CI &cell)
 
 template <int dim, int spacedim>
 template <typename CI>
-FEValuesBase<dim, spacedim>::CellIterator<CI>::
-operator typename Triangulation<dim, spacedim>::cell_iterator() const
+FEValuesBase<dim, spacedim>::CellIterator<
+  CI>::operator typename Triangulation<dim, spacedim>::cell_iterator() const
 {
   return cell;
 }
index 5c106dedcb60561c5f36f094d43a88831c89c187..3b16a492b587bb3a516b32fd4ee02efe6442e546 100644 (file)
@@ -263,15 +263,16 @@ MappingQCache<dim, spacedim>::initialize(
 {
   AssertDimension(transformation_function.n_components, spacedim);
 
-  this->initialize(mapping,
-                   tria,
-                   [&](const auto &, const auto &point) {
-                     Point<spacedim> new_point;
-                     for (int c = 0; c < spacedim; ++c)
-                       new_point[c] = transformation_function.value(point, c);
-                     return new_point;
-                   },
-                   function_describes_relative_displacement);
+  this->initialize(
+    mapping,
+    tria,
+    [&](const auto &, const auto &point) {
+      Point<spacedim> new_point;
+      for (int c = 0; c < spacedim; ++c)
+        new_point[c] = transformation_function.value(point, c);
+      return new_point;
+    },
+    function_describes_relative_displacement);
 
   uses_level_info = true;
 }
index 81fdd1eef02ef80e286007392507574e70478605..b7447e2d90415e26c743b696fde290f7f8047475 100644 (file)
@@ -235,7 +235,8 @@ namespace GridGenerator
         /**
          * Create a serial/parallel distributed triangulation.
          */
-        void create_triangulation(
+        void
+        create_triangulation(
           Triangulation<2> &                            tria_grid,
           std::vector<GridTools::PeriodicFacePair<
             typename Triangulation<2>::cell_iterator>> *periodic_faces) const
@@ -258,7 +259,8 @@ namespace GridGenerator
         /**
          * Specialization for parallel fully-distributed triangulations.
          */
-        void create_triangulation(
+        void
+        create_triangulation(
           parallel::fullydistributed::Triangulation<2> &parallel_grid,
           std::vector<GridTools::PeriodicFacePair<
             typename Triangulation<2>::cell_iterator>> *periodic_faces) const
@@ -815,7 +817,8 @@ namespace GridGenerator
          * Create 6 coarse grids based on points A-L (class fields) and merges
          * them to one triangulation.
          */
-        void make_coarse_grid(Triangulation<2> &tria) const
+        void
+        make_coarse_grid(Triangulation<2> &tria) const
         {
           // create vector of serial triangulations for each block and
           // temporary storage for merging them
@@ -900,7 +903,8 @@ namespace GridGenerator
          * - 4: upper far-field side
          * - 5: lower far-field side
          */
-        static void set_boundary_ids(Triangulation<2> &tria)
+        static void
+        set_boundary_ids(Triangulation<2> &tria)
         {
           for (auto cell : tria.active_cell_iterators())
             for (unsigned int f : GeometryInfo<2>::face_indices())
@@ -943,7 +947,8 @@ namespace GridGenerator
          * dense mesh next to airfoil geometry and receive an inclined boundary
          * between block 2&3 and 5&6, respectively
          */
-        void interpolate(Triangulation<2> &tria) const
+        void
+        interpolate(Triangulation<2> &tria) const
         {
           // array storing the information if a vertex was processed
           std::vector<bool> vertex_processed(tria.n_vertices(), false);
@@ -1148,7 +1153,8 @@ namespace GridGenerator
 
 
 
-    void internal_create_triangulation(
+    void
+    internal_create_triangulation(
       Triangulation<2, 2> &                            tria,
       std::vector<GridTools::PeriodicFacePair<
         typename Triangulation<2, 2>::cell_iterator>> *periodic_faces,
@@ -1170,7 +1176,8 @@ namespace GridGenerator
     }
 
     template <>
-    void create_triangulation(Triangulation<1, 1> &, const AdditionalData &)
+    void
+    create_triangulation(Triangulation<1, 1> &, const AdditionalData &)
     {
       Assert(false, ExcMessage("Airfoils only exist for 2D and 3D!"));
     }
@@ -1178,10 +1185,11 @@ namespace GridGenerator
 
 
     template <>
-    void create_triangulation(Triangulation<1, 1> &,
-                              std::vector<GridTools::PeriodicFacePair<
-                                typename Triangulation<1, 1>::cell_iterator>> &,
-                              const AdditionalData &)
+    void
+    create_triangulation(Triangulation<1, 1> &,
+                         std::vector<GridTools::PeriodicFacePair<
+                           typename Triangulation<1, 1>::cell_iterator>> &,
+                         const AdditionalData &)
     {
       Assert(false, ExcMessage("Airfoils only exist for 2D and 3D!"));
     }
@@ -1189,8 +1197,9 @@ namespace GridGenerator
 
 
     template <>
-    void create_triangulation(Triangulation<2, 2> & tria,
-                              const AdditionalData &additional_data)
+    void
+    create_triangulation(Triangulation<2, 2> & tria,
+                         const AdditionalData &additional_data)
     {
       internal_create_triangulation(tria, nullptr, additional_data);
     }
@@ -1198,7 +1207,8 @@ namespace GridGenerator
 
 
     template <>
-    void create_triangulation(
+    void
+    create_triangulation(
       Triangulation<2, 2> &                            tria,
       std::vector<GridTools::PeriodicFacePair<
         typename Triangulation<2, 2>::cell_iterator>> &periodic_faces,
@@ -1210,7 +1220,8 @@ namespace GridGenerator
 
 
     template <>
-    void create_triangulation(
+    void
+    create_triangulation(
       Triangulation<3, 3> &                            tria,
       std::vector<GridTools::PeriodicFacePair<
         typename Triangulation<3, 3>::cell_iterator>> &periodic_faces,
@@ -1249,10 +1260,11 @@ namespace GridGenerator
 
 
     template <int spacedim>
-    void colorize_subdivided_hyper_rectangle(Triangulation<1, spacedim> &tria,
-                                             const Point<spacedim> &,
-                                             const Point<spacedim> &,
-                                             const double)
+    void
+    colorize_subdivided_hyper_rectangle(Triangulation<1, spacedim> &tria,
+                                        const Point<spacedim> &,
+                                        const Point<spacedim> &,
+                                        const double)
     {
       for (typename Triangulation<1, spacedim>::cell_iterator cell =
              tria.begin();
@@ -1325,10 +1337,11 @@ namespace GridGenerator
      * Assign boundary number zero to the inner shell boundary and 1 to the
      * outer.
      */
-    void colorize_hyper_shell(Triangulation<2> &tria,
-                              const Point<2> &,
-                              const double,
-                              const double)
+    void
+    colorize_hyper_shell(Triangulation<2> &tria,
+                         const Point<2> &,
+                         const double,
+                         const double)
     {
       // In spite of receiving geometrical
       // data, we do this only based on
@@ -1350,10 +1363,11 @@ namespace GridGenerator
      * Assign boundary number zero to the inner shell boundary and 1 to the
      * outer.
      */
-    void colorize_hyper_shell(Triangulation<3> &tria,
-                              const Point<3> &,
-                              const double,
-                              const double)
+    void
+    colorize_hyper_shell(Triangulation<3> &tria,
+                         const Point<3> &,
+                         const double,
+                         const double)
     {
       // the following uses a good amount
       // of knowledge about the
@@ -1433,10 +1447,11 @@ namespace GridGenerator
      * shell boundary, two to the face with x=0, three to the face with y=0,
      * four to the face with z=0.
      */
-    void colorize_quarter_hyper_shell(Triangulation<3> &tria,
-                                      const Point<3> &  center,
-                                      const double      inner_radius,
-                                      const double      outer_radius)
+    void
+    colorize_quarter_hyper_shell(Triangulation<3> &tria,
+                                 const Point<3> &  center,
+                                 const double      inner_radius,
+                                 const double      outer_radius)
     {
       if (tria.n_cells() != 3)
         AssertThrow(false, ExcNotImplemented());
@@ -1792,11 +1807,12 @@ namespace GridGenerator
       }
   }
 
-  void moebius(Triangulation<3> & tria,
-               const unsigned int n_cells,
-               const unsigned int n_rotations,
-               const double       R,
-               const double       r)
+  void
+  moebius(Triangulation<3> & tria,
+          const unsigned int n_cells,
+          const unsigned int n_rotations,
+          const double       R,
+          const double       r)
   {
     const unsigned int dim = 3;
     Assert(n_cells > 4,
@@ -1867,11 +1883,12 @@ namespace GridGenerator
 
 
   template <>
-  void torus<2, 3>(Triangulation<2, 3> &tria,
-                   const double         R,
-                   const double         r,
-                   const unsigned int,
-                   const double)
+  void
+  torus<2, 3>(Triangulation<2, 3> &tria,
+              const double         R,
+              const double         r,
+              const unsigned int,
+              const double)
   {
     Assert(R > r,
            ExcMessage("Outer radius R must be greater than the inner "
@@ -2007,11 +2024,12 @@ namespace GridGenerator
 
 
   template <>
-  void torus<3, 3>(Triangulation<3, 3> &tria,
-                   const double         R,
-                   const double         r,
-                   const unsigned int   n_cells_toroidal,
-                   const double         phi)
+  void
+  torus<3, 3>(Triangulation<3, 3> &tria,
+              const double         R,
+              const double         r,
+              const unsigned int   n_cells_toroidal,
+              const double         phi)
   {
     Assert(R > r,
            ExcMessage("Outer radius R must be greater than the inner "
@@ -2168,26 +2186,29 @@ namespace GridGenerator
 
 
   template <>
-  void parallelogram(Triangulation<3> &,
-                     const Point<3> (&/*corners*/)[3],
-                     const bool /*colorize*/)
+  void
+  parallelogram(Triangulation<3> &,
+                const Point<3> (&/*corners*/)[3],
+                const bool /*colorize*/)
   {
     Assert(false, ExcNotImplemented());
   }
 
   template <>
-  void parallelogram(Triangulation<1> &,
-                     const Point<1> (&/*corners*/)[1],
-                     const bool /*colorize*/)
+  void
+  parallelogram(Triangulation<1> &,
+                const Point<1> (&/*corners*/)[1],
+                const bool /*colorize*/)
   {
     Assert(false, ExcNotImplemented());
   }
 
   // Implementation for 2D only
   template <>
-  void parallelogram(Triangulation<2> &tria,
-                     const Point<2> (&corners)[2],
-                     const bool colorize)
+  void
+  parallelogram(Triangulation<2> &tria,
+                const Point<2> (&corners)[2],
+                const bool colorize)
   {
     Point<2>                    origin;
     std::array<Tensor<1, 2>, 2> edges;
@@ -2894,11 +2915,11 @@ namespace GridGenerator
 
   template <>
   void
-    subdivided_hyper_rectangle(Triangulation<1> &                      tria,
-                               const std::vector<std::vector<double>> &spacing,
-                               const Point<1> &                        p,
-                               const Table<1, types::material_id> &material_id,
-                               const bool                          colorize)
+  subdivided_hyper_rectangle(Triangulation<1> &                      tria,
+                             const std::vector<std::vector<double>> &spacing,
+                             const Point<1> &                        p,
+                             const Table<1, types::material_id> &material_id,
+                             const bool                          colorize)
   {
     Assert(spacing.size() == 1, ExcInvalidRepetitionsDimension(1));
 
@@ -2952,11 +2973,11 @@ namespace GridGenerator
 
   template <>
   void
-    subdivided_hyper_rectangle(Triangulation<2> &                      tria,
-                               const std::vector<std::vector<double>> &spacing,
-                               const Point<2> &                        p,
-                               const Table<2, types::material_id> &material_id,
-                               const bool                          colorize)
+  subdivided_hyper_rectangle(Triangulation<2> &                      tria,
+                             const std::vector<std::vector<double>> &spacing,
+                             const Point<2> &                        p,
+                             const Table<2, types::material_id> &material_id,
+                             const bool                          colorize)
   {
     Assert(spacing.size() == 2, ExcInvalidRepetitionsDimension(2));
 
@@ -3046,11 +3067,11 @@ namespace GridGenerator
 
   template <>
   void
-    subdivided_hyper_rectangle(Triangulation<3> &                      tria,
-                               const std::vector<std::vector<double>> &spacing,
-                               const Point<3> &                        p,
-                               const Table<3, types::material_id> &material_id,
-                               const bool                          colorize)
+  subdivided_hyper_rectangle(Triangulation<3> &                      tria,
+                             const std::vector<std::vector<double>> &spacing,
+                             const Point<3> &                        p,
+                             const Table<3, types::material_id> &material_id,
+                             const bool                          colorize)
   {
     const unsigned int dim = 3;
 
@@ -3275,19 +3296,20 @@ namespace GridGenerator
 
 
   template <>
-  void plate_with_a_hole(Triangulation<1> & /*tria*/,
-                         const double /*inner_radius*/,
-                         const double /*outer_radius*/,
-                         const double /*pad_bottom*/,
-                         const double /*pad_top*/,
-                         const double /*pad_left*/,
-                         const double /*pad_right*/,
-                         const Point<1> & /*center*/,
-                         const types::manifold_id /*polar_manifold_id*/,
-                         const types::manifold_id /*tfi_manifold_id*/,
-                         const double /*L*/,
-                         const unsigned int /*n_slices*/,
-                         const bool /*colorize*/)
+  void
+  plate_with_a_hole(Triangulation<1> & /*tria*/,
+                    const double /*inner_radius*/,
+                    const double /*outer_radius*/,
+                    const double /*pad_bottom*/,
+                    const double /*pad_top*/,
+                    const double /*pad_left*/,
+                    const double /*pad_right*/,
+                    const Point<1> & /*center*/,
+                    const types::manifold_id /*polar_manifold_id*/,
+                    const types::manifold_id /*tfi_manifold_id*/,
+                    const double /*L*/,
+                    const unsigned int /*n_slices*/,
+                    const bool /*colorize*/)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3295,11 +3317,12 @@ namespace GridGenerator
 
 
   template <>
-  void channel_with_cylinder(Triangulation<1> & /*tria*/,
-                             const double /*shell_region_width*/,
-                             const unsigned int /*n_shells*/,
-                             const double /*skewness*/,
-                             const bool /*colorize*/)
+  void
+  channel_with_cylinder(Triangulation<1> & /*tria*/,
+                        const double /*shell_region_width*/,
+                        const unsigned int /*n_shells*/,
+                        const double /*skewness*/,
+                        const bool /*colorize*/)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3337,19 +3360,20 @@ namespace GridGenerator
 
 
   template <>
-  void plate_with_a_hole(Triangulation<2> &       tria,
-                         const double             inner_radius,
-                         const double             outer_radius,
-                         const double             pad_bottom,
-                         const double             pad_top,
-                         const double             pad_left,
-                         const double             pad_right,
-                         const Point<2> &         new_center,
-                         const types::manifold_id polar_manifold_id,
-                         const types::manifold_id tfi_manifold_id,
-                         const double             L,
-                         const unsigned int /*n_slices*/,
-                         const bool colorize)
+  void
+  plate_with_a_hole(Triangulation<2> &       tria,
+                    const double             inner_radius,
+                    const double             outer_radius,
+                    const double             pad_bottom,
+                    const double             pad_top,
+                    const double             pad_left,
+                    const double             pad_right,
+                    const Point<2> &         new_center,
+                    const types::manifold_id polar_manifold_id,
+                    const types::manifold_id tfi_manifold_id,
+                    const double             L,
+                    const unsigned int /*n_slices*/,
+                    const bool colorize)
   {
     const bool with_padding =
       pad_bottom > 0 || pad_top > 0 || pad_left > 0 || pad_right > 0;
@@ -3520,19 +3544,20 @@ namespace GridGenerator
 
 
   template <>
-  void plate_with_a_hole(Triangulation<3> &       tria,
-                         const double             inner_radius,
-                         const double             outer_radius,
-                         const double             pad_bottom,
-                         const double             pad_top,
-                         const double             pad_left,
-                         const double             pad_right,
-                         const Point<3> &         new_center,
-                         const types::manifold_id polar_manifold_id,
-                         const types::manifold_id tfi_manifold_id,
-                         const double             L,
-                         const unsigned int       n_slices,
-                         const bool               colorize)
+  void
+  plate_with_a_hole(Triangulation<3> &       tria,
+                    const double             inner_radius,
+                    const double             outer_radius,
+                    const double             pad_bottom,
+                    const double             pad_top,
+                    const double             pad_left,
+                    const double             pad_right,
+                    const Point<3> &         new_center,
+                    const types::manifold_id polar_manifold_id,
+                    const types::manifold_id tfi_manifold_id,
+                    const double             L,
+                    const unsigned int       n_slices,
+                    const bool               colorize)
   {
     Triangulation<2> tria_2;
     plate_with_a_hole(tria_2,
@@ -3569,11 +3594,12 @@ namespace GridGenerator
 
 
   template <>
-  void channel_with_cylinder(Triangulation<2> & tria,
-                             const double       shell_region_width,
-                             const unsigned int n_shells,
-                             const double       skewness,
-                             const bool         colorize)
+  void
+  channel_with_cylinder(Triangulation<2> & tria,
+                        const double       shell_region_width,
+                        const unsigned int n_shells,
+                        const double       skewness,
+                        const bool         colorize)
   {
     Assert(0.0 <= shell_region_width && shell_region_width < 0.05,
            ExcMessage("The width of the shell region must be less than 0.05 "
@@ -3798,11 +3824,12 @@ namespace GridGenerator
 
 
   template <>
-  void channel_with_cylinder(Triangulation<3> & tria,
-                             const double       shell_region_width,
-                             const unsigned int n_shells,
-                             const double       skewness,
-                             const bool         colorize)
+  void
+  channel_with_cylinder(Triangulation<3> & tria,
+                        const double       shell_region_width,
+                        const unsigned int n_shells,
+                        const double       skewness,
+                        const bool         colorize)
   {
     Triangulation<2> tria_2;
     channel_with_cylinder(
@@ -3912,7 +3939,7 @@ namespace GridGenerator
 
   template <>
   void
-    hyper_cube_slit(Triangulation<1> &, const double, const double, const bool)
+  hyper_cube_slit(Triangulation<1> &, const double, const double, const bool)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3920,11 +3947,12 @@ namespace GridGenerator
 
 
   template <>
-  void enclosed_hyper_cube(Triangulation<1> &,
-                           const double,
-                           const double,
-                           const double,
-                           const bool)
+  void
+  enclosed_hyper_cube(Triangulation<1> &,
+                      const double,
+                      const double,
+                      const double,
+                      const bool)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3932,7 +3960,8 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_L(Triangulation<1> &, const double, const double, const bool)
+  void
+  hyper_L(Triangulation<1> &, const double, const double, const bool)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3941,7 +3970,7 @@ namespace GridGenerator
 
   template <>
   void
-    hyper_ball(Triangulation<1> &, const Point<1> &, const double, const bool)
+  hyper_ball(Triangulation<1> &, const Point<1> &, const double, const bool)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3949,17 +3978,19 @@ namespace GridGenerator
 
 
   template <>
-  void cylinder(Triangulation<1> &, const double, const double)
+  void
+  cylinder(Triangulation<1> &, const double, const double)
   {
     Assert(false, ExcNotImplemented());
   }
 
 
   template <>
-  void subdivided_cylinder(Triangulation<1> &,
-                           const unsigned int,
-                           const double,
-                           const double)
+  void
+  subdivided_cylinder(Triangulation<1> &,
+                      const unsigned int,
+                      const double,
+                      const double)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3968,7 +3999,7 @@ namespace GridGenerator
 
   template <>
   void
-    truncated_cone(Triangulation<1> &, const double, const double, const double)
+  truncated_cone(Triangulation<1> &, const double, const double, const double)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -3976,70 +4007,77 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_shell(Triangulation<1> &,
-                   const Point<1> &,
-                   const double,
-                   const double,
-                   const unsigned int,
-                   const bool)
+  void
+  hyper_shell(Triangulation<1> &,
+              const Point<1> &,
+              const double,
+              const double,
+              const unsigned int,
+              const bool)
   {
     Assert(false, ExcNotImplemented());
   }
 
   template <>
-  void cylinder_shell(Triangulation<1> &,
-                      const double,
-                      const double,
-                      const double,
-                      const unsigned int,
-                      const unsigned int)
+  void
+  cylinder_shell(Triangulation<1> &,
+                 const double,
+                 const double,
+                 const double,
+                 const unsigned int,
+                 const unsigned int)
   {
     Assert(false, ExcNotImplemented());
   }
 
 
   template <>
-  void quarter_hyper_ball(Triangulation<1> &, const Point<1> &, const double)
+  void
+  quarter_hyper_ball(Triangulation<1> &, const Point<1> &, const double)
   {
     Assert(false, ExcNotImplemented());
   }
 
 
   template <>
-  void half_hyper_ball(Triangulation<1> &, const Point<1> &, const double)
+  void
+  half_hyper_ball(Triangulation<1> &, const Point<1> &, const double)
   {
     Assert(false, ExcNotImplemented());
   }
 
 
   template <>
-  void half_hyper_shell(Triangulation<1> &,
-                        const Point<1> &,
-                        const double,
-                        const double,
-                        const unsigned int,
-                        const bool)
+  void
+  half_hyper_shell(Triangulation<1> &,
+                   const Point<1> &,
+                   const double,
+                   const double,
+                   const unsigned int,
+                   const bool)
   {
     Assert(false, ExcNotImplemented());
   }
 
   template <>
-  void quarter_hyper_shell(Triangulation<1> &,
-                           const Point<1> &,
-                           const double,
-                           const double,
-                           const unsigned int,
-                           const bool)
+  void
+  quarter_hyper_shell(Triangulation<1> &,
+                      const Point<1> &,
+                      const double,
+                      const double,
+                      const unsigned int,
+                      const bool)
   {
     Assert(false, ExcNotImplemented());
   }
 
   template <>
-  void enclosed_hyper_cube(Triangulation<2> &tria,
-                           const double      left,
-                           const double      right,
-                           const double      thickness,
-                           const bool        colorize)
+  void
+  enclosed_hyper_cube(Triangulation<2> &tria,
+                      const double      left,
+                      const double      right,
+                      const double      thickness,
+                      const bool        colorize)
   {
     Assert(left < right,
            ExcMessage("Invalid left-to-right bounds of enclosed hypercube"));
@@ -4080,10 +4118,11 @@ namespace GridGenerator
 
   // Implementation for 2D only
   template <>
-  void hyper_cube_slit(Triangulation<2> &tria,
-                       const double      left,
-                       const double      right,
-                       const bool        colorize)
+  void
+  hyper_cube_slit(Triangulation<2> &tria,
+                  const double      left,
+                  const double      right,
+                  const bool        colorize)
   {
     const double             rl2                 = (right + left) / 2;
     const Point<2>           vertices[10]        = {Point<2>(left, left),
@@ -4124,10 +4163,11 @@ namespace GridGenerator
 
 
   template <>
-  void truncated_cone(Triangulation<2> &triangulation,
-                      const double      radius_0,
-                      const double      radius_1,
-                      const double      half_length)
+  void
+  truncated_cone(Triangulation<2> &triangulation,
+                 const double      radius_0,
+                 const double      radius_1,
+                 const double      half_length)
   {
     Point<2> vertices_tmp[4];
 
@@ -4164,10 +4204,11 @@ namespace GridGenerator
 
   // Implementation for 2D only
   template <>
-  void hyper_L(Triangulation<2> &tria,
-               const double      a,
-               const double      b,
-               const bool        colorize)
+  void
+  hyper_L(Triangulation<2> &tria,
+          const double      a,
+          const double      b,
+          const bool        colorize)
   {
     const Point<2> vertices[8]    = {Point<2>(a, a),
                                   Point<2>((a + b) / 2, a),
@@ -4287,10 +4328,11 @@ namespace GridGenerator
 
   // Implementation for 2D only
   template <>
-  void hyper_ball(Triangulation<2> &tria,
-                  const Point<2> &  p,
-                  const double      radius,
-                  const bool        internal_manifolds)
+  void
+  hyper_ball(Triangulation<2> &tria,
+             const Point<2> &  p,
+             const double      radius,
+             const bool        internal_manifolds)
   {
     // equilibrate cell sizes at
     // transition from the inner part
@@ -4332,12 +4374,13 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_shell(Triangulation<2> & tria,
-                   const Point<2> &   center,
-                   const double       inner_radius,
-                   const double       outer_radius,
-                   const unsigned int n_cells,
-                   const bool         colorize)
+  void
+  hyper_shell(Triangulation<2> & tria,
+              const Point<2> &   center,
+              const double       inner_radius,
+              const double       outer_radius,
+              const unsigned int n_cells,
+              const bool         colorize)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -4454,9 +4497,10 @@ namespace GridGenerator
 
   // Implementation for 2D only
   template <>
-  void cylinder(Triangulation<2> &tria,
-                const double      radius,
-                const double      half_length)
+  void
+  cylinder(Triangulation<2> &tria,
+           const double      radius,
+           const double      half_length)
   {
     Point<2> p1(-half_length, -radius);
     Point<2> p2(half_length, radius);
@@ -4484,10 +4528,11 @@ namespace GridGenerator
   }
 
   template <>
-  void subdivided_cylinder(Triangulation<2> &,
-                           const unsigned int,
-                           const double,
-                           const double)
+  void
+  subdivided_cylinder(Triangulation<2> &,
+                      const unsigned int,
+                      const double,
+                      const double)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -4496,21 +4541,23 @@ namespace GridGenerator
 
   // Implementation for 2D only
   template <>
-  void cylinder_shell(Triangulation<2> &,
-                      const double,
-                      const double,
-                      const double,
-                      const unsigned int,
-                      const unsigned int)
+  void
+  cylinder_shell(Triangulation<2> &,
+                 const double,
+                 const double,
+                 const double,
+                 const unsigned int,
+                 const unsigned int)
   {
     Assert(false, ExcNotImplemented());
   }
 
 
   template <>
-  void quarter_hyper_ball(Triangulation<2> &tria,
-                          const Point<2> &  p,
-                          const double      radius)
+  void
+  quarter_hyper_ball(Triangulation<2> &tria,
+                     const Point<2> &  p,
+                     const double      radius)
   {
     const unsigned int dim = 2;
 
@@ -4571,9 +4618,10 @@ namespace GridGenerator
 
 
   template <>
-  void half_hyper_ball(Triangulation<2> &tria,
-                       const Point<2> &  p,
-                       const double      radius)
+  void
+  half_hyper_ball(Triangulation<2> &tria,
+                  const Point<2> &  p,
+                  const double      radius)
   {
     // equilibrate cell sizes at
     // transition from the inner part
@@ -4637,12 +4685,13 @@ namespace GridGenerator
 
   // Implementation for 2D only
   template <>
-  void half_hyper_shell(Triangulation<2> & tria,
-                        const Point<2> &   center,
-                        const double       inner_radius,
-                        const double       outer_radius,
-                        const unsigned int n_cells,
-                        const bool         colorize)
+  void
+  half_hyper_shell(Triangulation<2> & tria,
+                   const Point<2> &   center,
+                   const double       inner_radius,
+                   const double       outer_radius,
+                   const unsigned int n_cells,
+                   const bool         colorize)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -4720,12 +4769,13 @@ namespace GridGenerator
 
 
   template <>
-  void quarter_hyper_shell(Triangulation<2> & tria,
-                           const Point<2> &   center,
-                           const double       inner_radius,
-                           const double       outer_radius,
-                           const unsigned int n_cells,
-                           const bool         colorize)
+  void
+  quarter_hyper_shell(Triangulation<2> & tria,
+                      const Point<2> &   center,
+                      const double       inner_radius,
+                      const double       outer_radius,
+                      const unsigned int n_cells,
+                      const bool         colorize)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -4804,10 +4854,11 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void hyper_cube_slit(Triangulation<3> &tria,
-                       const double      left,
-                       const double      right,
-                       const bool        colorize)
+  void
+  hyper_cube_slit(Triangulation<3> &tria,
+                  const double      left,
+                  const double      right,
+                  const bool        colorize)
   {
     const double rl2 = (right + left) / 2;
     const double len = (right - left) / 2.;
@@ -4852,11 +4903,12 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void enclosed_hyper_cube(Triangulation<3> &tria,
-                           const double      left,
-                           const double      right,
-                           const double      thickness,
-                           const bool        colorize)
+  void
+  enclosed_hyper_cube(Triangulation<3> &tria,
+                      const double      left,
+                      const double      right,
+                      const double      thickness,
+                      const bool        colorize)
   {
     Assert(left < right,
            ExcMessage("Invalid left-to-right bounds of enclosed hypercube"));
@@ -4905,10 +4957,11 @@ namespace GridGenerator
 
 
   template <>
-  void truncated_cone(Triangulation<3> &triangulation,
-                      const double      radius_0,
-                      const double      radius_1,
-                      const double      half_length)
+  void
+  truncated_cone(Triangulation<3> &triangulation,
+                 const double      radius_0,
+                 const double      radius_1,
+                 const double      half_length)
   {
     Assert(triangulation.n_cells() == 0,
            ExcMessage("The output triangulation object needs to be empty."));
@@ -4957,10 +5010,11 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void hyper_L(Triangulation<3> &tria,
-               const double      a,
-               const double      b,
-               const bool        colorize)
+  void
+  hyper_L(Triangulation<3> &tria,
+          const double      a,
+          const double      b,
+          const bool        colorize)
   {
     // we slice out the top back right
     // part of the cube
@@ -5027,10 +5081,11 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void hyper_ball(Triangulation<3> &tria,
-                  const Point<3> &  p,
-                  const double      radius,
-                  const bool        internal_manifold)
+  void
+  hyper_ball(Triangulation<3> &tria,
+             const Point<3> &  p,
+             const double      radius,
+             const bool        internal_manifold)
   {
     const double a =
       1. / (1 + std::sqrt(3.0)); // equilibrate cell sizes at transition
@@ -5093,9 +5148,10 @@ namespace GridGenerator
   }
 
 
-  void non_standard_orientation_mesh(Triangulation<2> &tria,
-                                     const bool        rotate_left_square,
-                                     const bool        rotate_right_square)
+  void
+  non_standard_orientation_mesh(Triangulation<2> &tria,
+                                const bool        rotate_left_square,
+                                const bool        rotate_right_square)
   {
     constexpr unsigned int dim = 2;
 
@@ -5173,11 +5229,12 @@ namespace GridGenerator
   }
 
 
-  void non_standard_orientation_mesh(Triangulation<3> &tria,
-                                     const bool        face_orientation,
-                                     const bool        face_flip,
-                                     const bool        face_rotation,
-                                     const bool        manipulate_left_cube)
+  void
+  non_standard_orientation_mesh(Triangulation<3> &tria,
+                                const bool        face_orientation,
+                                const bool        face_flip,
+                                const bool        face_rotation,
+                                const bool        manipulate_left_cube)
   {
     constexpr unsigned int dim = 3;
 
@@ -5443,9 +5500,10 @@ namespace GridGenerator
 
 
   template <int spacedim>
-  void hyper_sphere(Triangulation<spacedim - 1, spacedim> &tria,
-                    const Point<spacedim> &                p,
-                    const double                           radius)
+  void
+  hyper_sphere(Triangulation<spacedim - 1, spacedim> &tria,
+               const Point<spacedim> &                p,
+               const double                           radius)
   {
     Triangulation<spacedim> volume_mesh;
     GridGenerator::hyper_ball(volume_mesh, p, radius);
@@ -5460,10 +5518,11 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void subdivided_cylinder(Triangulation<3> & tria,
-                           const unsigned int x_subdivisions,
-                           const double       radius,
-                           const double       half_length)
+  void
+  subdivided_cylinder(Triangulation<3> & tria,
+                      const unsigned int x_subdivisions,
+                      const double       radius,
+                      const double       half_length)
   {
     // Copy the base from hyper_ball<3>
     // and transform it to yz
@@ -5586,17 +5645,19 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void cylinder(Triangulation<3> &tria,
-                const double      radius,
-                const double      half_length)
+  void
+  cylinder(Triangulation<3> &tria,
+           const double      radius,
+           const double      half_length)
   {
     subdivided_cylinder(tria, 2, radius, half_length);
   }
 
   template <>
-  void quarter_hyper_ball(Triangulation<3> &tria,
-                          const Point<3> &  center,
-                          const double      radius)
+  void
+  quarter_hyper_ball(Triangulation<3> &tria,
+                     const Point<3> &  center,
+                     const double      radius)
   {
     const unsigned int dim = 3;
 
@@ -5692,9 +5753,10 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void half_hyper_ball(Triangulation<3> &tria,
-                       const Point<3> &  center,
-                       const double      radius)
+  void
+  half_hyper_ball(Triangulation<3> &tria,
+                  const Point<3> &  center,
+                  const double      radius)
   {
     // These are for the two lower squares
     const double d = radius / std::sqrt(2.0);
@@ -5889,12 +5951,13 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_shell(Triangulation<3> & tria,
-                   const Point<3> &   p,
-                   const double       inner_radius,
-                   const double       outer_radius,
-                   const unsigned int n_cells,
-                   const bool         colorize)
+  void
+  hyper_shell(Triangulation<3> & tria,
+              const Point<3> &   p,
+              const double       inner_radius,
+              const double       outer_radius,
+              const unsigned int n_cells,
+              const bool         colorize)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -6104,12 +6167,13 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void half_hyper_shell(Triangulation<3> &tria,
-                        const Point<3> &  center,
-                        const double      inner_radius,
-                        const double      outer_radius,
-                        const unsigned int /*n_cells*/,
-                        const bool colorize)
+  void
+  half_hyper_shell(Triangulation<3> &tria,
+                   const Point<3> &  center,
+                   const double      inner_radius,
+                   const double      outer_radius,
+                   const unsigned int /*n_cells*/,
+                   const bool colorize)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -6204,12 +6268,13 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void quarter_hyper_shell(Triangulation<3> & tria,
-                           const Point<3> &   center,
-                           const double       inner_radius,
-                           const double       outer_radius,
-                           const unsigned int n,
-                           const bool         colorize)
+  void
+  quarter_hyper_shell(Triangulation<3> & tria,
+                      const Point<3> &   center,
+                      const double       inner_radius,
+                      const double       outer_radius,
+                      const unsigned int n,
+                      const bool         colorize)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -6272,12 +6337,13 @@ namespace GridGenerator
 
   // Implementation for 3D only
   template <>
-  void cylinder_shell(Triangulation<3> & tria,
-                      const double       length,
-                      const double       inner_radius,
-                      const double       outer_radius,
-                      const unsigned int n_radial_cells,
-                      const unsigned int n_axial_cells)
+  void
+  cylinder_shell(Triangulation<3> & tria,
+                 const double       length,
+                 const double       inner_radius,
+                 const double       outer_radius,
+                 const unsigned int n_radial_cells,
+                 const unsigned int n_axial_cells)
   {
     Assert((inner_radius > 0) && (inner_radius < outer_radius),
            ExcInvalidRadii());
@@ -7105,12 +7171,13 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_cube_with_cylindrical_hole(Triangulation<1> &,
-                                        const double,
-                                        const double,
-                                        const double,
-                                        const unsigned int,
-                                        const bool)
+  void
+  hyper_cube_with_cylindrical_hole(Triangulation<1> &,
+                                   const double,
+                                   const double,
+                                   const double,
+                                   const unsigned int,
+                                   const bool)
   {
     Assert(false, ExcNotImplemented());
   }
@@ -7118,12 +7185,13 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_cube_with_cylindrical_hole(Triangulation<2> &triangulation,
-                                        const double      inner_radius,
-                                        const double      outer_radius,
-                                        const double,       // width,
-                                        const unsigned int, // width_repetition,
-                                        const bool colorize)
+  void
+  hyper_cube_with_cylindrical_hole(Triangulation<2> &triangulation,
+                                   const double      inner_radius,
+                                   const double      outer_radius,
+                                   const double,       // width,
+                                   const unsigned int, // width_repetition,
+                                   const bool colorize)
   {
     const int dim = 2;
 
@@ -7333,12 +7401,13 @@ namespace GridGenerator
 
 
   template <>
-  void hyper_cube_with_cylindrical_hole(Triangulation<3> & triangulation,
-                                        const double       inner_radius,
-                                        const double       outer_radius,
-                                        const double       L,
-                                        const unsigned int Nz,
-                                        const bool         colorize)
+  void
+  hyper_cube_with_cylindrical_hole(Triangulation<3> & triangulation,
+                                   const double       inner_radius,
+                                   const double       outer_radius,
+                                   const double       L,
+                                   const unsigned int Nz,
+                                   const bool         colorize)
   {
     const int dim = 3;
 
index 317317c3144e8ac7684bd66f4b3c4a95acc8481d..05d1fff1c24cf1f39894b5854ebce97b3d725031 100644 (file)
@@ -240,7 +240,8 @@ for (deal_II_space_dimension : DIMENSIONS)
     \{
 
 #if deal_II_space_dimension >= 2
-      template void hyper_sphere<deal_II_space_dimension>(
+      template void
+      hyper_sphere<deal_II_space_dimension>(
         Triangulation<deal_II_space_dimension - 1, deal_II_space_dimension> &,
         const Point<deal_II_space_dimension> &,
         double);
index 6e1ccd82aec1f1007bc1fa73134e4f72d4bf5626..d341522ddc4a3cd1ba2cec21b0a86899f6b46795 100644 (file)
@@ -964,8 +964,7 @@ GridOut::write_dx(const Triangulation<dim, spacedim> &tria,
   // Write additional face information
 
   if (write_faces)
-    {
-    }
+    {}
   else
     {}
 
index aad99dcb06de22ec670aad7b075a6f9877618f29..d921603111fec622bb333c9e22157de18f586fb1 100644 (file)
@@ -56,38 +56,38 @@ for (S : REAL_SCALARS; deal_II_dimension : DIMENSIONS)
 
 #if deal_II_dimension < 3
     template void
-      GridRefinement::refine<deal_II_dimension, S, deal_II_dimension + 1>(
-        Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
-        const dealii::Vector<S> &,
-        const double,
-        const unsigned int);
+    GridRefinement::refine<deal_II_dimension, S, deal_II_dimension + 1>(
+      Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
+      const dealii::Vector<S> &,
+      const double,
+      const unsigned int);
 
     template void
-      GridRefinement::coarsen<deal_II_dimension, S, deal_II_dimension + 1>(
-        Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
-        const dealii::Vector<S> &,
-        const double);
+    GridRefinement::coarsen<deal_II_dimension, S, deal_II_dimension + 1>(
+      Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
+      const dealii::Vector<S> &,
+      const double);
 
     template void
-      GridRefinement::refine_and_coarsen_fixed_number<deal_II_dimension,
-                                                      S,
-                                                      deal_II_dimension + 1>(
-        Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
-        const dealii::Vector<S> &,
-        const double,
-        const double,
-        const unsigned int);
+    GridRefinement::refine_and_coarsen_fixed_number<deal_II_dimension,
+                                                    S,
+                                                    deal_II_dimension + 1>(
+      Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
+      const dealii::Vector<S> &,
+      const double,
+      const double,
+      const unsigned int);
 
     template void
-      GridRefinement::refine_and_coarsen_fixed_fraction<deal_II_dimension,
-                                                        S,
-                                                        deal_II_dimension + 1>(
-        Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
-        const dealii::Vector<S> &,
-        const double,
-        const double,
-        const unsigned int,
-        const VectorTools::NormType);
+    GridRefinement::refine_and_coarsen_fixed_fraction<deal_II_dimension,
+                                                      S,
+                                                      deal_II_dimension + 1>(
+      Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
+      const dealii::Vector<S> &,
+      const double,
+      const double,
+      const unsigned int,
+      const VectorTools::NormType);
 
     template void GridRefinement::
       refine_and_coarsen_optimize<deal_II_dimension, S, deal_II_dimension + 1>(
index 6bd793709cdee52e26019d4d4c341d0434cbe4a9..a29edac7f4af1e5db2c3c5acc08bf854fea478dd 100644 (file)
@@ -41,18 +41,21 @@ namespace
    * do the reordering of their
    * arguments in-place.
    */
-  void reorder_new_to_old_style(std::vector<CellData<1>> &)
+  void
+  reorder_new_to_old_style(std::vector<CellData<1>> &)
   {}
 
 
-  void reorder_new_to_old_style(std::vector<CellData<2>> &cells)
+  void
+  reorder_new_to_old_style(std::vector<CellData<2>> &cells)
   {
     for (auto &cell : cells)
       std::swap(cell.vertices[2], cell.vertices[3]);
   }
 
 
-  void reorder_new_to_old_style(std::vector<CellData<3>> &cells)
+  void
+  reorder_new_to_old_style(std::vector<CellData<3>> &cells)
   {
     unsigned int tmp[GeometryInfo<3>::vertices_per_cell];
     for (auto &cell : cells)
@@ -68,18 +71,21 @@ namespace
   /**
    * And now also in the opposite direction.
    */
-  void reorder_old_to_new_style(std::vector<CellData<1>> &)
+  void
+  reorder_old_to_new_style(std::vector<CellData<1>> &)
   {}
 
 
-  void reorder_old_to_new_style(std::vector<CellData<2>> &cells)
+  void
+  reorder_old_to_new_style(std::vector<CellData<2>> &cells)
   {
     // just invert the permutation:
     reorder_new_to_old_style(cells);
   }
 
 
-  void reorder_old_to_new_style(std::vector<CellData<3>> &cells)
+  void
+  reorder_old_to_new_style(std::vector<CellData<3>> &cells)
   {
     // undo the ordering above
     unsigned int tmp[GeometryInfo<3>::vertices_per_cell];
index 5c9b76652778317dbbe95a3c47029087d0400878..68004bf1aaabb9fb03fd835612edc6dd7bb51d09 100644 (file)
@@ -1910,7 +1910,8 @@ namespace GridTools
 
     // overload of the function above for 1d -- there is nothing
     // to orient in that case
-    void reorient(std::vector<CellData<1>> &)
+    void
+    reorient(std::vector<CellData<1>> &)
     {}
   } // namespace
 
index 74725e781a413e2f8924e13a4f15b85e25131d3f..eb2215c3f8f51d2299536431bdec4e08e3b0fda7 100644 (file)
@@ -484,16 +484,16 @@ for (deal_II_dimension : DIMENSIONS)
                       deal_II_dimension + 1>::active_cell_iterator);
 
     template void
-      GridTools::remove_hanging_nodes<deal_II_dimension, deal_II_dimension + 1>(
-        Triangulation<deal_II_dimension, deal_II_dimension + 1> & tria,
-        bool,
-        unsigned int);
+    GridTools::remove_hanging_nodes<deal_II_dimension, deal_II_dimension + 1>(
+      Triangulation<deal_II_dimension, deal_II_dimension + 1> & tria,
+      bool,
+      unsigned int);
 
     template void
-      GridTools::remove_anisotropy<deal_II_dimension, deal_II_dimension + 1>(
-        Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
-        double,
-        unsigned int);
+    GridTools::remove_anisotropy<deal_II_dimension, deal_II_dimension + 1>(
+      Triangulation<deal_II_dimension, deal_II_dimension + 1> &,
+      double,
+      unsigned int);
 #endif
   }
 
index 2842954fd48430ef4e486a1126ca1a01dd48b249..371ded1a7613fe19ac2030892de487f7629f38f0 100644 (file)
@@ -881,7 +881,7 @@ namespace GridTools
     const double layer_thickness)
   {
     std::vector<typename MeshType::active_cell_iterator>
-                      subdomain_boundary_cells, active_cell_layer_within_distance;
+      subdomain_boundary_cells, active_cell_layer_within_distance;
     std::vector<bool> vertices_outside_subdomain(
       mesh.get_triangulation().n_vertices(), false);
 
@@ -2409,7 +2409,8 @@ namespace GridTools
 
 
   template <typename FaceIterator>
-  inline bool orthogonal_equality(
+  inline bool
+  orthogonal_equality(
     std::bitset<3> &                                              orientation,
     const FaceIterator &                                          face1,
     const FaceIterator &                                          face2,
index 9c2bb2c9bc218a7f1e7d69a11dc5aecd0c4ebb0c..41bdd43b9e5870fca9cd87278968f061e256a68c 100644 (file)
@@ -249,7 +249,8 @@ for (X : SEQUENTIAL_TRIANGULATION_AND_DOFHANDLER;
     namespace GridTools
     \{
 
-      template bool orthogonal_equality<X::active_face_iterator>(
+      template bool
+      orthogonal_equality<X::active_face_iterator>(
         std::bitset<3> &,
         const X::active_face_iterator &,
         const X::active_face_iterator &,
@@ -257,7 +258,8 @@ for (X : SEQUENTIAL_TRIANGULATION_AND_DOFHANDLER;
         const Tensor<1, deal_II_space_dimension> &,
         const FullMatrix<double> &);
 
-      template bool orthogonal_equality<X::face_iterator>(
+      template bool
+      orthogonal_equality<X::face_iterator>(
         std::bitset<3> &,
         const X::face_iterator &,
         const X::face_iterator &,
index cf9daf7590eb0cf7df31a6a3552ef651e21b7ced..b707cee7008049fef6e6a4f8cf1dd139e52ebb64 100644 (file)
@@ -153,8 +153,8 @@ InterGridMap<MeshType>::set_entries_to_cell(const cell_iterator &src_cell,
 
 
 template <class MeshType>
-typename InterGridMap<MeshType>::cell_iterator InterGridMap<MeshType>::
-                                               operator[](const cell_iterator &source_cell) const
+typename InterGridMap<MeshType>::cell_iterator
+InterGridMap<MeshType>::operator[](const cell_iterator &source_cell) const
 {
   Assert(source_cell.state() == IteratorState::valid,
          ExcInvalidKey(source_cell));
index 961ad8285689a1c9b7f1fb103aa9c16af24f61e2..ad2fb12e1a60d1fb239df459df58011dd55f767f 100644 (file)
@@ -626,7 +626,7 @@ SphericalManifold<dim, spacedim>::get_new_points(
     }
 
   boost::container::small_vector<std::pair<double, Tensor<1, spacedim>>, 100>
-                                                           new_candidates(new_points.size());
+    new_candidates(new_points.size());
   boost::container::small_vector<Tensor<1, spacedim>, 100> directions(
     surrounding_points.size(), Point<spacedim>());
   boost::container::small_vector<double, 100> distances(
index 079b622b6c1bd5a4ab766ab7036d88841ce978c4..57b6da92e2d3001c43445a7effe9cdcbbae45e86 100644 (file)
@@ -477,8 +477,8 @@ namespace
   }
 
 
-  void reorder_compatibility(std::vector<CellData<2>> &cells,
-                             const SubCellData &)
+  void
+  reorder_compatibility(std::vector<CellData<2>> &cells, const SubCellData &)
   {
     for (auto &cell : cells)
       if (cell.vertices.size() == GeometryInfo<2>::vertices_per_cell)
@@ -486,8 +486,9 @@ namespace
   }
 
 
-  void reorder_compatibility(std::vector<CellData<3>> &cells,
-                             SubCellData &             subcelldata)
+  void
+  reorder_compatibility(std::vector<CellData<3>> &cells,
+                        SubCellData &             subcelldata)
   {
     unsigned int tmp[GeometryInfo<3>::vertices_per_cell];
     for (auto &cell : cells)
@@ -2107,7 +2108,8 @@ namespace internal
 
 
       template <int spacedim>
-      static void update_neighbors(Triangulation<1, spacedim> &)
+      static void
+      update_neighbors(Triangulation<1, spacedim> &)
       {}
 
 
@@ -2728,11 +2730,11 @@ namespace internal
        * argument and quads instead of lines.
        */
       template <int spacedim>
-      static void delete_children(
-        Triangulation<1, spacedim> &                        triangulation,
-        typename Triangulation<1, spacedim>::cell_iterator &cell,
-        std::vector<unsigned int> &,
-        std::vector<unsigned int> &)
+      static void
+      delete_children(Triangulation<1, spacedim> &triangulation,
+                      typename Triangulation<1, spacedim>::cell_iterator &cell,
+                      std::vector<unsigned int> &,
+                      std::vector<unsigned int> &)
       {
         const unsigned int dim = 1;
 
@@ -2832,11 +2834,11 @@ namespace internal
 
 
       template <int spacedim>
-      static void delete_children(
-        Triangulation<2, spacedim> &                        triangulation,
-        typename Triangulation<2, spacedim>::cell_iterator &cell,
-        std::vector<unsigned int> &                         line_cell_count,
-        std::vector<unsigned int> &)
+      static void
+      delete_children(Triangulation<2, spacedim> &triangulation,
+                      typename Triangulation<2, spacedim>::cell_iterator &cell,
+                      std::vector<unsigned int> &line_cell_count,
+                      std::vector<unsigned int> &)
       {
         const unsigned int        dim      = 2;
         const RefinementCase<dim> ref_case = cell->refinement_case();
@@ -2970,11 +2972,11 @@ namespace internal
 
 
       template <int spacedim>
-      static void delete_children(
-        Triangulation<3, spacedim> &                        triangulation,
-        typename Triangulation<3, spacedim>::cell_iterator &cell,
-        std::vector<unsigned int> &                         line_cell_count,
-        std::vector<unsigned int> &                         quad_cell_count)
+      static void
+      delete_children(Triangulation<3, spacedim> &triangulation,
+                      typename Triangulation<3, spacedim>::cell_iterator &cell,
+                      std::vector<unsigned int> &line_cell_count,
+                      std::vector<unsigned int> &quad_cell_count)
       {
         const unsigned int dim = 3;
 
@@ -3600,7 +3602,8 @@ namespace internal
        * "before") the reserved space.
        */
       template <int spacedim>
-      static void create_children(
+      static void
+      create_children(
         Triangulation<2, spacedim> &triangulation,
         unsigned int &              next_unused_vertex,
         typename Triangulation<2, spacedim>::raw_line_iterator
@@ -4540,8 +4543,8 @@ namespace internal
        */
       template <int spacedim>
       static typename Triangulation<1, spacedim>::DistortedCellList
-        execute_refinement(Triangulation<1, spacedim> &triangulation,
-                           const bool /*check_for_distorted_cells*/)
+      execute_refinement(Triangulation<1, spacedim> &triangulation,
+                         const bool /*check_for_distorted_cells*/)
       {
         const unsigned int dim = 1;
 
@@ -4771,8 +4774,8 @@ namespace internal
        */
       template <int spacedim>
       static typename Triangulation<2, spacedim>::DistortedCellList
-        execute_refinement(Triangulation<2, spacedim> &triangulation,
-                           const bool check_for_distorted_cells)
+      execute_refinement(Triangulation<2, spacedim> &triangulation,
+                         const bool                  check_for_distorted_cells)
       {
         const unsigned int dim = 2;
 
@@ -5089,8 +5092,8 @@ namespace internal
 
       template <int spacedim>
       static typename Triangulation<3, spacedim>::DistortedCellList
-        execute_refinement_isotropic(Triangulation<3, spacedim> &triangulation,
-                                     const bool check_for_distorted_cells)
+      execute_refinement_isotropic(Triangulation<3, spacedim> &triangulation,
+                                   const bool check_for_distorted_cells)
       {
         static const int          dim = 3;
         static const unsigned int X   = numbers::invalid_unsigned_int;
@@ -6326,8 +6329,8 @@ namespace internal
        */
       template <int spacedim>
       static typename Triangulation<3, spacedim>::DistortedCellList
-        execute_refinement(Triangulation<3, spacedim> &triangulation,
-                           const bool check_for_distorted_cells)
+      execute_refinement(Triangulation<3, spacedim> &triangulation,
+                         const bool                  check_for_distorted_cells)
       {
         const unsigned int dim = 3;
 
@@ -10681,7 +10684,8 @@ namespace internal
        * specialization).
        */
       template <int spacedim>
-      static void prevent_distorted_boundary_cells(Triangulation<1, spacedim> &)
+      static void
+      prevent_distorted_boundary_cells(Triangulation<1, spacedim> &)
       {}
 
 
@@ -10778,7 +10782,8 @@ namespace internal
 
 
       template <int spacedim>
-      static void prepare_refinement_dim_dependent(
+      static void
+      prepare_refinement_dim_dependent(
         Triangulation<3, spacedim> &triangulation)
       {
         const unsigned int dim = 3;
@@ -11031,7 +11036,8 @@ namespace internal
     struct ImplementationMixedMesh
     {
       template <int spacedim>
-      static void update_neighbors(Triangulation<1, spacedim> &)
+      static void
+      update_neighbors(Triangulation<1, spacedim> &)
       {}
 
       template <int dim, int spacedim>
@@ -11223,8 +11229,8 @@ Triangulation<dim, spacedim>::Triangulation(
 
 template <int dim, int spacedim>
 Triangulation<dim, spacedim> &
-Triangulation<dim, spacedim>::
-operator=(Triangulation<dim, spacedim> &&tria) noexcept
+Triangulation<dim, spacedim>::operator=(
+  Triangulation<dim, spacedim> &&tria) noexcept
 {
   Subscriptor::operator=(std::move(tria));
 
index b4237527b4f2662472fbc36377bf039a4ca8a33e..8bc89fdddf282003815460ecd5d7c17ffba1cec2 100644 (file)
@@ -107,8 +107,8 @@ BlockSparsityPatternBase<SparsityPatternBase>::reinit(
 
 template <class SparsityPatternBase>
 BlockSparsityPatternBase<SparsityPatternBase> &
-BlockSparsityPatternBase<SparsityPatternBase>::
-operator=(const BlockSparsityPatternBase<SparsityPatternBase> &bsp)
+BlockSparsityPatternBase<SparsityPatternBase>::operator=(
+  const BlockSparsityPatternBase<SparsityPatternBase> &bsp)
 {
   Assert(rows == bsp.rows, ExcDimensionMismatch(rows, bsp.rows));
   Assert(columns == bsp.columns, ExcDimensionMismatch(columns, bsp.columns));
index db61e93e48b7915ec5ea5c493c9bf3ad6804e79d..0080397f15d43ecbdcd6cd68c2f4faa583266ffa 100644 (file)
@@ -268,7 +268,8 @@ namespace LinearAlgebra
 
 
     template <typename Number>
-    Number Vector<Number>::operator*(const VectorSpaceVector<Number> &V) const
+    Number
+    Vector<Number>::operator*(const VectorSpaceVector<Number> &V) const
     {
       // Check that casting will work
       Assert(dynamic_cast<const Vector<Number> *>(&V) != nullptr,
index d4aae2a97a1cfee83027b516126268dc5132fdc8..3ff636d4490a69c1dbf101d5c50efd20c5a3cb61 100644 (file)
@@ -342,7 +342,8 @@ namespace PETScWrappers
 
 
 
-  PetscScalar VectorBase::operator*(const VectorBase &vec) const
+  PetscScalar
+  VectorBase::operator*(const VectorBase &vec) const
   {
     Assert(size() == vec.size(), ExcDimensionMismatch(size(), vec.size()));
 
index 5671daf54401bd503f19453d68c9f893ceda8e53..4579dfac96f470e0f5d643639c866f0ad56f7d34 100644 (file)
@@ -282,7 +282,8 @@ namespace LinearAlgebra
 
 
 
-    double Vector::operator*(const VectorSpaceVector<double> &V) const
+    double
+    Vector::operator*(const VectorSpaceVector<double> &V) const
     {
       // Check that casting will work.
       Assert(dynamic_cast<const Vector *>(&V) != nullptr,
index 5fe22dadf9e1195030de4ec81c2def43dcb840e6..35e67ac9e78cfe419d6061f2917d4cdc5ea53b6f 100644 (file)
@@ -1739,8 +1739,8 @@ namespace TrilinosWrappers
           (nonlocal_matrix.get() != nullptr &&
            matrix->RowMap().MyGID(
              static_cast<TrilinosWrappers::types::int_type>(row)) == false) ?
-            &nonlocal_matrix->Graph() :
-            &matrix->Graph();
+                                    &nonlocal_matrix->Graph() :
+                                    &matrix->Graph();
 
         indices.resize(graph->NumGlobalIndices(row));
         int n_indices = 0;
@@ -3060,8 +3060,9 @@ namespace TrilinosWrappers
 
 
 
-      TrilinosPayload operator*(const TrilinosPayload &first_op,
-                                const TrilinosPayload &second_op)
+      TrilinosPayload
+      operator*(const TrilinosPayload &first_op,
+                const TrilinosPayload &second_op)
       {
         using Domain        = typename TrilinosPayload::Domain;
         using Range         = typename TrilinosPayload::Range;
index 99346c517d79d9ad6d91676b8baaff7a5dc721a9..1481f6be08e2a4caaee53b184255843f60ba5683 100644 (file)
@@ -28,17 +28,18 @@ template class Vector<std::complex<double>>;
 
 // instantiate for integers:
 template class Vector<int>;
-template Vector<double> &Vector<double>::
-                         operator=<int>(const dealii::Vector<int> &);
-template bool Vector<int>::operator==<int>(dealii::Vector<int> const &) const;
+template Vector<double> &
+Vector<double>::operator=<int>(const dealii::Vector<int> &);
+template bool
+Vector<int>::operator==<int>(dealii::Vector<int> const &) const;
 
 template void
 Vector<int>::reinit<double>(const Vector<double> &, const bool);
 
 // instantiate for long double manually because we use it in a few places:
 template class Vector<long double>;
-template long double Vector<long double>::
-                     operator*<long double>(const Vector<long double> &) const;
+template long double
+Vector<long double>::operator*<long double>(const Vector<long double> &) const;
 
 // do a few functions that currently don't fit the scheme because they have
 // two template arguments that need to be different (the case of same
index e9cd7bb6f3159345a51ee68a15c051ea69aea2dd..dcaa2b91fab0b34e0662b345895052cb823e2ed1 100644 (file)
@@ -474,7 +474,7 @@ namespace NonMatching
 
     std::vector<
       std::vector<typename Triangulation<dim0, spacedim>::active_cell_iterator>>
-                                                       cell_container(n_active_c);
+      cell_container(n_active_c);
     std::vector<std::vector<std::vector<Point<dim0>>>> qpoints_container(
       n_active_c);
     std::vector<std::vector<std::vector<unsigned int>>> maps_container(
index b3609418a6deedfc2e7ec2bf0812f58d5c35bd3e..87fe4d7269c6c94496246f9e6f9c9f20c2b82c8e 100644 (file)
@@ -512,7 +512,7 @@ DataOutRotation<dim, spacedim>::build_patches(
       n_postprocessor_outputs[dataset] = 0;
 
   internal::DataOutRotationImplementation::ParallelData<dim, spacedim>
-                                                             thread_data(n_datasets,
+    thread_data(n_datasets,
                 n_subdivisions,
                 n_patches_per_circle,
                 n_postprocessor_outputs,
index 8e11d0f6d8c8d15f733cf7447c1709eb7aabc909..2e0368c6c341d9a36b7088882480aa1bd4c688b2 100644 (file)
@@ -396,9 +396,9 @@ KellyErrorEstimator<1, spacedim>::estimate(
   std::vector<std::vector<std::vector<Tensor<1, spacedim, number>>>>
     gradients_neighbor(gradients_here);
   std::vector<Vector<typename ProductType<number, double>::type>>
-  grad_dot_n_neighbor(n_solution_vectors,
-                      Vector<typename ProductType<number, double>::type>(
-                        n_components));
+    grad_dot_n_neighbor(n_solution_vectors,
+                        Vector<typename ProductType<number, double>::type>(
+                          n_components));
 
   // reserve some space for coefficient values at one point.  if there is no
   // coefficient, then we fill it by unity once and for all and don't set it
index f927cd728f425b7803b348321d64ce1efac5c384..46d7fadb29161519f6b035ac9a81e19c5a4d272e 100644 (file)
@@ -226,13 +226,13 @@ TimeDependent::start_sweep(const unsigned int s)
 void
 TimeDependent::end_sweep()
 {
-  parallel::apply_to_subranges(0U,
-                               timesteps.size(),
-                               [this](const unsigned int begin,
-                                      const unsigned int end) {
-                                 this->end_sweep(begin, end);
-                               },
-                               1);
+  parallel::apply_to_subranges(
+    0U,
+    timesteps.size(),
+    [this](const unsigned int begin, const unsigned int end) {
+      this->end_sweep(begin, end);
+    },
+    1);
 }
 
 
index d278f82e05999545492a18292a99795bb38615e8..dbb5614e902872a8b585bd8ee1f3be1d26dfe3fa 100644 (file)
@@ -90,14 +90,11 @@ namespace OpenCASCADE
     TopExp_Explorer exp;
     unsigned int    n_faces = 0, n_edges = 0, n_vertices = 0;
     for (exp.Init(shape, TopAbs_FACE); exp.More(); exp.Next(), ++n_faces)
-      {
-      }
+      {}
     for (exp.Init(shape, TopAbs_EDGE); exp.More(); exp.Next(), ++n_edges)
-      {
-      }
+      {}
     for (exp.Init(shape, TopAbs_VERTEX); exp.More(); exp.Next(), ++n_vertices)
-      {
-      }
+      {}
     return std::tuple<unsigned int, unsigned int, unsigned int>(n_faces,
                                                                 n_edges,
                                                                 n_vertices);
index bdffeeac0b5b84677c55dcbf62d4ab8b50bea2d5..2783a3635880d16bf8349e131a06715374c13197 100644 (file)
@@ -159,8 +159,8 @@ namespace Particles
 
   template <int dim, int spacedim>
   Particle<dim, spacedim> &
-  Particle<dim, spacedim>::
-  operator=(Particle<dim, spacedim> &&particle) noexcept
+  Particle<dim, spacedim>::operator=(
+    Particle<dim, spacedim> &&particle) noexcept
   {
     if (this != &particle)
       {
index 95590aad9592c633d0831dd02f04c2ccbcbbe266..a3332cc8ba79fa494f05737389e18e3dc40278ab 100644 (file)
@@ -56,7 +56,8 @@ FESubfaceValues<3> fe_face_values2(mapping,
                                    update_quadrature_points |
                                      update_JxW_values | update_normal_vectors);
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   DoFHandler<3> dof_handler(tria);
   dof_handler.distribute_dofs(fe);
@@ -99,7 +100,8 @@ void check_this(Triangulation<3> &tria)
 // perform the usual check, i.e. first refine a single cell (anisotropically),
 // then global refinement, then global coarsening. For each step, check, that
 // quadrature points both on faces and neighboring subfaces match.
-void check(Triangulation<3> &tria_org)
+void
+check(Triangulation<3> &tria_org)
 {
   for (unsigned int c = 0; c < tria_org.n_active_cells(); ++c)
     for (unsigned int i = 1; i < 8; ++i)
@@ -140,7 +142,8 @@ void check(Triangulation<3> &tria_org)
 // perform an additional check: simulate an isotropic refinement of a given cell
 // via several anisotropic refinements. Then, perform the usual checks. This
 // went wrong at some time, so check that it works now.
-void check2(Triangulation<3> &orig_tria)
+void
+check2(Triangulation<3> &orig_tria)
 {
   for (unsigned int i = 0; i < orig_tria.n_active_cells(); ++i)
     {
index 006225ad5a269c21c01eee5c3040416b5e425cd9..cba49843874f0535c5a1fef5b6ccd7dce0022961 100644 (file)
@@ -147,10 +147,11 @@ test()
 
     const unsigned int num_arnoldi_vectors = 2 * eigenvalues.size() + 2;
     PArpackSolver<LinearAlgebra::distributed::Vector<double>>::AdditionalData
-    additional_data(num_arnoldi_vectors,
-                    PArpackSolver<LinearAlgebra::distributed::Vector<double>>::
-                      largest_magnitude,
-                    true);
+      additional_data(
+        num_arnoldi_vectors,
+        PArpackSolver<
+          LinearAlgebra::distributed::Vector<double>>::largest_magnitude,
+        true);
 
     SolverControl solver_control(dof_handler.n_dofs(),
                                  1e-9,
index a3cad563730b36152b4cc709f51cf6d73e3351bc..2dc273a173c82773819bbcbd0ee358fffb8c7afd 100644 (file)
@@ -145,11 +145,12 @@ test()
 
     const unsigned int num_arnoldi_vectors = 2 * eigenvalues.size() + 40;
     PArpackSolver<LinearAlgebra::distributed::Vector<double>>::AdditionalData
-    additional_data(num_arnoldi_vectors,
-                    PArpackSolver<LinearAlgebra::distributed::Vector<double>>::
-                      largest_magnitude,
-                    true,
-                    2);
+      additional_data(
+        num_arnoldi_vectors,
+        PArpackSolver<
+          LinearAlgebra::distributed::Vector<double>>::largest_magnitude,
+        true,
+        2);
 
     SolverControl solver_control(dof_handler.n_dofs(),
                                  1e-10,
index ddf60fbc3bb84a3b9d130da406c04a6138c8fbdd..f325daa6a29b1ea8a6426c09bbacb374ed123a77 100644 (file)
@@ -146,11 +146,12 @@ test()
 
     const unsigned int num_arnoldi_vectors = 2 * eigenvalues.size() + 10;
     PArpackSolver<LinearAlgebra::distributed::Vector<double>>::AdditionalData
-    additional_data(num_arnoldi_vectors,
-                    PArpackSolver<LinearAlgebra::distributed::Vector<double>>::
-                      largest_magnitude,
-                    true,
-                    1);
+      additional_data(
+        num_arnoldi_vectors,
+        PArpackSolver<
+          LinearAlgebra::distributed::Vector<double>>::largest_magnitude,
+        true,
+        1);
 
     SolverControl solver_control(dof_handler.n_dofs(),
                                  1e-9,
index 27c38493e76701d082f02568789902619e7a2908..c3aae0951f354d0013cc9f24669f7944846365a2 100644 (file)
@@ -42,10 +42,10 @@ struct Mat1 : MaterialBase
 constexpr unsigned int n_data_points_per_cell = 4;
 
 
-void setup_history(
-  Triangulation<2> &tria,
-  CellDataStorage<typename Triangulation<2>::active_cell_iterator, MaterialBase>
-    &storage)
+void
+setup_history(Triangulation<2> &             tria,
+              CellDataStorage<typename Triangulation<2>::active_cell_iterator,
+                              MaterialBase> &storage)
 {
   deallog << "initializing history" << std::endl;
   for (auto cell : tria.active_cell_iterators())
@@ -58,10 +58,10 @@ void setup_history(
     }
 }
 
-void read_history(
-  Triangulation<2> &tria,
-  CellDataStorage<typename Triangulation<2>::active_cell_iterator, MaterialBase>
-    &storage)
+void
+read_history(Triangulation<2> &             tria,
+             CellDataStorage<typename Triangulation<2>::active_cell_iterator,
+                             MaterialBase> &storage)
 {
   deallog << "reading history" << std::endl;
   for (auto cell : tria.active_cell_iterators())
index 5f5a8e185a665d7e06915a0de0616b18ee6d9105..2b2b1edd4680add190aef8debcb009f823f7dd86 100644 (file)
@@ -86,7 +86,7 @@ check_function(const Functions::FlowFunction<dim> &f,
         }
 
   std::vector<Vector<double>>      values(points.size(),
-                                          Vector<double>(f.n_components));
+                                     Vector<double>(f.n_components));
   std::vector<std::vector<double>> values2(f.n_components,
                                            std::vector<double>(points.size()));
   f.vector_value_list(points, values);
index 8c228e14e2215a0bd23eaae4457805a804665104..b892762016bba03b5a2a397638c4acb6ebd5c1ef 100644 (file)
@@ -37,7 +37,8 @@ struct FillTensor
 template <int dim>
 struct FillTensor<1, dim>
 {
-  static void fill_tensor(Tensor<1, dim> &tensor, int base)
+  static void
+  fill_tensor(Tensor<1, dim> &tensor, int base)
   {
     for (int i = 0; i < dim; ++i)
       tensor[i] = 10 * base + i;
index 3c9c18fc0d25a6a3dfc1ec32ecd26d5128ecd7c1..3788e86969270495d1ba9d46d73df3fec5033365 100644 (file)
@@ -126,7 +126,7 @@ check_function_derivative(const Functions::FlowFunction<dim> &f,
         }
 
   std::vector<Vector<double>>      values(points.size(),
-                                          Vector<double>(f.n_components));
+                                     Vector<double>(f.n_components));
   std::vector<std::vector<double>> values2(f.n_components,
                                            std::vector<double>(points.size()));
   f.vector_value_list(points, values);
index cd6dcccb25487ee01cb43098ff3088e4f167ce5a..3a3f3edc8118d832465d8dc66e2112fcb2cb0312 100644 (file)
@@ -39,12 +39,13 @@ main()
     }
 
   // set z=x+2y, which happens to be zero
-  parallel::transform(x.begin(),
-                      x.end(),
-                      y.begin(),
-                      z.begin(),
-                      [](double i, double j) { return i + 2 * j; },
-                      10);
+  parallel::transform(
+    x.begin(),
+    x.end(),
+    y.begin(),
+    z.begin(),
+    [](double i, double j) { return i + 2 * j; },
+    10);
 
   Assert(z.l2_norm() == 0, ExcInternalError());
 
index 3cc5a4e97a58fd944f1dcf0fd6f3c1d0aa055c9e..0f85ccfa9cf601d199668275d75c0f850bbb7f73 100644 (file)
@@ -41,13 +41,14 @@ main()
 
   // set a=x+y-z, which happens to be
   // zero
-  parallel::transform(x.begin(),
-                      x.end(),
-                      y.begin(),
-                      z.begin(),
-                      a.begin(),
-                      [](double i, double j, double k) { return i + j - k; },
-                      10);
+  parallel::transform(
+    x.begin(),
+    x.end(),
+    y.begin(),
+    z.begin(),
+    a.begin(),
+    [](double i, double j, double k) { return i + j - k; },
+    10);
 
   AssertThrow(a.l2_norm() == 0, ExcInternalError());
 
index e4de898c862975a3a9a1e74254bf7c7d8f76e692..1437065f5db0160c0df4218dbba6687233c7e967 100644 (file)
@@ -23,7 +23,8 @@
 #include "../tests.h"
 
 template <int dim>
-void check_line(Quadrature<1> &quadrature)
+void
+check_line(Quadrature<1> &quadrature)
 {
   Point<dim> p1;
   Point<dim> p2;
@@ -51,7 +52,8 @@ void check_line(Quadrature<1> &quadrature)
 }
 
 template <int dim>
-void check_face(Quadrature<1> &q1)
+void
+check_face(Quadrature<1> &q1)
 {
   deallog << "Checking dim " << dim << " 1d-points " << q1.size() << std::endl;
 
@@ -79,7 +81,8 @@ void check_face(Quadrature<1> &q1)
 }
 
 template <int dim>
-void check_faces(Quadrature<1> &q1)
+void
+check_faces(Quadrature<1> &q1)
 {
   const unsigned int nq = q1.size();
 
@@ -142,7 +145,8 @@ void check_faces(Quadrature<1> &q1)
 }
 
 
-void check(Quadrature<1> &q)
+void
+check(Quadrature<1> &q)
 {
   deallog << std::endl;
   deallog.push("line");
index a35db39bb20f317aa07b89a6f607ba4f43c1a502..aea3d5a5c25d0954e05f31ec64d0adab1b08315e 100644 (file)
@@ -21,7 +21,7 @@
 
 template <class Quad, typename... Args>
 std::string
-check_q_move(Args &&... args)
+check_q_move(Args &&...args)
 {
   Quad               quad1(args...);
   const unsigned int size1 = quad1.size();
@@ -46,7 +46,7 @@ check_q_move(Args &&... args)
 
 template <template <int dim> class Quad, typename... Args>
 void
-check_quadrature_move(Args &&... args)
+check_quadrature_move(Args &&...args)
 {
   deallog << check_q_move<Quad<1>>(std::forward<Args>(args)...) << 1 << " "
           << check_q_move<Quad<2>>(std::forward<Args>(args)...) << 2 << " "
index 3f330e29769aa9f3786377549cd66f1013005ce5..933a62a679d909254bd1c3243df6adc3e1251f9e 100644 (file)
@@ -21,7 +21,7 @@
 
 template <template <int dim> class Quad, int dim, typename... Args>
 std::string
-check_q_assign_move(Args &&... args)
+check_q_assign_move(Args &&...args)
 {
   Quad<dim>                     quad1(args...);
   const unsigned int            size1    = quad1.size();
@@ -52,7 +52,7 @@ check_q_assign_move(Args &&... args)
 
 template <template <int dim> class Quad, typename... Args>
 void
-check_quadrature_assign_move(Args &&... args)
+check_quadrature_assign_move(Args &&...args)
 {
   deallog << check_q_assign_move<Quad, 1>(std::forward<Args>(args)...) << 1
           << " " << check_q_assign_move<Quad, 2>(std::forward<Args>(args)...)
index 28389019902ba2e516626867438385e41278a6d1..798e446430d413d96a8d6b087b39e9812f587b09 100644 (file)
@@ -57,7 +57,8 @@ test(TimerOutput::OutputType output_type)
 
   std::string s = ss.str();
   std::replace_if(s.begin(), s.end(), ::isdigit, ' ');
-  std::replace_if(s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
+  std::replace_if(
+    s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
   deallog << s << std::endl << std::endl;
 }
 
index de3a034b9e0a982db350f91488d196a898c001a5..5f98b3e3b4d15f4f026070c153dfc6c8016544b7 100644 (file)
@@ -55,7 +55,8 @@ test(TimerOutput::OutputType output_type)
 
   std::string s = ss.str();
   std::replace_if(s.begin(), s.end(), ::isdigit, ' ');
-  std::replace_if(s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
+  std::replace_if(
+    s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
   deallog << s << std::endl << std::endl;
 }
 
index 27e02b04b9c0ab811f7963cefa67adea759b2182..2dafe04e74ebd5fa11dfbc01f9c4c21491481c1d 100644 (file)
@@ -60,7 +60,8 @@ test()
 
   std::string s = ss.str();
   std::replace_if(s.begin(), s.end(), ::isdigit, ' ');
-  std::replace_if(s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
+  std::replace_if(
+    s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
 
   deallog << s << std::endl << std::endl;
 }
index 6f82e5335de8838a08d445d37569e1c8cbe28a0e..b31ee6e4651f418c7a2667c27646a6317a4098fd 100644 (file)
@@ -61,7 +61,8 @@ test()
 
   std::string s = ss.str();
   std::replace_if(s.begin(), s.end(), ::isdigit, ' ');
-  std::replace_if(s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
+  std::replace_if(
+    s.begin(), s.end(), [](char x) { return x == '.'; }, ' ');
 
   deallog << s << std::endl << std::endl;
 }
index bd2a8e507266cafed6d0701687d6dd0118cc9f70..a76aea9c83bbb47a81671f414e3821c0ae385abd 100644 (file)
@@ -47,10 +47,12 @@ rotate_to_y(const Point<dim> &p)
     return Point<dim>(-p[1], p[0], p[2]);
 }
 
-void set_manifold(Triangulation<2> &triangulation)
+void
+set_manifold(Triangulation<2> &triangulation)
 {}
 
-void set_manifold(Triangulation<3> &triangulation)
+void
+set_manifold(Triangulation<3> &triangulation)
 {
   static const CylindricalManifold<3> boundary(1);
   triangulation.set_manifold(0, boundary);
index 92f540e5334dc6b8ac922ad65b4cc38c40814064..9d66ee1c2dbe6c1155e384c8415af1391697898f 100644 (file)
@@ -44,7 +44,8 @@ rotate_to_z(const Point<dim> &p)
   return Point<dim>(-p[2], p[1], p[0]);
 }
 
-void set_manifold(Triangulation<3> &triangulation)
+void
+set_manifold(Triangulation<3> &triangulation)
 {
   static const CylindricalManifold<3> boundary(2);
   triangulation.set_manifold(0, boundary);
index 0d2ba58bfc3738cb2c612159840de59ebd87c9e8..30d567811f4de511e6f39c7c1f490562d32fe8b1 100644 (file)
@@ -29,7 +29,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   Point<2> p(1. / 3., 1. / 2. - 1e-10); // avoid ambiguity for hypercube mesh
 
index 33c9968d146003f7244ecddd2f20e2a32a898f09..2d36a14c273146634a689142b8b711e8e91d2d1e 100644 (file)
@@ -48,7 +48,8 @@
 
 
 
-void create_coarse_grid(Triangulation<2> &coarse_grid)
+void
+create_coarse_grid(Triangulation<2> &coarse_grid)
 {
   static const Point<2> vertices_1[] = {
     Point<2>(9.6982181981258408e-02, 1.1255621492491609e+03), // 0
index 35a7e649f34a7a6d1a5e1cf79d7bde6b951aff32..52c9cc58f3c621fa903919fde9263b3b5d6688ce 100644 (file)
@@ -33,7 +33,8 @@
 #include "../tests.h"
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   // generate some random points bounded by [0., 0.2)^2 in R^2 space
   // any point in this domain should be inside one of the cells
index 190a60483f392d4d9a133bbf4924537f3c0dcff2..a319d8413dd1e0aece7152ae167ca34276606663 100644 (file)
@@ -28,7 +28,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   Point<3> p(1. / 3., 1. / 2., 1. / 5.);
 
index 71dc4b74cbb4efa26a0350ce15e40cfa382cba7d..181a1e5478c9d43dbfe9e92a4af2dd2029069cb2 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   Point<3> p(1. / 3., 1. / 2., -1. / 5.);
 
index afee9299ddf31997db59cc1bcee45a5c32cd7f3d..29b9d15394b0e1391f3857544a09a75a5a7299bd 100644 (file)
@@ -30,7 +30,8 @@
 
 #include "../tests.h"
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   Point<3> p(0.75, 0, 0);
 
index ed883cc1320e74ba8b562ff985e73d763b1fc897..4bb4c745aa857a1f9246f79aca56f2432952f6dc 100644 (file)
@@ -32,7 +32,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   Point<3> p(0.75, 0.75, 0.75);
 
index c065d17cc3027129c5f8a03d8afba4b434b0c73b..f579bc026795c1765a2014138f6a6d7ff093216a 100644 (file)
@@ -30,7 +30,8 @@
 
 #include "../tests.h"
 
-bool inside(Triangulation<3> &tria, Point<3> &p)
+bool
+inside(Triangulation<3> &tria, Point<3> &p)
 {
   for (Triangulation<3>::cell_iterator cell = tria.begin(0);
        cell != tria.end(0);
index 90bd1a557e928662316da5001a5e7151bd8c7290..34b1adba0325913d60d5989c3ef64711ab517c51 100644 (file)
@@ -39,7 +39,8 @@
 
 #include "../tests.h"
 
-bool inside(Triangulation<3> &tria, Point<3> &p)
+bool
+inside(Triangulation<3> &tria, Point<3> &p)
 {
   for (Triangulation<3>::cell_iterator cell = tria.begin(0);
        cell != tria.end(0);
index ba9ed1d0da72ffd94f3f6e22f7fab32d7014d682..1fccac5cc76915d1953371abe12d297a28b59462 100644 (file)
@@ -30,7 +30,8 @@
 #include "../tests.h"
 
 
-void create_coarse_grid(Triangulation<2> &coarse_grid)
+void
+create_coarse_grid(Triangulation<2> &coarse_grid)
 {
   static const Point<2> vertices_1[] = {
     Point<2>(0., 0.),       // 0
@@ -62,7 +63,8 @@ void create_coarse_grid(Triangulation<2> &coarse_grid)
 }
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   Point<2> p(0.99, 1. / 2.);
 
index a361c97ea6f5f52c1a716ca2b99a66baa1730a08..af0e63891edf13dd6af5088eab3e85a82591ce87 100644 (file)
@@ -30,7 +30,8 @@
 #include "../tests.h"
 
 
-void create_coarse_grid(Triangulation<2> &coarse_grid)
+void
+create_coarse_grid(Triangulation<2> &coarse_grid)
 {
   static const Point<2> vertices_1[] = {
     Point<2>(0., 0.), // 0
@@ -65,7 +66,8 @@ void create_coarse_grid(Triangulation<2> &coarse_grid)
 }
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   Point<2> p(0.99, 1. / 2.);
 
index 2e15ef0320d14e11246b810d25dbfb3415bae5c8..86696fe05d867433ad004aadb9cb96fe0fa624a6 100644 (file)
@@ -32,7 +32,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   MappingQ<2> map(3); // Let's take a higher order mapping
 
index adb2e6f03b7a4e665fbe77b9270dcef849c95136..86ca4ecc7823d6d8ce23d0d9c3c47408fe181c6f 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   MappingQ<3> map(3);
 
index e7a85ce214ed89105a8ab7b6acf2e15185daddc9..7abd908516a3f6d230037ed24af6557520b835f4 100644 (file)
@@ -32,7 +32,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   MappingQ<3> map(3);
 
index 1f98182b0dc96f18fba216ac94d722873c22cc42..e8ba9db79a8a3787915d837c4718934d2351c707 100644 (file)
@@ -30,7 +30,8 @@
 #include "../tests.h"
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   MappingQ<3> map(1);
 
index 204bfff1a30e76ad809484fecf6de108cee890d7..d78720c563e8b85d7f04e3bbeed09a21548d3512 100644 (file)
@@ -30,7 +30,8 @@
 #include "../tests.h"
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   MappingQ<3> map(1);
   Point<3>    p(0.75, 0.75, 0.75);
index 51a0c54c0cca9d1d51882c3715213af0cccf1590..1d332511d0d2ed7f94db11b713612c128dfbe743 100644 (file)
@@ -41,7 +41,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   const std::vector<Point<2>> &v = tria.get_vertices();
   MappingQ<2>                  map(1);
index 19db4e328b7bfc6013acedd134c2f4bdcb01ebd2..dbc994cd7cb8d75bec7ba842ff960113ba3c9c86 100644 (file)
@@ -33,7 +33,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   MappingQ<2> map(5);
 
index 9b1d1f893c7f0b3ea9eb59cb74d5959e6c43c712..6cdde75db4b087b9dee086f9247974270bd67775 100644 (file)
@@ -39,7 +39,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   for (unsigned i = 0; i < tria.n_vertices(); i++)
     {
index 6e41e5174b3149043c5e6484e14a00e742ab14ea..0267a585279644bc066fe876de0f276158bacd2a 100644 (file)
@@ -28,7 +28,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   for (unsigned i = 0; i < tria.n_vertices(); i++)
     {
index 5ed7ab092d216d43c3e4722c7f2da6bbaf17cb12..ab28706eb8c161f82399e6d73a454a29c6e538c5 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   for (unsigned i = 0; i < tria.n_vertices(); i++)
     {
index ccaf112eab75affe23baacb4dcfa0970bba88870..c941b31dba4cc187db3dff9616ec497522637648 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void check(Triangulation<2> &tria)
+void
+check(Triangulation<2> &tria)
 {
   for (unsigned i = 0; i < tria.n_vertices(); i++)
     {
index 3d969356841b953e4c7e203fa62a5239254e1d5e..a265fd2a9c782f49108ce4a9ef3a488dde9e58fb 100644 (file)
@@ -29,7 +29,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   for (unsigned i = 0; i < tria.n_vertices(); i++)
     {
index 6d8ae76c4e5e71967278dbc26879fc1433c89108..6dc0e6c5359faa3d68cd90daedf87ab26a2937a5 100644 (file)
@@ -34,7 +34,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   for (unsigned i = 0; i < tria.n_vertices(); i++)
     {
index 0f5c2dfb2da08aae0887a6f70d5c02304ea3cafd..b458c5c4816077850fb10e787c3e9171569449e9 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   const std::vector<Point<3>> &v = tria.get_vertices();
   for (unsigned i = 0; i < v.size(); i++)
index ee5590b633381a7e4b8f89860b8726e9a919d259..fcad04582d09e6ad3b19561a91f1ceb4dff35b3b 100644 (file)
@@ -44,7 +44,8 @@
 // not a, as it should. Simply looking at the identity of the neighboring cell
 // is not enough, we have to look at the (index of the) face instead.
 
-void create_grid(Triangulation<2> &tria)
+void
+create_grid(Triangulation<2> &tria)
 {
   const unsigned int n_points = 5;
 
index 100d9aff0642d4f4f496ac879b5c55982aa2c72b..5f87a80acda50517a7f425a2eed392ff71fbb1bf 100644 (file)
@@ -38,7 +38,8 @@
 
 
 
-void create_two_cubes(Triangulation<3> &coarse_grid)
+void
+create_two_cubes(Triangulation<3> &coarse_grid)
 {
   const Point<3>        points[6] = {Point<3>(0, 0, 0),
                               Point<3>(1, 0, 0),
@@ -75,7 +76,8 @@ void create_two_cubes(Triangulation<3> &coarse_grid)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   QGauss<2>       quadrature(3);
   FE_Q<3>         fe(1);
index dcc475e9f8152747797b2ad33f1986785c6af77c..3ec4c832778ff88a8cce89602e12018ba8e9dcca 100644 (file)
@@ -41,7 +41,8 @@ check(const Triangulation<dim> &tria)
     Assert(cell->active_cell_index() == index, ExcInternalError());
 }
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   const int dim = 1;
 
@@ -51,7 +52,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -65,7 +67,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index 824a84586bd79d2b3975185b37f8b2f6e855a6ca..4510d11dfbc483cef4d2ad840f0c8c1210639dc1 100644 (file)
@@ -45,7 +45,8 @@ check(const Triangulation<dim> &tria)
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   tria.refine_global(2);
   tria.begin_active()->set_refine_flag();
@@ -53,7 +54,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -67,7 +69,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index c618bffdf19ccf6aa39bfb747362deb73d9f17ec..7b930a92bd41996b93b266c18d4c4cd39d688af3 100644 (file)
@@ -44,7 +44,8 @@ check(const Triangulation<dim> &tria)
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   tria.refine_global(2);
   tria.begin_active()->set_refine_flag();
@@ -52,7 +53,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -66,7 +68,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index 02df1fe95b62f2e3d625009221852008c1f97d6b..a8fd2c904f9e6a543548e6f3027cd9eddfc72f16 100644 (file)
@@ -47,7 +47,8 @@ check(const Triangulation<dim> &tria)
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   tria.refine_global(2);
   tria.begin_active()->set_refine_flag();
@@ -55,7 +56,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -69,7 +71,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index ef6a3547543b43d5ce0bf1faf3f7104af84f7e0c..e8feccbfd00d8ad1ed4fb5d047dcd2665f40ec3b 100644 (file)
@@ -52,7 +52,8 @@ check(const Triangulation<dim> &tria)
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   tria.refine_global(2);
   tria.begin_active()->set_refine_flag();
@@ -60,7 +61,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -74,7 +76,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index ec85989365c8b37a7ada614b5b3a5fe8c3d712fb..18473eb8636a744617bdd71461bbecb2194c9e70 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   const int dim = 1;
 
@@ -40,7 +41,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -54,7 +56,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index 05f5f235a429db2e3865e1c1b9b4371014974c37..1389c609255553ff5d781f61cc565945c8e216e1 100644 (file)
@@ -32,7 +32,8 @@
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   tria.refine_global(2);
   tria.begin_active()->set_refine_flag();
@@ -40,7 +41,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -54,7 +56,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index 68e34fcee08a56e2d5ffd3cfaa9e1a7577a14e59..9266ebfc2d2d766ca5b48d4ed1b49675306eb2c3 100644 (file)
@@ -31,7 +31,8 @@
 
 
 
-void do_refine(Triangulation<1> &tria)
+void
+do_refine(Triangulation<1> &tria)
 {
   tria.refine_global(2);
   tria.begin_active()->set_refine_flag();
@@ -39,7 +40,8 @@ void do_refine(Triangulation<1> &tria)
 }
 
 
-void do_refine(Triangulation<2> &tria)
+void
+do_refine(Triangulation<2> &tria)
 {
   const int dim = 2;
 
@@ -53,7 +55,8 @@ void do_refine(Triangulation<2> &tria)
 }
 
 
-void do_refine(Triangulation<3> &tria)
+void
+do_refine(Triangulation<3> &tria)
 {
   const int dim = 3;
 
index b6fdfe19c2adaea1681bcd9a92a3e0c0ca55a7fa..8a82155da05f26a7a8d642961f3e88cc1dcad4f2 100644 (file)
@@ -52,7 +52,8 @@
 #include "../tests.h"
 
 
-void evaluate_normal(DoFHandler<2> &dof_handler, Vector<double> &solution)
+void
+evaluate_normal(DoFHandler<2> &dof_handler, Vector<double> &solution)
 {
   // This quadrature rule determines
   // the points, where the continuity
index b7b5923d07f2afa7b00e07111b09c73f02bb0f31..e726c69985ecb2fe98a49db74924d3f2177020de 100644 (file)
@@ -177,9 +177,9 @@ namespace Evaluation
 
   template <int dim>
   void
-  PointXDerivativeEvaluation<dim>::
-  operator()(const DoFHandler<dim> &dof_handler,
-             const Vector<double> & solution) const
+  PointXDerivativeEvaluation<dim>::operator()(
+    const DoFHandler<dim> &dof_handler,
+    const Vector<double> & solution) const
   {
     double point_derivative = 0;
 
@@ -1031,7 +1031,8 @@ namespace Data
 
 
   template <>
-  void Exercise_2_3<2>::create_coarse_grid(Triangulation<2> &coarse_grid)
+  void
+  Exercise_2_3<2>::create_coarse_grid(Triangulation<2> &coarse_grid)
   {
     const unsigned int dim = 2;
 
@@ -1686,8 +1687,7 @@ namespace LaplaceSolver
     for (unsigned int t = 0;
          (t < this_thread) && (cell != dual_solver.dof_handler.end());
          ++t, ++cell)
-      {
-      }
+      {}
 
 
     if (cell == dual_solver.dof_handler.end())
@@ -1739,8 +1739,7 @@ namespace LaplaceSolver
         for (unsigned int t = 0;
              ((t < n_threads) && (cell != dual_solver.dof_handler.end()));
              ++t, ++cell, ++cell_index)
-          {
-          }
+          {}
 
         if (cell == dual_solver.dof_handler.end())
           break;
index 5282b9413817b4f41142f03fef87472e88650910..06ef563dfee03da7a66c080f5df2b8577c463eb3 100644 (file)
@@ -39,7 +39,8 @@
 std::ofstream logfile("output");
 
 
-void make_grid(Triangulation<2> &triangulation)
+void
+make_grid(Triangulation<2> &triangulation)
 {
   const Point<2> center(1, 0);
   const double   inner_radius = 0.5, outer_radius = 1.0;
@@ -75,7 +76,8 @@ void make_grid(Triangulation<2> &triangulation)
 }
 
 
-void distribute_dofs(DoFHandler<2> &dof_handler)
+void
+distribute_dofs(DoFHandler<2> &dof_handler)
 {
   static const FE_Q<2> finite_element(1);
   dof_handler.distribute_dofs(finite_element);
@@ -92,7 +94,8 @@ void distribute_dofs(DoFHandler<2> &dof_handler)
 
 
 
-void renumber_dofs(DoFHandler<2> &dof_handler)
+void
+renumber_dofs(DoFHandler<2> &dof_handler)
 {
   DoFRenumbering::Cuthill_McKee(dof_handler);
   SparsityPattern sparsity_pattern(dof_handler.n_dofs(), dof_handler.n_dofs());
index fd4bd9017d5d7d2718e490910d1707c038b012ad..ec26f6b6d71f6f4025009429d64d8e04e6262f69 100644 (file)
@@ -186,7 +186,8 @@ LaplaceKernelIntegration<dim>::term_D(const Tensor<1, 3> &r,
 }
 
 
-double integration(Point<3> point)
+double
+integration(Point<3> point)
 {
   Triangulation<2, 3> square;
   GridGenerator::hyper_cube<2, 3>(square, 0, 2);
index fc6b6cdde513325dc35e74d70c57a474ac3c1689..3521c8de58245bdc81fe2720850d197c5a6c8a1a 100644 (file)
 
 
 
-void cylinder(Triangulation<3> &tria,
-              const double      radius      = 1,
-              const double      half_length = 1)
+void
+cylinder(Triangulation<3> &tria,
+         const double      radius      = 1,
+         const double      half_length = 1)
 {
   // Copy the base from hyper_ball<3>
   // and transform it to yz
index 2efa461297516ad731415bfa0788c9afc818cc1a..dddce75e51bfd23f322caf6cb509fa41fa90abc3 100644 (file)
@@ -48,7 +48,8 @@ display_matrix(FullMatrix<number> M)
 }
 
 template <int b>
-void fill_tensor_2(Tensor<2, b> &T)
+void
+fill_tensor_2(Tensor<2, b> &T)
 {
   for (unsigned int i = 0; i < b; i++)
     for (unsigned int j = 0; j < b; j++)
@@ -57,7 +58,8 @@ void fill_tensor_2(Tensor<2, b> &T)
 
 
 template <int b>
-void display_tensor_2(Tensor<2, b> &T)
+void
+display_tensor_2(Tensor<2, b> &T)
 {
   deallog << b << "x" << b << " tensor" << std::endl;
   for (unsigned int i = 0; i < b; i++)
index 54913adf2aec38b0fe00459fecece4a4bc4d187a..38da36089baec046dfabaa631efbdf856323e6fd 100644 (file)
@@ -54,12 +54,12 @@ public:
 
 template <int dim, int fe_degree>
 __device__ void
-DummyOperator<dim, fe_degree>::
-operator()(const unsigned int                                          cell,
-           const typename CUDAWrappers::MatrixFree<dim, double>::Data *gpu_data,
-           CUDAWrappers::SharedData<dim, double> *,
-           const double *,
-           double *dst) const
+DummyOperator<dim, fe_degree>::operator()(
+  const unsigned int                                          cell,
+  const typename CUDAWrappers::MatrixFree<dim, double>::Data *gpu_data,
+  CUDAWrappers::SharedData<dim, double> *,
+  const double *,
+  double *dst) const
 {
   const unsigned int pos = CUDAWrappers::local_q_point_id<dim, double>(
     cell, gpu_data, n_dofs_1d, n_q_points);
index 94edcbec0767afdda424a94e7f3360b6954f1555..565ad348ec3bc790752ceb03d2a39c06cee28450 100644 (file)
@@ -27,7 +27,8 @@
 #include <iostream>
 
 
-void create_mesh(Triangulation<2> &tria, const double scale_grid = 1.)
+void
+create_mesh(Triangulation<2> &tria, const double scale_grid = 1.)
 {
   const unsigned int      dim = 2;
   std::vector<Point<dim>> points(12);
@@ -78,7 +79,8 @@ void create_mesh(Triangulation<2> &tria, const double scale_grid = 1.)
 
 
 
-void create_mesh(Triangulation<3> &tria, const double scale_grid = 1.)
+void
+create_mesh(Triangulation<3> &tria, const double scale_grid = 1.)
 {
   const unsigned int      dim = 3;
   std::vector<Point<dim>> points(24);
index cec4c58bd8ce1e7f5f0c22489dc7664bcd5aeda7..68e1f279f5ac03d01b8d99922ccca3e39f954f09 100644 (file)
@@ -39,7 +39,8 @@ test_cpu()
   deallog << "norm_square: " << t.norm_square() << std::endl;
 }
 
-__global__ void init_kernel(Tensor<2, 3> *t, const unsigned int N)
+__global__ void
+init_kernel(Tensor<2, 3> *t, const unsigned int N)
 {
   const unsigned int i = threadIdx.y;
   const unsigned int j = threadIdx.x;
@@ -47,7 +48,8 @@ __global__ void init_kernel(Tensor<2, 3> *t, const unsigned int N)
     (*t)[i][j] = j + i * N + 1.;
 }
 
-__global__ void norm_kernel(Tensor<2, 3> *t, double *norm, double *norm_square)
+__global__ void
+norm_kernel(Tensor<2, 3> *t, double *norm, double *norm_square)
 {
   if (threadIdx.x == 0)
     {
index be392d5583d6576416c48f1a2ad0019870205698..e3a5226bb7b28d5deaded4f6b91218222bd96f47 100644 (file)
@@ -89,14 +89,16 @@ division_kernel(Tensor<rank, dim, Number> *t,
 }
 
 template <int dim, typename Number>
-__global__ void init_kernel(Tensor<0, dim, Number> *t)
+__global__ void
+init_kernel(Tensor<0, dim, Number> *t)
 {
   if (threadIdx.x == 0)
     *t = 1.;
 }
 
 template <int dim, typename Number>
-__global__ void init_kernel(Tensor<1, dim, Number> *t)
+__global__ void
+init_kernel(Tensor<1, dim, Number> *t)
 {
   const unsigned int i = threadIdx.x;
   if (i < dim)
@@ -104,7 +106,8 @@ __global__ void init_kernel(Tensor<1, dim, Number> *t)
 }
 
 template <int dim, typename Number>
-__global__ void init_kernel(Tensor<2, dim, Number> *t)
+__global__ void
+init_kernel(Tensor<2, dim, Number> *t)
 {
   const unsigned int i = threadIdx.y;
   const unsigned int j = threadIdx.x;
index dc47e1323e0b31ba2e8cfcd03470daa367be50ab..fb42250267e721e159af67750be9ad34da233781 100644 (file)
@@ -121,7 +121,7 @@ test()
                  fe_degree,
                  Number,
                  LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA>>
-                                                                mf(mf_data, coef_size);
+    mf(mf_data, coef_size);
   LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA> in_dev;
   LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA> out_dev;
   mf_data.initialize_dof_vector(in_dev);
index e39e1b421859fefb0dcb74e41210c5963909d48c..450d6445126ec446754bba60ac61c4cbfcf9241e 100644 (file)
@@ -117,7 +117,7 @@ test()
                  fe_degree,
                  Number,
                  LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA>>
-                                                                mf(mf_data, coef_size);
+    mf(mf_data, coef_size);
   LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA> in_dev(
     owned_set, MPI_COMM_WORLD);
   LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA> out_dev(
index 38e27a70364029dfb6bf763b0419b3b942a8859f..baa2dc896062364dcdad92b8c1510ee4b074a91c 100644 (file)
@@ -124,7 +124,7 @@ test()
                  fe_degree,
                  Number,
                  LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA>>
-                                                                mf(mf_data, coef_size);
+    mf(mf_data, coef_size);
   LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA> in_dev;
   LinearAlgebra::distributed::Vector<Number, MemorySpace::CUDA> out_dev;
   mf_data.initialize_dof_vector(in_dev);
index e27fdc1d0ee7447f23d08d63c67d5655e5c3f0e1..55c605e18297d7b9b40cb12876c678d7c54cfd9f 100644 (file)
@@ -35,7 +35,8 @@ public:
     : coef(coef)
   {}
 
-  __device__ void operator()(
+  __device__ void
+  operator()(
     CUDAWrappers::FEEvaluation<dim, fe_degree, n_q_points_1d, 1, Number>
       *fe_eval) const;
 
@@ -46,9 +47,10 @@ private:
 
 
 template <int dim, int fe_degree, typename Number, int n_q_points_1d>
-__device__ void HelmholtzOperatorQuad<dim, fe_degree, Number, n_q_points_1d>::
-                operator()(CUDAWrappers::FEEvaluation<dim, fe_degree, n_q_points_1d, 1, Number>
-             *fe_eval) const
+__device__ void
+HelmholtzOperatorQuad<dim, fe_degree, Number, n_q_points_1d>::operator()(
+  CUDAWrappers::FEEvaluation<dim, fe_degree, n_q_points_1d, 1, Number> *fe_eval)
+  const
 {
   fe_eval->submit_value(coef * fe_eval->get_value());
   fe_eval->submit_gradient(fe_eval->get_gradient());
@@ -85,12 +87,12 @@ public:
 
 template <int dim, int fe_degree, typename Number, int n_q_points_1d>
 __device__ void
-HelmholtzOperator<dim, fe_degree, Number, n_q_points_1d>::
-operator()(const unsigned int                                          cell,
-           const typename CUDAWrappers::MatrixFree<dim, Number>::Data *gpu_data,
-           CUDAWrappers::SharedData<dim, Number> *shared_data,
-           const Number *                         src,
-           Number *                               dst) const
+HelmholtzOperator<dim, fe_degree, Number, n_q_points_1d>::operator()(
+  const unsigned int                                          cell,
+  const typename CUDAWrappers::MatrixFree<dim, Number>::Data *gpu_data,
+  CUDAWrappers::SharedData<dim, Number> *                     shared_data,
+  const Number *                                              src,
+  Number *                                                    dst) const
 {
   const unsigned int pos = CUDAWrappers::local_q_point_id<dim, Number>(
     cell, gpu_data, n_dofs_1d, n_q_points);
@@ -134,9 +136,9 @@ private:
 
 template <int dim, int fe_degree, typename Number, int n_q_points_1d>
 __device__ void
-VaryingCoefficientFunctor<dim, fe_degree, Number, n_q_points_1d>::
-operator()(const unsigned int                                          cell,
-           const typename CUDAWrappers::MatrixFree<dim, Number>::Data *gpu_data)
+VaryingCoefficientFunctor<dim, fe_degree, Number, n_q_points_1d>::operator()(
+  const unsigned int                                          cell,
+  const typename CUDAWrappers::MatrixFree<dim, Number>::Data *gpu_data)
 {
   const unsigned int pos = CUDAWrappers::local_q_point_id<dim, Number>(
     cell, gpu_data, n_dofs_1d, n_q_points);
index 4ae0b540b9ffb6a6d91ea2352790a7f10f72974b..6530cf9f6bdb90f09a498fefb6e968c462f8b4e3 100644 (file)
@@ -102,7 +102,7 @@ test(Utilities::CUDA::Handle &cuda_handle)
   CUDAWrappers::SparseMatrix<double> A_diagonal_inverse_dev(cuda_handle,
                                                             A_diagonal_inverse);
   RelaxationOperator<CUDAWrappers::SparseMatrix<double>>
-                                              relaxation_operator_dev(A_dev, A_diagonal_inverse_dev);
+    relaxation_operator_dev(A_dev, A_diagonal_inverse_dev);
   LinearAlgebra::CUDAWrappers::Vector<double> sol_dev(size);
   LinearAlgebra::CUDAWrappers::Vector<double> rhs_dev(size);
   LinearAlgebra::ReadWriteVector<double>      rw_vector(size);
index 7fe9fa40dc19e8cc2bd06703ea17c12c6c05c286..30839fabb242b02378806c752de7f9efe19ed175 100644 (file)
@@ -56,7 +56,8 @@ std::ofstream logfile("output");
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation, int orientation)
+void
+generate_grid(Triangulation<2> &triangulation, int orientation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -111,7 +112,8 @@ void generate_grid(Triangulation<2> &triangulation, int orientation)
 }
 
 /* The 2D in 3D case */
-void generate_grid(Triangulation<2, 3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<2, 3> &triangulation, int orientation)
 {
   Point<3> vertices_1[] = {
     Point<3>(-1., -3., 0.),
@@ -166,7 +168,8 @@ void generate_grid(Triangulation<2, 3> &triangulation, int orientation)
 }
 
 /* The 3D case */
-void generate_grid(Triangulation<3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<3> &triangulation, int orientation)
 {
   Point<3>              vertices_1[] = {Point<3>(-1., -1., -3.),
                            Point<3>(+1., -1., -3.),
index b13dffffcbc02844780b24d154fb49096211fcdb..b8b622831ee213af9d1a7ab0850fadbb8234df43 100644 (file)
@@ -58,7 +58,8 @@ std::ofstream logfile("output");
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation)
+void
+generate_grid(Triangulation<2> &triangulation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -108,7 +109,8 @@ void generate_grid(Triangulation<2> &triangulation)
 }
 
 /* The 2D in 3D case */
-void generate_grid(Triangulation<2, 3> &triangulation)
+void
+generate_grid(Triangulation<2, 3> &triangulation)
 {
   Point<3> vertices_1[] = {
     Point<3>(-1., -3., 0.),
index 482042de0eeb03f45c1aabdbbf8845c89ff1cba3..e3a14c482390e348ac754ef84eb9ae1e08bf268a 100644 (file)
@@ -92,7 +92,8 @@ std::ofstream logfile("output");
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation)
+void
+generate_grid(Triangulation<2> &triangulation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -142,7 +143,8 @@ void generate_grid(Triangulation<2> &triangulation)
 }
 
 /* The 2D in 3D case */
-void generate_grid(Triangulation<2, 3> &triangulation)
+void
+generate_grid(Triangulation<2, 3> &triangulation)
 {
   Point<3> vertices_1[] = {
     Point<3>(-1., -3., 0.),
index 392959e2b61cf73a67ba59b276ce56dcfd6d8a05..a2ba6417d521e988c0e035aa2a4b6f5927b7da91 100644 (file)
@@ -56,7 +56,8 @@ std::ofstream logfile("output");
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation)
+void
+generate_grid(Triangulation<2> &triangulation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -107,7 +108,8 @@ void generate_grid(Triangulation<2> &triangulation)
 }
 
 /* The 2D in 3D case */
-void generate_grid(Triangulation<2, 3> &triangulation)
+void
+generate_grid(Triangulation<2, 3> &triangulation)
 {
   Point<3> vertices_1[] = {
     Point<3>(-1., -3., 0.),
index 86f7501a10176634805a377baac1d218e758f8ce..68df610d913ebd75789e6830c0c38943f857c9c0 100644 (file)
@@ -59,7 +59,8 @@ std::ofstream logfile("output");
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation, int orientation)
+void
+generate_grid(Triangulation<2> &triangulation, int orientation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -115,7 +116,8 @@ void generate_grid(Triangulation<2> &triangulation, int orientation)
 }
 
 /* The 2D in 3D case */
-void generate_grid(Triangulation<2, 3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<2, 3> &triangulation, int orientation)
 {
   Point<3> vertices_1[] = {
     Point<3>(-1., -3., 0.),
@@ -171,7 +173,8 @@ void generate_grid(Triangulation<2, 3> &triangulation, int orientation)
 }
 
 /* The 3D case */
-void generate_grid(Triangulation<3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<3> &triangulation, int orientation)
 {
   Point<3>              vertices_1[] = {Point<3>(-1., -1., -3.),
                            Point<3>(+1., -1., -3.),
index 01a21c35bb06d45da9cf228a552100669695feb5..44d54eb6cf3e2dd91fa4ea66171ab7ec02690745 100644 (file)
@@ -84,7 +84,8 @@ create_and_print_flux_sparsity_pattern(const DoFHandler<dim> &dof_handler)
  * Create the 3-cells-triangulation (described at the top) by first creating 2
  * cells one the same level and then refining the right one.
  */
-void create_3_elements_on_2_different_levels(Triangulation<1> &triangulation)
+void
+create_3_elements_on_2_different_levels(Triangulation<1> &triangulation)
 {
   const unsigned int n_elements = 3;
   GridGenerator::subdivided_hyper_cube(triangulation, n_elements - 1);
index ab0a8eab0942ca12d8d24d677f33a64e013208e9..a5f8c78db50d3b7d2f42b36045ced3e47975208b 100644 (file)
@@ -116,7 +116,8 @@ test_with_both_dof_handlers(const Triangulation<dim> &triangulation)
 
 
 //  Create the 3-cell-triangulation described at the top.
-void create_3_cell_triangulation(Triangulation<1> &triangulation)
+void
+create_3_cell_triangulation(Triangulation<1> &triangulation)
 {
   const unsigned int n_elements = 3;
   const double       left       = -1;
index d168e258401eab2778d64309a0b7a7e5cb4b172c..da8a89d697d36abe292cba9ce10907937b21ba89 100644 (file)
@@ -77,7 +77,8 @@ set_boundary_ids(Triangulation<dim> &tria)
 }
 
 
-void set_boundary_ids(Triangulation<1> &)
+void
+set_boundary_ids(Triangulation<1> &)
 {}
 
 
index 56cb5dac891c996520ac81e690efe212028b3df7..742e55e0b4ddc5244fb8afa330b807042cf6239a 100644 (file)
@@ -60,7 +60,8 @@ output_bool_vector(std::vector<bool> &v)
 
 
 
-void set_boundary_ids(Triangulation<1> &)
+void
+set_boundary_ids(Triangulation<1> &)
 {}
 
 
index cdc4a1917adbd109db53de331aaaac8ed0bd3490..6aae4ba9e5fb3f3d5a16404eb1c3a16dea8382fd 100644 (file)
@@ -341,7 +341,8 @@ TestPoly<dim>::vector_value(const Point<dim> &p,
  * Check the value of the derivative field.
  */
 
-double TestProjection(Mapping<2> &mapping, DoFHandler<2> *dof_handler)
+double
+TestProjection(Mapping<2> &mapping, DoFHandler<2> *dof_handler)
 {
   Vector<double> solution;
   solution.reinit(dof_handler->n_dofs());
index 793512157ede33c7657d4b8414331eb4a8144fd2..7f349cfd3dab4375b6a7978b549cfb3775d258b8 100644 (file)
@@ -183,9 +183,9 @@ namespace Evaluation
 
   template <int dim>
   void
-  PointXDerivativeEvaluation<dim>::
-  operator()(const DoFHandler<dim> &dof_handler,
-             const Vector<double> & solution) const
+  PointXDerivativeEvaluation<dim>::operator()(
+    const DoFHandler<dim> &dof_handler,
+    const Vector<double> & solution) const
   {
     double point_derivative = 0;
 
@@ -1047,7 +1047,8 @@ namespace Data
 
 
   template <>
-  void Exercise_2_3<2>::create_coarse_grid(Triangulation<2> &coarse_grid)
+  void
+  Exercise_2_3<2>::create_coarse_grid(Triangulation<2> &coarse_grid)
   {
     const unsigned int dim = 2;
 
index 91879d2ea7a7be2fef320e56c828639fa36af98a..95754bb13212623571bc88cfe889c7e775b90d7e 100644 (file)
@@ -267,9 +267,10 @@ TestDef3<dim>::vector_value(const Point<dim> &p,
  * Integrate the function value over the element.
  */
 
-double EvaluateArea(Mapping<2> &    mapping,
-                    DoFHandler<2> * dof_handler,
-                    Vector<double> &solution)
+double
+EvaluateArea(Mapping<2> &    mapping,
+             DoFHandler<2> * dof_handler,
+             Vector<double> &solution)
 {
   // Use a high order quadrature.
   QGauss<2>   quad(6);
index 588263c1a7c3ed09292328180a0f1f25f12fe6c6..400803edab53a1d13cc3f755b93da6bd1376d567 100644 (file)
@@ -278,9 +278,10 @@ TestDef3<dim>::vector_value(const Point<dim> &p,
  * Check the value of the derivative field.
  */
 
-double EvaluateDiver(Mapping<2> &    mapping,
-                     DoFHandler<2> & dof_handler,
-                     Vector<double> &solution)
+double
+EvaluateDiver(Mapping<2> &    mapping,
+              DoFHandler<2> & dof_handler,
+              Vector<double> &solution)
 {
   // Use a high order quadrature.
   QGauss<2>   quad(6);
index 8234118ec951df7fe5ab19ebe79fd03db56f1c97..6338d3bd90101aa2fc96550d47f3aa100b141293 100644 (file)
@@ -61,7 +61,8 @@
  * Check the value of the derivative field.
  */
 
-void EvaluateDerivative(DoFHandler<2> *dof_handler, Vector<double> &solution)
+void
+EvaluateDerivative(DoFHandler<2> *dof_handler, Vector<double> &solution)
 {
   // This quadrature rule determines the points, where the
   // derivative will be evaluated.
@@ -545,7 +546,8 @@ project(const Mapping<dim> &             mapping,
 }
 
 
-int create_alternate_unitsquare(Triangulation<2> &tria)
+int
+create_alternate_unitsquare(Triangulation<2> &tria)
 {
   std::vector<Point<2>> points;
 
index a24a65cec408800a0dadda3e7e12cc53089b525d..d44a7574a432a6e720986995b7289d8796affb2e 100644 (file)
@@ -60,7 +60,8 @@
  * Check the value of the derivative field.
  */
 
-void EvaluateDerivative(DoFHandler<3> &dof_handler, Vector<double> &solution)
+void
+EvaluateDerivative(DoFHandler<3> &dof_handler, Vector<double> &solution)
 {
   // This quadrature rule determines the points, where the
   // derivative will be evaluated.
index 05746fc71a0a427361a0f60a65a407ba02a9c40d..46703c566d43a29e98968262b64b9b7c77d7af69 100644 (file)
@@ -56,7 +56,8 @@ tilt_coordinates(const Point<2> p)
 }
 
 
-void transform_grid(Triangulation<2> &tria, const unsigned int transform)
+void
+transform_grid(Triangulation<2> &tria, const unsigned int transform)
 {
   switch (transform)
     {
index 3672151d59079fb54ea7db0bb59657967d06a0bc..53ae566e40bfb65c1a9006b086381d9f3058da5b 100644 (file)
@@ -326,7 +326,8 @@ TestPoly<dim>::vector_value(const Point<dim> &p,
  * Check the value of the derivative field.
  */
 
-double TestProjection(Mapping<2> &mapping, DoFHandler<2> *dof_handler)
+double
+TestProjection(Mapping<2> &mapping, DoFHandler<2> *dof_handler)
 {
   Vector<double> solution;
   solution.reinit(dof_handler->n_dofs());
index d537359312e8cd66b1f0af22c8cec0c70bbb95a2..c265a71b1828df2315964415a7b4f0e72e5bc6f9 100644 (file)
@@ -113,7 +113,8 @@ TestMap1<dim>::vector_value(const Point<dim> &p,
  * Check the value of the derivative field.
  */
 
-void EvaluateDerivative(DoFHandler<2> *dof_handler, Vector<double> &solution)
+void
+EvaluateDerivative(DoFHandler<2> *dof_handler, Vector<double> &solution)
 {
   // This quadrature rule determines the points, where the
   // derivative will be evaluated.
@@ -654,7 +655,8 @@ create_tria(unsigned int elm, Triangulation<2> &tria)
 }
 
 
-void plot_shapes(DoFHandler<2> &dof_handler)
+void
+plot_shapes(DoFHandler<2> &dof_handler)
 {
   Vector<double>         solution(dof_handler.n_dofs());
   std::set<unsigned int> face_dofs;
index b9c63e3e46732237695bfc1e8459e65720c6ac2c..d3a765ec36ff8590df5767e3be03c2b2d72fbef5 100644 (file)
@@ -89,7 +89,8 @@ test_2d_3d(std::vector<FiniteElement<dim> *> &fe_datas)
 
 
 
-void test_2d_3d(std::vector<FiniteElement<1> *> &fe_datas)
+void
+test_2d_3d(std::vector<FiniteElement<1> *> &fe_datas)
 {}
 
 
index b0c9605e922fd7622f70903d0908d246e709adc6..186d23f4b13be147327ba7642d15993649b227c2 100644 (file)
@@ -290,13 +290,15 @@ struct ParameterCollection
   void
   print();
 
-  void set_enrichment_point(Point<2> &p, const unsigned int i)
+  void
+  set_enrichment_point(Point<2> &p, const unsigned int i)
   {
     AssertDimension(dim, 2);
     p(0) = points_enrichments[2 * i];
     p(1) = points_enrichments[2 * i + 1];
   }
-  void set_enrichment_point(Point<3> &p, const unsigned int i)
+  void
+  set_enrichment_point(Point<3> &p, const unsigned int i)
   {
     AssertDimension(dim, 3);
     p(0) = points_enrichments[3 * i];
index a291980f18183b105d15556378dced655e9c2b6d..88dc8acc507e0949fdc5cdb45fc808a0f242fa18 100644 (file)
@@ -33,7 +33,8 @@
 
 #include "../tests.h"
 
-void create_reference_triangulation(Triangulation<3> &tria)
+void
+create_reference_triangulation(Triangulation<3> &tria)
 {
   std::vector<unsigned int> repetitions(3, 1);
 
@@ -44,10 +45,11 @@ void create_reference_triangulation(Triangulation<3> &tria)
                                             Point<3>(1.0, 1.0, 1.0));
 }
 
-void create_triangulation(Triangulation<3> &tria,
-                          const bool        face_orientation,
-                          const bool        face_flip,
-                          const bool        face_rotation)
+void
+create_triangulation(Triangulation<3> &tria,
+                     const bool        face_orientation,
+                     const bool        face_flip,
+                     const bool        face_rotation)
 {
   std::vector<CellData<3>> cells(2);
 
index 27861132f133ce71f585d1d7f0cadf0dfe40c73b..a6bc38d4aabaa2e2494af48ba8d827ea12c86d00 100644 (file)
 
 #include "../tests.h"
 
-void create_reference_triangulation(Triangulation<3> &triangulation)
+void
+create_reference_triangulation(Triangulation<3> &triangulation)
 {
   GridGenerator::hyper_cube(triangulation, -1.0, 1.0);
   triangulation.refine_global(1);
 }
 
-void create_triangulation(Triangulation<3> &triangulation)
+void
+create_triangulation(Triangulation<3> &triangulation)
 {
   static const Point<3> vertices_parallelograms[] = {
     Point<3>(-1., -1., -1.), // 0
index 768dd80d60d61407b236afa3b4ce9b5f5f2495ac..76ed2fe713a70ea01589e22d5ee4c4034ae0f0f2 100644 (file)
@@ -34,7 +34,8 @@
 
 #include "../tests.h"
 
-void create_reference_triangulation(Triangulation<3> &tria)
+void
+create_reference_triangulation(Triangulation<3> &tria)
 {
   std::vector<unsigned int> repetitions(3, 1);
 
@@ -45,10 +46,11 @@ void create_reference_triangulation(Triangulation<3> &tria)
                                             Point<3>(1.0, 1.0, 1.0));
 }
 
-void create_triangulation(Triangulation<3> &tria,
-                          const bool        face_orientation,
-                          const bool        face_flip,
-                          const bool        face_rotation)
+void
+create_triangulation(Triangulation<3> &tria,
+                     const bool        face_orientation,
+                     const bool        face_flip,
+                     const bool        face_rotation)
 {
   std::vector<CellData<3>> cells(2);
 
index 85e2ba211f5b3ff3d2d5b2fcd29bb0f98e257954..7211a9a7386bd144ab1b6d2e30e5e4238ec38521 100644 (file)
@@ -141,8 +141,9 @@ VectorFunction<dim>::vector_value(const Point<dim> &p,
     values(i) = value(p, i);
 }
 
-void create_tria(Triangulation<2> &triangulation,
-                 const Point<2> *  vertices_parallelograms)
+void
+create_tria(Triangulation<2> &triangulation,
+            const Point<2> *  vertices_parallelograms)
 {
   const std::vector<Point<2>> vertices(&vertices_parallelograms[0],
                                        &vertices_parallelograms[n_vertices]);
index 84ff5f72caf9478b90c589f9e713280ada43a1b1..9d873baddd6fe40cfce2f168402a30245605b452 100644 (file)
@@ -190,8 +190,9 @@ VectorFunction<3>::gradient(const Point<3> &   p,
   return val;
 }
 
-void create_tria(Triangulation<3> &triangulation,
-                 const Point<3> *  vertices_parallelograms)
+void
+create_tria(Triangulation<3> &triangulation,
+            const Point<3> *  vertices_parallelograms)
 {
   const std::vector<Point<3>> vertices(&vertices_parallelograms[0],
                                        &vertices_parallelograms[n_vertices]);
index 78176232ed6f89cb066104f305b1058c07eab388..e4ab347d5579c686f7c42204464370be018b854b 100644 (file)
@@ -126,12 +126,14 @@ print(const Table<3, double> &coeff)
   deallog << std::endl;
 }
 
-void resize(Table<2, double> &coeff, const unsigned int N)
+void
+resize(Table<2, double> &coeff, const unsigned int N)
 {
   coeff.reinit(N, N);
 }
 
-void resize(Table<3, double> &coeff, const unsigned int N)
+void
+resize(Table<3, double> &coeff, const unsigned int N)
 {
   TableIndices<3> size;
   for (unsigned int d = 0; d < 3; d++)
index 97ee685583a9deb3c07dd77bdc7339c897c7126c..f5860713113f72aef08a71ea13357a6e04b4cd1e 100644 (file)
@@ -69,7 +69,8 @@ TestFunction::value(const Point<2> &p, const unsigned int component) const
 
 
 
-void make_grid(Triangulation<2> &triangulation)
+void
+make_grid(Triangulation<2> &triangulation)
 {
   GridGenerator::hyper_cube(triangulation);
 
index 138ddcc9cea4e140f9dd434ccb8f3d352e4ab16b..7e074536cd51447ed1285a45afb80cf421b96749 100644 (file)
@@ -62,7 +62,8 @@ tilt_coordinates(const Point<2> p)
 }
 
 
-void transform_grid(Triangulation<2> &tria, const unsigned int transform)
+void
+transform_grid(Triangulation<2> &tria, const unsigned int transform)
 {
   switch (transform)
     {
index 877b8c863ae1b4636c6dd0533176068f0c80d6e5..92df4009d4d5536523fe6ffe120d87e8af7a8280 100644 (file)
@@ -56,7 +56,8 @@ tilt_coordinates(const Point<2> p)
 }
 
 
-void transform_grid(Triangulation<2> &tria, const unsigned int transform)
+void
+transform_grid(Triangulation<2> &tria, const unsigned int transform)
 {
   switch (transform)
     {
index 362d06e99a716b6c1389c3858829e827630a9d80..c37460f8ca80e6e9b691ff85850b26b58a4d509e 100644 (file)
@@ -338,7 +338,8 @@ TestPoly<dim>::vector_value(const Point<dim> &p,
  * Check the value of the derivative field.
  */
 
-double TestProjection(Mapping<2> &mapping, DoFHandler<2> *dof_handler)
+double
+TestProjection(Mapping<2> &mapping, DoFHandler<2> *dof_handler)
 {
   Vector<double> solution;
   solution.reinit(dof_handler->n_dofs());
index 551a7fa071d52cc2eec03205dff866dc5e18a5aa..e6462d54a08a5b67b79cb40e99ec624e35ae24e7 100644 (file)
@@ -56,7 +56,8 @@ tilt_coordinates(const Point<2> p)
 
 
 
-void transform_grid(Triangulation<2> &tria, const unsigned int transform)
+void
+transform_grid(Triangulation<2> &tria, const unsigned int transform)
 {
   switch (transform)
     {
index e7460b34e03acb2788bfd10b8d1d3acee50dc7e9..82f07dda85c45a1aa487a59bfa3ae4683772111f 100644 (file)
@@ -59,7 +59,8 @@ std::ofstream logfile("output");
  * Check if the normal component is continuous over element edges.
  */
 
-void EvaluateNormal2(DoFHandler<2> *dof_handler, Vector<double> &solution)
+void
+EvaluateNormal2(DoFHandler<2> *dof_handler, Vector<double> &solution)
 {
   // This quadrature rule determines the points, where the
   // continuity will be tested.
@@ -168,7 +169,8 @@ void EvaluateNormal2(DoFHandler<2> *dof_handler, Vector<double> &solution)
  * Check if the normal component is continuous over element edges.
  */
 
-void EvaluateNormal(DoFHandler<2> *dof_handler, Vector<double> &solution)
+void
+EvaluateNormal(DoFHandler<2> *dof_handler, Vector<double> &solution)
 {
   // This quadrature rule determines the points, where the
   // continuity will be tested.
index 3abe3b6df5911e3a2737fd5e58d0924172aee827..b7de15072b12baa09e3bcdc8970e2f738a950a6d 100644 (file)
@@ -377,10 +377,11 @@ plot_face_shape_functions(Mapping<dim> &      mapping,
 
 
 template <>
-void plot_face_shape_functions(Mapping<1> &,
-                               FiniteElement<1> &,
-                               const char *,
-                               UpdateFlags)
+void
+plot_face_shape_functions(Mapping<1> &,
+                          FiniteElement<1> &,
+                          const char *,
+                          UpdateFlags)
 {}
 
 
index 13e5845ad0cdae63285288196b2da4096c6e0ee1..fef684011f339763081f89d8b9535aeaa75f07e7 100644 (file)
@@ -72,7 +72,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -83,7 +84,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index 689f2be36dbd2632aa73c7de030984c08f68b5f7..4871547a1f85d6c6150e8b96e571d92dbbf8dbb9 100644 (file)
@@ -36,7 +36,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -47,7 +48,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index b241abdf1b0c25e5a09cb0be006a155239596ec1..449e96e9a466b957ce2cf18902a11b71e2156055 100644 (file)
@@ -37,7 +37,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -48,7 +49,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index 4e148b3a361c5daaeae5a50eb0e4f0212c3c7362..82b322cf399d147299316b32e2cccd86de6d05ba 100644 (file)
@@ -72,7 +72,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -83,7 +84,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index edcdda30ada01421ff6a939d5e46d1795afe3fb2..abb3aec4eeb2f9e1752f1ea17cd072e85aba1d9f 100644 (file)
@@ -38,7 +38,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -49,7 +50,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index f38bb06ecf5245d3dd15d3dc5ad78d689f1ab961..affb1ce5e9ae054bf937b87288327c43ed58b91c 100644 (file)
@@ -38,7 +38,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -49,7 +50,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index cd448e3379c4510b7b688c1d1f811c2746fe5d6d..2a050091955342c47e15cf74e1afb35b8d89e774 100644 (file)
@@ -37,7 +37,8 @@ void
 make_2_cells(Triangulation<dim> &tria);
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -48,7 +49,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 }
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index dd114c7ce74746da0caff02ba8b1d3054eb45050..dd8e0d5c14d91075238c717b7aecf6016348cc96 100644 (file)
@@ -39,7 +39,8 @@ make_2_cells(Triangulation<dim> &tria);
 
 
 template <>
-void make_2_cells<2>(Triangulation<2> &tria)
+void
+make_2_cells<2>(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -52,7 +53,8 @@ void make_2_cells<2>(Triangulation<2> &tria)
 
 
 template <>
-void make_2_cells<3>(Triangulation<3> &tria)
+void
+make_2_cells<3>(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index 3754c8490e725bc5e639beb9c9c7a86099fe2fdc..c22dff410740d8413e1bb64272e1fa7f229f0080 100644 (file)
@@ -66,7 +66,8 @@ inspect_fiv(FEInterfaceValues<dim> &fiv)
   deallog << std::endl;
 }
 
-void make_2_cells(Triangulation<2> &tria)
+void
+make_2_cells(Triangulation<2> &tria)
 {
   const unsigned int        dim         = 2;
   std::vector<unsigned int> repetitions = {2, 1};
@@ -76,7 +77,8 @@ void make_2_cells(Triangulation<2> &tria)
   GridGenerator::subdivided_hyper_rectangle(tria, repetitions, p1, p2);
 }
 
-void make_2_cells(Triangulation<3> &tria)
+void
+make_2_cells(Triangulation<3> &tria)
 {
   const unsigned int        dim         = 3;
   std::vector<unsigned int> repetitions = {2, 1, 1};
index f59a085dbb9266fb8347d2b29b73b88dc4e9558d..0857c9a9e34abc50457608202510c0a9525bdd52 100644 (file)
@@ -24,7 +24,8 @@
 
 
 
-void setup_tria(Triangulation<1> &tria)
+void
+setup_tria(Triangulation<1> &tria)
 {
   GridGenerator::subdivided_hyper_rectangle(
     tria, std::vector<unsigned int>(5u, 1), Point<1>(), Point<1>(1.5), true);
index e57b25cf3154efd8a7735778b20df08926ab1b0c..f5327e5520bfe57194104e8259c6b0228014b1dd 100644 (file)
 
 
 
-void my_cylinder(Triangulation<3> &tria,
-                 const double      radius,
-                 const double      half_length)
+void
+my_cylinder(Triangulation<3> &tria,
+            const double      radius,
+            const double      half_length)
 {
   // Copy the base from hyper_ball<3>
   // and transform it to yz
index d14d608992df8547b83b91b10c80640f705752d2..5f83685f3fddc09176d833152e53c168144f675e 100644 (file)
@@ -55,7 +55,8 @@ namespace dealii
   namespace GridGenerator
   {
     template <int dim, typename VectorType>
-    void create_triangulation_with_marching_cube_algorithm(
+    void
+    create_triangulation_with_marching_cube_algorithm(
       Triangulation<dim - 1, dim> &tria,
       const Mapping<dim> &         mapping,
       const DoFHandler<dim> &      background_dof_handler,
index 215f234b82846e2f9d36567003c80a514229739c..bb6638ec20c0289c393cbfcfd5e4fa24f53ffd6a 100644 (file)
 #include "../tests.h"
 
 // overloads to get multiple grids for multiple dim and spacedim combinations
-void make_grid(Triangulation<2, 2> &triangulation)
+void
+make_grid(Triangulation<2, 2> &triangulation)
 {
   GridGenerator::hyper_shell(triangulation, Point<2>(), 2.0, 6.0, 12);
 }
 
-void make_grid(Triangulation<2, 3> &triangulation)
+void
+make_grid(Triangulation<2, 3> &triangulation)
 {
   GridGenerator::hyper_sphere(triangulation, Point<3>(), 6.0);
   triangulation.refine_global(1); // need more cells
 }
 
-void make_grid(Triangulation<3, 3> &triangulation)
+void
+make_grid(Triangulation<3, 3> &triangulation)
 {
   GridGenerator::hyper_shell(triangulation, Point<3>(), 2.0, 6.0, 12);
   triangulation.refine_global(0);
index 1a8c556610e047f6af0f78c8f288358a4af0f324..834901651ac5b5a91425167f7e9b254962ed0da3 100644 (file)
@@ -51,18 +51,21 @@ public:
 };
 
 // overloads to get multiple grids for multiple dim and spacedim combinations
-void make_grid(Triangulation<2, 2> &triangulation)
+void
+make_grid(Triangulation<2, 2> &triangulation)
 {
   GridGenerator::hyper_shell(triangulation, Point<2>(), 2.0, 6.0, 12);
 }
 
-void make_grid(Triangulation<2, 3> &triangulation)
+void
+make_grid(Triangulation<2, 3> &triangulation)
 {
   GridGenerator::hyper_sphere(triangulation, Point<3>(), 6.0);
   triangulation.refine_global(1); // need more cells
 }
 
-void make_grid(Triangulation<3, 3> &triangulation)
+void
+make_grid(Triangulation<3, 3> &triangulation)
 {
   GridGenerator::hyper_shell(triangulation, Point<3>(), 2.0, 6.0, 12);
   triangulation.refine_global(0);
index 1376c891a14678619ee0927f18cfc920860786f5..9c9eeeed74c21365c8289582c4fbf43428745813 100644 (file)
@@ -33,7 +33,8 @@
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation)
+void
+generate_grid(Triangulation<2> &triangulation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -86,7 +87,8 @@ void generate_grid(Triangulation<2> &triangulation)
 
 
 /* The 3D case */
-void generate_grid(Triangulation<3> &triangulation)
+void
+generate_grid(Triangulation<3> &triangulation)
 {
   Point<3>              vertices_1[] = {Point<3>(-1., -1., -3.),
                            Point<3>(+1., -1., -3.),
index ecc517b0c5349603eccb97346800719f1e4a13d3..39b5a9b822fe33d850bcb81a655cff8bb98d83bc 100644 (file)
@@ -35,7 +35,8 @@
  */
 
 /* The 2D case */
-void generate_grid(Triangulation<2> &triangulation, int orientation)
+void
+generate_grid(Triangulation<2> &triangulation, int orientation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -91,7 +92,8 @@ void generate_grid(Triangulation<2> &triangulation, int orientation)
 
 
 /* The 3D case */
-void generate_grid(Triangulation<3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<3> &triangulation, int orientation)
 {
   Point<3>              vertices_1[] = {Point<3>(-1., -1., -3.),
                            Point<3>(+1., -1., -3.),
index 519ab9d706685b7972ad2058dffebc8cf2240078..fa7d4b66888240e49a96abfa5f1b6afccc6b0813 100644 (file)
@@ -82,9 +82,9 @@ test()
     step_sizes.push_back(step_sizes_i);
 
   const Point<dim> bottom_left;
-  const Point<dim> upper_right =
-    dim == 1 ? Point<dim>(size) :
-               dim == 2 ? Point<dim>(size, size) : Point<dim>(size, size, size);
+  const Point<dim> upper_right = dim == 1 ? Point<dim>(size) :
+                                 dim == 2 ? Point<dim>(size, size) :
+                                            Point<dim>(size, size, size);
 
   Triangulation<dim> tria;
   GridGenerator::subdivided_hyper_rectangle(
index 562582e8b90e6f8ada43f68f54f3821c618e92e4..d123730214f0e189afee163e84771984940821d8 100644 (file)
@@ -28,13 +28,15 @@ Point<dim>
 trans_func(Point<dim> &p);
 
 template <>
-Point<2> trans_func(Point<2> &p)
+Point<2>
+trans_func(Point<2> &p)
 {
   Point<2> r(p(0) + p(1) * p(1), p(1));
   return r;
 }
 template <>
-Point<3> trans_func(Point<3> &p)
+Point<3>
+trans_func(Point<3> &p)
 {
   Point<3> r(p(0) + p(1) * p(1), p(1), p(2));
   return r;
index d9f965270a7eecde616e80861a2cb78a2902da33..60470545aa667122f9544e4be2775542869cf41c 100644 (file)
@@ -28,8 +28,9 @@
 // to all cells, thus n_cells are neighboring at this line. in delete_children,
 // this is not accounted for (for n_cells>5) and the child lines are deleted,
 // although they are still needed.
-void create_star_structured_cylinder(Triangulation<3> & coarse_grid,
-                                     const unsigned int n_cells)
+void
+create_star_structured_cylinder(Triangulation<3> & coarse_grid,
+                                const unsigned int n_cells)
 {
   Assert(n_cells > 1, ExcNotImplemented());
 
index 3d932d2df76cf5e9845f8905e6d1b2fdd87afe04..f0addd7c9c4ae28d16ba38d0dc911e0449eb1b92 100644 (file)
@@ -28,7 +28,8 @@
 
 // move backward two adjacent vertices of the top face up by one
 // unit. all faces remain flat this way
-Point<3> distort_planar(Point<3> p)
+Point<3>
+distort_planar(Point<3> p)
 {
   if (p(1) > 0.5 && p(2) > 0.5)
     {
@@ -40,7 +41,8 @@ Point<3> distort_planar(Point<3> p)
 
 // lift two opposite vertices of the top face up by one unit to create
 // a saddle surface
-Point<3> distort_twisted(Point<3> p)
+Point<3>
+distort_twisted(Point<3> p)
 {
   if (p(2) > 0.5 && ((p(0) > 0.5) ^ (p(1) > 0.5)))
     {
index 0119d7d261f22d3a05538bea2fc52c7655ed6000..23d70bfaead734d04f6589598f4b4df38af595a3 100644 (file)
@@ -26,7 +26,8 @@
 // match up for the standard orientation of the normals. we thus have
 // to store the face orientation in each cell
 
-void create_two_cubes(Triangulation<3> &coarse_grid)
+void
+create_two_cubes(Triangulation<3> &coarse_grid)
 {
   const Point<3>        points[6] = {Point<3>(0, 0, 0),
                               Point<3>(1, 0, 0),
@@ -68,8 +69,9 @@ void create_two_cubes(Triangulation<3> &coarse_grid)
 // the edges are not all ok and the common face is rotated. we thus have
 // to store the face rotation (and face flip) in each cell
 
-void create_two_cubes_rotation(Triangulation<3> & coarse_grid,
-                               const unsigned int n_rotations)
+void
+create_two_cubes_rotation(Triangulation<3> & coarse_grid,
+                          const unsigned int n_rotations)
 {
   Assert(n_rotations < 4, ExcNotImplemented());
 
@@ -112,7 +114,8 @@ void create_two_cubes_rotation(Triangulation<3> & coarse_grid,
 
 
 
-void create_L_shape(Triangulation<3> &coarse_grid)
+void
+create_L_shape(Triangulation<3> &coarse_grid)
 {
   std::vector<Point<3>>    vertices;
   std::vector<CellData<3>> cells;
@@ -163,7 +166,8 @@ void create_L_shape(Triangulation<3> &coarse_grid)
 }
 
 
-void coarsen_global(Triangulation<3> &grid)
+void
+coarsen_global(Triangulation<3> &grid)
 {
   for (Triangulation<3>::active_cell_iterator c = grid.begin_active();
        c != grid.end();
index 93c0f6841a6d673005a663a61297b8279d25256a..e8c03e12fc1741ee20cf372ea2741fa2df338f99 100644 (file)
@@ -40,7 +40,8 @@
 
 #include "mesh_3d.h"
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   for (Triangulation<3>::cell_iterator cell = tria.begin(); cell != tria.end();
        ++cell)
@@ -59,7 +60,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index 2869656f70edd7248d14a244ec209df64a9c3527..931bec385a69b517edd3ef6a8b8e9da48334aeb7 100644 (file)
@@ -41,7 +41,8 @@
 
 #include "mesh_3d.h"
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   for (Triangulation<3>::cell_iterator cell = tria.begin(); cell != tria.end();
        ++cell)
@@ -71,7 +72,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index 13a2f9c8483d446007606fd5785dbd7159abe2e4..dd0b4fbc0225292a7878772f4af7d3b348e652e7 100644 (file)
@@ -45,7 +45,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   FE_Q<3>       fe(1);
   DoFHandler<3> dof_handler(tria);
@@ -69,7 +70,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   (++tria.begin_active())->set_refine_flag();
   tria.execute_coarsening_and_refinement();
index ff8a21028134d896b28de5009a280d819ac2a8ea..eaa7be7dd95bbed291f2b9257d60d018b0790798 100644 (file)
@@ -38,7 +38,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   Triangulation<3>::active_cell_iterator cell = tria.begin_active();
   for (; cell != tria.end(); ++cell)
@@ -79,7 +80,8 @@ void check_this(Triangulation<3> &tria)
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   (++tria.begin_active())->set_refine_flag();
   tria.execute_coarsening_and_refinement();
index 74d7bb053b4906030efc3540119f173f686bc422..ad96418864ee0b5b501754cba9d259f37d30128c 100644 (file)
@@ -41,7 +41,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   QTrapezoid<2>      quadrature;
   FE_Q<3>            fe(1);
@@ -99,7 +100,8 @@ void check_this(Triangulation<3> &tria)
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   (++tria.begin_active())->set_refine_flag();
   tria.execute_coarsening_and_refinement();
index 52ef04a5de82cacfa02b85c04ce5639d26d6fe18..83326838014bdaf70ef6fd554f46e7ac8a681556 100644 (file)
@@ -41,7 +41,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   FE_Q<3> fe(1);
 
@@ -92,7 +93,8 @@ void check_this(Triangulation<3> &tria)
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   (++tria.begin_active())->set_refine_flag();
   tria.execute_coarsening_and_refinement();
index d2a92e1b3ffc6ba3f154df77ddf52f32f3a4ad64..0b9ba5b4e37837245271d59a088c29acccf60f4b 100644 (file)
@@ -39,7 +39,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   FE_Q<3>       fe(1);
   DoFHandler<3> dof_handler(tria);
index 61f67f6b2990704defe03b6ab6d2a2ff8cc4366a..551cc1dc74da6fb9da42dd008d896eff65621652 100644 (file)
@@ -34,7 +34,8 @@
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Coarse cell 0 vertices:" << std::endl;
   for (unsigned int i = 0; i < 8; ++i)
index 2f78b7c1ba5004b6efafdba840ff20d11e4e9364..fedb64dbd870ee5adfab859037fe37d7a6da458a 100644 (file)
@@ -40,7 +40,8 @@
 #include "../grid/mesh_3d.h"
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   QTrapezoid<2>   quadrature;
   FE_Q<3>         fe(1);
@@ -100,7 +101,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index 46e8f987cf656d534548982b4650a4b2f05bc3db..4469a2b8187a25e9d14d195c0ad383b67a9c9e59 100644 (file)
@@ -38,7 +38,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   FE_Q<3>       fe(1);
   DoFHandler<3> dof_handler(tria);
@@ -100,7 +101,8 @@ void check_this(Triangulation<3> &tria)
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   (++tria.begin_active())->set_refine_flag();
   tria.execute_coarsening_and_refinement();
index 95ff1a1113e111ae26554cc168f7c80801f2694d..c323c2c58d20a244071de3e5f2cb48b60f2dc526 100644 (file)
@@ -48,7 +48,8 @@ count_wrong_faces(const Triangulation<3> &tria)
 
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   const unsigned int initial_count = count_wrong_faces(tria);
   for (unsigned int r = 0; r < 3; ++r)
index 41b8f317fd37ae961757b8ffc4c99cd2e2e6f559..b85c7cabf60142f11885cc5affcc6b36a0fb9945 100644 (file)
@@ -30,7 +30,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   // look at all faces, not only
   // active ones
@@ -53,7 +54,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index a03ab29da662a3a90275a880382cb94eb183a2dc..41c2d3509f09056b4dc458ed1e33d1d438478ba4 100644 (file)
@@ -38,7 +38,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   QMidpoint<2>    q;
   FE_Q<3>         fe(1);
@@ -88,7 +89,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index 5adb23a78d332d2737ec6cddfe8d05a65707fabe..a3fccf7cd25fb21a600e942d7cbe1f454dde50c9 100644 (file)
@@ -37,7 +37,8 @@
 
 
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   QTrapezoid<2>   quadrature;
   FE_Q<3>         fe(1);
@@ -98,7 +99,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index ad5d4ae6f57bf8451c3bf21c2e61c7ce0be7944f..8fed47bb677ff68fda89224a7365a79ea0b49c59 100644 (file)
@@ -39,7 +39,8 @@
 
 #include "mesh_3d.h"
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   for (Triangulation<3>::cell_iterator cell = tria.begin(); cell != tria.end();
        ++cell)
@@ -56,7 +57,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index be2d46a07d51e78bcd1513966183c73a9ad8883f..ff7c3a44fb3d16dc2d75f426e95bef45975926d1 100644 (file)
@@ -40,7 +40,8 @@
 
 #include "mesh_3d.h"
 
-void check_this(Triangulation<3> &tria)
+void
+check_this(Triangulation<3> &tria)
 {
   for (Triangulation<3>::cell_iterator cell = tria.begin(); cell != tria.end();
        ++cell)
@@ -57,7 +58,8 @@ void check_this(Triangulation<3> &tria)
 }
 
 
-void check(Triangulation<3> &tria)
+void
+check(Triangulation<3> &tria)
 {
   deallog << "Initial check" << std::endl;
   check_this(tria);
index 87d06604d9ae4e8447c5e17b5363b274c1a5cc5e..360c6404847a80e908a30aa0323d26c89f46593e 100644 (file)
@@ -97,7 +97,7 @@ private:
   std::vector<types::global_dof_index> dofs_per_block;
 
   Triangulation<dim>
-                  triangulation; // a triangulation object of the "dim"-dimensional domain;
+    triangulation; // a triangulation object of the "dim"-dimensional domain;
   DoFHandler<dim> dof_handler; // is associated with triangulation;
 
   FESystem<dim>         elasticity_fe;
index 94de6ae93cc32cfb423d8b28ef1fd3fe3beafe72..c6be1688d115c12fe392a9289de0597f909ce8d9 100644 (file)
@@ -36,7 +36,8 @@
 
 
 
-void make_grid(Triangulation<2> &triangulation)
+void
+make_grid(Triangulation<2> &triangulation)
 {
   const Point<2> center(1, 0);
   const double   inner_radius = 0.5, outer_radius = 1.0;
@@ -71,7 +72,8 @@ void make_grid(Triangulation<2> &triangulation)
 }
 
 
-void distribute_dofs(DoFHandler<2> &dof_handler)
+void
+distribute_dofs(DoFHandler<2> &dof_handler)
 {
   static const hp::FECollection<2> finite_element(FE_Q<2>(1));
   dof_handler.distribute_dofs(finite_element);
@@ -88,7 +90,8 @@ void distribute_dofs(DoFHandler<2> &dof_handler)
 
 
 
-void renumber_dofs(DoFHandler<2> &dof_handler)
+void
+renumber_dofs(DoFHandler<2> &dof_handler)
 {
   DoFRenumbering::Cuthill_McKee(dof_handler);
   SparsityPattern sparsity_pattern(dof_handler.n_dofs(), dof_handler.n_dofs());
index 69ce49dbc2c347a1ca43b2a82d54b6d0e0d2f7c2..96b801d6d2e9ed4c44b15c80c2734535983b9251 100644 (file)
@@ -41,7 +41,8 @@
 std::ofstream logfile("output");
 
 
-void make_tria(Triangulation<3> &tria, int step)
+void
+make_tria(Triangulation<3> &tria, int step)
 {
   switch (step)
     {
index 588c322d98ade41dbdb8a191bfc0f0722ada23f9..fe7f73811b0538fa7abb9e9eb27243f183bbcb72 100644 (file)
@@ -32,7 +32,8 @@ namespace dealii
 {
   template <typename Number>
   template <typename Number2>
-  Number Vector<Number>::operator*(const Vector<Number2> &v) const
+  Number
+  Vector<Number>::operator*(const Vector<Number2> &v) const
   {
     Number sum = 0;
     for (unsigned int i = 0; i < size(); ++i)
index ed2488243d0b0d64c4cdf4a5dcd1d13bde43478e..c63918585ccc446a86ea3f2f22d39a52935e712f 100644 (file)
@@ -32,7 +32,8 @@ namespace dealii
 {
   template <typename Number>
   template <typename Number2>
-  Number Vector<Number>::operator*(const Vector<Number2> &v) const
+  Number
+  Vector<Number>::operator*(const Vector<Number2> &v) const
   {
     Number sum = 0;
     for (unsigned int i = 0; i < size(); ++i)
index 00d475b1337c9f9d5e50dfc9d00cd6fb1c416f0e..1cc44fadf5e35d6a4af62ae197d84b78040b354e 100644 (file)
@@ -200,11 +200,12 @@ test()
 
     const unsigned int num_arnoldi_vectors = 2 * eigenvalues.size() + 10;
     PArpackSolver<LinearAlgebra::distributed::Vector<double>>::AdditionalData
-    additional_data(num_arnoldi_vectors,
-                    PArpackSolver<LinearAlgebra::distributed::Vector<double>>::
-                      largest_magnitude,
-                    true,
-                    1);
+      additional_data(
+        num_arnoldi_vectors,
+        PArpackSolver<
+          LinearAlgebra::distributed::Vector<double>>::largest_magnitude,
+        true,
+        1);
 
     SolverControl solver_control(dof_handler.n_dofs(),
                                  1e-10,
index cc1bf385995cf1698439a4928525cfc512c4a7ca..a544909c2858721dff762a62e84aeec5f0aed854 100644 (file)
@@ -84,11 +84,12 @@ namespace
   //
   // Eccentricity must be in range ]0,1[
   //
-  void build_simple_hyper_shell(Triangulation<2, 2> &grid,
-                                const Point<2> &     center,
-                                const double         inner_radius,
-                                const double         outer_radius,
-                                const double         eccentricity)
+  void
+  build_simple_hyper_shell(Triangulation<2, 2> &grid,
+                           const Point<2> &     center,
+                           const double         inner_radius,
+                           const double         outer_radius,
+                           const double         eccentricity)
   {
     unsigned int          cell[][4] = {{5, 6, 0, 1},
                               {6, 7, 1, 2},
index e64ea881714f88bc264baacb06a844c76c1630ba..ce2da601825da2a8784ba009da23dc17ee50a7f9 100644 (file)
@@ -42,10 +42,11 @@ struct Geom_parameters
   std::vector<double>   radius;
 };
 
-void concentric_disks(Triangulation<2> &         tria,
-                      const double               s,
-                      const std::vector<double> &x,
-                      Geom_parameters &          gp)
+void
+concentric_disks(Triangulation<2> &         tria,
+                 const double               s,
+                 const std::vector<double> &x,
+                 Geom_parameters &          gp)
 {
   double r = x[0], d = 0.5 * x[0],
          q = 1.0 / sqrt(2.0); // q: corner points factor
@@ -262,9 +263,10 @@ void concentric_disks(Triangulation<2> &         tria,
   // --------------------------------------------------------------------------------
 }
 
-void concentric_disks(Triangulation<2> &  tria,
-                      std::vector<double> x,
-                      Geom_parameters &   gp)
+void
+concentric_disks(Triangulation<2> &  tria,
+                 std::vector<double> x,
+                 Geom_parameters &   gp)
 {
   concentric_disks(tria, 0.0, x, gp);
 }
index 5ce2e4301528de83706670b07d30bc8e7e668cef..4607f52426ac09530a7a068a1d85967fc3a37130 100644 (file)
@@ -177,19 +177,21 @@ plot_subfaces(Mapping<dim> &                           mapping,
 
 
 template <>
-inline void plot_faces(Mapping<1> &,
-                       FiniteElement<1> &,
-                       DoFHandler<1>::cell_iterator &,
-                       const std::string &)
+inline void
+plot_faces(Mapping<1> &,
+           FiniteElement<1> &,
+           DoFHandler<1>::cell_iterator &,
+           const std::string &)
 {}
 
 
 
 template <>
-inline void plot_subfaces(Mapping<1> &,
-                          FiniteElement<1> &,
-                          DoFHandler<1>::cell_iterator &,
-                          const std::string &)
+inline void
+plot_subfaces(Mapping<1> &,
+              FiniteElement<1> &,
+              DoFHandler<1>::cell_iterator &,
+              const std::string &)
 {}
 
 
@@ -228,9 +230,10 @@ unsigned int                           mapping_size;
 
 
 template <>
-void create_triangulations(std::vector<Triangulation<1> *> &tria_ptr,
-                           std::vector<Manifold<1> *> &,
-                           std::vector<double> &exact_areas)
+void
+create_triangulations(std::vector<Triangulation<1> *> &tria_ptr,
+                      std::vector<Manifold<1> *> &,
+                      std::vector<double> &exact_areas)
 {
   show.resize(1, std::vector<unsigned int>(mapping_size, 0));
   Triangulation<1> *tria = new Triangulation<1>();
@@ -245,9 +248,10 @@ void create_triangulations(std::vector<Triangulation<1> *> &tria_ptr,
 
 
 template <>
-void create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
-                           std::vector<Manifold<2> *> &     boundary_ptr,
-                           std::vector<double> &            exact_areas)
+void
+create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
+                      std::vector<Manifold<2> *> &     boundary_ptr,
+                      std::vector<double> &            exact_areas)
 {
   Triangulation<2> *tria;
   show.clear();
@@ -358,9 +362,10 @@ void create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
 
 
 template <>
-void create_triangulations(std::vector<Triangulation<3> *> &tria_ptr,
-                           std::vector<Manifold<3> *> &     boundary_ptr,
-                           std::vector<double> &            exact_areas)
+void
+create_triangulations(std::vector<Triangulation<3> *> &tria_ptr,
+                      std::vector<Manifold<3> *> &     boundary_ptr,
+                      std::vector<double> &            exact_areas)
 {
   Triangulation<3> *tria;
   show.clear();
index 0eb07076900956ccbd4cd77f64f98c53f758acaa..b5531bd988d253f1e22d6358e49b397ef6c8c792 100644 (file)
@@ -88,28 +88,29 @@ main()
   initlog();
   do_test<2>(3, Solution<2>(true), true);
   do_test<2>(3, Solution<2>(false), false);
-  do_test<2>(3,
-             [](const typename Triangulation<2>::cell_iterator &,
-                const Point<2> &p) -> Point<2> {
-               Point<2> result;
-
-               for (unsigned int compontent = 0; compontent < 2; ++compontent)
-                 result[compontent] =
-                   std::sin(p[compontent] * 0.5 * numbers::PI) - p[compontent];
-
-               return result;
-             },
-             true);
-  do_test<2>(3,
-             [](const typename Triangulation<2>::cell_iterator &,
-                const Point<2> &p) -> Point<2> {
-               Point<2> result;
-
-               for (unsigned int compontent = 0; compontent < 2; ++compontent)
-                 result[compontent] =
-                   std::sin(p[compontent] * 0.5 * numbers::PI);
-
-               return result;
-             },
-             false);
+  do_test<2>(
+    3,
+    [](const typename Triangulation<2>::cell_iterator &,
+       const Point<2> &p) -> Point<2> {
+      Point<2> result;
+
+      for (unsigned int compontent = 0; compontent < 2; ++compontent)
+        result[compontent] =
+          std::sin(p[compontent] * 0.5 * numbers::PI) - p[compontent];
+
+      return result;
+    },
+    true);
+  do_test<2>(
+    3,
+    [](const typename Triangulation<2>::cell_iterator &,
+       const Point<2> &p) -> Point<2> {
+      Point<2> result;
+
+      for (unsigned int compontent = 0; compontent < 2; ++compontent)
+        result[compontent] = std::sin(p[compontent] * 0.5 * numbers::PI);
+
+      return result;
+    },
+    false);
 }
index 246e52cc20f1722f42e340fa02fd854248794b43..850007c4b70630f3a3417001a7d20daf75a2393e 100644 (file)
@@ -56,7 +56,8 @@ const double Y_C = 0.2; // center
 const unsigned int MANIFOLD_ID = 1;
 
 
-void create_triangulation(Triangulation<2> &tria)
+void
+create_triangulation(Triangulation<2> &tria)
 {
   AssertThrow(std::abs((X_2 - X_1) - 2.0 * (X_C - X_1)) < 1.0e-12,
               ExcMessage("Geometry parameters X_1,X_2,X_C invalid!"));
@@ -165,7 +166,8 @@ void create_triangulation(Triangulation<2> &tria)
     }
 }
 
-void create_triangulation(Triangulation<3> &tria)
+void
+create_triangulation(Triangulation<3> &tria)
 {
   Triangulation<2> tria_2d;
   create_triangulation(tria_2d);
index 76a75982e5a25c29d273f42c8e4effdcbf1c1505..c048a67ec5e3935656794675f0712ebb0213fe81 100644 (file)
@@ -282,7 +282,7 @@ private:
               (number)(std::max(1, fe_degree) * (fe_degree + 1.0)) * 2.;
 
             std::array<types::boundary_id, VectorizedArray<number>::size()>
-                                    boundary_ids = data.get_faces_by_cells_boundary_id(cell, face);
+              boundary_ids = data.get_faces_by_cells_boundary_id(cell, face);
             VectorizedArray<number> factor_boundary;
             for (unsigned int v = 0; v < VectorizedArray<number>::size(); ++v)
               // interior face
index 2a4629775c3b9db86894d545dd7af67750b84a65..74a8bd654138101cc112cee60ac1bb2595f63349 100644 (file)
@@ -27,7 +27,8 @@
 #include <iostream>
 
 
-void create_mesh(Triangulation<2> &tria, const double scale_grid = 1.)
+void
+create_mesh(Triangulation<2> &tria, const double scale_grid = 1.)
 {
   const unsigned int      dim = 2;
   std::vector<Point<dim>> points(12);
@@ -78,7 +79,8 @@ void create_mesh(Triangulation<2> &tria, const double scale_grid = 1.)
 
 
 
-void create_mesh(Triangulation<3> &tria, const double scale_grid = 1.)
+void
+create_mesh(Triangulation<3> &tria, const double scale_grid = 1.)
 {
   const unsigned int      dim = 3;
   std::vector<Point<dim>> points(24);
index 921854026b2c092e933f178588baf286dbfd67b6..77ae5f593a917457681179cb7ff14747fcbf3e43 100644 (file)
@@ -89,11 +89,11 @@ private:
 
 template <int dim, int fe_degree, typename Number>
 void
-MatrixFreeTest<dim, fe_degree, Number>::
-operator()(const MatrixFree<dim, Number> &data,
-           VectorType &,
-           const VectorType &                           src,
-           const std::pair<unsigned int, unsigned int> &cell_range) const
+MatrixFreeTest<dim, fe_degree, Number>::operator()(
+  const MatrixFree<dim, Number> &data,
+  VectorType &,
+  const VectorType &                           src,
+  const std::pair<unsigned int, unsigned int> &cell_range) const
 {
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval(data);
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval2(data);
index 02d0fb9cfaf7ebe4348bf1b83dd214dfddf8fb54..7bb8f888d9ea9433fcdb65cade2bfe8bc1dcfad4 100644 (file)
@@ -85,11 +85,11 @@ private:
 
 template <int dim, int fe_degree, typename Number>
 void
-MatrixFreeTest<dim, fe_degree, Number>::
-operator()(const MatrixFree<dim, Number> &data,
-           VectorType &,
-           const VectorType &                           src,
-           const std::pair<unsigned int, unsigned int> &cell_range) const
+MatrixFreeTest<dim, fe_degree, Number>::operator()(
+  const MatrixFree<dim, Number> &data,
+  VectorType &,
+  const VectorType &                           src,
+  const std::pair<unsigned int, unsigned int> &cell_range) const
 {
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval(data);
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval2(data);
index 0420cdf9e3efa9c1f4ffea398f0b11c778e055ce..9f6dd5da2711818e1c0014990b7660c810f797eb 100644 (file)
@@ -87,11 +87,11 @@ private:
 
 template <int dim, int fe_degree, typename Number>
 void
-MatrixFreeTest<dim, fe_degree, Number>::
-operator()(const MatrixFree<dim, Number> &data,
-           std::vector<Vector<Number> *> &dst,
-           const std::vector<Vector<Number> *> &,
-           const std::pair<unsigned int, unsigned int> &cell_range) const
+MatrixFreeTest<dim, fe_degree, Number>::operator()(
+  const MatrixFree<dim, Number> &data,
+  std::vector<Vector<Number> *> &dst,
+  const std::vector<Vector<Number> *> &,
+  const std::pair<unsigned int, unsigned int> &cell_range) const
 {
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval(data);
   const unsigned int                     n_q_points    = fe_eval.n_q_points;
index f0944d6af89962621d3ce24ea44faa67e6191a33..cf464018fd39de33a6da55b9c4fe1e44ec70ca53 100644 (file)
@@ -93,11 +93,11 @@ private:
 
 template <int dim, int fe_degree, typename Number>
 void
-MatrixFreeTest<dim, fe_degree, Number>::
-operator()(const MatrixFree<dim, Number> &data,
-           std::vector<Vector<Number>> &  dst,
-           const std::vector<Vector<Number>> &,
-           const std::pair<unsigned int, unsigned int> &cell_range) const
+MatrixFreeTest<dim, fe_degree, Number>::operator()(
+  const MatrixFree<dim, Number> &data,
+  std::vector<Vector<Number>> &  dst,
+  const std::vector<Vector<Number>> &,
+  const std::pair<unsigned int, unsigned int> &cell_range) const
 {
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval0(data, 0, 0);
   FEEvaluation<dim, fe_degree + 1, fe_degree + 2, 1, Number> fe_eval1(data,
index 1af23f49cadb9820d07f15caa9e391e264bb18e9..f696e3206746cf9dc59afac9135b6bdac85cc26c 100644 (file)
@@ -96,11 +96,11 @@ private:
 
 template <int dim, int fe_degree, typename Number>
 void
-MatrixFreeTest<dim, fe_degree, Number>::
-operator()(const MatrixFree<dim, Number> &data,
-           std::vector<Vector<Number>> &  dst,
-           const std::vector<Vector<Number>> &,
-           const std::pair<unsigned int, unsigned int> &cell_range) const
+MatrixFreeTest<dim, fe_degree, Number>::operator()(
+  const MatrixFree<dim, Number> &data,
+  std::vector<Vector<Number>> &  dst,
+  const std::vector<Vector<Number>> &,
+  const std::pair<unsigned int, unsigned int> &cell_range) const
 {
   FEEvaluation<dim, 0, 1, 1, Number>                     fe_eval0(data, 0, 0);
   FEEvaluation<dim, fe_degree, fe_degree + 1, 1, Number> fe_eval1(data, 1, 1);
index b31456f03548daa6cac36e413082db6e07c356dc..9f086954ea7ea91ce1aa2c7a093a8f21917f566d 100644 (file)
@@ -31,7 +31,8 @@
 
 
 
-void generate_grid(Triangulation<3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<3> &triangulation, int orientation)
 {
   Point<3>              vertices_1[] = {Point<3>(-1., -1., -3.),
                            Point<3>(+1., -1., -3.),
index 976f950d05413ed56ad1dae9c2684cb7b34b04a9..943b02d212c65c05e991feceae9b034448205f2b 100644 (file)
@@ -332,7 +332,7 @@ private:
                         phif.inverse_jacobian(0))[dim - 1]) *
               (number)(std::max(1, fe_degree) * (fe_degree + 1.0)) * 2.;
             std::array<types::boundary_id, VectorizedArray<number>::size()>
-                                    boundary_ids = data.get_faces_by_cells_boundary_id(cell, face);
+              boundary_ids = data.get_faces_by_cells_boundary_id(cell, face);
             VectorizedArray<number> factor_boundary;
             for (unsigned int v = 0; v < VectorizedArray<number>::size(); ++v)
               // interior face
index 89402a6f0c2cf93edd185c420cc7ad617421075a..0cd84a23ff3c1780961861ab04e82b6f53ca9a9d 100644 (file)
@@ -243,7 +243,7 @@ do_test(const DoFHandler<dim> &dof)
 
   MyLaplaceOperator<dim, fe_degree, double> fine_matrix;
   std::shared_ptr<MatrixFree<dim, double>>  fine_level_data(
-     new MatrixFree<dim, double>());
+    new MatrixFree<dim, double>());
 
   typename MatrixFree<dim, double>::AdditionalData fine_level_additional_data;
   fine_level_additional_data.tasks_parallel_scheme =
index 667eafbaf44a061220490fb822574d499effae20..5739fead70f6c3e4bcf6e86a89a3447503f93a6a 100644 (file)
@@ -54,7 +54,8 @@ public:
 
 
 
-void generate_grid(Triangulation<3> &triangulation, int orientation)
+void
+generate_grid(Triangulation<3> &triangulation, int orientation)
 {
   Point<3>              vertices_1[] = {Point<3>(-0., -0., -0.),
                            Point<3>(+1., -0., -0.),
index 5d7bb217bc539d953579463ddb9155337b841877..ab2c3fb09edaa0c78e555b0b9b76a36c89034987 100644 (file)
@@ -100,7 +100,7 @@ test(const unsigned int degree)
 
   std::vector<double>                      solution_values(fe.dofs_per_cell);
   std::vector<Vector<double>>              function_values(unit_points.size(),
-                                                           Vector<double>(dim + 1));
+                                              Vector<double>(dim + 1));
   std::vector<std::vector<Tensor<1, dim>>> function_gradients(
     unit_points.size(), std::vector<Tensor<1, dim>>(dim + 1));
 
index 168d55322bd01f71ff2b4cae82ab3844c62431d8..06b3984501220f295684771de57f4495eec09dc4 100644 (file)
@@ -31,7 +31,8 @@
 
 
 // Create 2d grid
-void create_grid(Triangulation<2> &tria)
+void
+create_grid(Triangulation<2> &tria)
 {
   GridGenerator::hyper_cube(tria);
 
@@ -71,7 +72,8 @@ void create_grid(Triangulation<2> &tria)
 
 
 // Create 3d grid
-void create_grid(Triangulation<3> &tria)
+void
+create_grid(Triangulation<3> &tria)
 {
   GridGenerator::hyper_cube<3>(tria);
   tria.begin_active()->set_refine_flag(dealii::RefinementCase<3>::cut_x);
index e8fc47241bf4aec0a634a723def32ed2b45f02c2..76ff2378b83f0b1297fce3de45075963440ea841 100644 (file)
@@ -89,13 +89,13 @@ test()
   // ----- transfer -----
   parallel::distributed::
     CellDataTransfer<dim, spacedim, std::vector<std::vector<int>>>
-    cell_data_transfer(
-      tria,
-      /*transfer_variable_size_data=*/true,
-      /*refinement_strategy=*/
-      &dealii::AdaptationStrategies::Refinement::
-        preserve<dim, spacedim, std::vector<int>>,
-      /*coarsening_strategy=*/&get_data_of_first_child<dim, spacedim>);
+      cell_data_transfer(
+        tria,
+        /*transfer_variable_size_data=*/true,
+        /*refinement_strategy=*/
+        &dealii::AdaptationStrategies::Refinement::
+          preserve<dim, spacedim, std::vector<int>>,
+        /*coarsening_strategy=*/&get_data_of_first_child<dim, spacedim>);
 
   cell_data_transfer.prepare_for_coarsening_and_refinement(cell_data);
   tria.execute_coarsening_and_refinement();
index 4d277c5f00572dcacdd6c87796f0f5b3d934114c..0d9f19766edb6da976666c65782349c427650002 100644 (file)
@@ -120,10 +120,10 @@ test()
 
   // ----- execute adaptation -----
   parallel::distributed::CellDataTransfer<dim, dim, Vector<float>>
-  data_transfer(tria,
-                /*transfer_variable_size_data=*/false,
-                &AdaptationStrategies::Refinement::l2_norm<dim, dim, float>,
-                &AdaptationStrategies::Coarsening::l2_norm<dim, dim, float>);
+    data_transfer(tria,
+                  /*transfer_variable_size_data=*/false,
+                  &AdaptationStrategies::Refinement::l2_norm<dim, dim, float>,
+                  &AdaptationStrategies::Coarsening::l2_norm<dim, dim, float>);
 
   data_transfer.prepare_for_coarsening_and_refinement(predicted_errors);
   tria.execute_coarsening_and_refinement();
index 534d0f53ef1585a96f229e3cf35c48421fa40840..58c6cadb5ec912d6d27ee5209a33f8a677620d48 100644 (file)
@@ -146,10 +146,10 @@ test()
 
   // ----- execute adaptation -----
   parallel::distributed::CellDataTransfer<dim, dim, Vector<float>>
-  data_transfer(tria,
-                /*transfer_variable_size_data=*/false,
-                &AdaptationStrategies::Refinement::l2_norm<dim, dim, float>,
-                &AdaptationStrategies::Coarsening::l2_norm<dim, dim, float>);
+    data_transfer(tria,
+                  /*transfer_variable_size_data=*/false,
+                  &AdaptationStrategies::Refinement::l2_norm<dim, dim, float>,
+                  &AdaptationStrategies::Coarsening::l2_norm<dim, dim, float>);
 
   data_transfer.prepare_for_coarsening_and_refinement(predicted_errors);
   tria.execute_coarsening_and_refinement();
index 04d203b7d00309c5e789235bf71d19ae7ff185f5..c6db35e268ad5f0ed6536a73e1395ddc22fb96c0 100644 (file)
@@ -274,7 +274,7 @@ test(const FiniteElement<dim> &fe)
             {
               std::ofstream                        f("ordering",
                               (myid > 0) ? std::ofstream::app :
-                                           std::ofstream::out);
+                                                                  std::ofstream::out);
               std::vector<types::global_dof_index> local_dof_indices(
                 fe.dofs_per_cell);
               for (typename DoFHandler<dim>::active_cell_iterator cell =
index a5bfdbdaef0d9281c8e5ae2e3b62bd3bb83fcaf2..81467b206bd06295b54ff1edd21d25b8d5b3e833 100644 (file)
@@ -65,8 +65,8 @@ test()
   local_relevant.add_indices(&ghost_indices[0], &ghost_indices[0] + 10);
   types::global_dof_index before_start = myid > 0 ? my_start - set / 4 : 0;
   types::global_dof_index after_end    = myid < numproc - 1 ?
-                                        my_start + local_size + set / 3 :
-                                        my_start + local_size;
+                                           my_start + local_size + set / 3 :
+                                           my_start + local_size;
   if (before_start < my_start)
     local_relevant.add_range(before_start, my_start);
   if (after_end > my_start + local_size)
index cb0855932ef3fbaf27b13c3b2cb12cbc0d6b0a2d..45cef283e7edf1e9665c33b51a2a6224c42382ef 100644 (file)
@@ -75,8 +75,9 @@ set_periodicity(parallel::distributed::Triangulation<dim> &triangulation,
 }
 
 /* The 2D case */
-void generate_grid(parallel::distributed::Triangulation<2> &triangulation,
-                   int                                      orientation)
+void
+generate_grid(parallel::distributed::Triangulation<2> &triangulation,
+              int                                      orientation)
 {
   Point<2> vertices_1[] = {
     Point<2>(-1., -3.),
@@ -115,8 +116,9 @@ void generate_grid(parallel::distributed::Triangulation<2> &triangulation,
 
 
 /* The 3D case */
-void generate_grid(parallel::distributed::Triangulation<3> &triangulation,
-                   int                                      orientation)
+void
+generate_grid(parallel::distributed::Triangulation<3> &triangulation,
+              int                                      orientation)
 {
   Point<3>              vertices_1[] = {Point<3>(-1., -1., -3.),
                            Point<3>(+1., -1., -3.),
index eb405bac68416867fcefe415cf37c704cccc0cec..ea174094e51918367a7b5059601d2b02f9d5a841 100644 (file)
@@ -408,8 +408,7 @@ namespace Step50
                          local_dof_indices[j]) // ( boundary(i) && boundary(j)
                                                // && i==j )
                    ))
-                {
-                }
+                {}
               else
                 {
                   cell_matrix(i, j) = 0;
index b168ffc2eedcedfe575a6dbdbebd151cefca12fb..58a1b62a3fcb6c14616308c66dae759cc243a5b0 100644 (file)
@@ -407,8 +407,7 @@ namespace Step50
                          local_dof_indices[j]) // ( boundary(i) && boundary(j)
                                                // && i==j )
                    ))
-                {
-                }
+                {}
               else
                 {
                   cell_matrix(i, j) = 0;
index 37a3d024f27803f843db01976f095500297b175b..dd7ee66ca1092671c5b582f293bd2256ab723155 100644 (file)
@@ -408,8 +408,7 @@ namespace Step50
                          local_dof_indices[j]) // ( boundary(i) && boundary(j)
                                                // && i==j )
                    ))
-                {
-                }
+                {}
               else
                 {
                   cell_matrix(i, j) = 0;
index 07f73318c15182ba987b0e7acbbac0982d5f233f..6d89e1fc5aeee0a24d54c4fc62bb1f66e394e592 100644 (file)
@@ -346,8 +346,7 @@ LaplaceProblem<dim>::assemble_multigrid()
                   local_dof_indices[j]) // ( boundary(i) && boundary(j) &&
                                         // i==j )
                ))
-            {
-            }
+            {}
           else
             {
               cell_matrix(i, j) = 0;
index e0841a0a842633ea1b0b84756cf3edce895368ad..bc64a0afac7d5881a70ef8faacf9823febaeb99b 100644 (file)
@@ -415,8 +415,7 @@ namespace Step50
                          local_dof_indices[j]) // ( boundary(i) && boundary(j)
                                                // && i==j )
                    ))
-                {
-                }
+                {}
               else
                 {
                   cell_matrix(i, j) = 0;
index 27597f79cded4003e431467c2feb4897fb0e5579..7f2504ddc076b44600fc6cd0879920fbd55d316f 100644 (file)
@@ -126,19 +126,20 @@ namespace taskflow_v1
       const unsigned int chunk_size   = 8)
   {
     // forward to the other function
-    run(begin,
-        end,
-        [&main_object, worker](const Iterator &iterator,
-                               ScratchData &   scratch_data,
-                               CopyData &      copy_data) {
-          (main_object.*worker)(iterator, scratch_data, copy_data);
-        },
-        [&main_object, copier](const CopyData &copy_data) {
-          (main_object.*copier)(copy_data);
-        },
-        sample_scratch_data,
-        sample_copy_data,
-        queue_length,
-        chunk_size);
+    run(
+      begin,
+      end,
+      [&main_object, worker](const Iterator &iterator,
+                             ScratchData &   scratch_data,
+                             CopyData &      copy_data) {
+        (main_object.*worker)(iterator, scratch_data, copy_data);
+      },
+      [&main_object, copier](const CopyData &copy_data) {
+        (main_object.*copier)(copy_data);
+      },
+      sample_scratch_data,
+      sample_copy_data,
+      queue_length,
+      chunk_size);
   }
 } // namespace taskflow_v1
index e9bde20b5d8234841244f24993a282f900510717..a70363bb8eb54fda4d414e79da6ae897ccdf2c8f 100644 (file)
@@ -370,19 +370,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_1(X<1> &)
+  X<0>
+  foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_1(X<1> &)
+  static X<0>
+  static_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_1(X<1> &)
+  X<0> &
+  ref_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -394,13 +397,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_1(X<1> &)
+  const X<0> &
+  const_ref_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_1(X<1> &)
+  const X<0> &
+  const_ref_foo_const_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -412,13 +417,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_1_const(X<1> &) const
+  const X<0> &
+  const_ref_foo_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_1_const(X<1> &) const
+  const X<0> &
+  const_ref_foo_const_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -430,13 +437,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_1(X<1> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_1(X<1> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -448,25 +457,29 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_1_const(X<1> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_1_const(X<1> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> &static_ref_foo_ref_1(X<1> &)
+  static X<0> &
+  static_ref_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static const X<0> &static_const_ref_foo_ref_1(X<1> &)
+  static const X<0> &
+  static_const_ref_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -519,13 +532,15 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_1_const(X<1> &) const
+  X<0>
+  foo_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_1_const(X<1> &) const
+  X<0> &
+  ref_foo_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -557,13 +572,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_1_const(X<1> &) const
+  virtual X<0>
+  virtual_foo_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_1_const(X<1> &) const
+  virtual X<0> &
+  virtual_ref_foo_ref_1_const(X<1> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -595,13 +612,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_1(X<1> &)
+  virtual X<0>
+  virtual_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_1(X<1> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_1(X<1> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -651,19 +670,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_2(X<1> &, X<2> &)
+  X<0>
+  foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_2(X<1> &, X<2> &)
+  static X<0>
+  static_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_2(X<1> &, X<2> &)
+  X<0> &
+  ref_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -675,13 +697,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_2(X<1> &, X<2> &)
+  const X<0> &
+  const_ref_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_2(X<1> &, X<2> &)
+  const X<0> &
+  const_ref_foo_const_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -693,13 +717,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_2_const(X<1> &, X<2> &) const
+  const X<0> &
+  const_ref_foo_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_2_const(X<1> &, X<2> &) const
+  const X<0> &
+  const_ref_foo_const_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -711,13 +737,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_2(X<1> &, X<2> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_2(X<1> &, X<2> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -729,26 +757,29 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_2_const(X<1> &, X<2> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_2_const(X<1> &,
-                                                              X<2> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> &static_ref_foo_ref_2(X<1> &, X<2> &)
+  static X<0> &
+  static_ref_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static const X<0> &static_const_ref_foo_ref_2(X<1> &, X<2> &)
+  static const X<0> &
+  static_const_ref_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -801,13 +832,15 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_2_const(X<1> &, X<2> &) const
+  X<0>
+  foo_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_2_const(X<1> &, X<2> &) const
+  X<0> &
+  ref_foo_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -839,13 +872,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_2_const(X<1> &, X<2> &) const
+  virtual X<0>
+  virtual_foo_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_2_const(X<1> &, X<2> &) const
+  virtual X<0> &
+  virtual_ref_foo_ref_2_const(X<1> &, X<2> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -877,13 +912,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_2(X<1> &, X<2> &)
+  virtual X<0>
+  virtual_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_2(X<1> &, X<2> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_2(X<1> &, X<2> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -933,19 +970,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_3(X<1> &, X<2> &, X<3> &)
+  X<0>
+  foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  static X<0>
+  static_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  X<0> &
+  ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -957,13 +997,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  const X<0> &
+  const_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_3(X<1> &, X<2> &, X<3> &)
+  const X<0> &
+  const_ref_foo_const_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -975,13 +1017,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  const X<0> &
+  const_ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  const X<0> &
+  const_ref_foo_const_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -993,13 +1037,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_3(X<1> &, X<2> &, X<3> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1012,26 +1058,28 @@ struct U
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  virtual_const_ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_const_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  virtual_const_ref_foo_const_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> &static_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  static X<0> &
+  static_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static const X<0> &static_const_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  static const X<0> &
+  static_const_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1084,13 +1132,15 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  X<0>
+  foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  X<0> &
+  ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1122,13 +1172,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  virtual X<0>
+  virtual_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
+  virtual X<0> &
+  virtual_ref_foo_ref_3_const(X<1> &, X<2> &, X<3> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1162,13 +1214,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  virtual X<0>
+  virtual_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_3(X<1> &, X<2> &, X<3> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1218,19 +1272,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  X<0>
+  foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  static X<0>
+  static_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  X<0> &
+  ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1242,13 +1299,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  const X<0> &
+  const_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  const X<0> &
+  const_ref_foo_const_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1260,14 +1319,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  const X<0> &
+  const_ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   const X<0> &
-    const_ref_foo_const_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  const_ref_foo_const_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1280,14 +1340,14 @@ struct U
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  virtual_const_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_const_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  virtual_const_ref_foo_const_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1301,28 +1361,28 @@ struct U
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  virtual_const_ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_4_const(X<1> &,
-                                                              X<2> &,
-                                                              X<3> &,
-                                                              X<4> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> &static_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  static X<0> &
+  static_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static const X<0> &static_const_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  static const X<0> &
+  static_const_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1381,13 +1441,15 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  X<0>
+  foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  X<0> &
+  ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1425,14 +1487,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  virtual X<0>
+  virtual_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   virtual X<0> &
-    virtual_ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
+  virtual_ref_foo_ref_4_const(X<1> &, X<2> &, X<3> &, X<4> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1470,13 +1533,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  virtual X<0>
+  virtual_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_4(X<1> &, X<2> &, X<3> &, X<4> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1532,19 +1597,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  X<0>
+  foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  static X<0>
+  static_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  X<0> &
+  ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1556,13 +1624,15 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  const X<0> &
+  const_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  const X<0> &
+  const_ref_foo_const_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1575,17 +1645,14 @@ struct U
     return x;
   }
   const X<0> &
-    const_ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
+  const_ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_5_const(X<1> &,
-                                              X<2> &,
-                                              X<3> &,
-                                              X<4> &,
-                                              X<5> &) const
+  const X<0> &
+  const_ref_foo_const_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1598,14 +1665,14 @@ struct U
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  virtual_const_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_const_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  virtual_const_ref_foo_const_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1618,34 +1685,34 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_5_const(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+    const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_5_const(X<1> &,
-                                                              X<2> &,
-                                                              X<3> &,
-                                                              X<4> &,
-                                                              X<5> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_5_const(X<1> &,
+                                          X<2> &,
+                                          X<3> &,
+                                          X<4> &,
+                                          X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> &static_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  static X<0> &
+  static_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   static const X<0> &
-    static_const_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  static_const_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1718,13 +1785,15 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
+  X<0>
+  foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
+  X<0> &
+  ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1765,14 +1834,14 @@ struct U
     return x;
   }
   virtual X<0>
-    virtual_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
+  virtual_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   virtual X<0> &
-    virtual_ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
+  virtual_ref_foo_ref_5_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1812,13 +1881,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  virtual X<0>
+  virtual_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_5(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1876,19 +1947,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  X<0>
+  foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  static X<0>
+  static_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  X<0> &
+  ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1901,14 +1975,14 @@ struct U
     return x;
   }
   const X<0> &
-    const_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  const_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   const X<0> &
-    const_ref_foo_const_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  const_ref_foo_const_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1920,23 +1994,21 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_6_const(X<1> &,
-                                        X<2> &,
-                                        X<3> &,
-                                        X<4> &,
-                                        X<5> &,
-                                        X<6> &) const
+  const X<0> &
+  const_ref_foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+    const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_6_const(X<1> &,
-                                              X<2> &,
-                                              X<3> &,
-                                              X<4> &,
-                                              X<5> &,
-                                              X<6> &) const
+  const X<0> &
+  const_ref_foo_const_ref_6_const(X<1> &,
+                                  X<2> &,
+                                  X<3> &,
+                                  X<4> &,
+                                  X<5> &,
+                                  X<6> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1950,18 +2022,19 @@ struct U
     return x;
   }
   virtual const X<0> &
-    virtual_const_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  virtual_const_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_6(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &,
-                                                        X<6> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_6(X<1> &,
+                                    X<2> &,
+                                    X<3> &,
+                                    X<4> &,
+                                    X<5> &,
+                                    X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -1974,37 +2047,39 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_6_const(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &,
-                                                        X<6> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_6_const(X<1> &,
+                                    X<2> &,
+                                    X<3> &,
+                                    X<4> &,
+                                    X<5> &,
+                                    X<6> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_6_const(X<1> &,
-                                                              X<2> &,
-                                                              X<3> &,
-                                                              X<4> &,
-                                                              X<5> &,
-                                                              X<6> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_6_const(X<1> &,
+                                          X<2> &,
+                                          X<3> &,
+                                          X<4> &,
+                                          X<5> &,
+                                          X<6> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   static X<0> &
-    static_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  static_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   static const X<0> &
-    static_const_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  static_const_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2082,14 +2157,15 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &) const
+  X<0>
+  foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   X<0> &
-    ref_foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &) const
+  ref_foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2132,23 +2208,16 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_6_const(X<1> &,
-                                       X<2> &,
-                                       X<3> &,
-                                       X<4> &,
-                                       X<5> &,
-                                       X<6> &) const
+  virtual X<0>
+  virtual_foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_6_const(X<1> &,
-                                            X<2> &,
-                                            X<3> &,
-                                            X<4> &,
-                                            X<5> &,
-                                            X<6> &) const
+  virtual X<0> &
+  virtual_ref_foo_ref_6_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+    const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2190,14 +2259,15 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  virtual X<0>
+  virtual_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   virtual X<0> &
-    virtual_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
+  virtual_ref_foo_ref_6(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2258,20 +2328,22 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+  X<0>
+  foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   static X<0>
-    static_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+  static_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+  X<0> &
+  ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2284,19 +2356,20 @@ struct U
     return x;
   }
   const X<0> &
-    const_ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+  const_ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_7(X<1> &,
-                                        X<2> &,
-                                        X<3> &,
-                                        X<4> &,
-                                        X<5> &,
-                                        X<6> &,
-                                        X<7> &)
+  const X<0> &
+  const_ref_foo_const_ref_7(X<1> &,
+                            X<2> &,
+                            X<3> &,
+                            X<4> &,
+                            X<5> &,
+                            X<6> &,
+                            X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2309,25 +2382,27 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_7_const(X<1> &,
-                                        X<2> &,
-                                        X<3> &,
-                                        X<4> &,
-                                        X<5> &,
-                                        X<6> &,
-                                        X<7> &) const
+  const X<0> &
+  const_ref_foo_ref_7_const(X<1> &,
+                            X<2> &,
+                            X<3> &,
+                            X<4> &,
+                            X<5> &,
+                            X<6> &,
+                            X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_7_const(X<1> &,
-                                              X<2> &,
-                                              X<3> &,
-                                              X<4> &,
-                                              X<5> &,
-                                              X<6> &,
-                                              X<7> &) const
+  const X<0> &
+  const_ref_foo_const_ref_7_const(X<1> &,
+                                  X<2> &,
+                                  X<3> &,
+                                  X<4> &,
+                                  X<5> &,
+                                  X<6> &,
+                                  X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2340,25 +2415,27 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_7(X<1> &,
-                                                  X<2> &,
-                                                  X<3> &,
-                                                  X<4> &,
-                                                  X<5> &,
-                                                  X<6> &,
-                                                  X<7> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_7(X<1> &,
+                              X<2> &,
+                              X<3> &,
+                              X<4> &,
+                              X<5> &,
+                              X<6> &,
+                              X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_7(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &,
-                                                        X<6> &,
-                                                        X<7> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_7(X<1> &,
+                                    X<2> &,
+                                    X<3> &,
+                                    X<4> &,
+                                    X<5> &,
+                                    X<6> &,
+                                    X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2376,44 +2453,47 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_7_const(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &,
-                                                        X<6> &,
-                                                        X<7> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_7_const(X<1> &,
+                                    X<2> &,
+                                    X<3> &,
+                                    X<4> &,
+                                    X<5> &,
+                                    X<6> &,
+                                    X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_7_const(X<1> &,
-                                                              X<2> &,
-                                                              X<3> &,
-                                                              X<4> &,
-                                                              X<5> &,
-                                                              X<6> &,
-                                                              X<7> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_7_const(X<1> &,
+                                          X<2> &,
+                                          X<3> &,
+                                          X<4> &,
+                                          X<5> &,
+                                          X<6> &,
+                                          X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
   static X<0> &
-    static_ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+  static_ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static const X<0> &static_const_ref_foo_ref_7(X<1> &,
-                                                X<2> &,
-                                                X<3> &,
-                                                X<4> &,
-                                                X<5> &,
-                                                X<6> &,
-                                                X<7> &)
+  static const X<0> &
+  static_const_ref_foo_ref_7(X<1> &,
+                             X<2> &,
+                             X<3> &,
+                             X<4> &,
+                             X<5> &,
+                             X<6> &,
+                             X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2496,20 +2576,16 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_7_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
-    const
+  X<0>
+  foo_ref_7_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_7_const(X<1> &,
-                            X<2> &,
-                            X<3> &,
-                            X<4> &,
-                            X<5> &,
-                            X<6> &,
-                            X<7> &) const
+  X<0> &
+  ref_foo_ref_7_const(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+    const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2555,25 +2631,27 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_7_const(X<1> &,
-                                       X<2> &,
-                                       X<3> &,
-                                       X<4> &,
-                                       X<5> &,
-                                       X<6> &,
-                                       X<7> &) const
+  virtual X<0>
+  virtual_foo_ref_7_const(X<1> &,
+                          X<2> &,
+                          X<3> &,
+                          X<4> &,
+                          X<5> &,
+                          X<6> &,
+                          X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_7_const(X<1> &,
-                                            X<2> &,
-                                            X<3> &,
-                                            X<4> &,
-                                            X<5> &,
-                                            X<6> &,
-                                            X<7> &) const
+  virtual X<0> &
+  virtual_ref_foo_ref_7_const(X<1> &,
+                              X<2> &,
+                              X<3> &,
+                              X<4> &,
+                              X<5> &,
+                              X<6> &,
+                              X<7> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2618,19 +2696,14 @@ struct U
     return x;
   }
   virtual X<0>
-    virtual_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
+  virtual_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_7(X<1> &,
-                                      X<2> &,
-                                      X<3> &,
-                                      X<4> &,
-                                      X<5> &,
-                                      X<6> &,
-                                      X<7> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_7(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2693,33 +2766,29 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_8(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &, X<8> &)
+  X<0>
+  foo_ref_8(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &, X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> static_foo_ref_8(X<1> &,
-                               X<2> &,
-                               X<3> &,
-                               X<4> &,
-                               X<5> &,
-                               X<6> &,
-                               X<7> &,
-                               X<8> &)
+  static X<0>
+  static_foo_ref_8(X<1> &,
+                   X<2> &,
+                   X<3> &,
+                   X<4> &,
+                   X<5> &,
+                   X<6> &,
+                   X<7> &,
+                   X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_8(X<1> &,
-                      X<2> &,
-                      X<3> &,
-                      X<4> &,
-                      X<5> &,
-                      X<6> &,
-                      X<7> &,
-                      X<8> &)
+  X<0> &
+  ref_foo_ref_8(X<1> &, X<2> &, X<3> &, X<4> &, X<5> &, X<6> &, X<7> &, X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2731,27 +2800,29 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_8(X<1> &,
-                                  X<2> &,
-                                  X<3> &,
-                                  X<4> &,
-                                  X<5> &,
-                                  X<6> &,
-                                  X<7> &,
-                                  X<8> &)
+  const X<0> &
+  const_ref_foo_ref_8(X<1> &,
+                      X<2> &,
+                      X<3> &,
+                      X<4> &,
+                      X<5> &,
+                      X<6> &,
+                      X<7> &,
+                      X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_8(X<1> &,
-                                        X<2> &,
-                                        X<3> &,
-                                        X<4> &,
-                                        X<5> &,
-                                        X<6> &,
-                                        X<7> &,
-                                        X<8> &)
+  const X<0> &
+  const_ref_foo_const_ref_8(X<1> &,
+                            X<2> &,
+                            X<3> &,
+                            X<4> &,
+                            X<5> &,
+                            X<6> &,
+                            X<7> &,
+                            X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2764,27 +2835,29 @@ struct U
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_ref_8_const(X<1> &,
-                                        X<2> &,
-                                        X<3> &,
-                                        X<4> &,
-                                        X<5> &,
-                                        X<6> &,
-                                        X<7> &,
-                                        X<8> &) const
+  const X<0> &
+  const_ref_foo_ref_8_const(X<1> &,
+                            X<2> &,
+                            X<3> &,
+                            X<4> &,
+                            X<5> &,
+                            X<6> &,
+                            X<7> &,
+                            X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  const X<0> &const_ref_foo_const_ref_8_const(X<1> &,
-                                              X<2> &,
-                                              X<3> &,
-                                              X<4> &,
-                                              X<5> &,
-                                              X<6> &,
-                                              X<7> &,
-                                              X<8> &) const
+  const X<0> &
+  const_ref_foo_const_ref_8_const(X<1> &,
+                                  X<2> &,
+                                  X<3> &,
+                                  X<4> &,
+                                  X<5> &,
+                                  X<6> &,
+                                  X<7> &,
+                                  X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2797,27 +2870,29 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_8(X<1> &,
-                                                  X<2> &,
-                                                  X<3> &,
-                                                  X<4> &,
-                                                  X<5> &,
-                                                  X<6> &,
-                                                  X<7> &,
-                                                  X<8> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_8(X<1> &,
+                              X<2> &,
+                              X<3> &,
+                              X<4> &,
+                              X<5> &,
+                              X<6> &,
+                              X<7> &,
+                              X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_8(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &,
-                                                        X<6> &,
-                                                        X<7> &,
-                                                        X<8> &)
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_8(X<1> &,
+                                    X<2> &,
+                                    X<3> &,
+                                    X<4> &,
+                                    X<5> &,
+                                    X<6> &,
+                                    X<7> &,
+                                    X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2836,53 +2911,57 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_ref_8_const(X<1> &,
-                                                        X<2> &,
-                                                        X<3> &,
-                                                        X<4> &,
-                                                        X<5> &,
-                                                        X<6> &,
-                                                        X<7> &,
-                                                        X<8> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_ref_8_const(X<1> &,
+                                    X<2> &,
+                                    X<3> &,
+                                    X<4> &,
+                                    X<5> &,
+                                    X<6> &,
+                                    X<7> &,
+                                    X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual const X<0> &virtual_const_ref_foo_const_ref_8_const(X<1> &,
-                                                              X<2> &,
-                                                              X<3> &,
-                                                              X<4> &,
-                                                              X<5> &,
-                                                              X<6> &,
-                                                              X<7> &,
-                                                              X<8> &) const
+  virtual const X<0> &
+  virtual_const_ref_foo_const_ref_8_const(X<1> &,
+                                          X<2> &,
+                                          X<3> &,
+                                          X<4> &,
+                                          X<5> &,
+                                          X<6> &,
+                                          X<7> &,
+                                          X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static X<0> &static_ref_foo_ref_8(X<1> &,
-                                    X<2> &,
-                                    X<3> &,
-                                    X<4> &,
-                                    X<5> &,
-                                    X<6> &,
-                                    X<7> &,
-                                    X<8> &)
+  static X<0> &
+  static_ref_foo_ref_8(X<1> &,
+                       X<2> &,
+                       X<3> &,
+                       X<4> &,
+                       X<5> &,
+                       X<6> &,
+                       X<7> &,
+                       X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  static const X<0> &static_const_ref_foo_ref_8(X<1> &,
-                                                X<2> &,
-                                                X<3> &,
-                                                X<4> &,
-                                                X<5> &,
-                                                X<6> &,
-                                                X<7> &,
-                                                X<8> &)
+  static const X<0> &
+  static_const_ref_foo_ref_8(X<1> &,
+                             X<2> &,
+                             X<3> &,
+                             X<4> &,
+                             X<5> &,
+                             X<6> &,
+                             X<7> &,
+                             X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -2970,27 +3049,29 @@ struct U
     static X<0> x;
     return x;
   }
-  X<0> foo_ref_8_const(X<1> &,
-                       X<2> &,
-                       X<3> &,
-                       X<4> &,
-                       X<5> &,
-                       X<6> &,
-                       X<7> &,
-                       X<8> &) const
+  X<0>
+  foo_ref_8_const(X<1> &,
+                  X<2> &,
+                  X<3> &,
+                  X<4> &,
+                  X<5> &,
+                  X<6> &,
+                  X<7> &,
+                  X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  X<0> &ref_foo_ref_8_const(X<1> &,
-                            X<2> &,
-                            X<3> &,
-                            X<4> &,
-                            X<5> &,
-                            X<6> &,
-                            X<7> &,
-                            X<8> &) const
+  X<0> &
+  ref_foo_ref_8_const(X<1> &,
+                      X<2> &,
+                      X<3> &,
+                      X<4> &,
+                      X<5> &,
+                      X<6> &,
+                      X<7> &,
+                      X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -3039,27 +3120,29 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_8_const(X<1> &,
-                                       X<2> &,
-                                       X<3> &,
-                                       X<4> &,
-                                       X<5> &,
-                                       X<6> &,
-                                       X<7> &,
-                                       X<8> &) const
+  virtual X<0>
+  virtual_foo_ref_8_const(X<1> &,
+                          X<2> &,
+                          X<3> &,
+                          X<4> &,
+                          X<5> &,
+                          X<6> &,
+                          X<7> &,
+                          X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_8_const(X<1> &,
-                                            X<2> &,
-                                            X<3> &,
-                                            X<4> &,
-                                            X<5> &,
-                                            X<6> &,
-                                            X<7> &,
-                                            X<8> &) const
+  virtual X<0> &
+  virtual_ref_foo_ref_8_const(X<1> &,
+                              X<2> &,
+                              X<3> &,
+                              X<4> &,
+                              X<5> &,
+                              X<6> &,
+                              X<7> &,
+                              X<8> &) const
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
@@ -3106,27 +3189,29 @@ struct U
     static X<0> x;
     return x;
   }
-  virtual X<0> virtual_foo_ref_8(X<1> &,
-                                 X<2> &,
-                                 X<3> &,
-                                 X<4> &,
-                                 X<5> &,
-                                 X<6> &,
-                                 X<7> &,
-                                 X<8> &)
+  virtual X<0>
+  virtual_foo_ref_8(X<1> &,
+                    X<2> &,
+                    X<3> &,
+                    X<4> &,
+                    X<5> &,
+                    X<6> &,
+                    X<7> &,
+                    X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
     return x;
   }
-  virtual X<0> &virtual_ref_foo_ref_8(X<1> &,
-                                      X<2> &,
-                                      X<3> &,
-                                      X<4> &,
-                                      X<5> &,
-                                      X<6> &,
-                                      X<7> &,
-                                      X<8> &)
+  virtual X<0> &
+  virtual_ref_foo_ref_8(X<1> &,
+                        X<2> &,
+                        X<3> &,
+                        X<4> &,
+                        X<5> &,
+                        X<6> &,
+                        X<7> &,
+                        X<8> &)
   {
     deallog << unify_pretty_function(__PRETTY_FUNCTION__) << std::endl;
     static X<0> x;
index 8fdd44f7c3ed24159f3d0b26a8ae39ba9d22e59f..d6d1ce9426e6b5bef360c3eb9880d2a3e2c070b4 100644 (file)
 #include "../tests.h"
 
 
-void colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
-                                    const Point<3> &  center,
-                                    const double      inner_radius,
-                                    const double      outer_radius)
+void
+colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
+                               const Point<3> &  center,
+                               const double      inner_radius,
+                               const double      outer_radius)
 {
   //    if (tria.n_cells() != 4)
   //      AssertThrow (false, ExcNotImplemented());
@@ -137,10 +138,11 @@ void colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
       }
 }
 
-void sixty_deg_hyper_shell(Triangulation<3> &tria,
-                           const Point<3> &  center,
-                           const double      inner_radius,
-                           const double      outer_radius)
+void
+sixty_deg_hyper_shell(Triangulation<3> &tria,
+                      const Point<3> &  center,
+                      const double      inner_radius,
+                      const double      outer_radius)
 {
   const double r0 = inner_radius;
   const double r1 = outer_radius;
index 273a2426f9bc485a32a2e4d2afe3d04d423a52c0..eea4eaa34c2bd48241e6463d3199320ca6c40c3a 100644 (file)
@@ -63,7 +63,8 @@ do_rotate(Triangulation<dim> &tria)
 }
 
 
-void do_rotate(Triangulation<1> &)
+void
+do_rotate(Triangulation<1> &)
 {}
 
 
index d8635d23e873c21a544f898af4ef9958e349a07c..266c651ec15b42a0b94691ce1d9db21d1d6330ab 100644 (file)
@@ -63,7 +63,8 @@ do_rotate(Triangulation<dim> &tria)
 }
 
 
-void do_rotate(Triangulation<1> &)
+void
+do_rotate(Triangulation<1> &)
 {}
 
 
index 8ba5ac9e5e9bc4fb3f1612f3adf6e4e18e480ecc..0f6562039b10d602d36c99e12e5375b430f85f29 100644 (file)
@@ -149,12 +149,14 @@ compare(const Table<3, double> &coeff1, const Table<3, double> &coeff2)
 
 
 
-void resize(Table<2, double> &coeff, const unsigned int N)
+void
+resize(Table<2, double> &coeff, const unsigned int N)
 {
   coeff.reinit(N, N);
 }
 
-void resize(Table<3, double> &coeff, const unsigned int N)
+void
+resize(Table<3, double> &coeff, const unsigned int N)
 {
   TableIndices<3> size;
   for (unsigned int d = 0; d < 3; d++)
index d6601bf6ae1313ad429be3d88abca0c692e390aa..1e486523a3a1a47b66c4ed202fae4ab2348d0902 100644 (file)
@@ -98,8 +98,8 @@ PolyFunction<dim>::value(const Point<dim> &point, const unsigned int) const
 
 template <typename CoefficientType>
 void
-  prepare_symmetric_coefficients(Table<1, CoefficientType> &         coeff,
-                                 const std::vector<CoefficientType> &coeff_1d)
+prepare_symmetric_coefficients(Table<1, CoefficientType> &         coeff,
+                               const std::vector<CoefficientType> &coeff_1d)
 {
   Assert(coeff.size(0) == coeff_1d.size(), ExcInternalError());
 
@@ -109,8 +109,8 @@ void
 
 template <typename CoefficientType>
 void
-  prepare_symmetric_coefficients(Table<2, CoefficientType> &         coeff,
-                                 const std::vector<CoefficientType> &coeff_1d)
+prepare_symmetric_coefficients(Table<2, CoefficientType> &         coeff,
+                               const std::vector<CoefficientType> &coeff_1d)
 {
   for (unsigned int d = 0; d < 2; ++d)
     Assert(coeff.size(d) == coeff_1d.size(), ExcInternalError());
@@ -122,8 +122,8 @@ void
 
 template <typename CoefficientType>
 void
-  prepare_symmetric_coefficients(Table<3, CoefficientType> &         coeff,
-                                 const std::vector<CoefficientType> &coeff_1d)
+prepare_symmetric_coefficients(Table<3, CoefficientType> &         coeff,
+                               const std::vector<CoefficientType> &coeff_1d)
 {
   for (unsigned int d = 0; d < 3; ++d)
     Assert(coeff.size(d) == coeff_1d.size(), ExcInternalError());
index 9b1b8e130fca5dc85d1b2f825590de38d13f2222..ab09cb4bada123fa16ee161b94f54b99b95cc67f 100644 (file)
@@ -48,8 +48,7 @@ main()
       counter++;
       if ((counter == 4) || (counter == 5) || (counter == 6) ||
           (counter == 18) || (counter == 19))
-        {
-        }
+        {}
       else
         out << line << std::endl;
     }
index ae404840bfef8ae2fd5d15655d1c923f0cb10bf5..befe889915e95ac9f6dce6551ea5efae8e82b7cf 100644 (file)
@@ -42,8 +42,7 @@ main()
       counter++;
       if ((counter == 4) || (counter == 5) || (counter == 6) ||
           (counter == 18) || (counter == 19))
-        {
-        }
+        {}
       else
         out << line << std::endl;
     }
index dfce5daaeb3036c02f1b06dd37e868ebe1085225..1e329be61f0d89de668a1fd77e6d7fcac842098a 100644 (file)
@@ -1387,12 +1387,12 @@ namespace Step44
                                    &ls_minimization_function_ptrb,
                                    &use_ptrb]() {
           const auto res_0 = (use_ptrb ? ls_minimization_function_ptrb(0.0) :
-                                         ls_minimization_function(0.0));
+                                               ls_minimization_function(0.0));
           Assert(res_0.second < 0.0,
                  ExcMessage("Gradient should be negative. Current value: " +
                             std::to_string(res_0.second)));
           const auto res_1 = (use_ptrb ? ls_minimization_function_ptrb(1.0) :
-                                         ls_minimization_function(1.0));
+                                               ls_minimization_function(1.0));
 
           // Wriggers discussion after 5.14
           if (res_0.second * res_1.second > 0.0)
@@ -1417,7 +1417,7 @@ namespace Step44
                                          a_max,
                                          max_evals,
                                          debug_linesearch) :
-                                       LineMinimization::line_search<double>(
+                                             LineMinimization::line_search<double>(
                                          ls_minimization_function,
                                          res_0.first,
                                          res_0.second,
index 8b89e5e53e10bfaadce283de5eed38063b9ed9c9..a6b59949f555d3289baf31fe8aa38324db5129fb 100644 (file)
 using namespace dealii::Physics;
 
 template <int dim, typename Number>
-void initialize(Tensor<1, dim, Number> &x)
+void
+initialize(Tensor<1, dim, Number> &x)
 {
   for (unsigned int i = 0; i < x.n_independent_components; ++i)
     x[i] = i + 1;
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<2, dim, Number> &x)
+void
+initialize(Tensor<2, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -48,7 +50,8 @@ void initialize(Tensor<2, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(SymmetricTensor<2, dim, Number> &x)
+void
+initialize(SymmetricTensor<2, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -59,7 +62,8 @@ void initialize(SymmetricTensor<2, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<3, dim, Number> &x)
+void
+initialize(Tensor<3, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -73,8 +77,8 @@ void initialize(Tensor<3, dim, Number> &x)
 // A specialised constructor mimicking the construction
 // of a rank-3 tensor with two symmetric components
 template <int dim, typename Number>
-void initialize(Tensor<3, dim, Number> &x,
-                const bool              left_components_are_symmetric)
+void
+initialize(Tensor<3, dim, Number> &x, const bool left_components_are_symmetric)
 {
   Tensor<1, dim, Number> v;
   initialize(v);
@@ -88,7 +92,8 @@ void initialize(Tensor<3, dim, Number> &x,
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<4, dim, Number> &x)
+void
+initialize(Tensor<4, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -101,7 +106,8 @@ void initialize(Tensor<4, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(SymmetricTensor<4, dim, Number> &x)
+void
+initialize(SymmetricTensor<4, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
index 7b98b61f8192b119fc96ea634d7c5b2a81f4c48d..84756e39c3d4bcde34d25a353bb3fbefb2ae7e52 100644 (file)
 using namespace dealii::Physics;
 
 template <int dim, typename Number>
-void initialize(Tensor<1, dim, Number> &x)
+void
+initialize(Tensor<1, dim, Number> &x)
 {
   for (unsigned int i = 0; i < x.n_independent_components; ++i)
     x[i] = i + 1;
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<2, dim, Number> &x)
+void
+initialize(Tensor<2, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -51,7 +53,8 @@ void initialize(Tensor<2, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(SymmetricTensor<2, dim, Number> &x)
+void
+initialize(SymmetricTensor<2, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -62,7 +65,8 @@ void initialize(SymmetricTensor<2, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<3, dim, Number> &x)
+void
+initialize(Tensor<3, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -76,8 +80,8 @@ void initialize(Tensor<3, dim, Number> &x)
 // A specialised constructor mimicking the construction
 // of a rank-3 tensor with two symmetric components
 template <int dim, typename Number>
-void initialize(Tensor<3, dim, Number> &x,
-                const bool              left_components_are_symmetric)
+void
+initialize(Tensor<3, dim, Number> &x, const bool left_components_are_symmetric)
 {
   Tensor<1, dim, Number> v;
   initialize(v);
@@ -91,7 +95,8 @@ void initialize(Tensor<3, dim, Number> &x,
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<4, dim, Number> &x)
+void
+initialize(Tensor<4, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
@@ -104,7 +109,8 @@ void initialize(Tensor<4, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(SymmetricTensor<4, dim, Number> &x)
+void
+initialize(SymmetricTensor<4, dim, Number> &x)
 {
   unsigned int c = 1;
   for (unsigned int i = 0; i < dim; ++i)
index ef325e4d24ff55cd15acde7e9a6fd7e963d42998..131c09a8b387239d36349fbaff38843ec78475ab 100644 (file)
 using namespace dealii::Physics;
 
 template <int dim, typename Number>
-void initialize(Tensor<0, dim, Number> &x)
+void
+initialize(Tensor<0, dim, Number> &x)
 {
   x = 1.0;
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<1, dim, Number> &x)
+void
+initialize(Tensor<1, dim, Number> &x)
 {
   for (unsigned int i = 0; i < x.n_independent_components; ++i)
     x[i] = 1.0;
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<2, dim, Number> &x)
+void
+initialize(Tensor<2, dim, Number> &x)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = 0; j < dim; ++j)
@@ -54,7 +57,8 @@ void initialize(Tensor<2, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(SymmetricTensor<2, dim, Number> &x)
+void
+initialize(SymmetricTensor<2, dim, Number> &x)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = i; j < dim; ++j)
@@ -64,7 +68,8 @@ void initialize(SymmetricTensor<2, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<3, dim, Number> &x)
+void
+initialize(Tensor<3, dim, Number> &x)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = 0; j < dim; ++j)
@@ -75,7 +80,8 @@ void initialize(Tensor<3, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(Tensor<4, dim, Number> &x)
+void
+initialize(Tensor<4, dim, Number> &x)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = 0; j < dim; ++j)
@@ -87,7 +93,8 @@ void initialize(Tensor<4, dim, Number> &x)
 }
 
 template <int dim, typename Number>
-void initialize(SymmetricTensor<4, dim, Number> &x)
+void
+initialize(SymmetricTensor<4, dim, Number> &x)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = i; j < dim; ++j)
index 7a00496532bc84b27aea5d78c67ab894d90584c8..a6e79f794d37a0584e9c2e316fa4265984f03792 100644 (file)
@@ -390,7 +390,7 @@ namespace Step18
     std::vector<types::global_dof_index> local_dof_indices(dofs_per_cell);
     BodyForce<dim>                       body_force;
     std::vector<Vector<double>>          body_force_values(n_q_points,
-                                                           Vector<double>(dim));
+                                                  Vector<double>(dim));
     typename DoFHandler<dim>::active_cell_iterator cell =
                                                      dof_handler.begin_active(),
                                                    endc = dof_handler.end();
index 82e7a35b1b7737303a3c71927dffdfcebfa75702..91a73b557072a0c1a2a4435cdc9e4235d87da29b 100644 (file)
@@ -406,7 +406,7 @@ namespace Step18
     std::vector<types::global_dof_index> local_dof_indices(dofs_per_cell);
     BodyForce<dim>                       body_force;
     std::vector<Vector<double>>          body_force_values(n_q_points,
-                                                           Vector<double>(dim));
+                                                  Vector<double>(dim));
     typename DoFHandler<dim>::active_cell_iterator cell =
                                                      dof_handler.begin_active(),
                                                    endc = dof_handler.end();
index 5791dc14d93cb1cc9a9577ea15fce01a94b16e94..52e3d32c6755d6e0d95901585bbde16e9bcfb3a6 100644 (file)
@@ -71,12 +71,13 @@ test2()
   for (unsigned int i = 0; i < v.size(); ++i)
     v[i] = i + 1;
   int result = 0;
-  WorkStream::run(v.begin(),
-                  v.end(),
-                  &assemble,
-                  [&result](const copy_data &data) { copy(result, data); },
-                  scratch_data(),
-                  copy_data());
+  WorkStream::run(
+    v.begin(),
+    v.end(),
+    &assemble,
+    [&result](const copy_data &data) { copy(result, data); },
+    scratch_data(),
+    copy_data());
   std::cout << "result: " << result << std::endl;
 
   if (result != maxi * (maxi + 1) / 2)
index 8fd9e8936aa38aaa1c08e8366ab73995fd6c85db..a4ce14061d9011c9b3511ce4646cd78581e9d936 100644 (file)
@@ -146,7 +146,8 @@ do_boundary(Triangulation<dim, spacedim> &t1)
 
 
 template <int spacedim>
-void do_boundary(Triangulation<1, spacedim> &)
+void
+do_boundary(Triangulation<1, spacedim> &)
 {}
 
 
index 39e9be0d82c06f7f0bcbe11fd4428d0ce972b2e7..e0bba589bf796b1adb9c64e40c4e04bae80bb642 100644 (file)
@@ -154,7 +154,8 @@ do_boundary(Triangulation<dim, spacedim> &t1)
 
 
 template <int spacedim>
-void do_boundary(Triangulation<1, spacedim> &)
+void
+do_boundary(Triangulation<1, spacedim> &)
 {}
 
 
index cacd855b83e9f11d6e21ddb199ecced32c2cda5e..5e78ff6d270851429d348b495f4f3c1276e9b1ce 100644 (file)
@@ -136,7 +136,8 @@ do_boundary(Triangulation<dim, spacedim> &t1)
 
 
 template <int spacedim>
-void do_boundary(Triangulation<1, spacedim> &)
+void
+do_boundary(Triangulation<1, spacedim> &)
 {}
 
 
index afd70741f2552df6e38d913537da27803c0b3394..bad6caf1231a8683e991bec738ea075eb324f36a 100644 (file)
@@ -135,7 +135,8 @@ do_boundary(Triangulation<dim, spacedim> &t1)
 
 
 template <int spacedim>
-void do_boundary(Triangulation<1, spacedim> &)
+void
+do_boundary(Triangulation<1, spacedim> &)
 {}
 
 
index 3180130d776fcee4c62cedd61b58b2dfe83c7c1c..c0719dae99a369916f937b881cb0aab94ff64e95 100644 (file)
@@ -35,7 +35,8 @@
 
 using namespace dealii;
 
-void make_grid(Triangulation<2> &triangulation)
+void
+make_grid(Triangulation<2> &triangulation)
 {
   Triangulation<2> triangulation_temp;
 
index 5c2077b180f5755bb294462449e0ddde861d25bf..526f6230eb6e136a1b4fc51bc022510944134a6e 100644 (file)
@@ -45,7 +45,8 @@
 
 using namespace dealii;
 
-void make_grid(Triangulation<2> &triangulation)
+void
+make_grid(Triangulation<2> &triangulation)
 {
   Triangulation<2> triangulation_temp;
 
@@ -60,7 +61,8 @@ void make_grid(Triangulation<2> &triangulation)
   triangulation.refine_global(); // WARNING: no local refinement is performed
 }
 
-void distribute_dofs(DoFHandler<2> &dof_handler)
+void
+distribute_dofs(DoFHandler<2> &dof_handler)
 {
   const FE_SimplexP<2> finite_element(1);
   dof_handler.distribute_dofs(finite_element);
@@ -76,7 +78,8 @@ void distribute_dofs(DoFHandler<2> &dof_handler)
   sparsity_pattern.print_svg(deallog.get_file_stream());
 }
 
-void renumber_dofs(DoFHandler<2> &dof_handler)
+void
+renumber_dofs(DoFHandler<2> &dof_handler)
 {
   DoFRenumbering::Cuthill_McKee(dof_handler);
 
index 116bf5adda6acf04d023e2f388752dd1dc6b3c90..770a19974c01aa626747ec967b40ac27935b4889 100644 (file)
@@ -899,7 +899,7 @@ namespace Step31
       const LinearSolvers::BlockSchurPreconditioner<
         TrilinosWrappers::PreconditionAMG,
         TrilinosWrappers::PreconditionIC>
-                    preconditioner(stokes_matrix, mp_inverse, *Amg_preconditioner);
+        preconditioner(stokes_matrix, mp_inverse, *Amg_preconditioner);
       SolverControl solver_control(stokes_matrix.m(),
                                    1e-6 * stokes_rhs.l2_norm());
       SolverGMRES<TrilinosWrappers::MPI::BlockVector> gmres(
index 362e32b2dd56184d46c3a1de989b7e42f57d2478..03c9b23ef87b8a7225ff09785f45ba7bafa4a9a4 100644 (file)
@@ -499,7 +499,8 @@ struct FunctionMin
 template <typename number_t,
           enum SD::OptimizerType     opt_method,
           enum SD::OptimizationFlags opt_flags,
-          template <typename> class FunctionStruct>
+          template <typename>
+          class FunctionStruct>
 void
 test_functions()
 {
index 5700b8ed5236246a2a9bf6ee3d41662985d72abf..fcb5a1a32418048102a4b01c0c5b25f5d4c996d0 100644 (file)
@@ -21,7 +21,8 @@
 
 
 template <int dim>
-void initialize(SymmetricTensor<2, dim> &st)
+void
+initialize(SymmetricTensor<2, dim> &st)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = i; j < dim; ++j)
@@ -30,7 +31,8 @@ void initialize(SymmetricTensor<2, dim> &st)
 
 
 template <int dim>
-void initialize(SymmetricTensor<4, dim> &st)
+void
+initialize(SymmetricTensor<4, dim> &st)
 {
   for (unsigned int i = 0; i < dim; ++i)
     for (unsigned int j = i; j < dim; ++j)
index df9dbb000f7bc29e616e4b7ab156477bfcc9729c..dad3efed6911420e6af63c617f5ff67ea8056bef 100644 (file)
@@ -30,7 +30,8 @@
 // from NumberType2
 template <int rank,
           int dim,
-          template <int, int, typename> class TensorType,
+          template <int, int, typename>
+          class TensorType,
           typename NumberType1,
           typename NumberType2>
 typename std::enable_if<!std::is_constructible<NumberType1, NumberType2>::value,
@@ -40,7 +41,8 @@ test_tensor_constructor(const std::string &, const std::string &)
 
 template <int rank,
           int dim,
-          template <int, int, typename> class TensorType,
+          template <int, int, typename>
+          class TensorType,
           typename NumberType1,
           typename NumberType2>
 typename std::enable_if<std::is_constructible<NumberType1, NumberType2>::value,
@@ -57,7 +59,8 @@ test_tensor_constructor(const std::string &type1, const std::string &type2)
 
 template <int rank,
           int dim,
-          template <int, int, typename> class TensorType,
+          template <int, int, typename>
+          class TensorType,
           typename NumberType1>
 void
 test_fixed_NT_2(const std::string &type1)
index 2176289f98a890197e0101f6695dee2c0fdad61e..2ebfc75066fd2541545f96bd56e959119559b0c8 100644 (file)
@@ -29,8 +29,10 @@ template <int rank1,
           int rank3,
           int dim,
           typename number,
-          template <int, int, typename> class T1,
-          template <int, int, typename> class T3>
+          template <int, int, typename>
+          class T1,
+          template <int, int, typename>
+          class T3>
 void
 test_symm_tensor_contract_3(const T1<rank1, dim, number> &    l,
                             const Tensor<rank2, dim, number> &m,
index ce0dda62e63eaf5f3f95253fb4aa767f9a275140..035612f407f7cc81df430e312fb6fd570ca9106e 100644 (file)
@@ -26,8 +26,8 @@
 // in clang-3.7.0 and clang-3.9.1 in release mode. Hence, use a separate
 // function.
 template <int dim, typename Number>
-void fill_tensor(
-  dealii::SymmetricTensor<2, dim, dealii::VectorizedArray<Number>> &A)
+void
+fill_tensor(dealii::SymmetricTensor<2, dim, dealii::VectorizedArray<Number>> &A)
 {
   Number counter = 0.0;
   for (unsigned int i = 0; i < dim; ++i)
index 23c003b433f9b9fa648dc56306c8201116cacfad..e92e33ebbbf6e1da6c5e13b917ff510a195f8caa 100644 (file)
@@ -46,7 +46,8 @@ is_unit_vector(const Tensor<1, dim> &v)
 }
 
 template <int dim>
-bool check_orientation(Tensor<1, dim> v1, Tensor<1, dim> v2)
+bool
+check_orientation(Tensor<1, dim> v1, Tensor<1, dim> v2)
 {
   v1 /= v1.norm();
   v2 /= v2.norm();
index 29172446894c2c79921a42c49b7e8f54bb381caf..92eec6380df57f655dac252ceb6b289e372a1f92 100644 (file)
@@ -46,9 +46,8 @@ is_unit_vector(const Tensor<1, dim> &v)
 }
 
 template <int dim>
-bool check_orientation(Tensor<1, dim> v1,
-                       Tensor<1, dim> v2,
-                       const double   tol = 1e-9)
+bool
+check_orientation(Tensor<1, dim> v1, Tensor<1, dim> v2, const double tol = 1e-9)
 {
   v1 /= v1.norm();
   v2 /= v2.norm();
index e41d1755c39c2f8ee4ef39d7df8c3ca62feffd33..bb213faca6f1ad562f3e83ed87dd9cab5ba5fd04 100644 (file)
@@ -45,9 +45,11 @@ fill_tensor(Tensor<rank, dim, NumberType> &t)
 }
 
 template <int dim,
-          template <int, int, typename> class TensorType1,
+          template <int, int, typename>
+          class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 void
 print(const TensorType1<2, dim, NumberType1> &t2,
@@ -58,9 +60,11 @@ print(const TensorType1<2, dim, NumberType1> &t2,
 }
 
 template <int dim,
-          template <int, int, typename> class TensorType1,
+          template <int, int, typename>
+          class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 void
 print(const TensorType1<2, dim, NumberType1> &t2_1,
@@ -76,7 +80,8 @@ print(const TensorType1<2, dim, NumberType1> &t2_1,
 
 
 template <template <int, int, typename> class TensorType1,
-          template <int, int, typename> class TensorType2>
+          template <int, int, typename>
+          class TensorType2>
 struct AreSame : std::false_type
 {};
 
@@ -87,7 +92,8 @@ struct AreSame<TensorType1, TensorType1> : std::true_type
 
 template <template <int, int, typename> class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 void
 test_one()
@@ -122,7 +128,8 @@ test_one()
 
 template <template <int, int, typename> class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 typename std::enable_if<AreSame<TensorType1, TensorType2>::value>::type
 test_two()
@@ -175,7 +182,8 @@ test_two()
 
 template <template <int, int, typename> class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 typename std::enable_if<!AreSame<TensorType1, TensorType2>::value>::type
 test_two()
@@ -183,7 +191,8 @@ test_two()
 
 template <template <int, int, typename> class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 typename std::enable_if<(AreSame<TensorType1, SymmetricTensor>::value &&
                          AreSame<TensorType2, SymmetricTensor>::value)>::type
@@ -207,7 +216,8 @@ test_three()
 
 template <template <int, int, typename> class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 typename std::enable_if<!(AreSame<TensorType1, SymmetricTensor>::value &&
                           AreSame<TensorType2, SymmetricTensor>::value)>::type
@@ -217,7 +227,8 @@ test_three()
 
 template <template <int, int, typename> class TensorType1,
           typename NumberType1,
-          template <int, int, typename> class TensorType2,
+          template <int, int, typename>
+          class TensorType2,
           typename NumberType2>
 void
 test_all()

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.