From: bangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Sun, 26 Apr 2009 22:08:40 +0000 (+0000)
Subject: Remove references to step-32.
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=03875654ce8c5a6b0f89c7a258a4c00530d526fa;p=dealii-svn.git

Remove references to step-32.

git-svn-id: https://svn.dealii.org/branches/releases/Branch-6-2@18745 0785d39b-7218-0410-832d-ea1e28bc413d
---

diff --git a/deal.II/base/include/base/utilities.h b/deal.II/base/include/base/utilities.h
index 330e5b9150..151754b85c 100644
--- a/deal.II/base/include/base/utilities.h
+++ b/deal.II/base/include/base/utilities.h
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 2005, 2006, 2007, 2008 by the deal.II authors
+//    Copyright (C) 2005, 2006, 2007, 2008, 2009 by the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -266,9 +266,6 @@ namespace Utilities
 				      * destructor of this object which in
 				      * turns calls <code>MPI_Finalize</code>
 				      * to shut down the MPI system.
-				      *
-				      * This class is used in @ref step_32
-				      * "step-32", for example.
 				      */
     class MPI_InitFinalize
     {
@@ -329,8 +326,7 @@ namespace Utilities
    * provides a unified interface to both serial and parallel
    * implementations of Trilinos, sets up the MPI communicator in case the
    * programs are run in parallel, and correctly terminates all processes
-   * when the destructor is called. An example usage of this class is shown
-   * in the tutorial program @ref step_32 "step-32".
+   * when the destructor is called.
    */
 #ifdef DEAL_II_USE_TRILINOS
   namespace Trilinos
diff --git a/deal.II/deal.II/include/dofs/dof_tools.h b/deal.II/deal.II/include/dofs/dof_tools.h
index d62ecf4e6f..e49bb13b74 100644
--- a/deal.II/deal.II/include/dofs/dof_tools.h
+++ b/deal.II/deal.II/include/dofs/dof_tools.h
@@ -1336,9 +1336,8 @@ class DoFTools
 				      * case, an assertion is thrown.
 				      *
 				      * This function is used in the
-				      * @ref step_22 "step-22",
-				      * @ref step_31 "step-31", and
-				      * @ref step_32 "step-32" tutorial
+				      * @ref step_22 "step-22", and
+				      * @ref step_31 "step-31" tutorial
 				      * programs.
 				      */
     template <int dim, int spacedim>
diff --git a/deal.II/examples/step-31/doc/intro.dox b/deal.II/examples/step-31/doc/intro.dox
index e55e88d1fb..037c958533 100644
--- a/deal.II/examples/step-31/doc/intro.dox
+++ b/deal.II/examples/step-31/doc/intro.dox
@@ -964,7 +964,7 @@ the latter class, one of the most interesting capabilities is the existence of
 the Trilinos ML package that implements an Algebraic Multigrid (AMG)
 method. We will use this preconditioner to precondition the second order
 operator part of the momentum equation. The ability to solve problems in
-parallel will be explored in @ref step_32 "step-32", using the same problem as
+parallel will be explored in the future tutorial program step-32, using the same problem as
 discussed here.
 
 
diff --git a/deal.II/examples/step-31/doc/results.dox b/deal.II/examples/step-31/doc/results.dox
index 4a70bc0f8c..e5121201d0 100644
--- a/deal.II/examples/step-31/doc/results.dox
+++ b/deal.II/examples/step-31/doc/results.dox
@@ -561,8 +561,9 @@ despite the penalty we pay in terms of smaller time steps.
 
 There are various ways to extend the current program. Of particular interest
 is, of course, to make it faster and/or increase the resolution of the
-program, in particular in 3d. This is the topic of the @ref step_32 "step-32"
-tutorial program which will implement strategies to solve this problem in
+program, in particular in 3d. This is the topic of the future tutorial
+program step-32
+which will implement strategies to solve this problem in
 parallel on a cluster.
 
 Another direction would be to make the fluid flow more realistic. The program
diff --git a/deal.II/lac/include/lac/block_sparsity_pattern.h b/deal.II/lac/include/lac/block_sparsity_pattern.h
index 6cf9e4f17e..b1a9c2304d 100644
--- a/deal.II/lac/include/lac/block_sparsity_pattern.h
+++ b/deal.II/lac/include/lac/block_sparsity_pattern.h
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by the deal.II authors
+//    Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -911,7 +911,7 @@ class BlockCompressedSimpleSparsityPattern : public BlockSparsityPatternBase<Com
  * (in the sense that the method compress() needs to be called before the
  * pattern can be used).
  *
- * This class is used in @ref step_32 "step-32".
+ * This class is used in the future step-32 tutorial program.
  *
  * @author Martin Kronbichler, 2008
  */
diff --git a/deal.II/lac/include/lac/constraint_matrix.h b/deal.II/lac/include/lac/constraint_matrix.h
index b26c2b2616..bbcadfafd0 100644
--- a/deal.II/lac/include/lac/constraint_matrix.h
+++ b/deal.II/lac/include/lac/constraint_matrix.h
@@ -279,7 +279,7 @@ class BlockIndices;
  * where we have no access to the underlying representation of the matrix,
  * and therefore cannot efficiently implement the condense()
  * operation). This is the case discussed in @ref step_17 "step-17", @ref
- * step_18 "step-18", @ref step_31 "step-31", and @ref step_32 "step-32".
+ * step_18 "step-18" and @ref step_31 "step-31".
  * </ul>
  *
  * In this case, one possibility is to distribute local entries to the final