From cbdf7491904695f9496f4ea2eef4bee43e26b8a6 Mon Sep 17 00:00:00 2001 From: Daniel Arndt Date: Sun, 31 May 2020 09:17:44 -0400 Subject: [PATCH] Remove trailing empty lines in comments --- .../deal.II/algorithms/general_data_storage.h | 1 - include/deal.II/algorithms/named_selection.h | 1 - include/deal.II/algorithms/newton.h | 1 - include/deal.II/algorithms/operator.h | 3 -- include/deal.II/base/bounding_box.h | 1 - include/deal.II/base/bounding_box_data_out.h | 1 - include/deal.II/base/data_out_base.h | 6 --- include/deal.II/base/derivative_form.h | 1 - include/deal.II/base/discrete_time.h | 1 - include/deal.II/base/function.h | 1 - include/deal.II/base/geometry_info.h | 1 - include/deal.II/base/graph_coloring.h | 2 - include/deal.II/base/hdf5.h | 5 --- include/deal.II/base/index_set.h | 2 - include/deal.II/base/iterator_range.h | 1 - include/deal.II/base/linear_index_iterator.h | 1 - include/deal.II/base/logstream.h | 1 - include/deal.II/base/memory_space.h | 1 - include/deal.II/base/mpi.h | 4 -- .../deal.II/base/mpi_consensus_algorithms.h | 5 --- .../base/mpi_noncontiguous_partitioner.h | 1 - include/deal.II/base/mutable_bind.h | 2 - include/deal.II/base/numbers.h | 5 --- include/deal.II/base/parameter_acceptor.h | 2 - .../deal.II/base/parsed_convergence_table.h | 1 - include/deal.II/base/parsed_function.h | 1 - include/deal.II/base/partitioner.h | 1 - include/deal.II/base/patterns.h | 5 --- include/deal.II/base/polynomial.h | 8 ---- .../base/polynomials_integrated_legendre_sz.h | 1 - include/deal.II/base/polynomials_p.h | 1 - include/deal.II/base/polynomials_piecewise.h | 1 - include/deal.II/base/process_grid.h | 1 - include/deal.II/base/qprojector.h | 2 - include/deal.II/base/quadrature.h | 3 -- include/deal.II/base/quadrature_lib.h | 11 ------ include/deal.II/base/quadrature_point_data.h | 3 -- include/deal.II/base/subscriptor.h | 1 - include/deal.II/base/symmetric_tensor.h | 9 ----- include/deal.II/base/synchronous_iterator.h | 1 - include/deal.II/base/table.h | 4 -- include/deal.II/base/template_constraints.h | 6 --- include/deal.II/base/tensor_accessors.h | 5 --- .../deal.II/base/tensor_product_polynomials.h | 1 - .../base/tensor_product_polynomials_bubbles.h | 1 - .../base/tensor_product_polynomials_const.h | 1 - include/deal.II/base/thread_management.h | 1 - include/deal.II/base/time_stepping.h | 2 - include/deal.II/base/utilities.h | 13 ------- include/deal.II/base/vectorization.h | 3 -- include/deal.II/boost_adaptors/segment.h | 1 - .../deal.II/differentiation/ad/ad_drivers.h | 2 - .../deal.II/differentiation/ad/ad_helpers.h | 7 ---- .../differentiation/ad/ad_number_traits.h | 13 ------- .../differentiation/ad/ad_number_types.h | 1 - .../differentiation/ad/adolc_number_types.h | 9 ----- .../differentiation/ad/sacado_number_types.h | 6 --- .../sd/symengine_number_traits.h | 4 -- .../sd/symengine_number_types.h | 3 -- .../sd/symengine_number_visitor_internal.h | 2 - .../differentiation/sd/symengine_optimizer.h | 1 - .../sd/symengine_product_types.h | 1 - .../distributed/fully_distributed_tria.h | 1 - include/deal.II/distributed/shared_tria.h | 1 - include/deal.II/dofs/dof_accessor.h | 2 - include/deal.II/dofs/dof_faces.h | 4 -- include/deal.II/dofs/dof_handler.h | 1 - include/deal.II/dofs/dof_levels.h | 1 - include/deal.II/dofs/dof_tools.h | 8 ---- include/deal.II/fe/fe.h | 1 - include/deal.II/fe/fe_bernardi_raugel.h | 1 - include/deal.II/fe/fe_bernstein.h | 2 - include/deal.II/fe/fe_dgp.h | 1 - include/deal.II/fe/fe_dgp_monomial.h | 1 - include/deal.II/fe/fe_dgp_nonparametric.h | 1 - include/deal.II/fe/fe_dgq.h | 4 -- include/deal.II/fe/fe_enriched.h | 2 - include/deal.II/fe/fe_interface_values.h | 1 - include/deal.II/fe/fe_nedelec.h | 1 - include/deal.II/fe/fe_nedelec_sz.h | 2 - include/deal.II/fe/fe_nothing.h | 1 - include/deal.II/fe/fe_p1nc.h | 1 - include/deal.II/fe/fe_poly.h | 1 - include/deal.II/fe/fe_poly_face.h | 1 - include/deal.II/fe/fe_q_bubbles.h | 2 - include/deal.II/fe/fe_q_dg0.h | 1 - include/deal.II/fe/fe_q_hierarchical.h | 3 -- include/deal.II/fe/fe_q_iso_q1.h | 1 - include/deal.II/fe/fe_raviart_thomas.h | 3 -- include/deal.II/fe/fe_rt_bubbles.h | 1 - include/deal.II/fe/fe_series.h | 3 -- include/deal.II/fe/fe_tools.h | 2 - include/deal.II/fe/fe_values.h | 5 --- include/deal.II/fe/fe_values_extractors.h | 2 - include/deal.II/fe/mapping.h | 2 - include/deal.II/fe/mapping_c1.h | 1 - include/deal.II/fe/mapping_cartesian.h | 1 - include/deal.II/fe/mapping_fe_field.h | 1 - include/deal.II/fe/mapping_manifold.h | 1 - include/deal.II/fe/mapping_q1_eulerian.h | 1 - include/deal.II/fe/mapping_q_cache.h | 1 - include/deal.II/fe/mapping_q_eulerian.h | 1 - include/deal.II/fe/mapping_q_generic.h | 1 - include/deal.II/gmsh/utilities.h | 3 -- include/deal.II/grid/grid_generator.h | 14 +------ include/deal.II/grid/grid_in.h | 2 - include/deal.II/grid/grid_out.h | 1 - include/deal.II/grid/grid_tools.h | 38 ------------------- include/deal.II/grid/grid_tools_cache.h | 1 - .../grid/grid_tools_cache_update_flags.h | 2 - include/deal.II/grid/manifold.h | 2 - include/deal.II/grid/manifold_lib.h | 8 ---- .../deal.II/grid/tensor_product_manifold.h | 1 - include/deal.II/grid/tria.h | 4 -- include/deal.II/grid/tria_description.h | 6 --- include/deal.II/grid/tria_faces.h | 1 - include/deal.II/grid/tria_iterator.h | 3 -- include/deal.II/grid/tria_iterator_selector.h | 3 -- include/deal.II/grid/tria_levels.h | 1 - include/deal.II/grid/tria_objects.h | 1 - include/deal.II/hp/dof_handler.h | 1 - include/deal.II/hp/fe_collection.h | 1 - include/deal.II/hp/fe_values.h | 1 - include/deal.II/hp/mapping_collection.h | 1 - include/deal.II/hp/q_collection.h | 1 - include/deal.II/integrators/advection.h | 1 - include/deal.II/integrators/divergence.h | 12 ------ include/deal.II/integrators/elasticity.h | 3 -- include/deal.II/integrators/grad_div.h | 5 --- include/deal.II/integrators/l2.h | 5 --- include/deal.II/integrators/laplace.h | 10 ----- include/deal.II/integrators/maxwell.h | 7 ---- include/deal.II/integrators/patches.h | 1 - include/deal.II/lac/arpack_solver.h | 1 - include/deal.II/lac/block_matrix_base.h | 1 - include/deal.II/lac/block_sparsity_pattern.h | 3 -- include/deal.II/lac/block_vector.h | 1 - include/deal.II/lac/block_vector_base.h | 3 -- include/deal.II/lac/chunk_sparse_matrix.h | 1 - include/deal.II/lac/chunk_sparsity_pattern.h | 2 - .../deal.II/lac/communication_pattern_base.h | 1 - include/deal.II/lac/diagonal_matrix.h | 1 - .../deal.II/lac/dynamic_sparsity_pattern.h | 2 - include/deal.II/lac/eigen.h | 2 - include/deal.II/lac/full_matrix.h | 1 - include/deal.II/lac/householder.h | 1 - include/deal.II/lac/identity_matrix.h | 2 - .../deal.II/lac/la_parallel_block_vector.h | 2 - include/deal.II/lac/la_parallel_vector.h | 1 - include/deal.II/lac/la_vector.h | 2 - include/deal.II/lac/lapack_support.h | 1 - include/deal.II/lac/matrix_iterator.h | 1 - include/deal.II/lac/parpack_solver.h | 1 - include/deal.II/lac/petsc_block_vector.h | 1 - include/deal.II/lac/petsc_compatibility.h | 1 - include/deal.II/lac/petsc_vector.h | 1 - include/deal.II/lac/precondition.h | 4 -- include/deal.II/lac/precondition_block.h | 3 -- include/deal.II/lac/precondition_block_base.h | 1 - include/deal.II/lac/read_write_vector.h | 1 - include/deal.II/lac/scalapack.h | 1 - include/deal.II/lac/slepc_solver.h | 7 ---- include/deal.II/lac/solver_bicgstab.h | 1 - include/deal.II/lac/solver_cg.h | 2 - include/deal.II/lac/solver_control.h | 4 -- include/deal.II/lac/solver_fire.h | 1 - include/deal.II/lac/solver_gmres.h | 3 -- include/deal.II/lac/solver_idr.h | 1 - include/deal.II/lac/solver_minres.h | 2 - include/deal.II/lac/solver_qmrs.h | 2 - include/deal.II/lac/solver_richardson.h | 2 - include/deal.II/lac/solver_selector.h | 2 - include/deal.II/lac/sparse_decomposition.h | 1 - include/deal.II/lac/sparse_ilu.h | 1 - include/deal.II/lac/sparse_matrix_ez.h | 1 - include/deal.II/lac/sparse_mic.h | 1 - include/deal.II/lac/sparse_vanka.h | 1 - include/deal.II/lac/sparsity_pattern.h | 3 -- include/deal.II/lac/tensor_product_matrix.h | 3 -- .../lac/trilinos_parallel_block_vector.h | 1 - include/deal.II/lac/trilinos_precondition.h | 1 - include/deal.II/lac/trilinos_solver.h | 1 - include/deal.II/lac/trilinos_sparse_matrix.h | 2 - include/deal.II/lac/trilinos_vector.h | 1 - include/deal.II/lac/utilities.h | 4 -- include/deal.II/lac/vector.h | 1 - include/deal.II/lac/vector_memory.h | 5 --- include/deal.II/lac/vector_space_vector.h | 1 - include/deal.II/lac/vector_type_traits.h | 1 - .../deal.II/matrix_free/cuda_fe_evaluation.h | 1 - include/deal.II/matrix_free/dof_info.h | 1 - .../deal.II/matrix_free/evaluation_kernels.h | 4 -- include/deal.II/matrix_free/face_info.h | 1 - .../deal.II/matrix_free/face_setup_internal.h | 2 - include/deal.II/matrix_free/fe_evaluation.h | 7 ---- .../matrix_free/mapping_data_on_the_fly.h | 1 - include/deal.II/matrix_free/mapping_info.h | 3 -- include/deal.II/matrix_free/matrix_free.h | 1 - include/deal.II/matrix_free/operators.h | 5 --- include/deal.II/matrix_free/shape_info.h | 2 - include/deal.II/matrix_free/task_info.h | 2 - include/deal.II/meshworker/assemble_flags.h | 1 - include/deal.II/meshworker/copy_data.h | 1 - include/deal.II/meshworker/output.h | 1 - include/deal.II/meshworker/scratch_data.h | 1 - include/deal.II/multigrid/mg_base.h | 5 --- include/deal.II/multigrid/mg_block_smoother.h | 1 - include/deal.II/multigrid/mg_coarse.h | 4 -- include/deal.II/multigrid/mg_matrix.h | 2 - include/deal.II/multigrid/mg_smoother.h | 5 --- include/deal.II/multigrid/mg_tools.h | 1 - include/deal.II/multigrid/mg_transfer.h | 3 -- include/deal.II/multigrid/mg_transfer_block.h | 3 -- .../deal.II/multigrid/mg_transfer_component.h | 2 - .../multigrid/mg_transfer_matrix_free.h | 2 - include/deal.II/multigrid/multigrid.h | 2 - .../multigrid/sparse_matrix_collection.h | 1 - include/deal.II/non_matching/coupling.h | 6 --- .../immersed_surface_quadrature.h | 1 - .../deal.II/numerics/adaptation_strategies.h | 1 - .../numerics/data_component_interpretation.h | 1 - include/deal.II/numerics/data_out_dof_data.h | 1 - .../numerics/data_out_dof_data.templates.h | 1 - include/deal.II/numerics/data_postprocessor.h | 3 -- include/deal.II/numerics/error_estimator.h | 1 - include/deal.II/numerics/history.h | 1 - include/deal.II/numerics/rtree.h | 7 ---- .../deal.II/numerics/smoothness_estimator.h | 1 - include/deal.II/numerics/time_dependent.h | 4 -- .../deal.II/numerics/vector_tools_common.h | 1 - .../numerics/vector_tools_interpolate.h | 2 - include/deal.II/opencascade/manifold_lib.h | 5 --- include/deal.II/opencascade/utilities.h | 2 - .../deal.II/optimization/rol/vector_adaptor.h | 1 - include/deal.II/optimization/solver_bfgs.h | 1 - include/deal.II/particles/data_out.h | 2 - include/deal.II/particles/particle.h | 1 - include/deal.II/particles/particle_handler.h | 8 ---- include/deal.II/particles/utilities.h | 3 -- .../deal.II/physics/elasticity/kinematics.h | 3 +- include/deal.II/physics/notation.h | 1 - include/deal.II/physics/transformations.h | 4 -- include/deal.II/sundials/arkode.h | 1 - include/deal.II/sundials/ida.h | 1 - include/deal.II/sundials/kinsol.h | 1 - source/fe/fe_values.cc | 2 - source/multigrid/mg_transfer_component.cc | 2 - source/numerics/derivative_approximation.cc | 2 - tests/arpack/arpack_advection_diffusion.cc | 1 - .../parpack_advection_diffusion_petsc.cc | 1 - .../parpack_advection_diffusion_trilinos.cc | 1 - tests/arpack/step-36_ar.cc | 1 - tests/arpack/step-36_ar_with_iterations.cc | 1 - tests/arpack/step-36_parpack.cc | 1 - tests/arpack/step-36_parpack_mf.cc | 1 - tests/arpack/step-36_parpack_trilinos.cc | 1 - tests/bits/christian_1.cc | 1 - tests/fe/fe_enriched_color_03.cc | 1 - tests/fe/fe_enriched_color_07.cc | 1 - tests/grid/grid_tools_05.cc | 1 - tests/lac/utilities_02.cc | 1 - tests/meshworker/step-50-mesh_loop.cc | 1 - tests/multigrid/step-50_02.cc | 1 - tests/quick_tests/sundials-ida.cc | 1 - tests/sundials/harmonic_oscillator_01.cc | 1 - tests/sundials/harmonic_oscillator_02.cc | 1 - tests/sundials/harmonic_oscillator_03.cc | 1 - tests/sundials/kinsol_01.cc | 1 - tests/test_grids.h | 1 - tests/trilinos/elide_zeros.cc | 1 - 270 files changed, 2 insertions(+), 654 deletions(-) diff --git a/include/deal.II/algorithms/general_data_storage.h b/include/deal.II/algorithms/general_data_storage.h index 110e84374b..bdff0a196f 100644 --- a/include/deal.II/algorithms/general_data_storage.h +++ b/include/deal.II/algorithms/general_data_storage.h @@ -50,7 +50,6 @@ DEAL_II_NAMESPACE_OPEN * Volume = {7}, * Year = {2018}} * @endcode - * */ class GeneralDataStorage : public Subscriptor { diff --git a/include/deal.II/algorithms/named_selection.h b/include/deal.II/algorithms/named_selection.h index 917ab874d8..34edc14780 100644 --- a/include/deal.II/algorithms/named_selection.h +++ b/include/deal.II/algorithms/named_selection.h @@ -29,7 +29,6 @@ DEAL_II_NAMESPACE_OPEN * * Given a list of names to search for (provided by add()), objects of this * class provide an index list of the selected data. - * */ class NamedSelection { diff --git a/include/deal.II/algorithms/newton.h b/include/deal.II/algorithms/newton.h index 962d1e50b2..cacf05fcec 100644 --- a/include/deal.II/algorithms/newton.h +++ b/include/deal.II/algorithms/newton.h @@ -67,7 +67,6 @@ namespace Algorithms * * For the call to (*#inverse_derivative), the vector "Newton * residual" is inserted before "Newton iterate". - * */ template class Newton : public OperatorBase diff --git a/include/deal.II/algorithms/operator.h b/include/deal.II/algorithms/operator.h index 9d4111344d..3a1d871ccf 100644 --- a/include/deal.II/algorithms/operator.h +++ b/include/deal.II/algorithms/operator.h @@ -34,7 +34,6 @@ DEAL_II_NAMESPACE_OPEN * or OutputOperator, depending on whether they return a value or not. See the * documentation of those classes for more detailed information on how to use * them. - * */ namespace Algorithms { @@ -63,7 +62,6 @@ namespace Algorithms * the solution when the function returns. The object in is * providing additional information and forwarded to the inner Operator * objects of the nested iteration. - * */ class OperatorBase : public Subscriptor { @@ -102,7 +100,6 @@ namespace Algorithms /** * An unary operator base class, intended to output the vectors in AnyData * in each step of an iteration. - * */ template class OutputOperator : public Subscriptor diff --git a/include/deal.II/base/bounding_box.h b/include/deal.II/base/bounding_box.h index ff25de8ed4..ac0a4ada19 100644 --- a/include/deal.II/base/bounding_box.h +++ b/include/deal.II/base/bounding_box.h @@ -121,7 +121,6 @@ enum class NeighborType * * This is according to the convention set by the function * coordinate_to_one_dim_higher. - * */ template class BoundingBox diff --git a/include/deal.II/base/bounding_box_data_out.h b/include/deal.II/base/bounding_box_data_out.h index ff77f7c02f..2dd9738de4 100644 --- a/include/deal.II/base/bounding_box_data_out.h +++ b/include/deal.II/base/bounding_box_data_out.h @@ -38,7 +38,6 @@ DEAL_II_NAMESPACE_OPEN /** * This class generates graphical output for BoundingBox objects, starting from * any object that can be converted by boost to a BoundingBox. - * */ template class BoundingBoxDataOut : public DataOutInterface diff --git a/include/deal.II/base/data_out_base.h b/include/deal.II/base/data_out_base.h index bbe76fece2..bb42dc6ea0 100644 --- a/include/deal.II/base/data_out_base.h +++ b/include/deal.II/base/data_out_base.h @@ -239,7 +239,6 @@ namespace DataOutBase * 2dim. * * @ingroup output - * */ template struct Patch @@ -387,7 +386,6 @@ namespace DataOutBase * member variable that make no sense for zero-dimensional patches because * points have no natural neighbors across their non-existent faces, nor * can they reasonably be subdivided. - * */ template struct Patch<0, spacedim> @@ -2160,7 +2158,6 @@ namespace DataOutBase * references other files. For example, it could be the name for a * .pvtu file that references multiple parts of a parallel * computation. - * */ void write_pvd_record( @@ -2798,7 +2795,6 @@ public: * * @note Use an empty string "" for the first argument if output is to be * written in the current working directory. - * */ std::string write_vtu_with_pvtu_record( @@ -3445,7 +3441,6 @@ namespace DataOutBase * operator dumps the intermediate graphics format represented by the patch * data structure. It may later be converted into regular formats for a * number of graphics programs. - * */ template std::ostream & @@ -3458,7 +3453,6 @@ namespace DataOutBase * operator reads the intermediate graphics format represented by the patch * data structure, using the format in which it was written using the * operator<<. - * */ template std::istream & diff --git a/include/deal.II/base/derivative_form.h b/include/deal.II/base/derivative_form.h index f8e0c9ec7d..6cdf3629e7 100644 --- a/include/deal.II/base/derivative_form.h +++ b/include/deal.II/base/derivative_form.h @@ -53,7 +53,6 @@ DEAL_II_NAMESPACE_OPEN * In deal.II we represent these derivatives using objects of type * DerivativeForm@<1,dim,spacedim,Number@>, * DerivativeForm@<2,dim,spacedim,Number@> and so on. - * */ template class DerivativeForm diff --git a/include/deal.II/base/discrete_time.h b/include/deal.II/base/discrete_time.h index cc5eb1adc2..a656f77138 100644 --- a/include/deal.II/base/discrete_time.h +++ b/include/deal.II/base/discrete_time.h @@ -227,7 +227,6 @@ DEAL_II_NAMESPACE_OPEN * // } end snapshot stage * } * @endcode - * */ class DiscreteTime { diff --git a/include/deal.II/base/function.h b/include/deal.II/base/function.h index 44c7459309..23f38930d6 100644 --- a/include/deal.II/base/function.h +++ b/include/deal.II/base/function.h @@ -872,7 +872,6 @@ private: * custom_function({&first_component, &second_component}, * {&zero_gradient, &zero_gradient}); * @endcode - * */ template class FunctionFromFunctionObjects : public Function diff --git a/include/deal.II/base/geometry_info.h b/include/deal.II/base/geometry_info.h index ce55a298ed..61afc04ccb 100644 --- a/include/deal.II/base/geometry_info.h +++ b/include/deal.II/base/geometry_info.h @@ -412,7 +412,6 @@ namespace internal * Since the ability to identify such objects with the integral dimension of * the object represented, this class provides conversion operators to and * from unsigned integers. - * */ class GeometryPrimitive { diff --git a/include/deal.II/base/graph_coloring.h b/include/deal.II/base/graph_coloring.h index cbed131098..cdcfa753e6 100644 --- a/include/deal.II/base/graph_coloring.h +++ b/include/deal.II/base/graph_coloring.h @@ -103,7 +103,6 @@ namespace GraphColoring * std::vector for efficiency). Each element of the outermost set * corresponds to the iterators pointing to objects that are in the same * partition (i.e., the same zone). - * */ template std::vector> @@ -535,7 +534,6 @@ namespace GraphColoring * corresponds to the iterators pointing to objects that are in the same * partition (have the same color) and consequently do not conflict. The * elements of different sets may conflict. - * */ template std::vector> diff --git a/include/deal.II/base/hdf5.h b/include/deal.II/base/hdf5.h index ae7eb4331a..5e8be8e6c5 100644 --- a/include/deal.II/base/hdf5.h +++ b/include/deal.II/base/hdf5.h @@ -324,14 +324,12 @@ DEAL_II_NAMESPACE_OPEN * thread-safe HDF5 version serializes the API but does not provide any level of * concurrency. To achieve high parallel performance with HDF5, we advice to use * HDF5 with MPI. - * */ // clang-format on namespace HDF5 { /** * Base class for the HDF5 objects. - * */ class HDF5Object { @@ -408,7 +406,6 @@ namespace HDF5 /** * This class implements an HDF5 DataSet. - * */ class DataSet : public HDF5Object { @@ -959,7 +956,6 @@ namespace HDF5 /** * This class implements an HDF5 Group - * */ class Group : public HDF5Object { @@ -1057,7 +1053,6 @@ namespace HDF5 /** * This class implements an HDF5 File - * */ class File : public Group { diff --git a/include/deal.II/base/index_set.h b/include/deal.II/base/index_set.h index 2ac1d7252c..2aaa9574cb 100644 --- a/include/deal.II/base/index_set.h +++ b/include/deal.II/base/index_set.h @@ -68,7 +68,6 @@ DEAL_II_NAMESPACE_OPEN * The data structures used in this class along with a rationale can be found * in the * @ref distributed_paper "Distributed Computing paper". - * */ class IndexSet { @@ -347,7 +346,6 @@ public: * Split the set indices represented by this object into blocks given by the * @p n_indices_per_block structure. The sum of its entries must match the * global size of the current object. - * */ std::vector split_by_block( diff --git a/include/deal.II/base/iterator_range.h b/include/deal.II/base/iterator_range.h index a287e34dc1..b41e37ef75 100644 --- a/include/deal.II/base/iterator_range.h +++ b/include/deal.II/base/iterator_range.h @@ -287,7 +287,6 @@ private: /** * Create an object of type IteratorRange given the beginning and * end iterator. - * */ template IteratorRange diff --git a/include/deal.II/base/linear_index_iterator.h b/include/deal.II/base/linear_index_iterator.h index 362208f314..75f63ec5fc 100644 --- a/include/deal.II/base/linear_index_iterator.h +++ b/include/deal.II/base/linear_index_iterator.h @@ -134,7 +134,6 @@ DEAL_II_NAMESPACE_OPEN * size_type type. * * @note TransposeTable uses this template to implement its iterators. - * */ template class LinearIndexIterator diff --git a/include/deal.II/base/logstream.h b/include/deal.II/base/logstream.h index 72abe82413..1d0eb6665f 100644 --- a/include/deal.II/base/logstream.h +++ b/include/deal.II/base/logstream.h @@ -414,7 +414,6 @@ operator<<(LogStream &log, const T &t) /** * The standard log object of deal.II: - * */ extern LogStream deallog; diff --git a/include/deal.II/base/memory_space.h b/include/deal.II/base/memory_space.h index 4a8e67a82f..4467ff0f24 100644 --- a/include/deal.II/base/memory_space.h +++ b/include/deal.II/base/memory_space.h @@ -27,7 +27,6 @@ DEAL_II_NAMESPACE_OPEN /** - * */ namespace MemorySpace { diff --git a/include/deal.II/base/mpi.h b/include/deal.II/base/mpi.h index c24874ee7e..dd886eecf7 100644 --- a/include/deal.II/base/mpi.h +++ b/include/deal.II/base/mpi.h @@ -956,7 +956,6 @@ namespace Utilities * * @return A map from the rank (unsigned int) of the process * which sent the data and object received. - * */ template std::map @@ -975,7 +974,6 @@ namespace Utilities * processes in the MPI communicator. Each entry contains the object * received from the processor with the corresponding rank within the * communicator. - * */ template std::vector @@ -995,7 +993,6 @@ namespace Utilities * processes in the MPI communicator. Each entry contains the object * received from the processor with the corresponding rank within the * communicator. All other processes receive an empty vector. - * */ template std::vector @@ -1044,7 +1041,6 @@ namespace Utilities * @return List containing the MPI process rank for each entry in the index * set @p indices_to_look_up. The order coincides with the order * within the ElementIterator. - * */ std::vector compute_index_owner(const IndexSet &owned_indices, diff --git a/include/deal.II/base/mpi_consensus_algorithms.h b/include/deal.II/base/mpi_consensus_algorithms.h index e3c3a4caf0..eb5c98e532 100644 --- a/include/deal.II/base/mpi_consensus_algorithms.h +++ b/include/deal.II/base/mpi_consensus_algorithms.h @@ -57,7 +57,6 @@ namespace Utilities * 1) deliver only references to empty vectors (of size 0) the data to be * sent can be inserted to or read from, and 2) communicate these vectors * blindly. - * */ template class Process @@ -162,7 +161,6 @@ namespace Utilities * * @tparam T1 The type of the elements of the vector to be sent. * @tparam T2 The type of the elements of the vector to be received. - * */ template class Interface @@ -219,7 +217,6 @@ namespace Utilities * * @tparam T1 The type of the elements of the vector to be sent. * @tparam T2 The type of the elements of the vector to be received. - * */ template class NBX : public Interface @@ -357,7 +354,6 @@ namespace Utilities * * @tparam T1 The type of the elements of the vector to be sent. * @tparam T2 The type of the elements of the vector to be received. - * */ template class PEX : public Interface @@ -453,7 +449,6 @@ namespace Utilities * * @tparam T1 The type of the elements of the vector to be sent. * @tparam T2 The type of the elements of the vector to be received. - * */ template class Selector : public Interface diff --git a/include/deal.II/base/mpi_noncontiguous_partitioner.h b/include/deal.II/base/mpi_noncontiguous_partitioner.h index b155efb572..de17fc2d77 100644 --- a/include/deal.II/base/mpi_noncontiguous_partitioner.h +++ b/include/deal.II/base/mpi_noncontiguous_partitioner.h @@ -35,7 +35,6 @@ namespace Utilities /** * A flexible Partitioner class, which does not impose restrictions * regarding the order of the underlying index sets. - * */ class NoncontiguousPartitioner : public dealii::LinearAlgebra::CommunicationPatternBase diff --git a/include/deal.II/base/mutable_bind.h b/include/deal.II/base/mutable_bind.h index 03670e0f0d..197f127b24 100644 --- a/include/deal.II/base/mutable_bind.h +++ b/include/deal.II/base/mutable_bind.h @@ -77,7 +77,6 @@ namespace Utilities * exp.parse_arguments("3.0 : 4"); * exp(); // calls example_function(p, 3.0, 4); * @endcode - * */ template class MutableBind @@ -183,7 +182,6 @@ namespace Utilities * bound.parse_arguments("3: 4.0"); * bound(); // will execute my_function(3, 4.0); * @endcode - * */ template MutableBind diff --git a/include/deal.II/base/numbers.h b/include/deal.II/base/numbers.h index 67dbb72482..4e3432c7bc 100644 --- a/include/deal.II/base/numbers.h +++ b/include/deal.II/base/numbers.h @@ -55,7 +55,6 @@ namespace internal * * @tparam Number The underlying data type for which one wants to find out * the maximal length of hardware supported vectors. - * */ template struct VectorizedArrayWidthSpecifier @@ -71,7 +70,6 @@ namespace internal * for the data type `double` for the given processor architecture and * optimization level. For a detailed description of supported maximal vector * lengths, see the documentation of VectorizedArray. - * */ template <> struct VectorizedArrayWidthSpecifier @@ -96,7 +94,6 @@ namespace internal * for the data type `float` for the given processor architecture and * optimization level. For a detailed description of supported maximal vector * lengths, see the documentation of VectorizedArray. - * */ template <> struct VectorizedArrayWidthSpecifier @@ -412,7 +409,6 @@ namespace numbers * types and complex number types. This template is mostly used to implement * linear algebra classes such as vectors and matrices that work for both * real and complex numbers. - * */ template struct NumberTraits @@ -475,7 +471,6 @@ namespace numbers /** * Specialization of the general NumberTraits class that provides the * relevant information if the underlying data type is std::complex. - * */ template struct NumberTraits> diff --git a/include/deal.II/base/parameter_acceptor.h b/include/deal.II/base/parameter_acceptor.h index 2d17be3ac1..b0204672ad 100644 --- a/include/deal.II/base/parameter_acceptor.h +++ b/include/deal.II/base/parameter_acceptor.h @@ -344,7 +344,6 @@ DEAL_II_NAMESPACE_OPEN * itself. * * See the tutorial program step-60 for an example on how to use this class. - * */ class ParameterAcceptor : public Subscriptor { @@ -600,7 +599,6 @@ protected: * files. * * See the tutorial program step-60 for an example on how to use this class. - * */ template class ParameterAcceptorProxy : public SourceClass, public ParameterAcceptor diff --git a/include/deal.II/base/parsed_convergence_table.h b/include/deal.II/base/parsed_convergence_table.h index cd17a41740..a00dff2b14 100644 --- a/include/deal.II/base/parsed_convergence_table.h +++ b/include/deal.II/base/parsed_convergence_table.h @@ -131,7 +131,6 @@ DEAL_II_NAMESPACE_OPEN * Volume = {7}, * Year = {2018}} * @endcode - * */ class ParsedConvergenceTable { diff --git a/include/deal.II/base/parsed_function.h b/include/deal.II/base/parsed_function.h index 4b374f7620..89f0b35ec1 100644 --- a/include/deal.II/base/parsed_function.h +++ b/include/deal.II/base/parsed_function.h @@ -104,7 +104,6 @@ namespace Functions * set Variable names = x,y,t * * @endcode - * */ static void declare_parameters(ParameterHandler & prm, diff --git a/include/deal.II/base/partitioner.h b/include/deal.II/base/partitioner.h index f424e21ed2..68a814b21c 100644 --- a/include/deal.II/base/partitioner.h +++ b/include/deal.II/base/partitioner.h @@ -189,7 +189,6 @@ namespace Utilities * export_to_ghosted_array_start() and import_from_ghosted_array_start() * detect this case and only send the selected indices, taken from the * full array of ghost entries. - * */ class Partitioner : public ::dealii::LinearAlgebra::CommunicationPatternBase { diff --git a/include/deal.II/base/patterns.h b/include/deal.II/base/patterns.h index 92dc18558e..a68a374a9d 100644 --- a/include/deal.II/base/patterns.h +++ b/include/deal.II/base/patterns.h @@ -767,7 +767,6 @@ namespace Patterns * * The default separator is a colon, owing to the fact that a pair is in fact * a tuple with two elements. - * */ class Tuple : public PatternBase { @@ -1295,7 +1294,6 @@ namespace Patterns * The second template parameter is used internally to allow for advanced * SFINAE (substitution failure is not an error) tricks used to specialise * this class for arbitrary STL containers and maps. - * */ template struct Convert @@ -1359,7 +1357,6 @@ namespace Patterns * See the documentation of the class Patterns::Tools::Convert, and of the * helper class Patterns::Tools::RankInfo for details on the way separators * are selected when outputting STL container types. - * */ template std::string @@ -1389,7 +1386,6 @@ namespace Patterns * Notice that the current content of variable @p t is ignored. Its type is * used to infer how to interpret the string. If the string is successfully * parsed, then @p t will be set to the parsed content of @p s. - * */ template void @@ -1475,7 +1471,6 @@ namespace Patterns * elementary types, like Point(), or std::complex, are compatible * with the List type. Adding more compatible types is a matter of adding * a specialization of this struct for the given type. - * */ template struct RankInfo diff --git a/include/deal.II/base/polynomial.h b/include/deal.II/base/polynomial.h index cc7b64a256..1ca3d93379 100644 --- a/include/deal.II/base/polynomial.h +++ b/include/deal.II/base/polynomial.h @@ -55,7 +55,6 @@ namespace Polynomials * form, the constructor with the roots in form of a Lagrange polynomial * must be used. In case a manipulation is done that changes the roots, the * representation is switched to the coefficient form. - * */ template class Polynomial : public Subscriptor @@ -291,7 +290,6 @@ namespace Polynomials /** * Class generates Polynomial objects representing a monomial of degree n, * that is, the function $x^n$. - * */ template class Monomial : public Polynomial @@ -335,7 +333,6 @@ namespace Polynomials * entire space of polynomials of degree less than or equal degree. * * The Lagrange polynomials are implemented up to degree 10. - * */ class LagrangeEquidistant : public Polynomial { @@ -394,7 +391,6 @@ namespace Polynomials * interval $[-1,1]$. (ii) The polynomials have been scaled in such a way * that they are orthonormal, not just orthogonal; consequently, the * polynomials do not necessarily have boundary values equal to one. - * */ class Legendre : public Polynomial { @@ -432,7 +428,6 @@ namespace Polynomials * * These polynomials are used for the construction of the shape functions of * Nédélec elements of arbitrary order. - * */ class Lobatto : public Polynomial { @@ -496,7 +491,6 @@ namespace Polynomials * concept of a polynomial degree, if the given argument is zero, it does * not return the linear polynomial described above, but rather a * constant polynomial. - * */ class Hierarchical : public Polynomial { @@ -574,7 +568,6 @@ namespace Polynomials * \ldots & \ldots \\ * p_k(x) &= x^2(x-1)^2 L_{k-4}(x) * @f} - * */ class HermiteInterpolation : public Polynomial { @@ -696,7 +689,6 @@ namespace Polynomials * but gives better condition numbers of interpolation, which improves the * performance of some iterative schemes like conjugate gradients with * point-Jacobi. This polynomial is used in FE_DGQHermite. - * */ class HermiteLikeInterpolation : public Polynomial { diff --git a/include/deal.II/base/polynomials_integrated_legendre_sz.h b/include/deal.II/base/polynomials_integrated_legendre_sz.h index 732f355f5a..b52824c3dc 100644 --- a/include/deal.II/base/polynomials_integrated_legendre_sz.h +++ b/include/deal.II/base/polynomials_integrated_legendre_sz.h @@ -43,7 +43,6 @@ DEAL_II_NAMESPACE_OPEN * polynomials: * * $L_{n} = \frac{l_{n} - l_{n-2}}{2n-1)}$ - * */ class IntegratedLegendreSZ : public Polynomials::Polynomial { diff --git a/include/deal.II/base/polynomials_p.h b/include/deal.II/base/polynomials_p.h index ec947ac218..83082fe0a2 100644 --- a/include/deal.II/base/polynomials_p.h +++ b/include/deal.II/base/polynomials_p.h @@ -42,7 +42,6 @@ DEAL_II_NAMESPACE_OPEN * dimensions: ${1,x,y,xy,x^2,y^2,x^2y,xy^2,x^3,y^3,...}$. The ordering of the * monomials in $P_k1$ matches the ordering of the monomials in $P_k2$ for * $k2>k1$. - * */ template class PolynomialsP : public PolynomialSpace diff --git a/include/deal.II/base/polynomials_piecewise.h b/include/deal.II/base/polynomials_piecewise.h index a616d99a8c..20cd47a9e2 100644 --- a/include/deal.II/base/polynomials_piecewise.h +++ b/include/deal.II/base/polynomials_piecewise.h @@ -48,7 +48,6 @@ namespace Polynomials * allow constructing FE_Q_iso_Q1 elements that put additional degrees of * freedom into an equivalent of a refined mesh instead of higher order * polynomials, which is useful when using mixed finite elements. - * */ template class PiecewisePolynomial : public Subscriptor diff --git a/include/deal.II/base/process_grid.h b/include/deal.II/base/process_grid.h index e006ae6dfb..06faf24d2c 100644 --- a/include/deal.II/base/process_grid.h +++ b/include/deal.II/base/process_grid.h @@ -57,7 +57,6 @@ namespace Utilities * * Currently the only place where one would use a ProcessGrid object is * in connection with a ScaLAPACKMatrix object. - * */ class ProcessGrid { diff --git a/include/deal.II/base/qprojector.h b/include/deal.II/base/qprojector.h index 16e847fade..3daa600597 100644 --- a/include/deal.II/base/qprojector.h +++ b/include/deal.II/base/qprojector.h @@ -71,7 +71,6 @@ DEAL_II_NAMESPACE_OPEN * @ref GlossFaceOrientation "the glossary entry on face orientation" * for more information on this.) The DataSetDescriptor member class is used * to identify where each dataset starts. - * */ template class QProjector @@ -213,7 +212,6 @@ public: * member functions that generate objects of this type, given face or * subface indices, and you can then use the generated object in place of an * integer that denotes the offset of a given dataset. - * */ class DataSetDescriptor { diff --git a/include/deal.II/base/quadrature.h b/include/deal.II/base/quadrature.h index 1186397e55..d90d783f66 100644 --- a/include/deal.II/base/quadrature.h +++ b/include/deal.II/base/quadrature.h @@ -78,7 +78,6 @@ DEAL_II_NAMESPACE_OPEN * @note Instantiations for this template are provided for dimensions 0, 1, 2, * and 3 (see the section on * @ref Instantiations). - * */ template class Quadrature : public Subscriptor @@ -312,7 +311,6 @@ protected: * * @note Each constructor can only be used in the dimension matching the * number of arguments. - * */ template class QAnisotropic : public Quadrature @@ -360,7 +358,6 @@ public: * The aim of this class is to provide a low order formula, where the error * constant can be tuned by increasing the number of quadrature points. This * is useful in integrating non-differentiable functions on cells. - * */ template class QIterated : public Quadrature diff --git a/include/deal.II/base/quadrature_lib.h b/include/deal.II/base/quadrature_lib.h index 354f76d0cd..a3a1b01edd 100644 --- a/include/deal.II/base/quadrature_lib.h +++ b/include/deal.II/base/quadrature_lib.h @@ -33,7 +33,6 @@ DEAL_II_NAMESPACE_OPEN * described in Numerical * Recipes. - * */ template class QGauss : public Quadrature @@ -68,7 +67,6 @@ public: * @sa http://en.wikipedia.org/wiki/Handbook_of_Mathematical_Functions @sa * Karniadakis, G.E. and Sherwin, S.J.: Spectral/hp element methods for * computational fluid dynamics. Oxford: Oxford University Press, 2005 - * */ template class QGaussLobatto : public Quadrature @@ -117,7 +115,6 @@ public: * misnomer results from the fact that its original authors' poor English * language skills led them to translate the name incorrectly from the German * "Trapezregel". - * */ template class QTrapez : public Quadrature @@ -457,7 +454,6 @@ private: * * The weights and functions for Gauss Legendre formula have been tabulated up * to order 12. - * */ template class QTelles : public Quadrature @@ -488,7 +484,6 @@ public: * the integral $\int_0^1 f(x) w(x) dx$ with the weight: $w(x) = * 1/\sqrt{x(1-x)}$. For details see: M. Abramowitz & I.A. Stegun: Handbook of * Mathematical Functions, par. 25.4.38 - * */ template class QGaussChebyshev : public Quadrature @@ -512,7 +507,6 @@ public: * with the left endpoint as quadrature node, but the quadrature node can be * imposed at the right endpoint through the variable ep that can assume the * values left or right. - * */ template class QGaussRadauChebyshev : public Quadrature @@ -558,7 +552,6 @@ private: * $\int_0^1 f(x) w(x) dx$ with the weight: $w(x) = 1/\sqrt{x(1-x)}$. For * details see: M. Abramowitz & I.A. Stegun: Handbook of Mathematical * Functions, par. 25.4.40 - * */ template class QGaussLobattoChebyshev : public Quadrature @@ -597,7 +590,6 @@ public: * singularities at certain points, or functions that present jumps along a * co-dimension one surface inside the reference element, like in the extended * finite element method (XFEM). - * */ template class QSimplex : public Quadrature @@ -656,7 +648,6 @@ public: * \end{pmatrix} * \qquad \theta \dealcoloneq \frac\pi 2 \hat y * \f] - * */ class QTrianglePolar : public QSimplex<2> { @@ -711,7 +702,6 @@ public: * * When $\beta = 1$, this transformation is also known as the Lachat-Watson * transformation. - * */ class QDuffy : public QSimplex<2> { @@ -747,7 +737,6 @@ public: /** * A quadrature to use when the cell should be split into subregions to * integrate using one or more base quadratures. - * */ template class QSplit : public Quadrature diff --git a/include/deal.II/base/quadrature_point_data.h b/include/deal.II/base/quadrature_point_data.h index 42de5ff934..d73796d345 100644 --- a/include/deal.II/base/quadrature_point_data.h +++ b/include/deal.II/base/quadrature_point_data.h @@ -57,7 +57,6 @@ DEAL_II_NAMESPACE_OPEN * However, within the cell this class stores a vector of objects of a single * data type. For this reason, this class may not be sufficiently flexible when, * for example, adopting a level-set approach to describe material behavior. - * */ template class CellDataStorage : public Subscriptor @@ -272,7 +271,6 @@ private: * * To store and access instances of classes derived from this class, see the * CellDataStorage class. - * */ class TransferableQuadraturePointData { @@ -434,7 +432,6 @@ namespace parallel * yield over and undershoots that, once evaluated at a different set of * quadrature points (on child or parent cells) results in values that will * not make much sense. - * */ template class ContinuousQuadratureDataTransfer diff --git a/include/deal.II/base/subscriptor.h b/include/deal.II/base/subscriptor.h index 87beae7a98..363338a1da 100644 --- a/include/deal.II/base/subscriptor.h +++ b/include/deal.II/base/subscriptor.h @@ -205,7 +205,6 @@ private: * This counter may be read from and written to concurrently in * multithreaded code: hence we use the std::atomic class * template. - * */ mutable std::atomic counter; diff --git a/include/deal.II/base/symmetric_tensor.h b/include/deal.II/base/symmetric_tensor.h index 94c9f2cfd2..d0471c3dc4 100644 --- a/include/deal.II/base/symmetric_tensor.h +++ b/include/deal.II/base/symmetric_tensor.h @@ -203,7 +203,6 @@ namespace internal * between two tensors or ranks rank1 and rank2. In general, this is a * tensor of rank rank1+rank2-4, but if this is zero it is a * single scalar Number. For this case, we have a specialization. - * */ template rank1+rank2-4, but if this is zero it is a * single scalar Number. For this case, we have a specialization. - * */ template struct double_contraction_result<2, 2, dim, Number, OtherNumber> @@ -367,7 +365,6 @@ namespace internal * * This class is an adaptation of a similar class used for the Table * class. - * */ template class Accessor @@ -447,7 +444,6 @@ namespace internal * elements of the table, rather than recursively returning access objects * for further subsets. The same holds for this specialization as for the * general template; see there for more information. - * */ template class Accessor @@ -2891,7 +2887,6 @@ namespace internal * @param[out] Q The orthogonal matrix effecting the transformation * @param[out] d The diagonal elements of the tridiagonal matrix * @param[out] e The off-diagonal elements of the tridiagonal matrix - * */ template void @@ -2940,7 +2935,6 @@ namespace internal * * @return An array containing the eigenvectors and the associated eigenvalues. * The array is not sorted in any particular order. - * */ template std::array>, dim> @@ -2986,7 +2980,6 @@ namespace internal * * @return An array containing the eigenvectors and the associated eigenvalues. * The array is not sorted in any particular order. - * */ template std::array>, dim> @@ -3006,7 +2999,6 @@ namespace internal * * @return An array containing the eigenvectors and the associated eigenvalues. * The array is not sorted in any particular order. - * */ template std::array>, 2> @@ -3045,7 +3037,6 @@ namespace internal * * @return An array containing the eigenvectors and the associated eigenvalues. * The array is not sorted in any particular order. - * */ template std::array>, 3> diff --git a/include/deal.II/base/synchronous_iterator.h b/include/deal.II/base/synchronous_iterator.h index e8b1e90a30..ccc643b4f3 100644 --- a/include/deal.II/base/synchronous_iterator.h +++ b/include/deal.II/base/synchronous_iterator.h @@ -45,7 +45,6 @@ DEAL_II_NAMESPACE_OPEN * * This type, and the helper functions associated with it, are used as the * Value concept for the blocked_range type of the Threading Building Blocks. - * */ template struct SynchronousIterators diff --git a/include/deal.II/base/table.h b/include/deal.II/base/table.h index 9fb98cfa21..ebbd0941e5 100644 --- a/include/deal.II/base/table.h +++ b/include/deal.II/base/table.h @@ -69,7 +69,6 @@ namespace internal * should use explicitly in your programs (except, of course, through access * to the elements of tables with operator[], which generates * temporary objects of the types of this namespace). - * */ namespace TableBaseAccessors { @@ -156,7 +155,6 @@ namespace internal * objects of this class, as they are only thought as temporaries for * access to elements of the table class, not for passing them around as * arguments of functions, etc. - * */ template class Accessor @@ -234,7 +232,6 @@ namespace internal * rather than recursively returning access objects for further subsets. * The same holds for this specialization as for the general template; see * there for more information. - * */ template class Accessor @@ -3750,7 +3747,6 @@ Table<7, T>::operator()(const TableIndices<7> &indices) * Global function @p swap which overloads the default implementation of the * C++ standard library which uses a temporary object. The function simply * exchanges the data of the two tables. - * */ template inline void diff --git a/include/deal.II/base/template_constraints.h b/include/deal.II/base/template_constraints.h index 153f75ef3d..68f12520ba 100644 --- a/include/deal.II/base/template_constraints.h +++ b/include/deal.II/base/template_constraints.h @@ -194,7 +194,6 @@ struct constraint_and_return_value; * the second type in the template. * * @deprecated Use std::enable_if instead. - * */ template struct DEAL_II_DEPRECATED constraint_and_return_value @@ -260,7 +259,6 @@ struct DEAL_II_DEPRECATED constraint_and_return_value * forward_call(&h, 1); * } * @endcode - * */ template struct identity @@ -285,7 +283,6 @@ struct identity * This class implements a comparison function that always returns @p false if * the types of its two arguments are different, and returns p1 == p2 * otherwise. - * */ struct PointerComparison { @@ -354,7 +351,6 @@ namespace internal * that specialization of this class is only made for unqualified (fully * stripped) types and that the ProductType class be used to determine the * result of operating with (potentially) qualified types. - * */ template struct ProductTypeImpl @@ -411,7 +407,6 @@ namespace internal * In all of these cases, this type is used to identify which type needs to be * used for the result of computing the product of unknowns and the values, * gradients, or other properties of shape functions. - * */ template struct ProductType @@ -522,7 +517,6 @@ namespace internal * It also allows the declaration of overloads of a function such as @p * multiply for different types of arguments, without resulting in ambiguous * call errors by the compiler. - * */ template struct EnableIfScalar; diff --git a/include/deal.II/base/tensor_accessors.h b/include/deal.II/base/tensor_accessors.h index a0fdb04a2b..8c1d98076e 100644 --- a/include/deal.II/base/tensor_accessors.h +++ b/include/deal.II/base/tensor_accessors.h @@ -66,7 +66,6 @@ DEAL_II_NAMESPACE_OPEN * of such objects. * * @ingroup geomprimitives - * */ namespace TensorAccessors { @@ -183,7 +182,6 @@ namespace TensorAccessors * alias value_type and an index operator * operator[]() that returns a (const or non-const) reference * of value_type. - * */ template constexpr DEAL_II_ALWAYS_INLINE internal::ReorderedIndexView @@ -216,7 +214,6 @@ namespace TensorAccessors * @tparam ArrayType An array like object, such as std::array, or * dealii::TableIndices that stores at least @p rank indices that can be * accessed via operator[](). - * */ template constexpr DEAL_II_ALWAYS_INLINE typename ReturnType::value_type & @@ -264,7 +261,6 @@ namespace TensorAccessors * @note The Types @p T1, @p T2, and @p T3 must have rank rank_1 + rank_2 - * 2 * no_contr, rank_1, or rank_2, respectively. Obviously, no_contr must * be less or equal than rank_1 and rank_2. - * */ template class AnisotropicPolynomials : public ScalarPolynomialsBase diff --git a/include/deal.II/base/tensor_product_polynomials_bubbles.h b/include/deal.II/base/tensor_product_polynomials_bubbles.h index acfd410b76..7b45a6b9f8 100644 --- a/include/deal.II/base/tensor_product_polynomials_bubbles.h +++ b/include/deal.II/base/tensor_product_polynomials_bubbles.h @@ -40,7 +40,6 @@ DEAL_II_NAMESPACE_OPEN * $(2*x_j-1)^{degree-1}\prod_{i=0}^{dim-1}(x_i(1-x_i))$. This class inherits * most of its functionality from TensorProductPolynomials. The bubble * enrichments are added for the last indices. index. - * */ template class TensorProductPolynomialsBubbles : public ScalarPolynomialsBase diff --git a/include/deal.II/base/tensor_product_polynomials_const.h b/include/deal.II/base/tensor_product_polynomials_const.h index a1f6341386..62bccbf706 100644 --- a/include/deal.II/base/tensor_product_polynomials_const.h +++ b/include/deal.II/base/tensor_product_polynomials_const.h @@ -41,7 +41,6 @@ DEAL_II_NAMESPACE_OPEN * class inherits most of its functionality from TensorProductPolynomials. It * works similarly to that class but adds a constant function for the last * index. - * */ template class TensorProductPolynomialsConst : public ScalarPolynomialsBase diff --git a/include/deal.II/base/thread_management.h b/include/deal.II/base/thread_management.h index dd69597622..a3d92a2dfa 100644 --- a/include/deal.II/base/thread_management.h +++ b/include/deal.II/base/thread_management.h @@ -143,7 +143,6 @@ namespace Threads * A namespace in which helper functions and the like for the threading * subsystem are implemented. The members of this namespace are not meant * for public use. - * */ namespace internal { diff --git a/include/deal.II/base/time_stepping.h b/include/deal.II/base/time_stepping.h index 833ccba64d..e87dfe3988 100644 --- a/include/deal.II/base/time_stepping.h +++ b/include/deal.II/base/time_stepping.h @@ -28,7 +28,6 @@ DEAL_II_NAMESPACE_OPEN /** * Namespace containing the time stepping methods. - * */ namespace TimeStepping @@ -136,7 +135,6 @@ namespace TimeStepping /** * Base class for the Runge-Kutta method - * */ template class RungeKutta : public TimeStepping diff --git a/include/deal.II/base/utilities.h b/include/deal.II/base/utilities.h index f3bd3b3743..8bb17607d1 100644 --- a/include/deal.II/base/utilities.h +++ b/include/deal.II/base/utilities.h @@ -146,7 +146,6 @@ namespace Utilities * @param[in] input The string to compress * * @return A compressed version of the input string - * */ std::string compress(const std::string &input); @@ -163,7 +162,6 @@ namespace Utilities * function compress() * * @return The original uncompressed string. - * */ std::string decompress(const std::string &compressed_input); @@ -180,7 +178,6 @@ namespace Utilities * @param binary_input A vector of characters, representing your input as * binary data. * @return A string containing the binary input as a base64 string. - * */ std::string encode_base64(const std::vector &binary_input); @@ -192,7 +189,6 @@ namespace Utilities * * @param base64_input A string that contains the input in base64 format. * @return A vector of characters that represents your input as binary data. - * */ std::vector decode_base64(const std::string &base64_input); @@ -241,7 +237,6 @@ namespace Utilities /** * Determine how many digits are needed to represent numbers at most as * large as the given number. - * */ unsigned int needed_digits(const unsigned int max_number); @@ -253,7 +248,6 @@ namespace Utilities * operation, this function reduces the absolute value of a floating point * number and always rounds towards zero, since decimal places are simply * cut off. - * */ template Number @@ -440,7 +434,6 @@ namespace Utilities * In general, C++ uses mangled names to identify types. This function * uses boost::core::demangle to return a human readable string describing * the type of the variable passed as argument. - * */ template std::string @@ -577,7 +570,6 @@ namespace Utilities * If many consecutive calls with the same buffer are considered, it is * recommended for reasons of performance to ensure that its capacity is * sufficient. - * */ template size_t @@ -592,7 +584,6 @@ namespace Utilities * If the library has been compiled with ZLIB enabled, then the output buffer * can be compressed. This can be triggered with the parameter * @p allow_compression, and is only of effect if ZLIB is enabled. - * */ template std::vector @@ -627,7 +618,6 @@ namespace Utilities * This is because C++ does not allow functions to return arrays. * Consequently, there is a separate unpack() function for arrays, see * below. - * */ template T @@ -640,7 +630,6 @@ namespace Utilities * The @p allow_compression parameter denotes if the buffer to * read from could have been previously compressed with ZLIB, and * is only of effect if ZLIB is enabled. - * */ template T @@ -679,7 +668,6 @@ namespace Utilities * Note that unlike the other unpack() function, it is not necessary * to explicitly specify the template arguments since they can be * deduced from the second argument. - * */ template void @@ -694,7 +682,6 @@ namespace Utilities * The @p allow_compression parameter denotes if the buffer to * read from could have been previously compressed with ZLIB, and * is only of effect if ZLIB is enabled. - * */ template void diff --git a/include/deal.II/base/vectorization.h b/include/deal.II/base/vectorization.h index 4c723912d3..851a2f2b07 100644 --- a/include/deal.II/base/vectorization.h +++ b/include/deal.II/base/vectorization.h @@ -92,7 +92,6 @@ struct EnableIfScalar> /** * An iterator for VectorizedArray. - * */ template class VectorizedArrayIterator @@ -246,7 +245,6 @@ private: * Couriously Recurring Template Pattern (see * https://en.wikipedia.org/wiki/Curiously_recurring_template_pattern) in this * class to avoid having to resort to `virtual` member functions. - * */ template class VectorizedArrayBase @@ -386,7 +384,6 @@ public: * @tparam Number underlying data type * @tparam width vector length (optional; if not set, the maximal width of the * architecture is used) - * */ template class VectorizedArray diff --git a/include/deal.II/boost_adaptors/segment.h b/include/deal.II/boost_adaptors/segment.h index b211b3043a..866ea1447b 100644 --- a/include/deal.II/boost_adaptors/segment.h +++ b/include/deal.II/boost_adaptors/segment.h @@ -31,7 +31,6 @@ DEAL_II_NAMESPACE_OPEN /** * An alias for boost::geometry::model::segment that uses the deal.II * Point class. - * */ template using Segment = boost::geometry::model::segment>; diff --git a/include/deal.II/differentiation/ad/ad_drivers.h b/include/deal.II/differentiation/ad/ad_drivers.h index eabdab1bcf..3e73bef6e7 100644 --- a/include/deal.II/differentiation/ad/ad_drivers.h +++ b/include/deal.II/differentiation/ad/ad_drivers.h @@ -143,7 +143,6 @@ namespace Differentiation * from, operations performed with auto-differentiable numbers. * @tparam T An arbitrary type resulting from the application of * the SFINAE idiom to selectively specialize this class. - * */ template struct TapedDrivers @@ -514,7 +513,6 @@ namespace Differentiation * from, operations performed with auto-differentiable numbers. * @tparam T An arbitrary type resulting from the application of * the SFINAE idiom to selectively specialize this class. - * */ template struct TapelessDrivers diff --git a/include/deal.II/differentiation/ad/ad_helpers.h b/include/deal.II/differentiation/ad/ad_helpers.h index 394e88b5bf..57827c6050 100644 --- a/include/deal.II/differentiation/ad/ad_helpers.h +++ b/include/deal.II/differentiation/ad/ad_helpers.h @@ -164,7 +164,6 @@ namespace Differentiation * * @todo Make this class thread safe for Sacado number and ADOL-C tapeless * numbers (if supported). - * */ template @@ -831,7 +830,6 @@ namespace Differentiation * deal.II, so this class should @b not be embedded within a multithreaded * function when using ADOL-C number types. It is, however, suitable for use * in both serial and MPI routines. - * */ template @@ -1214,7 +1212,6 @@ namespace Differentiation * deal.II, so this class should @b not be embedded within a multithreaded * function when using ADOL-C number types. It is, however, suitable for use * in both serial and MPI routines. - * */ template @@ -1528,7 +1525,6 @@ namespace Differentiation * deal.II, so this class should @b not be embedded within a multithreaded * function when using ADOL-C number types. It is, however, suitable for use * in both serial and MPI routines. - * */ template @@ -2627,7 +2623,6 @@ namespace Differentiation * deal.II, so this class should @b not be embedded within a multithreaded * function when using ADOL-C number types. It is, however, suitable for use * in both serial and MPI routines. - * */ template struct ADNumberTraits; @@ -105,7 +103,6 @@ namespace Differentiation * static const unsigned int n_supported_derivative_levels; * * @endcode - * */ template struct Marking; @@ -175,7 +171,6 @@ namespace Differentiation * auto-differentiable number. * @tparam T An arbitrary type resulting from the application of * the SFINAE idiom to selectively specialize this class. - * */ template struct ExtractData; @@ -192,7 +187,6 @@ namespace Differentiation * supported auto-differentiable number. * @tparam T An arbitrary type resulting from the application of * the SFINAE idiom to selectively specialize this class. - * */ template struct HasRequiredADInfo; @@ -211,7 +205,6 @@ namespace Differentiation * an @p ADNumberType must be extracted through some function that is * specific to each type of AD number. This requires some specialist * intervention to get at this data. - * */ template struct NumberType; @@ -220,7 +213,6 @@ namespace Differentiation /** * A small struct to remove the @p std::complex wrapper * around a number. - * */ template struct RemoveComplexWrapper; @@ -233,7 +225,6 @@ namespace Differentiation * auto-differentiable number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_ad_number; @@ -244,7 +235,6 @@ namespace Differentiation * auto-differentiable number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_taped_ad_number; @@ -255,7 +245,6 @@ namespace Differentiation * auto-differentiable number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_tapeless_ad_number; @@ -266,7 +255,6 @@ namespace Differentiation * auto-differentiable number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_real_valued_ad_number; @@ -277,7 +265,6 @@ namespace Differentiation * auto-differentiable number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_complex_valued_ad_number; diff --git a/include/deal.II/differentiation/ad/ad_number_types.h b/include/deal.II/differentiation/ad/ad_number_types.h index 0b57e6e767..6bd7ae5716 100644 --- a/include/deal.II/differentiation/ad/ad_number_types.h +++ b/include/deal.II/differentiation/ad/ad_number_types.h @@ -30,7 +30,6 @@ namespace Differentiation * An enumeration to indicate which type of auto-differentiable number * is to be used for computations. If a type that is selected for use * is not available in the library, a run-time error will be thrown. - * */ enum class NumberTypes { diff --git a/include/deal.II/differentiation/ad/adolc_number_types.h b/include/deal.II/differentiation/ad/adolc_number_types.h index 9957da8c70..da96b165f8 100644 --- a/include/deal.II/differentiation/ad/adolc_number_types.h +++ b/include/deal.II/differentiation/ad/adolc_number_types.h @@ -31,7 +31,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is an * ADOL-C number or not. By default, numbers are not considered to * have the necessary characteristics to fulfill this condition. - * */ template struct is_adolc_number : std::false_type @@ -42,7 +41,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a taped * ADOL-C number or not. By default, numbers are not considered to * have the necessary characteristics to fulfill this condition. - * */ template struct is_adolc_taped_number : std::false_type @@ -53,7 +51,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a tapeless * ADOL-C number or not. By default, numbers are not considered to * have the necessary characteristics to fulfill this condition. - * */ template struct is_adolc_tapeless_number : std::false_type @@ -229,7 +226,6 @@ namespace Differentiation /** * A struct to help extract certain information associated with * taped ADOL-C auto-differentiable numbers. - * */ template <> struct ExtractData @@ -279,7 +275,6 @@ namespace Differentiation /** * A struct to help extract certain information associated with * tapeless ADOL-C auto-differentiable numbers. - * */ template <> struct ExtractData @@ -332,7 +327,6 @@ namespace Differentiation * taped ADOL-C (real) double. * * @note In this case the number traits are the same as those for a taped double. - * */ template struct ADNumberTraits< @@ -355,7 +349,6 @@ namespace Differentiation * * @note In this case the number traits are the same as those for a taped complex * double. - * */ template struct ADNumberTraits< @@ -378,7 +371,6 @@ namespace Differentiation * tapeless ADOL-C (real) double. * * @note In this case the number traits are the same as those for a tapeless double. - * */ template struct ADNumberTraits< @@ -402,7 +394,6 @@ namespace Differentiation * * @note In this case the number traits are the same as those for a tapeless * complex double. - * */ template struct ADNumberTraits< diff --git a/include/deal.II/differentiation/ad/sacado_number_types.h b/include/deal.II/differentiation/ad/sacado_number_types.h index 39bda6de87..12e089f935 100644 --- a/include/deal.II/differentiation/ad/sacado_number_types.h +++ b/include/deal.II/differentiation/ad/sacado_number_types.h @@ -32,7 +32,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a * Sacado number or not. By default, numbers are not considered to * have the necessary characteristics to fulfill this condition. - * */ template struct is_sacado_number : std::false_type @@ -43,7 +42,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a supported Sacado::Fad * number or not. By default, numbers are not considered to have the * necessary characteristics to fulfill this condition. - * */ template struct is_sacado_dfad_number : std::false_type @@ -54,7 +52,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a supported Sacado::Rad * number or not. By default, numbers are not considered to have the * necessary characteristics to fulfill this condition. - * */ template struct is_sacado_rad_number : std::false_type @@ -103,7 +100,6 @@ namespace Differentiation * implementation details of a @p SacadoNumber. It defines * various number types, and records how many levels of * differentiation the number is able to support. - * */ template struct SacadoNumberInfo; @@ -376,7 +372,6 @@ namespace Differentiation * A struct to help extract certain information associated with * Sacado dynamic reverse auto-differentiable numbers. The @p NumberType * can be either a floating point number or another Sacado type. - * */ template struct ExtractData> @@ -427,7 +422,6 @@ namespace Differentiation * A struct to help extract certain information associated with * Sacado dynamic reverse auto-differentiable numbers. The @p NumberType * can be either a floating point number or another Sacado type. - * */ template struct ExtractData> diff --git a/include/deal.II/differentiation/sd/symengine_number_traits.h b/include/deal.II/differentiation/sd/symengine_number_traits.h index f1d62c2b0e..52f7a647b2 100644 --- a/include/deal.II/differentiation/sd/symengine_number_traits.h +++ b/include/deal.II/differentiation/sd/symengine_number_traits.h @@ -37,7 +37,6 @@ namespace Differentiation * symbolically differentiable number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_sd_number : std::false_type @@ -49,7 +48,6 @@ namespace Differentiation * SymEngine number or not. By default, numbers are not * considered to have the necessary characteristics to fulfill this * condition. - * */ template struct is_symengine_number : std::false_type @@ -63,7 +61,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a supported * symbolically differentiable number or not. * This is a specialization for the SymEngine Expression class. - * */ template <> struct is_symengine_number : std::true_type @@ -74,7 +71,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a supported * symbolically differentiable number or not. * This is a specialization for the SymEngine Expression class. - * */ template <> struct is_sd_number : std::true_type diff --git a/include/deal.II/differentiation/sd/symengine_number_types.h b/include/deal.II/differentiation/sd/symengine_number_types.h index 6bb696f572..3d430e2b90 100644 --- a/include/deal.II/differentiation/sd/symengine_number_types.h +++ b/include/deal.II/differentiation/sd/symengine_number_types.h @@ -173,7 +173,6 @@ namespace Differentiation * // We can expect the above to evaluate to "2*10" which is, * // of course, the numeric value 20. * @endcode - * */ class Expression { @@ -878,7 +877,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a supported * symbolically differentiable number or not. * This is a specialization for the deal.II Expression class. - * */ template <> struct is_symengine_number : std::true_type @@ -889,7 +887,6 @@ namespace Differentiation * A struct to indicate whether a given @p NumberType is a supported * SymEngine number or not. * This is a specialization for the deal.II Expression class. - * */ template <> struct is_sd_number : std::true_type diff --git a/include/deal.II/differentiation/sd/symengine_number_visitor_internal.h b/include/deal.II/differentiation/sd/symengine_number_visitor_internal.h index baa10ce856..c3a15ff721 100644 --- a/include/deal.II/differentiation/sd/symengine_number_visitor_internal.h +++ b/include/deal.II/differentiation/sd/symengine_number_visitor_internal.h @@ -56,7 +56,6 @@ namespace Differentiation * * It is intended that this class only be used in conjunction * with the DictionarySubstitutionVisitor. - * */ template class CSEDictionaryVisitor @@ -262,7 +261,6 @@ namespace Differentiation * between different optimizers and, more importantly, for integrating * CSE into a dictionary substitution scheme. It is therefore only * intended to be created and used by a BatchOptimizer. - * */ template class DictionarySubstitutionVisitor diff --git a/include/deal.II/differentiation/sd/symengine_optimizer.h b/include/deal.II/differentiation/sd/symengine_optimizer.h index 52f609610e..784b93bab1 100644 --- a/include/deal.II/differentiation/sd/symengine_optimizer.h +++ b/include/deal.II/differentiation/sd/symengine_optimizer.h @@ -1425,7 +1425,6 @@ namespace Differentiation * @warning The LLVM optimizer does not yet support complex numbers. If this * incompatible combination of @p ReturnType and optimization method are * selected, then an error will be thrown at run time. - * */ template class BatchOptimizer diff --git a/include/deal.II/differentiation/sd/symengine_product_types.h b/include/deal.II/differentiation/sd/symengine_product_types.h index b9ef24f195..d90b9f4a70 100644 --- a/include/deal.II/differentiation/sd/symengine_product_types.h +++ b/include/deal.II/differentiation/sd/symengine_product_types.h @@ -57,7 +57,6 @@ namespace internal * would otherwise occur if trying to directly implement * these as specializations of the ProductTypeImpl class * itself. - * */ template struct GeneralProductTypeImpl; diff --git a/include/deal.II/distributed/fully_distributed_tria.h b/include/deal.II/distributed/fully_distributed_tria.h index 848865180f..f84adb4754 100644 --- a/include/deal.II/distributed/fully_distributed_tria.h +++ b/include/deal.II/distributed/fully_distributed_tria.h @@ -108,7 +108,6 @@ namespace parallel * @note Currently only simple periodicity conditions (i.e. without offsets * and rotation matrices - see also the documentation of * GridTools::collect_periodic_faces()) are supported. - * */ template class Triangulation diff --git a/include/deal.II/distributed/shared_tria.h b/include/deal.II/distributed/shared_tria.h index f93ab34545..51c80be0d8 100644 --- a/include/deal.II/distributed/shared_tria.h +++ b/include/deal.II/distributed/shared_tria.h @@ -96,7 +96,6 @@ namespace parallel * appropriate for the partitioned mesh. * * @ingroup distributed - * */ template class Triangulation diff --git a/include/deal.II/dofs/dof_accessor.h b/include/deal.II/dofs/dof_accessor.h index 94f8696276..2e04ad1818 100644 --- a/include/deal.II/dofs/dof_accessor.h +++ b/include/deal.II/dofs/dof_accessor.h @@ -419,7 +419,6 @@ public: * Consequently, the derived DoFCellAccessor class has an overloaded version * of this function that calls the present function with * cell-@>active_fe_index as last argument. - * */ void get_dof_indices( @@ -759,7 +758,6 @@ private: * cell in spacedim space dimensions. Since vertices function differently than * general faces, this class does a few things differently than the general * template, but the interface should look the same. - * */ template