From: David Wells Date: Fri, 8 May 2020 01:36:11 +0000 (-0400) Subject: Remove double word typos. X-Git-Tag: v9.2.0-rc1~93^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=902d571aaf3584c941d0605d3dbd86466b05ea49;p=dealii.git Remove double word typos. --- diff --git a/include/deal.II/base/discrete_time.h b/include/deal.II/base/discrete_time.h index b1f7ac291e..1f58db4a98 100644 --- a/include/deal.II/base/discrete_time.h +++ b/include/deal.II/base/discrete_time.h @@ -339,7 +339,7 @@ public: /** * Set the *desired* value of the next time step size. By calling this - * method, we are indicating the the next time advance_time() is called, we + * method, we are indicating the next time advance_time() is called, we * would like @p time_step_size to be used to advance the simulation time. * However, if the step is too large such that the next * simulation time exceeds the end time, the step size is truncated. diff --git a/include/deal.II/base/mpi.h b/include/deal.II/base/mpi.h index 07e6fda84d..4fa2bbc249 100644 --- a/include/deal.II/base/mpi.h +++ b/include/deal.II/base/mpi.h @@ -888,7 +888,7 @@ namespace Utilities * * The object @p request needs to exist when MPI_Finalize is called, which means the * request is typically statically allocated. Otherwise, you need to call - * unregister_request() before the request goes out of scope. Note that is + * unregister_request() before the request goes out of scope. Note that it * is acceptable for a request to be already waited on (and consequently * reset to MPI_REQUEST_NULL). * diff --git a/include/deal.II/base/mpi_consensus_algorithms.templates.h b/include/deal.II/base/mpi_consensus_algorithms.templates.h index ab68ab100b..757817f1bc 100644 --- a/include/deal.II/base/mpi_consensus_algorithms.templates.h +++ b/include/deal.II/base/mpi_consensus_algorithms.templates.h @@ -220,7 +220,7 @@ namespace Utilities # endif std::vector buffer_recv; - // get size of of incoming message + // get size of incoming message int number_amount; auto ierr = MPI_Get_count(&status, MPI_BYTE, &number_amount); AssertThrowMPI(ierr); diff --git a/include/deal.II/base/numbers.h b/include/deal.II/base/numbers.h index 88dfb1e9c0..c0db8c9e75 100644 --- a/include/deal.II/base/numbers.h +++ b/include/deal.II/base/numbers.h @@ -71,7 +71,7 @@ namespace internal * A helper class specifying the maximal vector length of VectorizedArray * for the data type `double` for the given processor architecture and * optimization level. For a detailed description of supported maximal vector - * lengths, see the the documentation of VectorizedArray. + * lengths, see the documentation of VectorizedArray. * * @author Peter Munch, 2019 */ @@ -97,7 +97,7 @@ namespace internal * A helper class specifying the maximal vector length of VectorizedArray * for the data type `float` for the given processor architecture and * optimization level. For a detailed description of supported maximal vector - * lengths, see the the documentation of VectorizedArray. + * lengths, see the documentation of VectorizedArray. * * @author Peter Munch, 2019 */ diff --git a/include/deal.II/base/parameter_handler.h b/include/deal.II/base/parameter_handler.h index 4fdc503ece..6518d663ca 100644 --- a/include/deal.II/base/parameter_handler.h +++ b/include/deal.II/base/parameter_handler.h @@ -53,7 +53,7 @@ class MultipleParameterLoop; * Input may be sorted into subsection trees in order to give the input a * logical structure, and input files may include other files. * - * The ParameterHandler class is discussed in in step-29, + * The ParameterHandler class is discussed in step-29, * step-33, and step-34. * *

Declaring entries

diff --git a/include/deal.II/base/vectorization.h b/include/deal.II/base/vectorization.h index 92ea471e74..54efca7ddc 100644 --- a/include/deal.II/base/vectorization.h +++ b/include/deal.II/base/vectorization.h @@ -755,7 +755,7 @@ inline DEAL_II_ALWAYS_INLINE VectorizedArrayType /** - * Load size() data items from memory into the the VectorizedArray @p out, + * Load size() data items from memory into the VectorizedArray @p out, * starting at the given addresses and with given offset, each entry from the * offset providing one element of the vectorized array. * diff --git a/include/deal.II/differentiation/sd/symengine_optimizer.h b/include/deal.II/differentiation/sd/symengine_optimizer.h index f1bf2e1c89..86f16e937c 100644 --- a/include/deal.II/differentiation/sd/symengine_optimizer.h +++ b/include/deal.II/differentiation/sd/symengine_optimizer.h @@ -1947,7 +1947,7 @@ namespace Differentiation /** * A set of symbolic expressions to be optimized. It is required that - * the symbols on which these dependent functions be based are are + * the symbols on which these dependent functions be based are * registered in the @p independent_variables_symbols map. */ types::symbol_vector dependent_variables_functions; diff --git a/include/deal.II/differentiation/sd/symengine_scalar_operations.h b/include/deal.II/differentiation/sd/symengine_scalar_operations.h index e5b7539c5f..a7756c0fc5 100644 --- a/include/deal.II/differentiation/sd/symengine_scalar_operations.h +++ b/include/deal.II/differentiation/sd/symengine_scalar_operations.h @@ -1198,7 +1198,7 @@ namespace Differentiation * * Example: * If map["a"] -> 1 and - * map["b"] -> "a"+ 2, then then the function $f(a,b(a)) = a+b$ + * map["b"] -> "a"+ 2, then the function $f(a,b(a)) = a+b$ * will be evaluated and the result $f\vert_{a=1,b=a+2} = 3+a$ is determined * upon the completion of the first sweep. A second sweep is therefore * necessary to resolve the final symbol, and the returned value is diff --git a/include/deal.II/dofs/dof_tools.h b/include/deal.II/dofs/dof_tools.h index 71d8f4d309..1cbb695f1f 100644 --- a/include/deal.II/dofs/dof_tools.h +++ b/include/deal.II/dofs/dof_tools.h @@ -1195,11 +1195,11 @@ namespace DoFTools * This function makes sure that identity constraints don't create cycles * in @p constraints. * - * @p periodicity_factor can be used to to implement Bloch periodic conditions + * @p periodicity_factor can be used to implement Bloch periodic conditions * (a.k.a. phase shift periodic conditions) of the form * $\psi(\mathbf{r})=e^{-i\mathbf{k}\cdot\mathbf{r}}u(\mathbf{r})$ * where $u$ is periodic with the same periodicity as the crystal lattice and - * and $\mathbf{k}$ is the wavevector, see + * $\mathbf{k}$ is the wavevector, see * [https://en.wikipedia.org/wiki/Bloch_wave](https://en.wikipedia.org/wiki/Bloch_wave). * The solution at @p face_2 is equal to the solution at @p face_1 times * @p periodicity_factor. For example, if the solution at @p face_1 is diff --git a/include/deal.II/fe/fe_interface_values.h b/include/deal.II/fe/fe_interface_values.h index 78727fb9c3..7c905964eb 100644 --- a/include/deal.II/fe/fe_interface_values.h +++ b/include/deal.II/fe/fe_interface_values.h @@ -308,7 +308,7 @@ public: * * Note that one can define the jump in * different ways (the value "there" minus the value "here", or the other way - * way around; both are used in the finite element literature). The definition + * around; both are used in the finite element literature). The definition * here uses "value here minus value there", as seen from the first cell. * * If this is a boundary face (at_boundary() returns true), then diff --git a/include/deal.II/grid/grid_tools.h b/include/deal.II/grid/grid_tools.h index 994a1bedc5..af480e2b81 100644 --- a/include/deal.II/grid/grid_tools.h +++ b/include/deal.II/grid/grid_tools.h @@ -2027,7 +2027,7 @@ namespace GridTools * @note If the flag @p group_siblings is set to false, children of a * cell might be placed on different processors even though they are all * active, which is an assumption made by p4est. By relaxing this, we - * can can create partitions owning a single cell (also for refined + * can create partitions owning a single cell (also for refined * meshes). */ template diff --git a/include/deal.II/lac/lapack_full_matrix.h b/include/deal.II/lac/lapack_full_matrix.h index f615c00f41..9134fbdc21 100644 --- a/include/deal.II/lac/lapack_full_matrix.h +++ b/include/deal.II/lac/lapack_full_matrix.h @@ -793,7 +793,7 @@ public: * the diagonal while all the other elements are zero. U is a MxM orthogonal * matrix containing the left singular vectors corresponding to the singular * values of A. V is a NxN orthonal matrix containing the right singular - * vectors corresponding the the singular values of A. + * vectors corresponding the singular values of A. * * Note that the variable #svd_vt contains the tranpose of V and can be * accessed by get_svd_vt(), while U is accessed with get_svd_u(). diff --git a/include/deal.II/lac/sparsity_tools.h b/include/deal.II/lac/sparsity_tools.h index 579be8f636..bb1d17b84d 100644 --- a/include/deal.II/lac/sparsity_tools.h +++ b/include/deal.II/lac/sparsity_tools.h @@ -275,7 +275,7 @@ namespace SparsityTools /** * Communicate rows in a dynamic sparsity pattern over MPI, similar to the - * one above but using a vector `rows_per_cpu` containing the number of of + * one above but using a vector `rows_per_cpu` containing the number of * rows per CPU for determining ownership. This is typically the value * returned by DoFHandler::n_locally_owned_dofs_per_processor -- given that * the construction of the input to this function involves all-to-all