From d7a05ca46cec67960276ed25584e63bd28cd1b4f Mon Sep 17 00:00:00 2001
From: Wolfgang Bangerth <bangerth@math.tamu.edu>
Date: Tue, 25 Mar 2008 16:17:03 +0000
Subject: [PATCH] Only run tests on the first cell, to reduce output from the
 many megabytes we currently have.

git-svn-id: https://svn.dealii.org/trunk@15934 0785d39b-7218-0410-832d-ea1e28bc413d
---
 tests/deal.II/fe_values_view_01.cc |  66 +++++++++----------
 tests/deal.II/fe_values_view_02.cc | 102 ++++++++++++++---------------
 2 files changed, 80 insertions(+), 88 deletions(-)

diff --git a/tests/deal.II/fe_values_view_01.cc b/tests/deal.II/fe_values_view_01.cc
index d27c97acdf..e5c5a7dcdd 100644
--- a/tests/deal.II/fe_values_view_01.cc
+++ b/tests/deal.II/fe_values_view_01.cc
@@ -46,42 +46,38 @@ void test (const Triangulation<dim>& tr,
   const QGauss<dim> quadrature(2);
   FEValues<dim> fe_values (fe, quadrature,
 			   update_values | update_gradients | update_hessians);
-  for (typename DoFHandler<dim>::active_cell_iterator
-	 cell = dof.begin_active(); cell != dof.end(); ++cell)
-    {
-      fe_values.reinit (cell);
+  fe_values.reinit (dof.begin_active());
   
-      for (unsigned int c=0; c<fe.n_components(); ++c)
-	{
-	  FEValuesExtractors::Scalar single_component (c);
-
-	  for (unsigned int i=0; i<fe_values.dofs_per_cell; ++i)
-	    for (unsigned int q=0; q<fe_values.n_quadrature_points; ++q)
-	      {
-		deallog << "i=" << i << ", q=" << q << std::endl;
-		deallog << "   "
-			<< fe_values[single_component].value (i,q) << ' '
-			<< fe_values[single_component].gradient (i,q) << std::endl;
-		for (unsigned int k=0; k<dim; ++k)
-		  for (unsigned int l=0; l<dim; ++l)
-		    deallog << fe_values[single_component].hessian (i,q)[k][l] << std::endl;
-
-		Assert (fe_values[single_component].value (i,q)
-			==
-			fe_values.shape_value_component (i,q,c),
-			ExcInternalError());
-
-		Assert (fe_values[single_component].gradient (i,q)
-			==
-			fe_values.shape_grad_component (i,q,c),
-			ExcInternalError());
-
-		Assert (fe_values[single_component].hessian (i,q)
-			==
-			fe_values.shape_hessian_component (i,q,c),
-			ExcInternalError());
-	      }
-	}
+  for (unsigned int c=0; c<fe.n_components(); ++c)
+    {
+      FEValuesExtractors::Scalar single_component (c);
+
+      for (unsigned int i=0; i<fe_values.dofs_per_cell; ++i)
+	for (unsigned int q=0; q<fe_values.n_quadrature_points; ++q)
+	  {
+	    deallog << "i=" << i << ", q=" << q << std::endl;
+	    deallog << "   "
+		    << fe_values[single_component].value (i,q) << ' '
+		    << fe_values[single_component].gradient (i,q) << std::endl;
+	    for (unsigned int k=0; k<dim; ++k)
+	      for (unsigned int l=0; l<dim; ++l)
+		deallog << fe_values[single_component].hessian (i,q)[k][l] << std::endl;
+
+	    Assert (fe_values[single_component].value (i,q)
+		    ==
+		    fe_values.shape_value_component (i,q,c),
+		    ExcInternalError());
+
+	    Assert (fe_values[single_component].gradient (i,q)
+		    ==
+		    fe_values.shape_grad_component (i,q,c),
+		    ExcInternalError());
+
+	    Assert (fe_values[single_component].hessian (i,q)
+		    ==
+		    fe_values.shape_hessian_component (i,q,c),
+		    ExcInternalError());
+	  }
     }
 }
 
diff --git a/tests/deal.II/fe_values_view_02.cc b/tests/deal.II/fe_values_view_02.cc
index a7d48f646a..3c7c18ca96 100644
--- a/tests/deal.II/fe_values_view_02.cc
+++ b/tests/deal.II/fe_values_view_02.cc
@@ -46,65 +46,61 @@ void test (const Triangulation<dim>& tr,
   const QGauss<dim> quadrature(2);
   FEValues<dim> fe_values (fe, quadrature,
 			   update_values | update_gradients | update_hessians);
-  for (typename DoFHandler<dim>::active_cell_iterator
-	 cell = dof.begin_active(); cell != dof.end(); ++cell)
-    {
-      fe_values.reinit (cell);
+  fe_values.reinit (dof.begin_active());
   
-      for (unsigned int c=0; c<fe.n_components(); ++c)
-					 // use a vector extractor if there
-					 // are sufficiently many components
-					 // left after the current component
-					 // 'c'
-	if (c+dim <= fe.n_components())
-	  {
-	    FEValuesExtractors::Vector vec_components (c);
-
-	    for (unsigned int i=0; i<fe_values.dofs_per_cell; ++i)
-	      for (unsigned int q=0; q<fe_values.n_quadrature_points; ++q)
-		{
-		  deallog << "i=" << i << ", q=" << q << std::endl;
-		  deallog << "   "
-			  << fe_values[vec_components].value (i,q) << ' '
-			  << fe_values[vec_components].gradient (i,q) << ' '
-			  << fe_values[vec_components].divergence (i,q) << ' '
-			  << fe_values[vec_components].symmetric_gradient (i,q) << std::endl;
-		  for (unsigned int k=0; k<dim; ++k)
-		    for (unsigned int l=0; l<dim; ++l)
-		      deallog << fe_values[vec_components].hessian (i,q)[k][l]
-			      << std::endl;
+  for (unsigned int c=0; c<fe.n_components(); ++c)
+				     // use a vector extractor if there
+				     // are sufficiently many components
+				     // left after the current component
+				     // 'c'
+    if (c+dim <= fe.n_components())
+      {
+	FEValuesExtractors::Vector vec_components (c);
+
+	for (unsigned int i=0; i<fe_values.dofs_per_cell; ++i)
+	  for (unsigned int q=0; q<fe_values.n_quadrature_points; ++q)
+	    {
+	      deallog << "i=" << i << ", q=" << q << std::endl;
+	      deallog << "   "
+		      << fe_values[vec_components].value (i,q) << ' '
+		      << fe_values[vec_components].gradient (i,q) << ' '
+		      << fe_values[vec_components].divergence (i,q) << ' '
+		      << fe_values[vec_components].symmetric_gradient (i,q) << std::endl;
+	      for (unsigned int k=0; k<dim; ++k)
+		for (unsigned int l=0; l<dim; ++l)
+		  deallog << fe_values[vec_components].hessian (i,q)[k][l]
+			  << std::endl;
 		  
-		  for (unsigned int d=0; d<dim; ++d)
-		    {
-		      Assert (fe_values[vec_components].value (i,q)[d]
-			      ==
-			      fe_values.shape_value_component (i,q,c+d),
-			      ExcInternalError());
-
-		      Assert (fe_values[vec_components].gradient (i,q)[d]
-			      ==
-			      fe_values.shape_grad_component (i,q,c+d),
-			      ExcInternalError());
-
-		      Assert (fe_values[vec_components].symmetric_gradient (i,q)
-			      ==
-			      (fe_values[vec_components].gradient(i,q) +
-			       transpose(fe_values[vec_components].gradient(i,q)))/2,
-			      ExcInternalError());
-		      
-		      Assert (fe_values[vec_components].hessian (i,q)[d]
-			      ==
-			      fe_values.shape_hessian_component (i,q,c+d),
-			      ExcInternalError());
-		    }
+	      for (unsigned int d=0; d<dim; ++d)
+		{
+		  Assert (fe_values[vec_components].value (i,q)[d]
+			  ==
+			  fe_values.shape_value_component (i,q,c+d),
+			  ExcInternalError());
+
+		  Assert (fe_values[vec_components].gradient (i,q)[d]
+			  ==
+			  fe_values.shape_grad_component (i,q,c+d),
+			  ExcInternalError());
 
-		  Assert (fe_values[vec_components].divergence (i,q)
+		  Assert (fe_values[vec_components].symmetric_gradient (i,q)
+			  ==
+			  (fe_values[vec_components].gradient(i,q) +
+			   transpose(fe_values[vec_components].gradient(i,q)))/2,
+			  ExcInternalError());
+		      
+		  Assert (fe_values[vec_components].hessian (i,q)[d]
 			  ==
-			  trace (fe_values[vec_components].gradient (i,q)),
+			  fe_values.shape_hessian_component (i,q,c+d),
 			  ExcInternalError());
 		}
-	  }
-    }
+
+	      Assert (fe_values[vec_components].divergence (i,q)
+		      ==
+		      trace (fe_values[vec_components].gradient (i,q)),
+		      ExcInternalError());
+	    }
+      }
 }
 
 
-- 
2.39.5