Explain the sparsity pattern changes in step-22.

In particular, step-22 has used three different sparsity patterns at
different points.

diff --git a/examples/step-22/doc/intro.dox b/examples/step-22/doc/intro.dox
index 089e909414435324ea77603300c12951fdee65e3..ba836b21a8f76f4c524e5f07ae6f88c98765ef18 100644 (file)
--- a/examples/step-22/doc/intro.dox
+++ b/examples/step-22/doc/intro.dox
@@ -731,7 +731,8 @@ element at a time; however, its data structures are poorly adapted for the
 large numbers of nonzero entries per row created by our discretization in
 3d, leading to a quadratic behavior. Replacing the internal algorithms in
 deal.II to set many elements at a time, and using a
-BlockCompressedSimpleSparsityPattern as a better adapted data structure,
+BlockCompressedSimpleSparsityPattern (which has, as of early 2015, been in turn
+replaced by BlockDynamicSparsityPattern) as a better adapted data structure,
 removed this bottleneck at the price of a slightly higher memory
 consumption. Likewise, the implementation of the decomposition step in the
 SparseILU class was very inefficient and has been replaced by one that is