]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Various small updates.
authorwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Sun, 2 Jan 2000 20:35:49 +0000 (20:35 +0000)
committerwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Sun, 2 Jan 2000 20:35:49 +0000 (20:35 +0000)
git-svn-id: https://svn.dealii.org/trunk@2142 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/deal.II/Attic/examples/step-by-step/step-1/step-1.cc
deal.II/deal.II/Attic/examples/step-by-step/step-2/step-2.cc
deal.II/deal.II/Attic/examples/step-by-step/step-3/step-3.cc
deal.II/deal.II/Attic/examples/step-by-step/step-4/step-4.cc
deal.II/deal.II/Attic/examples/step-by-step/step-5/step-5.cc
deal.II/examples/step-1/step-1.cc
deal.II/examples/step-2/step-2.cc
deal.II/examples/step-3/step-3.cc
deal.II/examples/step-4/step-4.cc
deal.II/examples/step-5/step-5.cc

index cff1bb3f709c243c27112376522ba29fe766a022..f2487effbefd861b37594f0c376b0cfe5f3e0e6c 100644 (file)
@@ -1,6 +1,9 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
-                                 // Needed for the Triangulation class:
+                                 // The most fundamental class in the
+                                 // library is the ``Triangulation''
+                                 // class, which is declared here:
 #include <grid/tria.h>
                                  // We need the following two includes
                                  // for loops over cells and/or faces:
@@ -40,7 +43,7 @@ void first_grid ()
                                    // dimensions. Likewise, there are
                                    // version working in one ("<1>")
                                    // and three ("<3>") space
-                                   // dimension, or for all
+                                   // dimensions, or for all
                                    // dimensions. We will see such
                                    // constructs in later examples,
                                    // where we show how to program
index b8045ea8772a8e11f76dd46da114f8860b16eb4d..e39eda858bcfbf9aedab78eadf789ae0b8ab24c6 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // The following includes are just
                                 // like for the previous program, so
index 407191cc88899d21bca9a91214b3f55d586ccc7b..6a2c095c2af5dfeb8baab41bc124329588651ee8 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // These include files are already
                                 // known to you. They declare the
@@ -111,7 +112,7 @@ class LaplaceProblem
     void make_grid_and_dofs ();
     void assemble_system ();
     void solve ();
-    void output_results ();
+    void output_results () const;
 
                                     // And then we have the member
                                     // variables. There are variables
@@ -732,7 +733,7 @@ void LaplaceProblem::solve ()
                                 // have no such postprocessing here,
                                 // but we would like to write the
                                 // solution to a file.
-void LaplaceProblem::output_results () 
+void LaplaceProblem::output_results () const
 {
                                   // To write the output to a file,
                                   // we need an object which knows
index 5c95b88071e7c923f2a92906a14ef4bd1cc42470..73967fb1e55f0151ab326a30a8fc24f68acca45e 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // The first few (many?) include
                                 // files have already been used in
@@ -68,7 +69,7 @@ class LaplaceProblem
     void make_grid_and_dofs ();
     void assemble_system ();
     void solve ();
-    void output_results ();
+    void output_results () const;
 
     Triangulation<dim>   triangulation;
     FEQ1<dim>            fe;
@@ -490,7 +491,7 @@ void LaplaceProblem<dim>::solve ()
                                 // example. No changes here for
                                 // dimension independentce either.
 template <int dim>
-void LaplaceProblem<dim>::output_results () 
+void LaplaceProblem<dim>::output_results () const
 {
   DataOut<dim> data_out;
 
index 8e0beba015e888dcf9a2ffbd3f87040fc80bba59..aa67eff4fcb05c90706910c2d408c58545b2a2b1 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // Again, the first few include files
                                 // are already known, so we won't
@@ -66,7 +67,7 @@ class LaplaceProblem
     void setup_system ();
     void assemble_system ();
     void solve ();
-    void output_results (const unsigned int cycle);
+    void output_results (const unsigned int cycle) const;
 
     Triangulation<dim>   triangulation;
     FEQ1<dim>            fe;
@@ -635,7 +636,7 @@ void LaplaceProblem<dim>::solve ()
                                 // filename for each refinement
                                 // cycle.
 template <int dim>
-void LaplaceProblem<dim>::output_results (const unsigned int cycle)
+void LaplaceProblem<dim>::output_results (const unsigned int cycle) const
 {
   DataOut<dim> data_out;
 
index cff1bb3f709c243c27112376522ba29fe766a022..f2487effbefd861b37594f0c376b0cfe5f3e0e6c 100644 (file)
@@ -1,6 +1,9 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
-                                 // Needed for the Triangulation class:
+                                 // The most fundamental class in the
+                                 // library is the ``Triangulation''
+                                 // class, which is declared here:
 #include <grid/tria.h>
                                  // We need the following two includes
                                  // for loops over cells and/or faces:
@@ -40,7 +43,7 @@ void first_grid ()
                                    // dimensions. Likewise, there are
                                    // version working in one ("<1>")
                                    // and three ("<3>") space
-                                   // dimension, or for all
+                                   // dimensions, or for all
                                    // dimensions. We will see such
                                    // constructs in later examples,
                                    // where we show how to program
index b8045ea8772a8e11f76dd46da114f8860b16eb4d..e39eda858bcfbf9aedab78eadf789ae0b8ab24c6 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // The following includes are just
                                 // like for the previous program, so
index 407191cc88899d21bca9a91214b3f55d586ccc7b..6a2c095c2af5dfeb8baab41bc124329588651ee8 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // These include files are already
                                 // known to you. They declare the
@@ -111,7 +112,7 @@ class LaplaceProblem
     void make_grid_and_dofs ();
     void assemble_system ();
     void solve ();
-    void output_results ();
+    void output_results () const;
 
                                     // And then we have the member
                                     // variables. There are variables
@@ -732,7 +733,7 @@ void LaplaceProblem::solve ()
                                 // have no such postprocessing here,
                                 // but we would like to write the
                                 // solution to a file.
-void LaplaceProblem::output_results () 
+void LaplaceProblem::output_results () const
 {
                                   // To write the output to a file,
                                   // we need an object which knows
index 5c95b88071e7c923f2a92906a14ef4bd1cc42470..73967fb1e55f0151ab326a30a8fc24f68acca45e 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // The first few (many?) include
                                 // files have already been used in
@@ -68,7 +69,7 @@ class LaplaceProblem
     void make_grid_and_dofs ();
     void assemble_system ();
     void solve ();
-    void output_results ();
+    void output_results () const;
 
     Triangulation<dim>   triangulation;
     FEQ1<dim>            fe;
@@ -490,7 +491,7 @@ void LaplaceProblem<dim>::solve ()
                                 // example. No changes here for
                                 // dimension independentce either.
 template <int dim>
-void LaplaceProblem<dim>::output_results () 
+void LaplaceProblem<dim>::output_results () const
 {
   DataOut<dim> data_out;
 
index 8e0beba015e888dcf9a2ffbd3f87040fc80bba59..aa67eff4fcb05c90706910c2d408c58545b2a2b1 100644 (file)
@@ -1,4 +1,5 @@
 /* $Id$ */
+/* Author: Wolfgang Bangerth, University of Heidelberg, 1999 */
 
                                 // Again, the first few include files
                                 // are already known, so we won't
@@ -66,7 +67,7 @@ class LaplaceProblem
     void setup_system ();
     void assemble_system ();
     void solve ();
-    void output_results (const unsigned int cycle);
+    void output_results (const unsigned int cycle) const;
 
     Triangulation<dim>   triangulation;
     FEQ1<dim>            fe;
@@ -635,7 +636,7 @@ void LaplaceProblem<dim>::solve ()
                                 // filename for each refinement
                                 // cycle.
 template <int dim>
-void LaplaceProblem<dim>::output_results (const unsigned int cycle)
+void LaplaceProblem<dim>::output_results (const unsigned int cycle) const
 {
   DataOut<dim> data_out;
 

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.