From: bangerth Date: Mon, 8 Jul 2013 13:55:30 +0000 (+0000) Subject: Fix a bunch of typos in comments, using the script from https://github.com/vlajos... X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=6c90536acbdb02d0c141d09256908bf41dcf4a79;p=dealii-svn.git Fix a bunch of typos in comments, using the script from https://github.com/vlajos/misspell_fixer . git-svn-id: https://svn.dealii.org/trunk@29952 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/doxygen/headers/exceptions.h b/deal.II/doc/doxygen/headers/exceptions.h index c39d08dd41..b6f5cf43b6 100644 --- a/deal.II/doc/doxygen/headers/exceptions.h +++ b/deal.II/doc/doxygen/headers/exceptions.h @@ -245,7 +245,7 @@ * do_something (); * } * catch (exception &e) { - * std::cerr << "Exception occured:" << std::endl + * std::cerr << "Exception occurred:" << std::endl * << e.what () * << std::endl; * do_something_to_reciver (); diff --git a/deal.II/include/deal.II/base/convergence_table.h b/deal.II/include/deal.II/base/convergence_table.h index a262a6be3b..e406a7f3ee 100644 --- a/deal.II/include/deal.II/base/convergence_table.h +++ b/deal.II/include/deal.II/base/convergence_table.h @@ -188,7 +188,7 @@ public: * omitted (see previous function) and execpt of the columns that are * previously evaluated rate columns. This function allows to evaluate the * convergence rate for almost all columns of a table without calling - * evaluate_convergence_rates() for each column seperately. + * evaluate_convergence_rates() for each column separately. * * Example: * Columns like n cells or n dofs columns may be wanted to diff --git a/deal.II/include/deal.II/base/exceptions.h b/deal.II/include/deal.II/base/exceptions.h index 59b93fd0ff..72c1a9ad9c 100644 --- a/deal.II/include/deal.II/base/exceptions.h +++ b/deal.II/include/deal.II/base/exceptions.h @@ -79,7 +79,7 @@ public: /** * Print more specific information about the exception which - * occured. Overload this function in your own exception classes. + * occurred. Overload this function in your own exception classes. */ virtual void print_info (std::ostream &out) const; @@ -148,7 +148,7 @@ namespace deal_II_exceptions * processes is redirected to the same console window. In this case, * it is convenient to set as additional name the name of the host on * which the program runs, so that one can see in which instance of the - * program the exception occured. + * program the exception occurred. * * The string pointed to by the argument is copied, so doesn't need to be * stored after the call to this function. diff --git a/deal.II/include/deal.II/base/quadrature_lib.h b/deal.II/include/deal.II/base/quadrature_lib.h index b152a99937..a2cb1611dc 100644 --- a/deal.II/include/deal.II/base/quadrature_lib.h +++ b/deal.II/include/deal.II/base/quadrature_lib.h @@ -295,7 +295,7 @@ public: * $[x_0,1]$, the actual location of the * singularity, the scale factor inside * the logarithmic function and a flag - * that decides wether the singularity is + * that decides whether the singularity is * left inside the quadrature formula or * it is factored out, to be included in * the integrand. @@ -334,7 +334,7 @@ protected: * original quadrature, and this process is repeated for the next half * element. * - * Upon construction it is possible to specify wether we want the + * Upon construction it is possible to specify whether we want the * singularity removed, or not. In other words, this quadrature can be * used to integrate $g(x) = 1/R\ f(x)$, or simply $f(x)$, with the $1/R$ * factor already included in the quadrature weights. diff --git a/deal.II/include/deal.II/dofs/dof_faces.h b/deal.II/include/deal.II/dofs/dof_faces.h index a9062e8bf9..a9fccc9a8b 100644 --- a/deal.II/include/deal.II/dofs/dof_faces.h +++ b/deal.II/include/deal.II/dofs/dof_faces.h @@ -42,7 +42,7 @@ namespace internal * the hierarchical structure of cells, which are organized in levels. In 2D we store * information on degrees of freedom located on lines whereas in 3D we store information on * degrees of freedom located on quads and lines. In 1D we do nothing, as the faces of - * lines are vertices which are treated seperately. + * lines are vertices which are treated separately. * * Apart from the DoFObjects object containing the data to store (degree of freedom * indices) we do not store any data or provide any functionality. However, we do implement @@ -72,7 +72,7 @@ namespace internal /** * Store the indices of degrees of freedom on faces in 1D. As these would be vertices, which - * are treted seperately, don't do anything. + * are treted separately, don't do anything. * * @author Tobias Leicht, 2006 */ diff --git a/deal.II/include/deal.II/dofs/dof_renumbering.h b/deal.II/include/deal.II/dofs/dof_renumbering.h index ae80171850..63896ca4f5 100644 --- a/deal.II/include/deal.II/dofs/dof_renumbering.h +++ b/deal.II/include/deal.II/dofs/dof_renumbering.h @@ -167,7 +167,7 @@ DEAL_II_NAMESPACE_OPEN * The component_wise() function allows not only to honor enumeration based on * vector components, but also allows to group together vector components into * "blocks" using a defaulted argument to the various DoFRenumber::component_wise() - * functinos (see @ref GlossComponent vs @ref GlossBlock for a description of + * functions (see @ref GlossComponent vs @ref GlossBlock for a description of * the difference). The blocks designated through this argument may, but do not * have to be, equal to the blocks that the finite element reports. For example, * a typical Stokes element would be diff --git a/deal.II/include/deal.II/dofs/dof_tools.h b/deal.II/include/deal.II/dofs/dof_tools.h index 1b0b49a0f3..f256fda570 100644 --- a/deal.II/include/deal.II/dofs/dof_tools.h +++ b/deal.II/include/deal.II/dofs/dof_tools.h @@ -1384,7 +1384,7 @@ namespace DoFTools /** * Do the same thing as the corresponding - * extract_dofs() functino for one level + * extract_dofs() function for one level * of a multi-grid DoF numbering. */ template @@ -1396,7 +1396,7 @@ namespace DoFTools /** * Do the same thing as the corresponding - * extract_dofs() functino for one level + * extract_dofs() function for one level * of a multi-grid DoF numbering. */ template diff --git a/deal.II/include/deal.II/fe/fe_tools.h b/deal.II/include/deal.II/fe/fe_tools.h index de51d2aa9b..694debccca 100644 --- a/deal.II/include/deal.II/fe/fe_tools.h +++ b/deal.II/include/deal.II/fe/fe_tools.h @@ -259,7 +259,7 @@ namespace FETools * For all possible (isotropic and anisotropic) refinement cases compute the * embedding matrices from a coarse cell to the child cells. Each column of * the resulting matrices contains the representation of a coarse grid basis - * functon by the fine grid basis; the matrices are split such that there is + * function by the fine grid basis; the matrices are split such that there is * one matrix for every child. * * This function computes the coarse grid function in a sufficiently large diff --git a/deal.II/include/deal.II/grid/grid_generator.h b/deal.II/include/deal.II/grid/grid_generator.h index 702bb1e01f..137b648218 100644 --- a/deal.II/include/deal.II/grid/grid_generator.h +++ b/deal.II/include/deal.II/grid/grid_generator.h @@ -607,7 +607,7 @@ public: * @arg @p L: extension in @p z-direction (only used in 3d) * @arg @p repetitions: number of subdivisions * along the @p z-direction - * @arg @p colorize: wether to assign different + * @arg @p colorize: whether to assign different * boundary indicators to different faces. * The colors are given in lexicographic * ordering for the flat faces (0 to 3 in 2d, diff --git a/deal.II/include/deal.II/grid/tria.h b/deal.II/include/deal.II/grid/tria.h index 40e8969705..5f1dfbf2c9 100644 --- a/deal.II/include/deal.II/grid/tria.h +++ b/deal.II/include/deal.II/grid/tria.h @@ -1455,7 +1455,7 @@ public: * RefinementListener. * * @note The use of this class has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -1470,7 +1470,7 @@ public: * class also has virtual functions. * * @note The use of this class has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -1486,7 +1486,7 @@ public: * registered with the triangulation. * * @note The use of this class has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -1504,7 +1504,7 @@ public: * registered with the triangulation. * * @note The use of this class has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -1529,7 +1529,7 @@ public: * derived classes. * * @note The use of this class has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -1552,7 +1552,7 @@ public: * implemented in derived classes. * * @note The use of this class has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -2203,7 +2203,7 @@ public: * the Triangulation is refined. * * @note The use of this function has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -2221,7 +2221,7 @@ public: * Triangulation. * * @note The use of this function has been - * superceded by the signals mechanism. + * superseded by the signals mechanism. * See the general documentation of the * Triangulation class for more information. * @@ -3201,7 +3201,7 @@ public: */ DeclException0 (ExcTriangulationNotEmpty); /** - * Trying to re-read a grid, an error occured. + * Trying to re-read a grid, an error occurred. * * @ingroup Exceptions */ @@ -3521,7 +3521,7 @@ private: * this contains nothing, in 2D it contains data * concerning lines and in 3D quads and lines. All of * these have no level and are therefore treated - * seperately. + * separately. */ dealii::internal::Triangulation::TriaFaces *faces; diff --git a/deal.II/include/deal.II/hp/dof_faces.h b/deal.II/include/deal.II/hp/dof_faces.h index 4896d69b1e..12e3cbfb41 100644 --- a/deal.II/include/deal.II/hp/dof_faces.h +++ b/deal.II/include/deal.II/hp/dof_faces.h @@ -43,7 +43,7 @@ namespace internal * independent of the hierarchical structure of cells, which are organized in levels. In 2D * we store information on degrees of freedom located on lines whereas in 3D we store * information on drefrees of freedom located on quads and lines. In 1D we do nothing, as - * the faces of lines are vertices which are treated seperately. + * the faces of lines are vertices which are treated separately. * * Apart from the internal::hp::DoFObjects object containing the data to store * (degree of freedom indices) and all the access-functionality to this data, we do not @@ -81,7 +81,7 @@ namespace internal /** * Store the indices of degrees of freedom on faces in 1D. As these would be vertices, which - * are treted seperately, don't do anything. + * are treted separately, don't do anything. * * @ingroup hp * @author Tobias Leicht, 2006 diff --git a/deal.II/include/deal.II/lac/vector_view.h b/deal.II/include/deal.II/lac/vector_view.h index 72fae49f8e..c9d26541fa 100644 --- a/deal.II/include/deal.II/lac/vector_view.h +++ b/deal.II/include/deal.II/lac/vector_view.h @@ -217,7 +217,7 @@ public: * view_of_long_vector(i), with i>0 might * cause an attempt to access invalid * areas of memory, or might function - * properly, depending on wether or not + * properly, depending on whether or not * the system was able to allocate some * memory consecutively after the * original allocation. diff --git a/deal.II/source/grid/grid_generator.cc b/deal.II/source/grid/grid_generator.cc index 34bcf1a71e..2081edd459 100644 --- a/deal.II/source/grid/grid_generator.cc +++ b/deal.II/source/grid/grid_generator.cc @@ -2589,7 +2589,7 @@ GridGenerator::cylinder (Triangulation<3> &tria, // respectively. note that we also // have to deal with those lines // that are purely in the interior - // of the ends. we determine wether + // of the ends. we determine whether // an edge is purely in the // interior if one of its vertices // is at coordinates '+-a' as set diff --git a/deal.II/source/grid/tria.cc b/deal.II/source/grid/tria.cc index f9a3901d7a..5e42db0c5e 100644 --- a/deal.II/source/grid/tria.cc +++ b/deal.II/source/grid/tria.cc @@ -2049,7 +2049,7 @@ namespace internal // first, we only collect the data // now - // the bool array stores, wether the lines + // the bool array stores, whether the lines // are in the standard orientation or not // note that QuadComparator is a @@ -2565,7 +2565,7 @@ namespace internal else { - // look wether it exists in + // look whether it exists in // reverse direction std::swap (line_vertices.first, line_vertices.second); if (needed_lines.find(line_vertices) != needed_lines.end()) @@ -2623,7 +2623,7 @@ namespace internal if (needed_lines.find(line_vertices) != needed_lines.end()) line[i] = needed_lines[line_vertices]; else - // look wether it exists + // look whether it exists // in reverse direction { std::swap (line_vertices.first, line_vertices.second); @@ -9329,7 +9329,7 @@ namespace internal /** * Helper function for - * @p fix_coarsen_flags. Return wether + * @p fix_coarsen_flags. Return whether * coarsening of this cell is allowed. * Coarsening can be forbidden if the * neighboring cells are or will be @@ -9386,7 +9386,7 @@ namespace internal // to the common neighbor cell, // not to its children. what we // really want to know in the - // following is, wether the + // following is, whether the // neighbor cell is refined twice // with reference to our cell. // that only has to be asked, if @@ -9744,7 +9744,7 @@ create_triangulation (const std::vector > &v, Its entries are indexes by the local indeces of the common face. For example if two elements share a face, and this face is face 0 for element 0 and face 1 for element 1, then - table(0,1) will tell wether the orientation are the same (true) or + table(0,1) will tell whether the orientation are the same (true) or opposite (false). Even though there may be a combinatorial/graph theory argument to get @@ -13617,7 +13617,7 @@ bool Triangulation::prepare_coarsening_and_refinement () // next global loop. when this // function terminates, the // requirement will be - // fullfilled. However, it might be + // fulfilled. However, it might be // faster to insert an inner loop // here. bool changed = true; diff --git a/deal.II/source/lac/slepc_solver.cc b/deal.II/source/lac/slepc_solver.cc index 2703bc964c..fff1aa9d8e 100644 --- a/deal.II/source/lac/slepc_solver.cc +++ b/deal.II/source/lac/slepc_solver.cc @@ -448,7 +448,7 @@ namespace SLEPcWrappers this->solver_control.max_steps()); AssertThrow (ierr == 0, ExcSLEPcError(ierr)); #else - // Supress compiler warnings about unused paameters. + // Suppress compiler warnings about unused parameters. (void) eps; // PETSc/SLEPc version must be > 3.1.0. @@ -481,7 +481,7 @@ namespace SLEPcWrappers this->solver_control.max_steps()); AssertThrow (ierr == 0, ExcSLEPcError(ierr)); #else - // Supress compiler warnings about unused paameters. + // Suppress compiler warnings about unused parameters. (void) eps; // PETSc/SLEPc version must be > 3.1.0. @@ -517,7 +517,7 @@ namespace SLEPcWrappers this->solver_control.max_steps()); AssertThrow (ierr == 0, ExcSLEPcError(ierr)); #else - // Supress compiler warnings about unused paameters. + // Suppress compiler warnings about unused parameters. (void) eps; Assert ((false),