From 2e81825021b045c0973fa9bb380a9913d2c6f861 Mon Sep 17 00:00:00 2001 From: Reza Rastak Date: Thu, 29 Aug 2019 10:09:29 -0400 Subject: [PATCH] Several typos in documentation of time_dependent.h fixed --- include/deal.II/numerics/time_dependent.h | 46 +++++++++++------------ 1 file changed, 23 insertions(+), 23 deletions(-) diff --git a/include/deal.II/numerics/time_dependent.h b/include/deal.II/numerics/time_dependent.h index 9fd42dded6..61c9a1289f 100644 --- a/include/deal.II/numerics/time_dependent.h +++ b/include/deal.II/numerics/time_dependent.h @@ -128,8 +128,8 @@ class Triangulation; * In order to facilitate these principles, the concept of waking up and * letting sleep a time step object was developed. Assume we have a time * stepping scheme which needs to look ahead one time step and needs the data - * of the last two time steps, the following pseudocode described what the - * centeral loop function of this class will do when we move from timestep @p + * of the last two time steps, the following pseudocode describes what the + * central loop function of this class will do when we move from timestep @p * n-1 to timestep @p n: * @verbatim * wake up timestep n+1 with signal 1 @@ -151,8 +151,8 @@ class Triangulation; * * In the example above, possible actions might be: timestep n+1 * rebuilds the computational grid (there is a specialized class which can do - * this for you); timestep @p n builds matrices sets solution vectors to the - * right size, maybe using an initial guess; then it does the computations; + * this for you); timestep @p n builds matrices and sets solution vectors to + * the right size, maybe using an initial guess; then it does the computations; * then it deletes the matrices since they are not needed by subsequent * timesteps; timestep @p n-1 deletes those data vectors which are only needed * by one timestep ahead; timestep @p n-2 deletes the remaining vectors and @@ -163,7 +163,7 @@ class Triangulation; * the following sequence of events: * @verbatim * wake up with signal 1 - * wake up signal 0 + * wake up with signal 0 * do computation * sleep with signal 0 * sleep with signal 1 @@ -176,7 +176,7 @@ class Triangulation; * look-behind (i.e. the maximum signal number to the @p sleep function) can * be chosen separately. For example, it is usually only needed to look one * time step behind when computing error estimation (in some cases, it may - * vene be possible to not look ahead or back at all, in which case only + * even be possible to not look ahead or back at all, in which case only * signals zero will be sent), while one needs a look back of at least one for * a timestepping method. * @@ -212,7 +212,7 @@ class Triangulation; * write_statistics (); * * end_sweep (); - * }; + * } * * * @@ -221,9 +221,9 @@ class Triangulation; * { * for (unsigned int sweep=0; sweep, which * is a class derived from TimeDependent. @p start_sweep, @p * solve_primal_problem, @p solve_dual_problem, @p postprocess and @p * end_sweep are functions inherited from this class. They all do a loop over @@ -242,11 +242,11 @@ class Triangulation; * { * timesteps[step]->set_timestep_no (step); * timesteps[step]->set_sweep_no (sweep_no); - * }; + * } * * for (unsigned int step=0; stepstart_sweep (); - * }; + * } * * * void @@ -258,7 +258,7 @@ class Triangulation; * std::placeholders::_1), * timestepping_data_primal, * forward); - * }; + * } * @endcode * The latter function shows rather clear how most of the loops are invoked * (@p solve_primal_problem, @p solve_dual_problem, @p postprocess, @p @@ -294,8 +294,8 @@ class Triangulation; * TimeDependent::TimeSteppingData (0,1), * TimeDependent::forward); * @endcode - * TimeStepBase_Wave::refine_grid is a function taking an argument, unlike all - * the other functions used above within the loops. However, in this special + * TimeStepBase_Wave::refine_grid is a function taking an argument, unlike + * all the other functions used above within the loops. However, in this special * case the parameter was the same for all timesteps and known before the loop * was started, so we fixed it and made a function object which to the outside * world does not take parameters. @@ -345,7 +345,7 @@ class Triangulation; * look_back<=timestepping_data.look_back; * ++look_back) * timesteps[step-look_back]->sleep(look_back); - * }; + * } * * // make the last few timesteps sleep * for (int step=n_timesteps; @@ -355,7 +355,7 @@ class Triangulation; * look_back<=timestepping_data.look_back; * ++look_back) * timesteps[step-look_back]->sleep(look_back); - * }; + * } * @endcode * * @@ -408,7 +408,7 @@ public: * scheme), this value will be one. * * The value of this number determines, how many time steps after having - * done computations on a tim level the time step manager will call the @p + * done computations on a time level the time step manager will call the @p * sleep function for each time step. */ const unsigned int look_back; @@ -473,7 +473,7 @@ public: * * This mechanism usually will result in a set-up loop like this * @code - * for (i=0; i