From b434e8056dba23241c7ded36572da26c00012917 Mon Sep 17 00:00:00 2001 From: Chaitanya Dev Date: Mon, 18 Apr 2022 07:52:28 +0200 Subject: [PATCH] fixing typo of the type 'the the' --- .../archive/detail/polymorphic_iarchive_route.hpp | 4 ++-- .../archive/detail/polymorphic_oarchive_route.hpp | 4 ++-- .../include/boost/config/compiler/cray.hpp | 10 +++++----- bundled/boost-1.70.0/include/boost/container/deque.hpp | 4 ++-- .../include/boost/container/stable_vector.hpp | 4 ++-- .../boost-1.70.0/include/boost/container/vector.hpp | 6 +++--- bundled/boost-1.70.0/include/boost/date_time/date.hpp | 2 +- .../include/boost/date_time/int_adapter.hpp | 4 ++-- .../boost-1.70.0/include/boost/graph/labeled_graph.hpp | 2 +- .../boost/graph/planar_detail/boyer_myrvold_impl.hpp | 2 +- .../include/boost/graph/sloan_ordering.hpp | 2 +- .../interpolators/detail/cubic_b_spline_detail.hpp | 2 +- .../include/boost/math/special_functions/sinc.hpp | 2 +- .../include/boost/math/special_functions/sinhc.hpp | 2 +- .../odeint/integrate/detail/integrate_const.hpp | 2 +- .../include/boost/numeric/ublas/expression_types.hpp | 2 +- .../include/boost/serialization/config.hpp | 2 +- .../include/boost/serialization/singleton.hpp | 2 +- .../include/boost/type_traits/is_virtual_base_of.hpp | 2 +- bundled/muparser_v2_3_3/src/muParserBase.cpp | 2 +- bundled/umfpack/UMFPACK/Include/umfpack_numeric.h | 2 +- .../umfpack/UMFPACK/Include/umfpack_triplet_to_col.h | 2 +- .../headers/automatic_and_symbolic_differentiation.h | 2 +- doc/doxygen/headers/glossary.h | 2 +- doc/doxygen/headers/main.h | 2 +- doc/news/8.3.0-vs-8.4.0.h | 2 +- doc/news/9.0.1-vs-9.1.0.h | 2 +- doc/news/changes/minor/20210309Munch | 2 +- doc/users/cmake_user.html | 2 +- examples/step-19/step-19.cc | 2 +- examples/step-67/doc/intro.dox | 2 +- examples/step-70/step-70.cc | 4 ++-- examples/step-71/doc/intro.dox | 2 +- examples/step-71/step-71.cc | 2 +- examples/step-78/doc/results.dox | 2 +- examples/step-9/doc/intro.dox | 2 +- include/deal.II/matrix_free/fe_evaluation.h | 2 +- source/grid/grid_generator.cc | 2 +- source/grid/grid_tools.cc | 2 +- source/grid/grid_tools_dof_handlers.cc | 2 +- source/non_matching/mesh_classifier.cc | 2 +- .../hp_line_dof_identities_q_equidistant_multiway.cc | 2 +- .../hp_quad_dof_identities_q_equidistant_multiway.cc | 2 +- tests/mappings/mapping_points_real_to_unit.cc | 2 +- tests/non_matching/quadrature_generator.cc | 2 +- tests/particles/step-19.cc | 2 +- 46 files changed, 58 insertions(+), 58 deletions(-) diff --git a/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_iarchive_route.hpp b/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_iarchive_route.hpp index 105685ebbd..1f6b1b4064 100644 --- a/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_iarchive_route.hpp +++ b/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_iarchive_route.hpp @@ -50,7 +50,7 @@ class basic_pointer_iserializer; template class polymorphic_iarchive_route : public polymorphic_iarchive, - // note: gcc dynamic cross cast fails if the the derivation below is + // note: gcc dynamic cross cast fails if the derivation below is // not public. I think this is a mistake. public /*protected*/ ArchiveImplementation { @@ -190,7 +190,7 @@ public: } // register type function template - const basic_pointer_iserializer * + const basic_pointer_iserializer * register_type(T * t = NULL){ return ArchiveImplementation::register_type(t); } diff --git a/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_oarchive_route.hpp b/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_oarchive_route.hpp index b23fd6bf39..21fa95103f 100644 --- a/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_oarchive_route.hpp +++ b/bundled/boost-1.70.0/include/boost/archive/detail/polymorphic_oarchive_route.hpp @@ -50,7 +50,7 @@ class basic_pointer_oserializer; template class polymorphic_oarchive_route : public polymorphic_oarchive, - // note: gcc dynamic cross cast fails if the the derivation below is + // note: gcc dynamic cross cast fails if the derivation below is // not public. I think this is a mistake. public /*protected*/ ArchiveImplementation { @@ -181,7 +181,7 @@ public: } // register type function template - const basic_pointer_oserializer * + const basic_pointer_oserializer * register_type(T * t = NULL){ return ArchiveImplementation::register_type(t); } diff --git a/bundled/boost-1.70.0/include/boost/config/compiler/cray.hpp b/bundled/boost-1.70.0/include/boost/config/compiler/cray.hpp index 412ef9efa5..9fad2fbe27 100644 --- a/bundled/boost-1.70.0/include/boost/config/compiler/cray.hpp +++ b/bundled/boost-1.70.0/include/boost/config/compiler/cray.hpp @@ -78,7 +78,7 @@ // Cray employee), the release patch level is reported as "x". This gives // versions that look like e.g. "8.6.x". // -// To accomplish this, the the Cray compiler preprocessor inserts: +// To accomplish this, the Cray compiler preprocessor inserts: // // #define _RELEASE_PATCHLEVEL x // @@ -227,8 +227,8 @@ #define BOOST_MATH_DISABLE_STD_FPCLASSIFY //#define BOOST_HAS_FPCLASSIFY -#define BOOST_SP_USE_PTHREADS -#define BOOST_AC_USE_PTHREADS +#define BOOST_SP_USE_PTHREADS +#define BOOST_AC_USE_PTHREADS // // Everything that follows is working around what are thought to be @@ -296,8 +296,8 @@ #undef BOOST_NO_SFINAE_EXPR #undef BOOST_NO_TWO_PHASE_NAME_LOOKUP #undef BOOST_MATH_DISABLE_STD_FPCLASSIFY -#undef BOOST_SP_USE_PTHREADS -#undef BOOST_AC_USE_PTHREADS +#undef BOOST_SP_USE_PTHREADS +#undef BOOST_AC_USE_PTHREADS #define BOOST_HAS_VARIADIC_TMPL #define BOOST_HAS_UNISTD_H diff --git a/bundled/boost-1.70.0/include/boost/container/deque.hpp b/bundled/boost-1.70.0/include/boost/container/deque.hpp index 1fa3e5d5d4..a66dc808b7 100644 --- a/bundled/boost-1.70.0/include/boost/container/deque.hpp +++ b/bundled/boost-1.70.0/include/boost/container/deque.hpp @@ -867,7 +867,7 @@ class deque : protected deque_base::type> this->assign(c_it(val, n), c_it()); } - //! Effects: Assigns the the range [first, last) to *this. + //! Effects: Assigns the range [first, last) to *this. //! //! Throws: If memory allocation throws or //! T's constructor from dereferencing InIt throws. @@ -920,7 +920,7 @@ class deque : protected deque_base::type> #endif #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) - //! Effects: Assigns the the range [il.begin(), il.end()) to *this. + //! Effects: Assigns the range [il.begin(), il.end()) to *this. //! //! Throws: If memory allocation throws or //! T's constructor from dereferencing std::initializer_list iterator throws. diff --git a/bundled/boost-1.70.0/include/boost/container/stable_vector.hpp b/bundled/boost-1.70.0/include/boost/container/stable_vector.hpp index 92ef0f6a7f..d4b37ca354 100644 --- a/bundled/boost-1.70.0/include/boost/container/stable_vector.hpp +++ b/bundled/boost-1.70.0/include/boost/container/stable_vector.hpp @@ -905,7 +905,7 @@ class stable_vector this->assign(cvalue_iterator(t, n), cvalue_iterator()); } - //! Effects: Assigns the the range [first, last) to *this. + //! Effects: Assigns the range [first, last) to *this. //! //! Throws: If memory allocation throws or //! T's constructor from dereferencing InpIt throws. @@ -933,7 +933,7 @@ class stable_vector } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) - //! Effects: Assigns the the range [il.begin(), il.end()) to *this. + //! Effects: Assigns the range [il.begin(), il.end()) to *this. //! //! Throws: If memory allocation throws or //! T's constructor from dereferencing initializer_list iterator throws. diff --git a/bundled/boost-1.70.0/include/boost/container/vector.hpp b/bundled/boost-1.70.0/include/boost/container/vector.hpp index 010b599d6d..f1b467afd5 100644 --- a/bundled/boost-1.70.0/include/boost/container/vector.hpp +++ b/bundled/boost-1.70.0/include/boost/container/vector.hpp @@ -1214,7 +1214,7 @@ private: #endif - //! Effects: Assigns the the range [first, last) to *this. + //! Effects: Assigns the range [first, last) to *this. //! //! Throws: If memory allocation throws or T's copy/move constructor/assignment or //! T's constructor/assignment from dereferencing InpIt throws. @@ -1253,7 +1253,7 @@ private: } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) - //! Effects: Assigns the the range [il.begin(), il.end()) to *this. + //! Effects: Assigns the range [il.begin(), il.end()) to *this. //! //! Throws: If memory allocation throws or //! T's constructor from dereferencing iniializer_list iterator throws. @@ -1264,7 +1264,7 @@ private: } #endif - //! Effects: Assigns the the range [first, last) to *this. + //! Effects: Assigns the range [first, last) to *this. //! //! Throws: If memory allocation throws or T's copy/move constructor/assignment or //! T's constructor/assignment from dereferencing InpIt throws. diff --git a/bundled/boost-1.70.0/include/boost/date_time/date.hpp b/bundled/boost-1.70.0/include/boost/date_time/date.hpp index 18333fd3ff..186c14a070 100644 --- a/bundled/boost-1.70.0/include/boost/date_time/date.hpp +++ b/bundled/boost-1.70.0/include/boost/date_time/date.hpp @@ -31,7 +31,7 @@ namespace date_time { operations (add, subtract) and storage (minimize space to represent) in a concrete class. Thus, the date uses a count internally to represent a particular date. The calendar parameter defines - the policies for converting the the year-month-day and internal + the policies for converting the year-month-day and internal counted form here. Applications that need to perform heavy formatting of the same date repeatedly will perform better by using the year-month-day representation. diff --git a/bundled/boost-1.70.0/include/boost/date_time/int_adapter.hpp b/bundled/boost-1.70.0/include/boost/date_time/int_adapter.hpp index 6ee7712fab..81682b2584 100644 --- a/bundled/boost-1.70.0/include/boost/date_time/int_adapter.hpp +++ b/bundled/boost-1.70.0/include/boost/date_time/int_adapter.hpp @@ -202,7 +202,7 @@ public: // } /*! Operator allows for adding dissimilar int_adapter types. - * The return type will match that of the the calling object's type */ + * The return type will match that of the calling object's type */ template inline int_adapter operator+(const int_adapter& rhs) const @@ -251,7 +251,7 @@ public: } /*! Operator allows for subtracting dissimilar int_adapter types. - * The return type will match that of the the calling object's type */ + * The return type will match that of the calling object's type */ template inline int_adapter operator-(const int_adapter& rhs)const diff --git a/bundled/boost-1.70.0/include/boost/graph/labeled_graph.hpp b/bundled/boost-1.70.0/include/boost/graph/labeled_graph.hpp index 59df0feb8f..a148fbb276 100644 --- a/bundled/boost-1.70.0/include/boost/graph/labeled_graph.hpp +++ b/bundled/boost-1.70.0/include/boost/graph/labeled_graph.hpp @@ -52,7 +52,7 @@ namespace graph_detail { /** * @name Generate Label Map * These type generators are responsible for instantiating an associative - * container for the the labeled graph. Note that the Selector must be + * container for the labeled graph. Note that the Selector must be * select a pair associative container or a vecS, which is only valid if * Label is an integral type. */ diff --git a/bundled/boost-1.70.0/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp b/bundled/boost-1.70.0/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp index 45a552aa5d..d9246b1d2f 100644 --- a/bundled/boost-1.70.0/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp +++ b/bundled/boost-1.70.0/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp @@ -422,7 +422,7 @@ namespace boost // clean_up_embedding does some clean-up and fills in values that have // to be computed lazily during the actual execution of the algorithm // (for instance, whether or not a bicomp is flipped in the final - // embedding). It's dispatched on the the StoreEmbeddingPolicy, since + // embedding). It's dispatched on the StoreEmbeddingPolicy, since // it's not needed if an embedding isn't desired. typename vertex_vector_t::reverse_iterator vi, vi_end; diff --git a/bundled/boost-1.70.0/include/boost/graph/sloan_ordering.hpp b/bundled/boost-1.70.0/include/boost/graph/sloan_ordering.hpp index 88ad1b297f..7fae9b26d9 100644 --- a/bundled/boost-1.70.0/include/boost/graph/sloan_ordering.hpp +++ b/bundled/boost-1.70.0/include/boost/graph/sloan_ordering.hpp @@ -162,7 +162,7 @@ namespace boost { new_start = false; //Setting the loop repetition status to false //step 2 - //initialize the the disance std-vector with 0 + //initialize the disance std-vector with 0 for(typename std::vector::vertices_size_type>::iterator iter = dist.begin(); iter != dist.end(); ++iter) *iter = 0; //generating the RLS (rooted level structure) diff --git a/bundled/boost-1.70.0/include/boost/math/interpolators/detail/cubic_b_spline_detail.hpp b/bundled/boost-1.70.0/include/boost/math/interpolators/detail/cubic_b_spline_detail.hpp index de013fabbf..662da3cb85 100644 --- a/bundled/boost-1.70.0/include/boost/math/interpolators/detail/cubic_b_spline_detail.hpp +++ b/bundled/boost-1.70.0/include/boost/math/interpolators/detail/cubic_b_spline_detail.hpp @@ -170,7 +170,7 @@ cubic_b_spline_imp::cubic_b_spline_imp(BidiIterator f, BidiIterator end_p, // There are, in fact 5 diagonals, but they only differ from zero on the first and last row, // so we can patch up the tridiagonal row reduction algorithm to deal with two special rows. // See Kress, equations 8.41 - // The the "tridiagonal" matrix is: + // the "tridiagonal" matrix is: // 1 0 -1 // 1 4 1 // 1 4 1 diff --git a/bundled/boost-1.70.0/include/boost/math/special_functions/sinc.hpp b/bundled/boost-1.70.0/include/boost/math/special_functions/sinc.hpp index 131e985fd9..036e1af575 100644 --- a/bundled/boost-1.70.0/include/boost/math/special_functions/sinc.hpp +++ b/bundled/boost-1.70.0/include/boost/math/special_functions/sinc.hpp @@ -28,7 +28,7 @@ #include -// These are the the "Sinus Cardinal" functions. +// These are the "Sinus Cardinal" functions. namespace boost { diff --git a/bundled/boost-1.70.0/include/boost/math/special_functions/sinhc.hpp b/bundled/boost-1.70.0/include/boost/math/special_functions/sinhc.hpp index 1216b7bfb7..cabaa1b149 100644 --- a/bundled/boost-1.70.0/include/boost/math/special_functions/sinhc.hpp +++ b/bundled/boost-1.70.0/include/boost/math/special_functions/sinhc.hpp @@ -26,7 +26,7 @@ #include -// These are the the "Hyperbolic Sinus Cardinal" functions. +// These are the "Hyperbolic Sinus Cardinal" functions. namespace boost { diff --git a/bundled/boost-1.70.0/include/boost/numeric/odeint/integrate/detail/integrate_const.hpp b/bundled/boost-1.70.0/include/boost/numeric/odeint/integrate/detail/integrate_const.hpp index 7a86b32fa6..778888aa5f 100644 --- a/bundled/boost-1.70.0/include/boost/numeric/odeint/integrate/detail/integrate_const.hpp +++ b/bundled/boost-1.70.0/include/boost/numeric/odeint/integrate/detail/integrate_const.hpp @@ -151,7 +151,7 @@ size_t integrate_const( } // last observation, if we are still in observation interval - // might happen due to finite precision problems when computing the the time + // might happen due to finite precision problems when computing the time if( less_eq_with_sign( time , end_time , dt ) ) { st.calc_state( time , start_state ); diff --git a/bundled/boost-1.70.0/include/boost/numeric/ublas/expression_types.hpp b/bundled/boost-1.70.0/include/boost/numeric/ublas/expression_types.hpp index eecc71ad6e..1e158dfe1e 100644 --- a/bundled/boost-1.70.0/include/boost/numeric/ublas/expression_types.hpp +++ b/bundled/boost-1.70.0/include/boost/numeric/ublas/expression_types.hpp @@ -21,7 +21,7 @@ namespace boost { namespace numeric { namespace ublas { - /** \brief Base class for uBLAS statically derived expressions using the the Barton Nackman trick + /** \brief Base class for uBLAS statically derived expressions using the Barton Nackman trick * * This is a NonAssignable class * Directly implement nonassignable - simplifes debugging call trace! diff --git a/bundled/boost-1.70.0/include/boost/serialization/config.hpp b/bundled/boost-1.70.0/include/boost/serialization/config.hpp index ea8cb9239e..d9e1482023 100644 --- a/bundled/boost-1.70.0/include/boost/serialization/config.hpp +++ b/bundled/boost-1.70.0/include/boost/serialization/config.hpp @@ -18,7 +18,7 @@ #include #include -// note: this version incorporates the related code into the the +// note: this version incorporates the related code into the // the same library as BOOST_ARCHIVE. This could change some day in the // future diff --git a/bundled/boost-1.70.0/include/boost/serialization/singleton.hpp b/bundled/boost-1.70.0/include/boost/serialization/singleton.hpp index a668100da2..a22de71d66 100644 --- a/bundled/boost-1.70.0/include/boost/serialization/singleton.hpp +++ b/bundled/boost-1.70.0/include/boost/serialization/singleton.hpp @@ -177,7 +177,7 @@ private: // the sequence of object initialization. // Unfortunately, this triggers detectors of undefine behavior // and reports an error. But I've been unable to find a different - // of guarenteeing that the the singleton is created at pre-main time. + // of guarenteeing that the singleton is created at pre-main time. use(* m_instance); return static_cast(t); diff --git a/bundled/boost-1.70.0/include/boost/type_traits/is_virtual_base_of.hpp b/bundled/boost-1.70.0/include/boost/type_traits/is_virtual_base_of.hpp index fe2cdcfcc0..1bead8e994 100644 --- a/bundled/boost-1.70.0/include/boost/type_traits/is_virtual_base_of.hpp +++ b/bundled/boost-1.70.0/include/boost/type_traits/is_virtual_base_of.hpp @@ -35,7 +35,7 @@ namespace boost { // (2) a Base* cannot be converted to Derived* (so the base class is either ambiguous or virtual) // With both conditions true, Base must be a virtual base of Derived. // The "is_base_of" is only needed so the compiler can (but is not required to) error out if the types are incomplete. - // This is in league with the the expected behaviour. + // This is in league with the expected behaviour. template constexpr bool is_virtual_base_impl(...) { return true; } diff --git a/bundled/muparser_v2_3_3/src/muParserBase.cpp b/bundled/muparser_v2_3_3/src/muParserBase.cpp index e71d5e6663..d488da7b43 100644 --- a/bundled/muparser_v2_3_3/src/muParserBase.cpp +++ b/bundled/muparser_v2_3_3/src/muParserBase.cpp @@ -545,7 +545,7 @@ namespace mu \param [in] a_eAssociativity The associativity of the operator. \param [in] a_bAllowOpt If this is true the operator may be optimized away. - Adds a new Binary operator the the parser instance. + Adds a new Binary operator the parser instance. */ void ParserBase::DefineOprt(const string_type& a_sName, fun_type2 a_pFun, unsigned a_iPrec, EOprtAssociativity a_eAssociativity, bool a_bAllowOpt) { diff --git a/bundled/umfpack/UMFPACK/Include/umfpack_numeric.h b/bundled/umfpack/UMFPACK/Include/umfpack_numeric.h index d871ef18e2..3aa94c757c 100644 --- a/bundled/umfpack/UMFPACK/Include/umfpack_numeric.h +++ b/bundled/umfpack/UMFPACK/Include/umfpack_numeric.h @@ -267,7 +267,7 @@ Arguments: (-Control [UMFPACK_ALLOC_INIT]). Regardless of the value of this parameter, a space equal to or - greater than the the bare minimum amount of memory needed to start + greater than the bare minimum amount of memory needed to start the factorization is always initially allocated. The bare initial memory required is returned by umfpack_*_*symbolic in Info [UMFPACK_VARIABLE_INIT_ESTIMATE] (an exact value, not an diff --git a/bundled/umfpack/UMFPACK/Include/umfpack_triplet_to_col.h b/bundled/umfpack/UMFPACK/Include/umfpack_triplet_to_col.h index cb45278e18..92f5d66135 100644 --- a/bundled/umfpack/UMFPACK/Include/umfpack_triplet_to_col.h +++ b/bundled/umfpack/UMFPACK/Include/umfpack_triplet_to_col.h @@ -225,7 +225,7 @@ Arguments: Ax is optional; if Tx and/or Ax are not present (a (double *) NULL pointer), then Ax is not computed. If present, Ax holds the - numerical values of the the real part of the sparse matrix A and Az + numerical values of the real part of the sparse matrix A and Az holds the imaginary parts. The nonzero pattern (row indices) for column j is stored in Ai [(Ap [j]) ... (Ap [j+1]-1)], and the corresponding numerical values are stored in diff --git a/doc/doxygen/headers/automatic_and_symbolic_differentiation.h b/doc/doxygen/headers/automatic_and_symbolic_differentiation.h index 847a4d5ff7..c27f99f7dd 100644 --- a/doc/doxygen/headers/automatic_and_symbolic_differentiation.h +++ b/doc/doxygen/headers/automatic_and_symbolic_differentiation.h @@ -490,7 +490,7 @@ * * - Classes designed to operate at the quadrature point level (or any general continuum point): * - Differentiation::AD::ScalarFunction: %Differentiation of a scalar-valued function. - * One typical use would be the the development of constitutive laws directly from a strain + * One typical use would be the development of constitutive laws directly from a strain * energy function. An example of this exact use case is given in step-71. * - Differentiation::AD::VectorFunction: %Differentiation of a vector-valued function. * This could be used to linearize the kinematic variables of a constitutive law, or assist diff --git a/doc/doxygen/headers/glossary.h b/doc/doxygen/headers/glossary.h index 06f2ee072a..54983236a5 100644 --- a/doc/doxygen/headers/glossary.h +++ b/doc/doxygen/headers/glossary.h @@ -1123,7 +1123,7 @@ * may not even store all of the elements a non-ghosted vector would * store on the current processor. Consequently, for Trilinos vectors, * there is no notion of an 'owner' of vector elements in the way we - * have it in the the non-ghost case view (or in the PETSc case) and + * have it in the non-ghost case view (or in the PETSc case) and * the name "ghost element" may be misleading since in this view, * every element we have available locally may or may not be stored * somewhere else as well, but even if it is, the local element is not diff --git a/doc/doxygen/headers/main.h b/doc/doxygen/headers/main.h index 6042c842d6..21561a5599 100644 --- a/doc/doxygen/headers/main.h +++ b/doc/doxygen/headers/main.h @@ -169,7 +169,7 @@ * number of them. It also gives them a global numbering. * * A different viewpoint is this: While the mesh and finite element describe - * abstract properties of the the finite dimensional space $V_h$ in which we + * abstract properties of the finite dimensional space $V_h$ in which we * seek the discrete solution, the %DoFHandler classes enumerate a concrete * basis of this space so that we can represent the discrete solution as * $u_h(\mathbf x)= \sum_j U_j \varphi_i(\mathbf x)$ by an ordered set of diff --git a/doc/news/8.3.0-vs-8.4.0.h b/doc/news/8.3.0-vs-8.4.0.h index 38659aa88b..4d250e2d3a 100644 --- a/doc/news/8.3.0-vs-8.4.0.h +++ b/doc/news/8.3.0-vs-8.4.0.h @@ -941,7 +941,7 @@ inconvenience this causes.
  • New: Memory consumption during compilation has been reduced by splitting instantiation files. For this make_instantiations now supports additional - logic to split the the instantiations in .inst files into groups. This is + logic to split the instantiations in .inst files into groups. This is used in fe_values.cc, error_estimator.cc, and others.
    (Timo Heister, 2015/09/05) diff --git a/doc/news/9.0.1-vs-9.1.0.h b/doc/news/9.0.1-vs-9.1.0.h index e5c82827ce..e20421e6de 100644 --- a/doc/news/9.0.1-vs-9.1.0.h +++ b/doc/news/9.0.1-vs-9.1.0.h @@ -1910,7 +1910,7 @@ inconvenience this causes.
  • - Improved: TimerOutput now dynamically adjust to the the width of Section column. + Improved: TimerOutput now dynamically adjust to the width of Section column.
    (Denis Davydov, 2018/05/29)
    • diff --git a/doc/news/changes/minor/20210309Munch b/doc/news/changes/minor/20210309Munch index e6b3b6019a..b68f7074f9 100644 --- a/doc/news/changes/minor/20210309Munch +++ b/doc/news/changes/minor/20210309Munch @@ -1,6 +1,6 @@ New: The class MGTransferMatrixFree::build() now also accepts an optional function for initializing the internal level vectors. -This is useful if one uses the the transfer operators in the context of +This is useful if one uses the transfer operators in the context of smoothers that are built around MatrixFree objects.
    (Peter Munch, 2021/03/09) diff --git a/doc/users/cmake_user.html b/doc/users/cmake_user.html index ca31554375..824862833e 100644 --- a/doc/users/cmake_user.html +++ b/doc/users/cmake_user.html @@ -510,7 +510,7 @@ DEAL_II_INITIALIZE_CACHED_VARIABLES() PROJECT(myproject) The macro will set an uninitialized CMAKE_BUILD_TYPE variable -to the the build type of deal.II, i.e. DEAL_II_BUILD_TYPE. If +to the build type of deal.II, i.e. DEAL_II_BUILD_TYPE. If CMAKE_BUILD_TYPE is specified it will automatically be reset if the given value is unsupported by the deal.II installation (i.e., if it is not equal to Debug, Release, or diff --git a/examples/step-19/step-19.cc b/examples/step-19/step-19.cc index 76f6faf6a2..87e56d18f5 100644 --- a/examples/step-19/step-19.cc +++ b/examples/step-19/step-19.cc @@ -539,7 +539,7 @@ namespace Step19 // Let us now turn to the functions that deal with particles. The first one // is about the creation of particles. As mentioned in the introduction, - // we want to create a particle at points of the cathode if the the electric + // we want to create a particle at points of the cathode if the electric // field $\mathbf E=\nabla V$ exceeds a certain threshold, i.e., if // $|\mathbf E| \ge E_\text{threshold}$, and if furthermore the electric field // points into the domain (i.e., if $\mathbf E \cdot \mathbf n < 0$). As is diff --git a/examples/step-67/doc/intro.dox b/examples/step-67/doc/intro.dox index 7c258b8c16..d565fd1642 100644 --- a/examples/step-67/doc/intro.dox +++ b/examples/step-67/doc/intro.dox @@ -349,7 +349,7 @@ in time system compactly as \mathcal L_h(t, \mathbf{w}_h), @f] where we have taken the liberty to also denote the global solution -vector by $\mathbf{w}_h$ (in addition to the the corresponding finite +vector by $\mathbf{w}_h$ (in addition to the corresponding finite element function). Equivalently, the system above has the form @f[ \frac{\partial \mathbf{w}_h}{\partial t} = diff --git a/examples/step-70/step-70.cc b/examples/step-70/step-70.cc index 8d498123cc..3afb736204 100644 --- a/examples/step-70/step-70.cc +++ b/examples/step-70/step-70.cc @@ -537,7 +537,7 @@ namespace Step70 // The next two functions initialize the // Particles::ParticleHandler objects used in this class. We have two such // objects: One represents passive tracers, used to plot the trajectories - // of fluid particles, while the the other represents material particles + // of fluid particles, while the other represents material particles // of the solid, which are placed at quadrature points of the solid grid. void setup_tracer_particles(); void setup_solid_particles(); @@ -1905,7 +1905,7 @@ namespace Step70 // exception of the handling of input parameter files. We allow the user to // specify an optional parameter file as an argument to the program. If // nothing is specified, we use the default file "parameters.prm", which is -// created if non existent. The file name is scanned for the the string "23" +// created if non existent. The file name is scanned for the string "23" // first, and "3" afterwards. If the filename contains the string "23", the // problem classes are instantiated with template arguments 2 and 3 // respectively. If only the string "3" is found, then both template arguments diff --git a/examples/step-71/doc/intro.dox b/examples/step-71/doc/intro.dox index 6652a2820c..d4a2aba9c3 100644 --- a/examples/step-71/doc/intro.dox +++ b/examples/step-71/doc/intro.dox @@ -138,7 +138,7 @@ Truesdell and Toupin @cite Truesdell1960a and Coleman and Noll @cite Coleman1963 and follows the logic laid out by Holzapfel @cite Holzapfel2007a. Starting from the first law of thermodynamics, and following a few technical -assumptions, it can be shown the the balance between the kinetic plus internal +assumptions, it can be shown the balance between the kinetic plus internal energy rates and the power supplied to the system from external sources is given by the following relationship that equates the rate of change of the energy in an (arbitrary) volume $V$ on the left, and diff --git a/examples/step-71/step-71.cc b/examples/step-71/step-71.cc index 2dfa635e93..8ad2969c82 100644 --- a/examples/step-71/step-71.cc +++ b/examples/step-71/step-71.cc @@ -2220,7 +2220,7 @@ namespace Step71 // \right] // @f} // - // Well, that escalated quickly -- although the the definition of $\psi_{0}$ + // Well, that escalated quickly -- although the definition of $\psi_{0}$ // and $f_{\mu_e}$ might have given some hints that the calculating // the kinetic fields and their linearization would take some effort, it is // likely that there's a little more complexity to the final definitions diff --git a/examples/step-78/doc/results.dox b/examples/step-78/doc/results.dox index b514b64210..6dc2de7a31 100644 --- a/examples/step-78/doc/results.dox +++ b/examples/step-78/doc/results.dox @@ -43,7 +43,7 @@ n cells H1 L2 What is more interesting is the output of the convergence tables. They are outputted into the console, as well into a LaTeX file. The convergence tables -are shown above. Here, you can see that the the solution has a convergence rate +are shown above. Here, you can see that the solution has a convergence rate of $\mathcal{O}(h)$ with respect to the $H^1$-norm, and the solution has a convergence rate of $\mathcal{O}(h^2)$ with respect to the $L^2$-norm. diff --git a/examples/step-9/doc/intro.dox b/examples/step-9/doc/intro.dox index 4e42b3abad..ded3a8db95 100644 --- a/examples/step-9/doc/intro.dox +++ b/examples/step-9/doc/intro.dox @@ -75,7 +75,7 @@ A standard approach to address this difficulty is the "streamline-upwind Petrov-Galerkin" (SUPG) method, sometimes also called the streamline diffusion method. A good explanation of the method can be found in @cite elman2005 . Formally, this method replaces the step -in which we derive the the weak form of the differential equation from +in which we derive the weak form of the differential equation from the strong form: Instead of multiplying the equation by a test function $v$ and integrating over the domain, we instead multiply by $v + \delta \beta\cdot\nabla v$, where $\delta$ is a diff --git a/include/deal.II/matrix_free/fe_evaluation.h b/include/deal.II/matrix_free/fe_evaluation.h index b4c4ab72ff..16559a54b5 100644 --- a/include/deal.II/matrix_free/fe_evaluation.h +++ b/include/deal.II/matrix_free/fe_evaluation.h @@ -6958,7 +6958,7 @@ FEEvaluation point = this->mapping_data->quadrature_points diff --git a/source/grid/grid_generator.cc b/source/grid/grid_generator.cc index 1f7d28dc79..e586f393d5 100644 --- a/source/grid/grid_generator.cc +++ b/source/grid/grid_generator.cc @@ -1160,7 +1160,7 @@ namespace GridGenerator const AdditionalData & additional_data) { MeshGenerator mesh_generator(additional_data); - // Cast the the triangulation to the right type so that the right + // Cast the triangulation to the right type so that the right // specialization of the function create_triangulation is picked up. if (auto parallel_tria = dynamic_cast *>( diff --git a/source/grid/grid_tools.cc b/source/grid/grid_tools.cc index 24b7ec0dfa..3dfb6e99c1 100644 --- a/source/grid/grid_tools.cc +++ b/source/grid/grid_tools.cc @@ -6290,7 +6290,7 @@ namespace GridTools mpi_communicator); AssertThrowMPI(ierr); - // Now computing the the displacement, relative to recvbuf, + // Now computing the displacement, relative to recvbuf, // at which to store the incoming data std::vector rdispls(n_procs); rdispls[0] = 0; diff --git a/source/grid/grid_tools_dof_handlers.cc b/source/grid/grid_tools_dof_handlers.cc index 314ab7bc37..68897f3f02 100644 --- a/source/grid/grid_tools_dof_handlers.cc +++ b/source/grid/grid_tools_dof_handlers.cc @@ -1458,7 +1458,7 @@ namespace GridTools else // If not, it asks for the parent of the cell, until it finds the // parent cell with the refinement level equal to the min_level and - // inserts that parent cell into the the set of uniform_cells, as the + // inserts that parent cell into the set of uniform_cells, as the // set of cells with the coarsest common refinement level. { typename Container::cell_iterator parent = *patch_cell; diff --git a/source/non_matching/mesh_classifier.cc b/source/non_matching/mesh_classifier.cc index c0c92fa64d..236b14022e 100644 --- a/source/non_matching/mesh_classifier.cc +++ b/source/non_matching/mesh_classifier.cc @@ -91,7 +91,7 @@ namespace NonMatching /** * Return the active FE index of the DoFCellAccessor associated with the - * DoFHandler and the the incoming cell in the triangulation. + * DoFHandler and the incoming cell in the triangulation. */ unsigned int active_fe_index(const typename Triangulation::active_cell_iterator diff --git a/tests/hp/hp_line_dof_identities_q_equidistant_multiway.cc b/tests/hp/hp_line_dof_identities_q_equidistant_multiway.cc index 10bca7137b..71f669a654 100644 --- a/tests/hp/hp_line_dof_identities_q_equidistant_multiway.cc +++ b/tests/hp/hp_line_dof_identities_q_equidistant_multiway.cc @@ -17,7 +17,7 @@ // Check FE_Collection::hp_line_dof_identities with multiway // identities for the FE_Q element. For this particular test, we use -// equidistant support points for the the FE_Q element since that adds +// equidistant support points for the FE_Q element since that adds // additional identities between FE_Q(4) and FE_Q(8). diff --git a/tests/hp/hp_quad_dof_identities_q_equidistant_multiway.cc b/tests/hp/hp_quad_dof_identities_q_equidistant_multiway.cc index 4a0f25d5b5..7efcd1af79 100644 --- a/tests/hp/hp_quad_dof_identities_q_equidistant_multiway.cc +++ b/tests/hp/hp_quad_dof_identities_q_equidistant_multiway.cc @@ -17,7 +17,7 @@ // Check FE_Collection::hp_quad_dof_identities with multiway // identities for the FE_Q element. For this particular test, we use -// equidistant support points for the the FE_Q element since that adds +// equidistant support points for the FE_Q element since that adds // additional identities between FE_Q(4) and FE_Q(8). diff --git a/tests/mappings/mapping_points_real_to_unit.cc b/tests/mappings/mapping_points_real_to_unit.cc index 8e7028adc5..2dab9ed9d2 100644 --- a/tests/mappings/mapping_points_real_to_unit.cc +++ b/tests/mappings/mapping_points_real_to_unit.cc @@ -42,7 +42,7 @@ template void test_real_to_unit_cell(const Mapping &mapping) { - // define a boundary that fits the the vertices of the hyper cube we're + // define a boundary that fits the vertices of the hyper cube we're // going to create below SphericalManifold boundary; diff --git a/tests/non_matching/quadrature_generator.cc b/tests/non_matching/quadrature_generator.cc index e98a3cc902..bce9f75af0 100644 --- a/tests/non_matching/quadrature_generator.cc +++ b/tests/non_matching/quadrature_generator.cc @@ -135,7 +135,7 @@ test_constant_level_sets_both_signs() // (0, 0 ,0), (0, 0, l), (0, l, 0), (l, 0, 0), in 3D. // where l is the edge length. // This is a good test because we know that the inside weights should sum to the -// area/volume: $V = l^{dim}/dim!$, and that the the surface weights should sum +// area/volume: $V = l^{dim}/dim!$, and that the surface weights should sum // to $S = \sqrt(2) l$ in 2D and $S = \sqrt(3)/2 l^2$ in 3D. template void diff --git a/tests/particles/step-19.cc b/tests/particles/step-19.cc index 12ee98c62b..5f3088d894 100644 --- a/tests/particles/step-19.cc +++ b/tests/particles/step-19.cc @@ -562,7 +562,7 @@ namespace Step19 // Let us now turn to the functions that deal with particles. The first one // is about the creation of particles. As mentioned in the introduction, - // we want to create a particle at points of the cathode if the the electric + // we want to create a particle at points of the cathode if the electric // field $\mathbf E=\nabla V$ exceeds a certain threshold, i.e., if // $|\mathbf E| \ge E_\text{threshold}$, and if furthermore the electric field // points into the domain (i.e., if $\mathbf E \cdot \mathbf n < 0$). As is -- 2.39.5