* @pre The condition <code>begin@<=end</code> needs to be satisfied. They
* also obviously have to point into the same container.
*
- * @note The operations of this function are substantially more efficient if
+ * @note The operations of this function are substantially more efficient
* if the indices pointed to by the range of iterators are already sorted.
* As a consequence, it is often worth sorting the range of indices
* before calling this function.
/**
* Structure describing the default memory space. If Kokkos was configured
* with a GPU backend, the default memory space is the one corresponding to
- * that backend. Otherwise, the default memory space is the the same as the
+ * that backend. Otherwise, the default memory space is the same as the
* Host memory space.
*/
struct Default
* @p values when using shared memory and the memory space is
* MemorySpace::Host. Otherwise it is not set.
*/
- // This a shared pointer pointer so that MemorySpaceData can be copied and
+ // This a shared pointer so that MemorySpaceData can be copied and
// MemorySpaceData::values can be used in Kokkos::parallel_for. This
// pointer owns the data when using shared memory with MPI. In this case,
// the Kokkos::View @p values is non-owning. When shared memory with MPI is
*
* This class models these two steps by taking two constructor
* arguments that correspond to these two operations. It ensures
- * that that upon destruction of the current object, both the
+ * that upon destruction of the current object, both the
* wait and clean-up functions are called. Because the clean-up
* function can only be called once, objects of the current
* class can not be copied, but they can be moved.
{
/**
* Decompose the shape-function index of a linear wedge into an index
- * to access the right shape function within the triangle and and within
+ * to access the right shape function within the triangle and within
* the line.
*/
static const constexpr dealii::ndarray<unsigned int, 6, 2> wedge_table_1{
/**
* Decompose the shape-function index of a quadratic wedge into an index
- * to access the right shape function within the triangle and and within
+ * to access the right shape function within the triangle and within
* the line.
*/
static const constexpr dealii::ndarray<unsigned int, 18, 2> wedge_table_2{
DEAL_II_NAMESPACE_OPEN
/**
- * A namespace with repartitioning policies. These classes return vectors of
+ * A namespace with repartitioning policies. These classes return vectors
* of the new owners of the active locally owned and ghost cells of a
* Triangulation object. The returned vectors can be used, e.g., in
* TriangulationDescription::Utilities::create_description_from_triangulation()
/**
* Return the jump in the third derivatives of the
- * the finite element function characterized by <tt>fe_function</tt> at
+ * finite element function characterized by <tt>fe_function</tt> at
* the quadrature points of the cell interface selected the last time
* the <tt>reinit</tt> function of the FEInterfaceValues object was called.
*
/**
* Return the average of the gradients of the
- * the finite element function characterized by <tt>fe_function</tt> at the
+ * finite element function characterized by <tt>fe_function</tt> at the
* quadrature points of the cell interface selected the last time
* the <tt>reinit</tt> function of the FEInterfaceValues object was called.
* @dealiiRequiresUpdateFlags{update_gradients}
/**
* Return the average of the Hessians of the
- * the finite element function characterized by <tt>fe_function</tt> at the
+ * finite element function characterized by <tt>fe_function</tt> at the
* quadrature points of the cell interface selected the last time
* the <tt>reinit</tt> function of the FEInterfaceValues object was called.
* @dealiiRequiresUpdateFlags{update_hessians}
/**
* This class generates the same type of immersed quadrature rules as those
* described in the QuadratureGenerator class. The difference is that this
- * class handles the case when the the domain is a discrete level set
+ * class handles the case when the domain is a discrete level set
* function, i.e., when the level set function is described as a
* (DoFHandler, Vector) pair. The generate()-function of this class takes a
* cell in real space and constructs the immersed quadrature rules in
/**
* This class generates the same type of immersed quadrature rules as those
* described in the FaceQuadratureGenerator class. The difference is that this
- * class handles the case when the the domain is a discrete level set
+ * class handles the case when the domain is a discrete level set
* function, i.e., when the level set function is described as a
* (DoFHandler, Vector) pair. The generate()-function of this class takes a
* cell in real space plus the respective face index and constructs the
/**
* Release pointers to all input data elements, i.e. pointers to
- * to the DoF handler object. This function may be useful when
+ * the DoF handler object. This function may be useful when
* you have called the @p build_patches function of derived class, since
* then the patches are built and the input data is no more needed, nor is
* there a need to reference it. You can then output the patches detached
* previous state is overwritten, and the merged-in patches are lost.
*
* The second parameter allows to shift each node of the patches in the
- * object passed in in the first parameter by a certain amount. This is
+ * object passed in the first parameter by a certain amount. This is
* sometimes useful to generate "exploded" views of a collection of blocks.
*
* This function will fail if either this or the other object did not yet
* solution) makes no sense because the norm will either be dominated by the
* velocity components or the pressure components. The scaling vector this
* function returns is intended to provide each component of the solution
- * with a scaling factor that is generally chosen as as the inverse of a
+ * with a scaling factor that is generally chosen as the inverse of a
* "typical velocity" or "typical pressure" so that upon multiplication of a
* vector component by the corresponding scaling vector component, one
* obtains a number that is of order of magnitude of one (i.e., a reasonably
projects / dealii.git / commitdiff