]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
missing declarations added
authorguido <guido@0785d39b-7218-0410-832d-ea1e28bc413d>
Thu, 25 May 2000 16:50:06 +0000 (16:50 +0000)
committerguido <guido@0785d39b-7218-0410-832d-ea1e28bc413d>
Thu, 25 May 2000 16:50:06 +0000 (16:50 +0000)
git-svn-id: https://svn.dealii.org/trunk@2945 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/base/include/base/function_lib.h
deal.II/deal.II/include/numerics/error_estimator.h
deal.II/deal.II/include/numerics/matrices.h
deal.II/examples/step-5/step-5.cc
deal.II/examples/step-6/step-6.cc
deal.II/examples/step-8/step-8.cc
deal.II/lac/include/lac/precondition.h

index 7e5941e80fb92738820d1707141fa70f1606533c..45b06be82d31fc1287a5e442d9c67fdfaa7f0501 100644 (file)
@@ -62,15 +62,15 @@ class PillowFunction : public Function<dim>
                                     /**
                                      * Laplacian at a single point.
                                      */
-    double laplacian(const Point<dim>   &p,
-                    const unsigned int  component = 0) const;
+    double laplacian (const Point<dim>   &p,
+                     const unsigned int  component = 0) const;
 
                                     /**
                                      * Laplacian at multiple points.
                                      */
-    void laplacian_list(const vector<Point<dim> > &points,
-                       vector<double>            &values,
-                       const unsigned int         component = 0) const;
+    void laplacian_list (const vector<Point<dim> > &points,
+                        vector<double>            &values,
+                        const unsigned int         component = 0) const;
 };
 
 
index b3bf3528b4b7bbe7e161824a64514472e343cf1f..5afae24f58c3c06fb9467e13f81c87239402b263 100644 (file)
 #include <map>
 
 
+template <int dim> class FEFaceValues;
+template <int dim> class FESubfaceValues;
+
+
 
 /**
  *  Implementation of the error estimator by Kelly, Gago, Zienkiewicz
index 15bd54c8757caaa2f23afc390a2ac908022531f5..c12b39d506146884cd7f6f66fb69bcbadbeee7a7 100644 (file)
@@ -25,6 +25,9 @@ template<typename number> class SparseMatrix;
 
 template <typename number, int rows, int columns  >  class BlockSparseMatrix;
 template <int n_blocks, typename Number> class BlockVector;
+
+template <int dim> class DoFHandler;
+template <int dim> class MGDoFHandler;
 template <int dim> class FEValues;
 template <int dim> class Equation;
 
index ea47148a2e06d4928781dab3bb064f4c919c91cd..326afd4e09224d42af07a1db20eeeaf05b2fd34a 100644 (file)
@@ -198,12 +198,12 @@ void Coefficient<dim>::value_list (const vector<Point<dim> > &points,
                                   // classes derived from
                                   // ``Function'', that class
                                   // declares an exception
-                                  // ``ExcVectorHasWrongSize'' which
+                                  // ``ExcDimensionMismatch'' which
                                   // takes the sizes of two vectors
                                   // and prints some output in case
                                   // the condition is violated:
   Assert (values.size() == n_points, 
-         ExcVectorHasWrongSize (values.size(), n_points));
+         ExcDimensionMismatch (values.size(), n_points));
                                   // Since examples are not very good
                                   // if they do not demonstrate their
                                   // point, we will show how to
@@ -242,7 +242,7 @@ void Coefficient<dim>::value_list (const vector<Point<dim> > &points,
                                   // components that this function
                                   // has.)
   Assert (component == 0, 
-         ExcWrongComponent (component, 1));
+         ExcIndexRange (component, 0, 1));
   
   for (unsigned int i=0; i<n_points; ++i)
     {
index a3602dc148af8d859cd97691bf548857a4db7b09..a2ec11793b22b053c59c123bf50404f3e04b4c9c 100644 (file)
@@ -163,10 +163,10 @@ void Coefficient<dim>::value_list (const vector<Point<dim> > &points,
   const unsigned int n_points = points.size();
 
   Assert (values.size() == n_points, 
-         ExcVectorHasWrongSize (values.size(), n_points));
+         ExcDimensionMismatch (values.size(), n_points));
   
   Assert (component == 0, 
-         ExcWrongComponent (component, 1));
+         ExcIndexRange (component, 0, 1));
   
   for (unsigned int i=0; i<n_points; ++i)
     {
index 51f6741f93922f245e32d2a66d82d1079879befa..bbd6d87c4c7e525e5631d2cdc0a030a94ba6cbc0 100644 (file)
@@ -180,7 +180,7 @@ void RightHandSide<dim>::vector_value (const Point<dim> &p,
                                   // for this case and otherwise
                                   // throw an exception:
   Assert (values.size() == dim, 
-         ExcVectorHasWrongSize (values.size(), dim));
+         ExcDimensionMismatch (values.size(), dim));
                                   // Likewise, if by some accident
                                   // someone tried to compile and run
                                   // the program in only one space
@@ -248,7 +248,7 @@ void RightHandSide<dim>::vector_value_list (const vector<Point<dim> > &points,
                                   // correctly, i.e. to the number of
                                   // input points:
   Assert (value_list.size() == n_points, 
-         ExcVectorHasWrongSize (value_list.size(), n_points));
+         ExcDimensionMismatch (value_list.size(), n_points));
 
                                   // Finally we treat each of the
                                   // points. In one of the previous
index 0c41b80e693554b615e3227f787b20e4025721c4..9b279680e02845fb206e43fc65ebe23bca9c1cb9 100644 (file)
 
 #include <lac/vector_memory.h>
 
+template <typename number> class Vector;
+template <typename number> class SparseMatrix;
+
+
 /**
  * No preconditioning.
  * This class helps you, if you want to use a linear solver without

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.