From: bangerth Date: Sun, 28 Jul 2013 18:32:53 +0000 (+0000) Subject: Clarify that a variable is a number of neighbors, not a has some/has no neighbors... X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=1c11ded71441ccbb80c05b6d3c779b54bab78bff;p=dealii-svn.git Clarify that a variable is a number of neighbors, not a has some/has no neighbors boolean. git-svn-id: https://svn.dealii.org/trunk@30178 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/include/deal.II/matrix_free/dof_info.templates.h b/deal.II/include/deal.II/matrix_free/dof_info.templates.h index 16c53c268d..8ab56dcc92 100644 --- a/deal.II/include/deal.II/matrix_free/dof_info.templates.h +++ b/deal.II/include/deal.II/matrix_free/dof_info.templates.h @@ -1020,12 +1020,12 @@ no_constraint: k++) { unsigned int cell = partition_list[k]; - unsigned int no_neighbors = connectivity.row_length(cell); + unsigned int n_neighbors = connectivity.row_length(cell); // In the worst case, each neighbor has a different color. So we - // find at least one available color between 0 and no_neighbors. - color_finder.resize(no_neighbors+1); - for (unsigned int j=0; j<=no_neighbors; ++j) + // find at least one available color between 0 and n_neighbors. + color_finder.resize(n_neighbors+1); + for (unsigned int j=0; j<=n_neighbors; ++j) color_finder[j]=true; CompressedSimpleSparsityPattern::row_iterator neighbor = connectivity.row_begin(cell), @@ -1035,7 +1035,7 @@ no_constraint: // Mark the color that a neighbor within the partition has // as taken if (cell_partition[*neighbor] == part && - cell_color[*neighbor] <= no_neighbors) + cell_color[*neighbor] <= n_neighbors) color_finder[cell_color[*neighbor]] = false; } // Choose the smallest color that is not taken for the block