From: Bruno Turcksin Date: Sat, 18 Apr 2015 22:30:51 +0000 (-0500) Subject: Reindent step-17. X-Git-Tag: v8.3.0-rc1~246^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=ebfdb833ae13778393d33ea86ad6038cd5dac170;p=dealii.git Reindent step-17. --- diff --git a/examples/step-17/step-17.cc b/examples/step-17/step-17.cc index 6fc53cc4d8..986a8eea72 100644 --- a/examples/step-17/step-17.cc +++ b/examples/step-17/step-17.cc @@ -94,12 +94,12 @@ namespace Step17 // @sect3{The ElasticProblem class} - // Here comes the declaration of the main class. As mentioned in the - // introduction, almost all of this has been copied verbatim from step-8, - // so we only comment on the few differences between the two tutorials. - // There is one (cosmetic) change in that we let solve return - // a value, namely the number of iterations it took to converge, so that - // we can output this to the screen at the appropriate place. In addition, + // Here comes the declaration of the main class. As mentioned in the + // introduction, almost all of this has been copied verbatim from step-8, + // so we only comment on the few differences between the two tutorials. + // There is one (cosmetic) change in that we let solve return + // a value, namely the number of iterations it took to converge, so that + // we can output this to the screen at the appropriate place. In addition, // we introduce a stream-like variable // pcout, explained below: template @@ -178,7 +178,7 @@ namespace Step17 // @sec3{Right hand side values} - + // The following is taken from step-8 without change: template class RightHandSide : public Function @@ -244,7 +244,7 @@ namespace Step17 // @sect3{The ElasticProblem class implementation} - + // @sect4{ElasticProblem::ElasticProblem} // The first step in the actual implementation is the constructor @@ -637,7 +637,7 @@ namespace Step17 // @sect4{ElasticProblem::refine_grid} - // Using some kind of refinement indicator, the mesh can be refined. The problem + // Using some kind of refinement indicator, the mesh can be refined. The problem // is basically the same as with distributing hanging node constraints: in order to // compute the error indicator, we need access to all elements of the // solution vector. We then compute the indicators for the cells that belong