From: wolf Date: Thu, 21 Feb 2002 14:34:58 +0000 (+0000) Subject: Fix typos. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=3a559843b9d838cc96733fc8d9e8f7e80d1b1993;p=dealii-svn.git Fix typos. git-svn-id: https://svn.dealii.org/trunk@5530 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/deal.II/include/fe/fe_base.h b/deal.II/deal.II/include/fe/fe_base.h index 94a667d179..c5126fe153 100644 --- a/deal.II/deal.II/include/fe/fe_base.h +++ b/deal.II/deal.II/include/fe/fe_base.h @@ -95,7 +95,7 @@ class FiniteElementData * face. This information is * redundant to some fields in the * derived classes but makes - * writing dimension independant + * writing dimension independent * programs easier. */ const unsigned int dofs_per_face; @@ -105,7 +105,7 @@ class FiniteElementData * on a cell. This information is * redundant to some fields in the * derived classes but makes - * writing dimension independant + * writing dimension independent * programs easier. */ const unsigned int dofs_per_cell; diff --git a/deal.II/deal.II/include/grid/tria.h b/deal.II/deal.II/include/grid/tria.h index d947a79ef6..511bd363b0 100644 --- a/deal.II/deal.II/include/grid/tria.h +++ b/deal.II/deal.II/include/grid/tria.h @@ -761,7 +761,7 @@ struct TriaNumberCache<3> : public TriaNumberCache<2> * problems and an algorithm to reorder cells such that they * satisfy the conditions outlined above. * - * @item Copying a triangulation: when computing on time dependant meshes + * @item Copying a triangulation: when computing on time dependent meshes * of when using adaptive refinement, you will often want to create a * new triangulation to be the same as another one. This is facilitated * by the @p{copy_triangulation} function. diff --git a/deal.II/deal.II/include/grid/tria_levels.h b/deal.II/deal.II/include/grid/tria_levels.h index 942816effd..4caa716d3e 100644 --- a/deal.II/deal.II/include/grid/tria_levels.h +++ b/deal.II/deal.II/include/grid/tria_levels.h @@ -40,7 +40,7 @@ class TriangulationLevel * Store all information which belongs to one level of the multilevel hierarchy. * * In @ref{TriangulationLevel<0>} all data is stored which is not - * dependant on the dimension, e.g. a field to store the + * dependent on the dimension, e.g. a field to store the * refinement flag for the cells (what a cell actually is * is declared elsewhere), etc. Actually, it is only cell-based * data, like neighborship info or refinement flags. There is another diff --git a/deal.II/deal.II/include/numerics/vectors.h b/deal.II/deal.II/include/numerics/vectors.h index 629b0d08df..af50fd8bbc 100644 --- a/deal.II/deal.II/include/numerics/vectors.h +++ b/deal.II/deal.II/include/numerics/vectors.h @@ -114,7 +114,7 @@ class ConstraintMatrix; * The projection of the boundary values first, then eliminating them from * the global system of equations is not needed usually. It may be necessary * if you want to enforce special restrictions on the boundary values of the - * projected function, for example in time dependant problems: you may want + * projected function, for example in time dependent problems: you may want * to project the initial values but need consistency with the boundary * values for later times. Since the latter are projected onto the boundary * in each time step, it is necessary that we also project the boundary