From 8a7c2c08ed7b669eccffba691879c7d9cdc369ad Mon Sep 17 00:00:00 2001
From: wolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Mon, 27 Mar 2000 06:59:55 +0000
Subject: [PATCH] Clean up Rasched's changes.

git-svn-id: https://svn.dealii.org/trunk@2633 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/examples/step-3/step-3.cc | 18 +++++++++---------
 deal.II/examples/step-5/step-5.cc | 27 +++++++++++++++------------
 deal.II/examples/step-6/step-6.cc |  3 ++-
 3 files changed, 26 insertions(+), 22 deletions(-)

diff --git a/deal.II/examples/step-3/step-3.cc b/deal.II/examples/step-3/step-3.cc
index 9f30b5fb15..385f7c94f7 100644
--- a/deal.II/examples/step-3/step-3.cc
+++ b/deal.II/examples/step-3/step-3.cc
@@ -118,10 +118,9 @@ class LaplaceProblem
 				     // variables. There are variables
 				     // describing the triangulation
 				     // and the numbering of the
-				     // degrees of freedom...  The
-				     // FEQ<2> is the space which
-				     // has the following base
-				     // functions: {1,x,y,xy}
+				     // degrees of freedom...
+				     // (FEQ1<2> is the space with
+				     // shape functions {1,x,y,xy})
     Triangulation<2>     triangulation;
     FEQ1<2>              fe;
     DoFHandler<2>        dof_handler;
@@ -358,8 +357,8 @@ void LaplaceProblem::assemble_system ()
 				   // list them as well. The advantage
 				   // of this proceeding is that we
 				   // calculate only what we
-				   // need. This optimates the process
-				   // of solving:
+				   // need. This optimatizes the
+				   // process of solving:
   FEValues<2> fe_values (fe, quadrature_formula, 
 			 UpdateFlags(update_values    |
 				     update_gradients |
@@ -429,8 +428,9 @@ void LaplaceProblem::assemble_system ()
 				   // global matrix, we have to know
 				   // the global numbers of the
 				   // degrees of freedom. When we get
-				   // them, we need a scratch (temporal) array
-				   // for these numbers:
+				   // them, we need a scratch
+				   // (temporary) array for these
+				   // numbers:
   vector<unsigned int> local_dof_indices (dofs_per_cell);
 
 				   // Now for the loop over all
@@ -710,7 +710,7 @@ void LaplaceProblem::solve ()
 				   // PrimitiveVectorMemory class is
 				   // such a helper class which the
 				   // solver can ask for memory. The
-				   // angle brackets ``<>''indicate
+				   // angle brackets ``<>'' indicate
 				   // that this class really takes a
 				   // template parameter (here the
 				   // data type of the vectors we
diff --git a/deal.II/examples/step-5/step-5.cc b/deal.II/examples/step-5/step-5.cc
index a0aafa3c3d..ea47148a2e 100644
--- a/deal.II/examples/step-5/step-5.cc
+++ b/deal.II/examples/step-5/step-5.cc
@@ -300,7 +300,7 @@ void LaplaceProblem<dim>::setup_system ()
 				 // as the preconditions CG method),
 				 // assembling the matrix and right
 				 // hand side can take a comparable
-				 // time, and you should thing about
+				 // time, and you should think about
 				 // using one or two optimizations at
 				 // some places.
 				 //
@@ -787,10 +787,9 @@ void LaplaceProblem<dim>::run ()
 				       // triangulation object when we
 				       // ask it to read the
 				       // file). Then we open the
-				       // respective file and fill the
-				       // triangulation with it
-				       // because you like to work
-				       // with it:
+				       // respective file and
+				       // initialize the triangulation
+				       // with the data in the file:
       if (cycle == 0)
 	{
 	  GridIn<dim> grid_in;
@@ -851,15 +850,19 @@ void LaplaceProblem<dim>::run ()
 					   // of the ``UCD''-file is
 					   // ``inp''), as supported
 					   // by AVS Explorer, for
-					   // example:
-	  
+					   // example:	  
 	  grid_in.read_ucd (input_file);
+                                           // If you like to use
+                                           // another input format,
+                                           // you have to use an other
+                                           // ``grid_in.read_xxx''
+                                           // function. (See the
+                                           // documentation of the
+                                           // ``GridIn'' class to find
+                                           // out what input formats
+                                           // are presently
+                                           // supported.)
 
-                                           // If you like to use other
-                                           // input format, you have
-                                           // to use an other
-                                           // grid_in.read_``blabla''
-                                           // funktion.
 					   // The grid in the file
 					   // describes a
 					   // circle. Therefore we
diff --git a/deal.II/examples/step-6/step-6.cc b/deal.II/examples/step-6/step-6.cc
index acddb69ea6..a3602dc148 100644
--- a/deal.II/examples/step-6/step-6.cc
+++ b/deal.II/examples/step-6/step-6.cc
@@ -447,7 +447,8 @@ void LaplaceProblem<dim>::assemble_system ()
 				   // the number of degrees of freedom
 				   // per cell before: the following
 				   // value will be set to 9 (in 2D
-				   // because of Q2S) now, where it was
+				   // because of the biquadratic
+				   // element used) now, where it was
 				   // 4 before.
   const unsigned int   dofs_per_cell = fe.dofs_per_cell;
   const unsigned int   n_q_points    = quadrature_formula.n_quadrature_points;
-- 
2.39.5