From: Wolfgang Bangerth Date: Fri, 13 Apr 2018 17:55:34 +0000 (-0600) Subject: Adjust to common coding styles. X-Git-Tag: v9.0.0-rc1~171^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=d379e21631dcdfff6e11ec811e254a2187732d4c;p=dealii.git Adjust to common coding styles. --- diff --git a/include/deal.II/distributed/tria.h b/include/deal.II/distributed/tria.h index 8dae2a39bc..90d8e1ba84 100644 --- a/include/deal.II/distributed/tria.h +++ b/include/deal.II/distributed/tria.h @@ -926,6 +926,9 @@ namespace parallel /** * Override the implementation in parallel::Triangulation because * we can ask p4est about ghost neighbors across periodic boundaries. + * + * Specifically, this function determines the neighboring subdomains that + * are adjacent to each vertex. */ virtual std::map > compute_vertices_with_ghost_neighbors () const; diff --git a/source/distributed/tria.cc b/source/distributed/tria.cc index fd52ba428e..73b8b48b70 100644 --- a/source/distributed/tria.cc +++ b/source/distributed/tria.cc @@ -1789,6 +1789,7 @@ namespace parallel } + template void Triangulation:: @@ -1845,6 +1846,7 @@ namespace parallel } + template void Triangulation:: @@ -3014,6 +3016,8 @@ namespace parallel this->update_periodic_face_map(); } + + template void Triangulation::repartition () @@ -3230,6 +3234,8 @@ namespace parallel ExcInternalError()); } + + template unsigned int Triangulation:: @@ -3272,7 +3278,7 @@ namespace parallel cell != this->end (0); ++cell) { - //skip coarse cells, that are not ours + // skip coarse cells that are not ours if (tree_exists_locally (parallel_forest, coarse_cell_to_p4est_tree_permutation[cell->index() ]) == false) @@ -3321,6 +3327,7 @@ namespace parallel } + template const std::vector & Triangulation::get_p4est_tree_to_coarse_cell_permutation() const @@ -3338,10 +3345,7 @@ namespace parallel } - /** - * Determine the neighboring subdomains that are adjacent to each vertex. - * This is achieved via the p4est_iterate/p8est_iterate tool - */ + template std::map > Triangulation::compute_vertices_with_ghost_neighbors () const @@ -3351,8 +3355,6 @@ namespace parallel return dealii::internal::p4est::compute_vertices_with_ghost_neighbors (*this, this->parallel_forest, this->parallel_ghost); - - } @@ -3661,6 +3663,7 @@ namespace parallel } + template void Triangulation:: @@ -3711,6 +3714,8 @@ namespace parallel } } + + template std::vector Triangulation:: @@ -3819,6 +3824,7 @@ namespace parallel } + template const std::vector & Triangulation<1,spacedim>::get_p4est_tree_to_coarse_cell_permutation() const @@ -3827,6 +3833,8 @@ namespace parallel return a; } + + template std::map > Triangulation<1,spacedim>:: @@ -3836,6 +3844,8 @@ namespace parallel return std::map >(); } + + template std::map > Triangulation<1,spacedim>:: @@ -3846,6 +3856,8 @@ namespace parallel return std::map >(); } + + template std::vector Triangulation<1,spacedim>:: @@ -3865,6 +3877,8 @@ namespace parallel Assert (false, ExcNotImplemented()); } + + template void Triangulation<1,spacedim>::save(const char *) const