From: Daniel Arndt Date: Sun, 29 Jul 2018 17:17:22 +0000 (+0200) Subject: Fix various warnings X-Git-Tag: v9.1.0-rc1~870^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=53820e6eb80baaeeedae59b9243aa24bfedd90f2;p=dealii.git Fix various warnings --- 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 -#include +#include +#include // Then we also need interfaces for solvers and preconditioners that PETSc // provides: #include 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 #include #include -#include -#include +#include +#include #include #include #include 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 -#include +#include // 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 #include -#include -#include +#include +#include #include #include 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 &tria) -> double { double length = std::numeric_limits::max(); - for (const auto cell : tria.active_cell_iterators()) + for (const auto &cell : tria.active_cell_iterators()) for (unsigned int n = 0; n < GeometryInfo::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> face, const double radius) { + (void)center; + (void)radial_vertex_tolerance; (void)face; (void)radius; for (unsigned int vertex_n = 0;