documentation fixes (thanks felgru)

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

diff --git a/deal.II/examples/step-2/step-2.cc b/deal.II/examples/step-2/step-2.cc
index ead86f462bf9a4ca9f9e97ff891f4ba44087ab6e..8a24ffb6d4adb3ad4dcda9135c5620c329f06046 100644 (file)
--- a/deal.II/examples/step-2/step-2.cc
+++ b/deal.II/examples/step-2/step-2.cc
@@ -183,7 +183,7 @@ void make_grid (Triangulation<2> &triangulation)
                                  // lingo: we <code>distribute degrees of
                                  // freedom</code>). Note that the DoFHandler
                                  // object will store a reference to this
-                                 // finite element object, so we need have to
+                                 // finite element object, so we have to
                                  // make sure its lifetime is at least as long
                                  // as that of the <code>DoFHandler</code>; one way to
                                  // make sure this is so is to make it static

diff --git a/deal.II/examples/step-3/doc/intro.dox b/deal.II/examples/step-3/doc/intro.dox
index 8f9b71cfcfb41fb2b8e2b46d9a424c8d34db1b7f..bebeefdd28406d0d5cc796a734b0791035492281 100644 (file)
--- a/deal.II/examples/step-3/doc/intro.dox
+++ b/deal.II/examples/step-3/doc/intro.dox
@@ -195,7 +195,7 @@ particular information you need; if anything can be re-used from the previous
 cell, then it will do so, and there is a lot of code in that class to make
 sure things are cached wherever this is advantageous.
 
-The final piece of the this introduction is to mention that after a linear
+The final piece of this introduction is to mention that after a linear
 system is obtained, it is solved using an iterative solver and then
 postprocessed: we create an output file using the DataOut class that can then
 be visualized using one of the common visualization programs.

diff --git a/deal.II/examples/step-3/step-3.cc b/deal.II/examples/step-3/step-3.cc
index cfbfba6806e13bf7c6ef3d76ab669f0b0560cc65..1e9fa84ff980072cf1190daf1a28a43e07c1fda4 100644 (file)
--- a/deal.II/examples/step-3/step-3.cc
+++ b/deal.II/examples/step-3/step-3.cc
@@ -533,7 +533,7 @@ void Step3::assemble_system ()
       fe_values.reinit (cell);
 
                                        // Next, reset the local cell's
-                                       // contributions contributions to
+                                       // contributions to
                                        // global matrix and global right hand
                                        // side to zero, before we fill them:
       cell_matrix = 0;

diff --git a/deal.II/examples/step-4/step-4.cc b/deal.II/examples/step-4/step-4.cc
index aa8385c9551882952bc4465f21e70846cc4eb694..40bf96d41ce7a706be77c212c58aff3dd2b821f1 100644 (file)
--- a/deal.II/examples/step-4/step-4.cc
+++ b/deal.II/examples/step-4/step-4.cc
@@ -366,7 +366,7 @@ void Step4<dim>::setup_system ()
                                  // non-constant right hand side
                                  // function and non-zero boundary
                                  // values. Both are tasks that are
-                                 // readily achieved with a only a few
+                                 // readily achieved with only a few
                                  // new lines of code in the
                                  // assemblage of the matrix and right
                                  // hand side.