From 5df3ace87d737b489b6d61fc0544eba1689c8bee Mon Sep 17 00:00:00 2001 From: wolf Date: Mon, 14 Feb 2000 13:42:40 +0000 Subject: [PATCH] Remove outdated comment. git-svn-id: https://svn.dealii.org/trunk@2404 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/deal.II/include/grid/tria.h | 3 --- deal.II/deal.II/include/grid/tria_iterator.h | 3 +-- 2 files changed, 1 insertion(+), 5 deletions(-) diff --git a/deal.II/deal.II/include/grid/tria.h b/deal.II/deal.II/include/grid/tria.h index c4fa6611ee..91a08ef393 100644 --- 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 253532f02d..19cc636837 100644 --- 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} -- 2.39.5