giving up fixing cells_adjacent_to_vertex and deprecating it due to its bad implement...

git-svn-id: https://svn.dealii.org/trunk@26126 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/include/deal.II/grid/grid_tools.h b/deal.II/include/deal.II/grid/grid_tools.h
index d001af2caa6b4c213db67c743b54dff87c178560..08a74019f5d8a3cf1d7b2588c0755dbce6f23980 100644 (file)
--- a/deal.II/include/deal.II/grid/grid_tools.h
+++ b/deal.II/include/deal.II/grid/grid_tools.h
@@ -266,6 +266,19 @@ namespace GridTools
                        const Point<spacedim>     &p);
 
                                    /**
+                                   * @deprecated This function might
+                                    * be acceptable to find a patch
+                                    * around a single vertex, but it
+                                    * wastes resources creating
+                                    * patches around all vertices. The
+                                    * function mail fail on
+                                    * anisotropic meshes, and an easy
+                                    * fix is not obvious. Therefore,
+                                    * it should be replaced by a
+                                    * function which computes all
+                                    * active vertex patches by looping
+                                    * over cells.
+                                   *
                                     * Find and return a vector of
                                     * iterators to active cells that
                                     * surround a given vertex @p vertex.

diff --git a/deal.II/source/grid/grid_tools.cc b/deal.II/source/grid/grid_tools.cc
index cea5d080198af3589bea295ec4b01db6be1452b9..a97cf9aa93db027aca90f7a83803c478993abb51 100644 (file)
--- a/deal.II/source/grid/grid_tools.cc
+++ b/deal.II/source/grid/grid_tools.cc
@@ -732,8 +732,9 @@ namespace GridTools
                         // that cell. in either case, it is adjacent
                         // to the vertex, so add it to the list as well
                         // (if the cell was already in the list then
-                        // the std::set makes sure that we get it only once)
-                        adjacent_cells.insert (cell->neighbor(face));
+                        // the std::set makes sure that we get it only
+                        // once)
+                        adjacent_cells.insert (neighbor);
                         goto next_cell;
                       }
                   }