Remove a few unused variables.

git-svn-id: https://svn.dealii.org/trunk@21087 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/deal.II/include/numerics/theta_timestepping.templates.h b/deal.II/deal.II/include/numerics/theta_timestepping.templates.h
index 485fca03aed47540a9da0230e08e594d42033058..ae188ba68fc1bbef9d1ce8d86cd9b8c0ed4ad20f 100644 (file)
--- a/deal.II/deal.II/include/numerics/theta_timestepping.templates.h
+++ b/deal.II/deal.II/include/numerics/theta_timestepping.templates.h
@@ -69,7 +69,6 @@ namespace Algorithms
 
     control.restart();
 
-    bool first = true;
     d_explicit.time = control.now();
 
                                     // The data used to compute the

diff --git a/deal.II/deal.II/source/grid/grid_tools.cc b/deal.II/deal.II/source/grid/grid_tools.cc
index f4d50cd28175a7017b6f319d242f936f4fd832b7..d845d538cd68c9faa3794bf2b88858ba0a9dadad 100644 (file)
--- a/deal.II/deal.II/source/grid/grid_tools.cc
+++ b/deal.II/deal.II/source/grid/grid_tools.cc
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by the deal.II authors
+//    Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 by the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -1573,7 +1573,6 @@ namespace internal
                                             // sure we go at most
                                             // step_length into this
                                             // direction
-           const Point<spacedim> old_point = object_mid_point;
            object_mid_point -= std::min(2 * current_value / (gradient*gradient),
                                         step_length / gradient.norm()) *
                                gradient;

diff --git a/deal.II/deal.II/source/grid/tria.cc b/deal.II/deal.II/source/grid/tria.cc
index 225da640a26a25d392d740b7a05d94c4e25bae45..bd765a18e9c1e96555729f4c8c14c0c206f725fa 100644 (file)
--- a/deal.II/deal.II/source/grid/tria.cc
+++ b/deal.II/deal.II/source/grid/tria.cc
@@ -5227,8 +5227,7 @@ namespace internal
                  quad = triangulation.begin_quad(),
                  endq = triangulation.end_quad();
                typename Triangulation<dim,spacedim>::raw_line_iterator
-                 next_unused_line = triangulation.begin_raw_line (),
-                 endl = triangulation.end_line();
+                 next_unused_line = triangulation.begin_raw_line ();
                typename Triangulation<dim,spacedim>::raw_quad_iterator
                  next_unused_quad = triangulation.begin_raw_quad ();
 
@@ -6059,10 +6058,6 @@ namespace internal
                typename Triangulation<dim,spacedim>::active_hex_iterator
                  hex  = triangulation.begin_active_hex(level),
                  endh = triangulation.begin_active_hex(level+1);
-               typename Triangulation<dim,spacedim>::raw_line_iterator
-                 next_unused_line = triangulation.begin_raw_line ();
-               typename Triangulation<dim,spacedim>::raw_quad_iterator
-                 next_unused_quad = triangulation.begin_raw_quad ();
                typename Triangulation<dim,spacedim>::raw_hex_iterator
                  next_unused_hex  = triangulation.begin_raw_hex (level+1);
 

diff --git a/deal.II/deal.II/source/grid/tria_boundary.cc b/deal.II/deal.II/source/grid/tria_boundary.cc
index d9582af5071e518a4cbb8f20510f6500a0f9c453..f8809ce2317c39fc083526ebdcd662c10647ece2 100644 (file)
--- a/deal.II/deal.II/source/grid/tria_boundary.cc
+++ b/deal.II/deal.II/source/grid/tria_boundary.cc
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2008, 2009 by the deal.II authors
+//    Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2008, 2009, 2010 by the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -35,7 +35,7 @@ Boundary<dim, spacedim>::~Boundary ()
 template <int dim, int spacedim>
 Point<spacedim>
 Boundary<dim, spacedim>::
-get_new_point_on_quad (const typename Triangulation<dim, spacedim>::quad_iterator &) const 
+get_new_point_on_quad (const typename Triangulation<dim, spacedim>::quad_iterator &) const
 {
   Assert (false, ExcPureFunctionCalled());
   return Point<spacedim>();
@@ -80,7 +80,7 @@ get_new_point_on_face (const typename Triangulation<dim,spacedim>::face_iterator
       case 3:
            return get_new_point_on_quad (face);
     }
-  
+
   return Point<spacedim>();
 }
 
@@ -224,7 +224,7 @@ StraightBoundary<dim, spacedim>::StraightBoundary ()
 template <int dim, int spacedim>
 Point<spacedim>
 StraightBoundary<dim, spacedim>::
-get_new_point_on_line (const typename Triangulation<dim, spacedim>::line_iterator &line) const 
+get_new_point_on_line (const typename Triangulation<dim, spacedim>::line_iterator &line) const
 {
   return (line->vertex(0) + line->vertex(1)) / 2;
 }
@@ -315,7 +315,7 @@ namespace
 template <int dim, int spacedim>
 Point<spacedim>
 StraightBoundary<dim, spacedim>::
-get_new_point_on_quad (const typename Triangulation<dim, spacedim>::quad_iterator &) const 
+get_new_point_on_quad (const typename Triangulation<dim, spacedim>::quad_iterator &) const
 {
   Assert (false, ExcImpossibleInDim(dim));
   return Point<spacedim>();
@@ -325,7 +325,7 @@ get_new_point_on_quad (const typename Triangulation<dim, spacedim>::quad_iterato
 template <>
 Point<3>
 StraightBoundary<2,3>::
-get_new_point_on_quad (const Triangulation<2,3>::quad_iterator &quad) const 
+get_new_point_on_quad (const Triangulation<2,3>::quad_iterator &quad) const
 {
   return compute_new_point_on_quad<2> (quad);
 }
@@ -336,7 +336,7 @@ get_new_point_on_quad (const Triangulation<2,3>::quad_iterator &quad) const
 template <>
 Point<3>
 StraightBoundary<3>::
-get_new_point_on_quad (const Triangulation<3>::quad_iterator &quad) const 
+get_new_point_on_quad (const Triangulation<3>::quad_iterator &quad) const
 {
   return compute_new_point_on_quad<3> (quad);
 }
@@ -375,13 +375,13 @@ get_intermediate_points_on_line (const typename Triangulation<dim, spacedim>::li
 {
   const unsigned int n=points.size();
   Assert(n>0, ExcInternalError());
-  
+
   const double dx=1./(n+1);
   double x=dx;
 
   const Point<spacedim> vertices[2] = { line->vertex(0),
                                   line->vertex(1) };
-  
+
   for (unsigned int i=0; i<n; ++i, x+=dx)
     points[i] = (1-x)*vertices[0] + x*vertices[1];
 }
@@ -410,7 +410,7 @@ get_intermediate_points_on_quad (const Triangulation<3>::quad_iterator &quad,
                                 std::vector<Point<3> > &points) const
 {
   const unsigned int spacedim = 3;
-  
+
   const unsigned int n=points.size(),
                     m=static_cast<unsigned int>(std::sqrt(static_cast<double>(n)));
                                   // is n a square number
@@ -622,7 +622,7 @@ namespace internal
       x_k += object->vertex(i) *
             GeometryInfo<dim>::d_linear_shape_function (xi, i);
 
-    do 
+    do
       {
        Tensor<1,dim> F_k;
        for (unsigned int i=0; i<GeometryInfo<dim>::vertices_per_cell; ++i)
@@ -643,7 +643,6 @@ namespace internal
        const Point<dim> delta_xi = - invert(H_k) * F_k;
        xi += delta_xi;
 
-       Point<spacedim> old_xk = x_k;
        x_k = Point<spacedim>();
        for (unsigned int i=0; i<GeometryInfo<dim>::vertices_per_cell; ++i)
          x_k += object->vertex(i) *
@@ -653,7 +652,7 @@ namespace internal
          break;
       }
     while (true);
-    
+
     return x_k;
   }
 

diff --git a/deal.II/deal.II/source/numerics/point_value_history.cc b/deal.II/deal.II/source/numerics/point_value_history.cc
index d1b7c80d63d4ca64bb4177e6baa3b7a64cbe35a8..621f4f3179d3e68566a1e7b64f972857996e7d00 100644 (file)
--- a/deal.II/deal.II/source/numerics/point_value_history.cc
+++ b/deal.II/deal.II/source/numerics/point_value_history.cc
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 2009 by Michael Rapson and the deal.II authors
+//    Copyright (C) 2009, 2010 by Michael Rapson and the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -517,8 +517,6 @@ void PointValueHistory<dim>
       to_gnuplot << "# Data independent of mesh location\n";
 
                                       // write column headings
-      std::map <std::string, std::vector <std::vector <double> > >::iterator
-       data_store_begin = data_store.begin ();
       to_gnuplot << "# <Key> ";
 
       for (unsigned int component = 0; component < n_indep; component++)
@@ -530,8 +528,6 @@ void PointValueHistory<dim>
                                       // write general data stored
       for (unsigned int key = 0; key < dataset_key.size (); key++)
         {
-          std::map <std::string, std::vector <std::vector <double> > >::iterator
-           data_store_begin = data_store.begin ();
           to_gnuplot << dataset_key[key];
 
           for (unsigned int component = 0; component < n_indep; component++)

diff --git a/deal.II/lac/source/constraint_matrix.cc b/deal.II/lac/source/constraint_matrix.cc
index 8485b6ea160ca133b9d55500db4f4f14ebdcb809..741f41ee00eed7a11f5c205c3d16fe71ecf99a20 100644 (file)
--- a/deal.II/lac/source/constraint_matrix.cc
+++ b/deal.II/lac/source/constraint_matrix.cc
@@ -1218,7 +1218,6 @@ void ConstraintMatrix::condense (CompressedSetSparsityPattern &sparsity) const
              if (distribute[column] != numbers::invalid_unsigned_int)
                {
                  // row
-                 unsigned int old_rowlength = sparsity.row_length(row);
                  for (unsigned int q=0;
                       q!=lines[distribute[column]].entries.size();
                       ++q)