From 96042324777142681e31203d2ff2175fa5010d3e Mon Sep 17 00:00:00 2001
From: guido <guido@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Thu, 25 May 2000 16:50:06 +0000
Subject: [PATCH] missing declarations added

git-svn-id: https://svn.dealii.org/trunk@2945 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/base/include/base/function_lib.h           | 10 +++++-----
 deal.II/deal.II/include/numerics/error_estimator.h |  4 ++++
 deal.II/deal.II/include/numerics/matrices.h        |  3 +++
 deal.II/examples/step-5/step-5.cc                  |  6 +++---
 deal.II/examples/step-6/step-6.cc                  |  4 ++--
 deal.II/examples/step-8/step-8.cc                  |  4 ++--
 deal.II/lac/include/lac/precondition.h             |  4 ++++
 7 files changed, 23 insertions(+), 12 deletions(-)

diff --git a/deal.II/base/include/base/function_lib.h b/deal.II/base/include/base/function_lib.h
index 7e5941e80f..45b06be82d 100644
--- a/deal.II/base/include/base/function_lib.h
+++ b/deal.II/base/include/base/function_lib.h
@@ -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;
 };
 
 
diff --git a/deal.II/deal.II/include/numerics/error_estimator.h b/deal.II/deal.II/include/numerics/error_estimator.h
index b3bf3528b4..5afae24f58 100644
--- a/deal.II/deal.II/include/numerics/error_estimator.h
+++ b/deal.II/deal.II/include/numerics/error_estimator.h
@@ -21,6 +21,10 @@
 #include <map>
 
 
+template <int dim> class FEFaceValues;
+template <int dim> class FESubfaceValues;
+
+
 
 /**
  *  Implementation of the error estimator by Kelly, Gago, Zienkiewicz
diff --git a/deal.II/deal.II/include/numerics/matrices.h b/deal.II/deal.II/include/numerics/matrices.h
index 15bd54c875..c12b39d506 100644
--- a/deal.II/deal.II/include/numerics/matrices.h
+++ b/deal.II/deal.II/include/numerics/matrices.h
@@ -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;
 
diff --git a/deal.II/examples/step-5/step-5.cc b/deal.II/examples/step-5/step-5.cc
index ea47148a2e..326afd4e09 100644
--- a/deal.II/examples/step-5/step-5.cc
+++ b/deal.II/examples/step-5/step-5.cc
@@ -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)
     {
diff --git a/deal.II/examples/step-6/step-6.cc b/deal.II/examples/step-6/step-6.cc
index a3602dc148..a2ec11793b 100644
--- a/deal.II/examples/step-6/step-6.cc
+++ b/deal.II/examples/step-6/step-6.cc
@@ -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)
     {
diff --git a/deal.II/examples/step-8/step-8.cc b/deal.II/examples/step-8/step-8.cc
index 51f6741f93..bbd6d87c4c 100644
--- a/deal.II/examples/step-8/step-8.cc
+++ b/deal.II/examples/step-8/step-8.cc
@@ -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
diff --git a/deal.II/lac/include/lac/precondition.h b/deal.II/lac/include/lac/precondition.h
index 0c41b80e69..9b279680e0 100644
--- a/deal.II/lac/include/lac/precondition.h
+++ b/deal.II/lac/include/lac/precondition.h
@@ -15,6 +15,10 @@
 
 #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
-- 
2.39.5