From fbacc6b147bdb4ea2881a378ba9af5ff3449f354 Mon Sep 17 00:00:00 2001 From: bangerth Date: Tue, 27 May 2008 19:45:12 +0000 Subject: [PATCH] Fix a bunch of references to tutorial programs deleted on the branch. git-svn-id: https://svn.dealii.org/branches/Branch-6-1@16233 0785d39b-7218-0410-832d-ea1e28bc413d --- .../deal.II/include/dofs/dof_constraints.h | 4 +- deal.II/deal.II/include/fe/fe.h | 2 +- deal.II/deal.II/include/grid/grid_generator.h | 5 -- deal.II/deal.II/include/grid/tria.h | 3 +- deal.II/deal.II/include/grid/tria_accessor.h | 8 --- deal.II/deal.II/include/numerics/vectors.h | 7 -- deal.II/doc/doxygen/deal.dox | 3 +- deal.II/doc/doxygen/headers/vector_valued.h | 11 ++- deal.II/doc/news/changes.h | 72 ------------------- deal.II/examples/step-18/doc/intro.dox | 5 +- deal.II/examples/step-23/doc/intro.dox | 3 +- .../lac/include/lac/block_sparsity_pattern.h | 2 +- .../lac/compressed_set_sparsity_pattern.h | 8 +-- .../include/lac/compressed_sparsity_pattern.h | 2 +- 14 files changed, 18 insertions(+), 117 deletions(-) delete mode 100644 deal.II/doc/news/changes.h diff --git a/deal.II/deal.II/include/dofs/dof_constraints.h b/deal.II/deal.II/include/dofs/dof_constraints.h index f68562e45c..6aa7e04a74 100644 --- a/deal.II/deal.II/include/dofs/dof_constraints.h +++ b/deal.II/deal.II/include/dofs/dof_constraints.h @@ -702,7 +702,7 @@ class ConstraintMatrix : public Subscriptor * CompressedSetSparsityPattern * class instead, see for example * @ref step_27 "step-27" and - * @ref step_31 "step-31". + * @ref step_22 "step-22". */ void condense (CompressedSparsityPattern &sparsity) const; @@ -737,7 +737,7 @@ class ConstraintMatrix : public Subscriptor * BlockCompressedSetSparsityPattern * class instead, see for example * @ref step_27 "step-27" and - * @ref step_31 "step-31". + * @ref step_22 "step-22". */ void condense (BlockCompressedSparsityPattern &sparsity) const; diff --git a/deal.II/deal.II/include/fe/fe.h b/deal.II/deal.II/include/fe/fe.h index f476a01456..33312cd6b3 100644 --- a/deal.II/deal.II/include/fe/fe.h +++ b/deal.II/deal.II/include/fe/fe.h @@ -1343,7 +1343,7 @@ class FiniteElement : public Subscriptor, * Access to base element * objects. If the element is * scalar, then - * #base_element(0) is + * base_element(0) is * @p this. */ virtual diff --git a/deal.II/deal.II/include/grid/grid_generator.h b/deal.II/deal.II/include/grid/grid_generator.h index 27a78155bc..8d8e15013e 100644 --- a/deal.II/deal.II/include/grid/grid_generator.h +++ b/deal.II/deal.II/include/grid/grid_generator.h @@ -188,11 +188,6 @@ class GridGenerator * @note The triangulation needs to be * void upon calling this * function. - * - * @note For an example of the - * use of this function see the - * @ref step_28 "step-28" - * tutorial program. */ template static diff --git a/deal.II/deal.II/include/grid/tria.h b/deal.II/deal.II/include/grid/tria.h index 329b645873..9a76c25075 100644 --- a/deal.II/deal.II/include/grid/tria.h +++ b/deal.II/deal.II/include/grid/tria.h @@ -837,8 +837,7 @@ namespace internal * This material_id may be set upon construction of a * triangulation (through the CellData data structure), or later * through use of cell iterators. For a typical use of this - * functionality, see the @ref step_28 "step-28" tutorial - * program. The functions of the GridGenerator namespace typically + * functionality. The functions of the GridGenerator namespace typically * set the material ID of all cells to zero. When reading a * triangulation, the material id must be specified in the input * file (UCD format) or is otherwise set to zero. Material IDs are diff --git a/deal.II/deal.II/include/grid/tria_accessor.h b/deal.II/deal.II/include/grid/tria_accessor.h index 0f59aedefc..94fda69369 100644 --- a/deal.II/deal.II/include/grid/tria_accessor.h +++ b/deal.II/deal.II/include/grid/tria_accessor.h @@ -3586,20 +3586,12 @@ class CellAccessor : public TriaObjectAccessor /** * Return the material id of this * cell. - * - * For a typical use of this - * function, see the @ref step_28 - * "step-28" tutorial program. */ unsigned char material_id () const; /** * Set the material id of this * cell. - * - * For a typical use of this - * function, see the @ref step_28 - * "step-28" tutorial program. */ void set_material_id (const unsigned char new_material_id) const; diff --git a/deal.II/deal.II/include/numerics/vectors.h b/deal.II/deal.II/include/numerics/vectors.h index f19fa4e131..354a18156d 100644 --- a/deal.II/deal.II/include/numerics/vectors.h +++ b/deal.II/deal.II/include/numerics/vectors.h @@ -748,13 +748,6 @@ class VectorTools * distribute the solution vector * afterwards. * - * The use of this function is - * explained in more detail in - * @ref step_31 "step-31". It - * doesn't make much sense in 1d, - * so the function throws an - * exception in that case. - * * The second argument of this * function denotes the first * vector component in the finite diff --git a/deal.II/doc/doxygen/deal.dox b/deal.II/doc/doxygen/deal.dox index c88bbdf9ea..3fa3c439f7 100644 --- a/deal.II/doc/doxygen/deal.dox +++ b/deal.II/doc/doxygen/deal.dox @@ -10,8 +10,7 @@ INPUT = headers/ \ ../../deal.II/include/multigrid \ ../../deal.II/include/numerics \ tutorial/doxygen \ - ../news/6.0.0-vs-6.1.0.h \ - ../news/changes.h + ../news/6.0.0-vs-6.1.0.h HTML_OUTPUT = deal.II LATEX_OUTPUT = LaTeX/deal.II diff --git a/deal.II/doc/doxygen/headers/vector_valued.h b/deal.II/doc/doxygen/headers/vector_valued.h index d85fb20890..ab499e7f62 100644 --- a/deal.II/doc/doxygen/headers/vector_valued.h +++ b/deal.II/doc/doxygen/headers/vector_valued.h @@ -28,7 +28,7 @@ * solution is the scalar pressure and the vector-valued velocity * at each point. *
  • The Stokes equation and its extensions discussed in - * @ref step_22 "step-22", and @ref step_31 "step-31" in which again + * @ref step_22 "step-22" in which again * the solution is the scalar pressure and the vector-valued velocity * at each point. *
  • Complex-valued solutions consisting of real and imaginary parts, as @@ -364,8 +364,7 @@ * * Other examples of using extractors and views are shown in tutorial programs * @ref step_21 "step-21", - * @ref step_22 "step-22", - * @ref step_31 "step-31" and a few other programs. + * @ref step_22 "step-22" and a few other programs. * * * @anchor VVAlternative @@ -648,8 +647,8 @@ scalar_product (const Tensor<2,dim> &u, * What is needed is to re-enumerate degrees of freedom so that velocities * come first and pressures last. This can be done using the * DoFRenumbering::component_wise function, as explained in @ref step_20 - * "step-20", @ref step_21 "step-21", @ref step_22 "step-22", and @ref step_31 - * "step-31". After this, at least the degrees of freedom are partitioned + * "step-20", @ref step_21 "step-21", and @ref step_22 "step-22". + * After this, at least the degrees of freedom are partitioned * properly. * * But then we still have to make use of it, i.e. we have to come up with a @@ -690,7 +689,7 @@ scalar_product (const Tensor<2,dim> &u, * large whole matrix we had before. * * How a solver like this is implemented is explained in more detail in @ref - * step_20 "step-20", @ref step_31 "step-31", and a few other tutorial + * step_20 "step-20" and a few other tutorial * programs. What we would like to point out here is that we now need a way to * extract certain parts of a matrix or vector: if we are to multiply, say, * the $U$ part of the solution vector by the $M$ part of the global matrix, diff --git a/deal.II/doc/news/changes.h b/deal.II/doc/news/changes.h deleted file mode 100644 index 95078f4700..0000000000 --- a/deal.II/doc/news/changes.h +++ /dev/null @@ -1,72 +0,0 @@ -/** - * @page changes_after_6.1 Changes after Version 6.1 - -

    -This is the list of changes made after the release of -deal.II version 6.1. It is subdivided into changes -made to the three sub-libraries base, -lac, and deal.II, as well as -changes to the general infrastructure, -documentation, etc. -

    - -

    -All entries are signed with the names of the author. Regular -contributor's names are abbreviated by WB (Wolfgang Bangerth), GK -(Guido Kanschat), RH (Ralf Hartmann). -

    - - - -

    Incompatibilities

    - -

    -Following are a few modifications to the library that unfortunately -are incompatible with previous versions of the library, but which we -deem necessary for the future maintainability of the -library. Unfortunately, some of these changes will require -modifications to application programs. We apologize for the -inconvenience this causes. -

    - -
      - -
    - - - -

    General

    - -
      - -
    - - - - -

    base

    - -
      - -
    - - - - -

    lac

    - -
      - -
    - - - - -

    deal.II

    - -
      - -
    - - -*/ diff --git a/deal.II/examples/step-18/doc/intro.dox b/deal.II/examples/step-18/doc/intro.dox index 2e5e514061..6645112292 100644 --- a/deal.II/examples/step-18/doc/intro.dox +++ b/deal.II/examples/step-18/doc/intro.dox @@ -636,10 +636,7 @@ data for the cells it owned on the old mesh, and it may need to know the values of the quadrature point data on other cells if the corresponding cells on the new mesh are assigned to this process after subdividing the new mesh. A global communication of these data elements is therefore necessary, making the -entire process a little more unpleasant. The @ref step_28 "step-28" tutorial -program shows how to work with different meshes at the same time, albeit for a -different kind of problem, giving indications on how to approach the problem -for time-dependent adaptivity as well. +entire process a little more unpleasant.
    Ensuring mesh regularity
    At present, the program makes no attempt diff --git a/deal.II/examples/step-23/doc/intro.dox b/deal.II/examples/step-23/doc/intro.dox index e9d8f60598..2db5d9ec78 100644 --- a/deal.II/examples/step-23/doc/intro.dox +++ b/deal.II/examples/step-23/doc/intro.dox @@ -311,8 +311,7 @@ i.e. $\phi^n_i=\phi_i^{n-1}=\phi_i$. Consequently, we get $M^n=M^{n,n-1}=M$ and $A^n=A^{n,n-1}=A$. On the other hand, if we had used different shape functions, then we would have to compute integrals that contain shape functions defined on two meshes. This is a -somewhat messy process that we omit here, but that is treated in some -detail in @ref step_28 "step-28". +somewhat messy process that we omit here. Under these conditions (i.e. a mesh that doesn't change), one can optimize the solution procedure a bit by basically eliminating the solution of the second diff --git a/deal.II/lac/include/lac/block_sparsity_pattern.h b/deal.II/lac/include/lac/block_sparsity_pattern.h index bffe05cb12..821ab634c9 100644 --- a/deal.II/lac/include/lac/block_sparsity_pattern.h +++ b/deal.II/lac/include/lac/block_sparsity_pattern.h @@ -675,7 +675,7 @@ typedef BlockCompressedSparsityPattern CompressedBlockSparsityPattern; * BlockCompressedSetSparsityPattern) are interface-compatible it is * frequently worth checking which version is more efficient. * - * This class is used in @ref step_31 "step-31". + * This class is used in @ref step_22 "step-22". * * @author Wolfgang Bangerth, 2007 */ diff --git a/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h b/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h index 544b6ae0d5..7cbcccf0e4 100644 --- a/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h +++ b/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h @@ -51,8 +51,8 @@ template class SparseMatrix; * module. * * This class is an example of the "dynamic" type of @ref Sparsity. It - * is discussed in the @ref step_27 "step-27" and @ref step_31 - * "step-31" tutorial programs. + * is discussed in the @ref step_27 "step-27" and @ref step_22 + * "step-22" tutorial programs. * *

    Interface

    * @@ -89,8 +89,8 @@ template class SparseMatrix; * situations, but seems to work much better than the * CompressedSparsityPattern in the context of hp-adaptivity (see for * example @ref step_27 "step-27"), or generally when there are many - * nonzero entries in each row of a matrix (see @ref step_31 - * "step-31"). On the other hand, a benchmark where nonzero entries + * nonzero entries in each row of a matrix (see @ref step_22 + * "step-22"). On the other hand, a benchmark where nonzero entries * were randomly inserted into the sparsity pattern revealed that this * class is slower by a factor 4-6 in this situation. Hence, currently * the suggestion is to carefully analyze which of the diff --git a/deal.II/lac/include/lac/compressed_sparsity_pattern.h b/deal.II/lac/include/lac/compressed_sparsity_pattern.h index f40410e422..85b90b4ae7 100644 --- a/deal.II/lac/include/lac/compressed_sparsity_pattern.h +++ b/deal.II/lac/include/lac/compressed_sparsity_pattern.h @@ -83,7 +83,7 @@ template class SparseMatrix; * that appears to be more efficient in some situations, in particular * when using hp finite elements or, more generally, in cases with * many nonzero entries. See for example the @ref step_27 "step-27" - * and @ref step_31 "step-31" tutorial programs. + * and @ref step_22 "step-22" tutorial programs. * * @author Wolfgang Bangerth, 2001 */ -- 2.39.5