From 53820e6eb80baaeeedae59b9243aa24bfedd90f2 Mon Sep 17 00:00:00 2001
From: Daniel Arndt <daniel.arndt@iwr.uni-heidelberg.de>
Date: Sun, 29 Jul 2018 19:17:22 +0200
Subject: [PATCH] Fix various warnings

---
 examples/step-17/step-17.cc   | 4 ++--
 examples/step-18/step-18.cc   | 4 ++--
 examples/step-36/step-36.cc   | 2 +-
 examples/step-55/step-55.cc   | 4 ++--
 source/grid/grid_generator.cc | 4 +++-
 5 files changed, 10 insertions(+), 8 deletions(-)

diff --git a/examples/step-17/step-17.cc b/examples/step-17/step-17.cc
index 62a4ddf519..e2caf3a2f8 100644
--- a/examples/step-17/step-17.cc
+++ b/examples/step-17/step-17.cc
@@ -68,8 +68,8 @@
 // simply map to sequential, local vectors and matrices if there is only a
 // single process, i.e. if you are running on only one machine, and without
 // MPI support):
-#include <deal.II/lac/petsc_parallel_vector.h>
-#include <deal.II/lac/petsc_parallel_sparse_matrix.h>
+#include <deal.II/lac/petsc_vector.h>
+#include <deal.II/lac/petsc_sparse_matrix.h>
 // Then we also need interfaces for solvers and preconditioners that PETSc
 // provides:
 #include <deal.II/lac/petsc_solver.h>
diff --git a/examples/step-18/step-18.cc b/examples/step-18/step-18.cc
index 176f46b8c1..5796801b57 100644
--- a/examples/step-18/step-18.cc
+++ b/examples/step-18/step-18.cc
@@ -30,8 +30,8 @@
 #include <deal.II/lac/vector.h>
 #include <deal.II/lac/full_matrix.h>
 #include <deal.II/lac/dynamic_sparsity_pattern.h>
-#include <deal.II/lac/petsc_parallel_vector.h>
-#include <deal.II/lac/petsc_parallel_sparse_matrix.h>
+#include <deal.II/lac/petsc_vector.h>
+#include <deal.II/lac/petsc_sparse_matrix.h>
 #include <deal.II/lac/petsc_solver.h>
 #include <deal.II/lac/petsc_precondition.h>
 #include <deal.II/lac/affine_constraints.h>
diff --git a/examples/step-36/step-36.cc b/examples/step-36/step-36.cc
index d44c112908..fe6e593e15 100644
--- a/examples/step-36/step-36.cc
+++ b/examples/step-36/step-36.cc
@@ -50,7 +50,7 @@
 
 // PETSc appears here because SLEPc depends on this library:
 #include <deal.II/lac/petsc_sparse_matrix.h>
-#include <deal.II/lac/petsc_parallel_vector.h>
+#include <deal.II/lac/petsc_vector.h>
 
 // And then we need to actually import the interfaces for solvers that SLEPc
 // provides:
diff --git a/examples/step-55/step-55.cc b/examples/step-55/step-55.cc
index e417e727e5..92bfdf7747 100644
--- a/examples/step-55/step-55.cc
+++ b/examples/step-55/step-55.cc
@@ -49,8 +49,8 @@ namespace LA
 #include <deal.II/lac/affine_constraints.h>
 #include <deal.II/lac/dynamic_sparsity_pattern.h>
 
-#include <deal.II/lac/petsc_parallel_sparse_matrix.h>
-#include <deal.II/lac/petsc_parallel_vector.h>
+#include <deal.II/lac/petsc_sparse_matrix.h>
+#include <deal.II/lac/petsc_vector.h>
 #include <deal.II/lac/petsc_solver.h>
 #include <deal.II/lac/petsc_precondition.h>
 
diff --git a/source/grid/grid_generator.cc b/source/grid/grid_generator.cc
index a05207881c..e868b93980 100644
--- a/source/grid/grid_generator.cc
+++ b/source/grid/grid_generator.cc
@@ -4738,7 +4738,7 @@ namespace GridGenerator
 
     auto min_line_length = [](const Triangulation<dim> &tria) -> double {
       double length = std::numeric_limits<double>::max();
-      for (const auto cell : tria.active_cell_iterators())
+      for (const auto &cell : tria.active_cell_iterators())
         for (unsigned int n = 0; n < GeometryInfo<dim>::lines_per_cell; ++n)
           length = std::min(length, cell->line(n)->diameter());
       return length;
@@ -4783,6 +4783,8 @@ namespace GridGenerator
       [center, radial_vertex_tolerance](
         const TriaIterator<TriaAccessor<dim - 1, dim, dim>> face,
         const double                                        radius) {
+        (void)center;
+        (void)radial_vertex_tolerance;
         (void)face;
         (void)radius;
         for (unsigned int vertex_n = 0;
-- 
2.39.5