From: David Wells Date: Fri, 18 Sep 2015 19:51:53 +0000 (-0400) Subject: Fix some typos in the documentation. X-Git-Tag: v8.4.0-rc2~392^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=8658b81a3accc56c629357fab83a84ce73a0d780;p=dealii.git Fix some typos in the documentation. --- diff --git a/include/deal.II/grid/tria_accessor.h b/include/deal.II/grid/tria_accessor.h index fcc3f7a2b0..dd59f11ea5 100644 --- a/include/deal.II/grid/tria_accessor.h +++ b/include/deal.II/grid/tria_accessor.h @@ -253,7 +253,7 @@ public: static const unsigned int space_dimension = spacedim; /** - * Dimensionality of the object that the thing represented by this accessopr + * Dimensionality of the object that the thing represented by this accessor * is part of. For example, if this accessor represents a line that is part * of a hexahedron, then this value will be three. */ @@ -1505,7 +1505,7 @@ public: static const unsigned int space_dimension = spacedim; /** - * Dimensionality of the object that the thing represented by this accessopr + * Dimensionality of the object that the thing represented by this accessor * is part of. For example, if this accessor represents a line that is part * of a hexahedron, then this value will be three. */ @@ -2176,10 +2176,10 @@ public: * refined: cell->neighbor(neighbor)->neighbor_child_on_subface(face_no, * subface_no)==cell. In 3D, a coarser neighbor can still be refined. * In that case subface_no denotes the child index of the neighbors face - * that relates to our face: cell->neighbor(neighbor)->face(face_no)->ch - * ild(subface_no)==cell->face(neighbor). This case in 3d and how it - * can happen is discussed in the introduction of the step-30 tutorial - * program. + * that relates to our face: + * cell->neighbor(neighbor)->face(face_no)->child(subface_no)==cell->face(neighbor). + * This case in 3d and how it can happen is discussed in the introduction of + * the step-30 tutorial program. * * This function is impossible for dim==1. */ @@ -2805,7 +2805,7 @@ CellAccessor::id() const CellAccessor ptr = *this; while (ptr.level()>0) { - // find the 'v'st child of our parent we are + // determine which child we are unsigned char v=-1; for (unsigned int c=0; cn_children(); ++c) { diff --git a/include/deal.II/numerics/matrix_tools.h b/include/deal.II/numerics/matrix_tools.h index e2ce2c8441..7c4ad805a6 100644 --- a/include/deal.II/numerics/matrix_tools.h +++ b/include/deal.II/numerics/matrix_tools.h @@ -182,7 +182,7 @@ namespace TrilinosWrappers * 2). The size of the matrix is equal to the number of degrees of freedom * that have support on the boundary, i.e. it is not a matrix on all * degrees of freedom, but only a subset. (The $\phi_i$ in the formula are - * this subsect of basis functions which have at least part of their support + * the subset of basis functions which have at least part of their support * on $\Gamma$.) In order to determine which shape functions are to be * considered, and in order to determine in which order, the function takes a * @p dof_to_boundary_mapping; this object maps global DoF numbers to a