]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Improve documentation for the function vertex_to_cell_map.
authorBruno Turcksin <bruno.turcksin@gmail.com>
Wed, 30 Sep 2015 19:30:08 +0000 (14:30 -0500)
committerBruno Turcksin <bruno.turcksin@gmail.com>
Wed, 30 Sep 2015 19:30:08 +0000 (14:30 -0500)
include/deal.II/grid/grid_tools.h
source/grid/grid_tools.cc

index 5daf06dd66084137775d3946b10c7c8e57ee6ee9..38ec4d33cd74fa503527d8c13e4cba4fc68d5b17 100644 (file)
@@ -632,8 +632,12 @@ namespace GridTools
 
 
   /**
-   * Return the adjacent cells of all the vertices. The vertices are ordered by
-   * their ID.
+   * Return the adjacent cells of all the vertices. If a vertex is also a
+   * hanging node, the associated coarse cell is also returned. The vertices
+   * are ordered by the vertex index. This is the number returned by the
+   * function <code>cell-@>vertex_index()</code>. Notice that only the
+   * indices marked in the array returned by
+   * Triangulation<dim,spacedim>::get_used_vertices() are used.
    */
   template <int dim, int spacedim>
   std::vector<std::set<typename Triangulation<dim,spacedim>::active_cell_iterator> >
index 828d0ccd928f98b0c45a34b996610e935cbc1b14..9756b80b16d0dbc2f01f1726f2179932e2fca902 100644 (file)
@@ -1611,7 +1611,7 @@ next_cell:
     for (; cell!=endc; ++cell)
       for (unsigned int i=0; i<GeometryInfo<dim>::faces_per_cell; ++i)
         {
-          if ((cell->neighbor_level(i)>=0) && (cell->neighbor_level(i)<cell->level()))
+          if ((cell->at_boundary(i)==false) && (cell->neighbor_level(i)<cell->level()))
             {
               typename Triangulation<dim,spacedim>::active_cell_iterator adjacent_cell =
                 cell->neighbor(i);

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.