Remove outdated comment.

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

diff --git a/deal.II/deal.II/include/grid/tria.h b/deal.II/deal.II/include/grid/tria.h
index c4fa6611ee8ff65e3fd5a35d72fdfbec4297d719..91a08ef393be70be651d28406f6150eba56cf852 100644 (file)
--- a/deal.II/deal.II/include/grid/tria.h
+++ b/deal.II/deal.II/include/grid/tria.h
@@ -584,9 +584,6 @@ struct TriaNumberCache<3> : public TriaNumberCache<2>
  *        return n;
  *      };  
  *    \end{verbatim}
- *    Unfortunately, #g++# presently (version 2.7.2) fails to find the right
- *    #distance# template instantiation; it seems we have to wait for future
- *    #g++# versions :-(
  *    
  *  \item {\it Refining all cells of a triangulation}
  *    \begin{verbatim}

diff --git a/deal.II/deal.II/include/grid/tria_iterator.h b/deal.II/deal.II/include/grid/tria_iterator.h
index 253532f02dbfd616e0f553c949d4376976ff78d4..19cc636837a56e33950043d0220df3569ab9d209 100644 (file)
--- a/deal.II/deal.II/include/grid/tria_iterator.h
+++ b/deal.II/deal.II/include/grid/tria_iterator.h
@@ -98,8 +98,7 @@
  *   the STL documentation. It is therefore possible to use the functions
  *   from the {\it algorithm section} of the C++ standard, e.g. #count_if#
  *   (see the documentation for \Ref{Triangulation} for an example) and
- *   several others. Unfortunately, with some of them (e.g. #distance#),
- *   g++2.7 has some problems and we will have to wait for g++2.8.
+ *   several others.
  *   
  *
  *   \subsection{Differences between the classes in this inheritance tree}