https://gcc.gnu.org/g:b1263bca56ea82e555ddccf6729042a25805580c
commit r17-1036-gb1263bca56ea82e555ddccf6729042a25805580c Author: Dhruv Chawla <[email protected]> Date: Thu May 14 09:28:27 2026 +0000 libstdc++: Fix typos in various files Signed-off-by: Dhruv Chawla <[email protected]> libstdc++-v3/ChangeLog: * configure: Regenerate. * acinclude.m4: Fix typos. * configure.ac: Likewise. * doc/doxygen/doxygroups.cc: Likewise. * doc/doxygen/stdheader.cc (init_map): Likewise. * include/bits/basic_string.h: Likewise. * include/bits/chrono.h: Likewise. * include/bits/chrono_io.h: Likewise. * include/bits/cpyfunc_impl.h: Likewise. * include/bits/funcref_impl.h: Likewise. * include/bits/locale_conv.h: Likewise. * include/bits/mofunc_impl.h: Likewise. * include/bits/shared_ptr_base.h: Likewise. * include/bits/simd_details.h: Likewise. * include/bits/stl_algo.h: Likewise. * include/bits/stl_deque.h: Likewise. * include/bits/stl_iterator.h: Likewise. * include/bits/stl_map.h: Likewise. * include/bits/stl_multimap.h: Likewise. * include/bits/stl_multiset.h: Likewise. * include/bits/stl_set.h: Likewise. * include/bits/unicode.h: Likewise. * include/bits/unique_ptr.h: Likewise. * include/bits/version.h: Likewise. * include/experimental/bits/simd.h: Likewise. * include/experimental/bits/simd_fixed_size.h: Likewise. * include/experimental/bits/simd_x86_conversions.h: Likewise. * include/ext/concurrence.h: Likewise. * include/ext/pb_ds/detail/container_base_dispatch.hpp: Likewise. * include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp: Likewise. * include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp: Likewise. * include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp: Likewise. * include/ext/pb_ds/tree_policy.hpp: Likewise. * include/ext/pb_ds/trie_policy.hpp: Likewise. * include/parallel/multiway_merge.h: Likewise. * include/pstl/parallel_backend_tbb.h (__parallel_transform_reduce): Likewise. (class __merge_func): Likewise. (class __stable_sort_func): Likewise. (__parallel_stable_sort): Likewise. * include/tr1/shared_ptr.h: Likewise. * libsupc++/hash_bytes.cc: Likewise. * libsupc++/vmi_class_type_info.cc (__do_find_public_src): Likewise. * src/c++17/fast_float/fast_float.h (struct parse_options): Likewise. (rounds_to_nearest): Likewise. Diff: --- libstdc++-v3/acinclude.m4 | 4 ++-- libstdc++-v3/configure | 6 +++--- libstdc++-v3/configure.ac | 2 +- libstdc++-v3/doc/doxygen/doxygroups.cc | 2 +- libstdc++-v3/doc/doxygen/stdheader.cc | 2 +- libstdc++-v3/include/bits/basic_string.h | 2 +- libstdc++-v3/include/bits/chrono.h | 2 +- libstdc++-v3/include/bits/chrono_io.h | 2 +- libstdc++-v3/include/bits/cpyfunc_impl.h | 2 +- libstdc++-v3/include/bits/funcref_impl.h | 4 ++-- libstdc++-v3/include/bits/locale_conv.h | 2 +- libstdc++-v3/include/bits/mofunc_impl.h | 2 +- libstdc++-v3/include/bits/shared_ptr_base.h | 2 +- libstdc++-v3/include/bits/simd_details.h | 4 ++-- libstdc++-v3/include/bits/stl_algo.h | 4 ++-- libstdc++-v3/include/bits/stl_deque.h | 2 +- libstdc++-v3/include/bits/stl_iterator.h | 2 +- libstdc++-v3/include/bits/stl_map.h | 2 +- libstdc++-v3/include/bits/stl_multimap.h | 2 +- libstdc++-v3/include/bits/stl_multiset.h | 2 +- libstdc++-v3/include/bits/stl_set.h | 2 +- libstdc++-v3/include/bits/unicode.h | 2 +- libstdc++-v3/include/bits/unique_ptr.h | 2 +- libstdc++-v3/include/bits/version.h | 2 +- libstdc++-v3/include/experimental/bits/simd.h | 2 +- libstdc++-v3/include/experimental/bits/simd_fixed_size.h | 2 +- libstdc++-v3/include/experimental/bits/simd_x86_conversions.h | 4 ++-- libstdc++-v3/include/ext/concurrence.h | 2 +- libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp | 4 ++-- .../ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp | 2 +- .../ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp | 2 +- .../ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp | 2 +- libstdc++-v3/include/ext/pb_ds/tree_policy.hpp | 2 +- libstdc++-v3/include/ext/pb_ds/trie_policy.hpp | 4 ++-- libstdc++-v3/include/parallel/multiway_merge.h | 2 +- libstdc++-v3/include/pstl/parallel_backend_tbb.h | 8 ++++---- libstdc++-v3/include/tr1/shared_ptr.h | 2 +- libstdc++-v3/libsupc++/hash_bytes.cc | 2 +- libstdc++-v3/libsupc++/vmi_class_type_info.cc | 2 +- libstdc++-v3/src/c++17/fast_float/fast_float.h | 4 ++-- 40 files changed, 53 insertions(+), 53 deletions(-) diff --git a/libstdc++-v3/acinclude.m4 b/libstdc++-v3/acinclude.m4 index dfdf96cd09d4..13fb32af1e30 100644 --- a/libstdc++-v3/acinclude.m4 +++ b/libstdc++-v3/acinclude.m4 @@ -733,7 +733,7 @@ dnl Assumes cross_compiling bits already done, and with_cross_host in dnl particular. dnl dnl This logic must match gcc/configure.ac's setting of gcc_gxx_include_dir. -dnl config/gxx-include-dir.m4 must be kept consistant with this as well. +dnl config/gxx-include-dir.m4 must be kept consistent with this as well. AC_DEFUN([GLIBCXX_EXPORT_INSTALL_INFO], [ glibcxx_toolexecdir=no glibcxx_toolexeclibdir=no @@ -4026,7 +4026,7 @@ if test x$enable_symvers = xsun ; then *) # Unlikely to work. AC_MSG_WARN([=== You have requested Sun symbol versioning, but]) - AC_MSG_WARN([=== you are not targetting Solaris 2.]) + AC_MSG_WARN([=== you are not targeting Solaris 2.]) AC_MSG_WARN([=== Symbol versioning will be disabled.]) enable_symvers=no ;; diff --git a/libstdc++-v3/configure b/libstdc++-v3/configure index cdc912c79896..7c921ed282a2 100755 --- a/libstdc++-v3/configure +++ b/libstdc++-v3/configure @@ -16201,7 +16201,7 @@ pic_mode='default' postdeps_CXX=`echo " $postdeps_CXX " | sed 's, -lstdc++ ,,g'` # Possibly disable most of the library. -## TODO: Consider skipping unncessary tests altogether in this case, rather +## TODO: Consider skipping unnecessary tests altogether in this case, rather ## than just ignoring the results. Faster /and/ more correct, win win. # Check whether --enable-hosted-libstdcxx was given. @@ -51308,8 +51308,8 @@ if test x$enable_symvers = xsun ; then # Unlikely to work. { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: === You have requested Sun symbol versioning, but" >&5 $as_echo "$as_me: WARNING: === You have requested Sun symbol versioning, but" >&2;} - { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: === you are not targetting Solaris 2." >&5 -$as_echo "$as_me: WARNING: === you are not targetting Solaris 2." >&2;} + { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: === you are not targeting Solaris 2." >&5 +$as_echo "$as_me: WARNING: === you are not targeting Solaris 2." >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: === Symbol versioning will be disabled." >&5 $as_echo "$as_me: WARNING: === Symbol versioning will be disabled." >&2;} enable_symvers=no diff --git a/libstdc++-v3/configure.ac b/libstdc++-v3/configure.ac index f81dccdeef70..2b1a6ff4193f 100644 --- a/libstdc++-v3/configure.ac +++ b/libstdc++-v3/configure.ac @@ -159,7 +159,7 @@ pic_mode='default' postdeps_CXX=`echo " $postdeps_CXX " | sed 's, -lstdc++ ,,g'` # Possibly disable most of the library. -## TODO: Consider skipping unncessary tests altogether in this case, rather +## TODO: Consider skipping unnecessary tests altogether in this case, rather ## than just ignoring the results. Faster /and/ more correct, win win. GLIBCXX_ENABLE_HOSTED diff --git a/libstdc++-v3/doc/doxygen/doxygroups.cc b/libstdc++-v3/doc/doxygen/doxygroups.cc index 00d945ceba00..3a5de2afaea8 100644 --- a/libstdc++-v3/doc/doxygen/doxygroups.cc +++ b/libstdc++-v3/doc/doxygen/doxygroups.cc @@ -47,7 +47,7 @@ * interface. */ /** @namespace __gnu_internal - * @brief GNU implemenation details, not for public use or + * @brief GNU implementation details, not for public use or * export. Used only when anonymous namespaces cannot be substituted. */ /** @namespace std::experimental diff --git a/libstdc++-v3/doc/doxygen/stdheader.cc b/libstdc++-v3/doc/doxygen/stdheader.cc index cb5d17a4f1f7..1920544c9671 100644 --- a/libstdc++-v3/doc/doxygen/stdheader.cc +++ b/libstdc++-v3/doc/doxygen/stdheader.cc @@ -26,7 +26,7 @@ std::map<std::string_view, std::string_view> headers; void init_map() { - // Enter the glamourous world of data entry!! Maintain these! + // Enter the glamorous world of data entry!! Maintain these! // Because the map_header function removes common prefixes and suffixes, // a header "bits/st[dl]_foo.h" will automatically map to "foo" if that // is a standard header, so we don't need to list those cases here. diff --git a/libstdc++-v3/include/bits/basic_string.h b/libstdc++-v3/include/bits/basic_string.h index c1871633f1b5..23e6979f03d7 100644 --- a/libstdc++-v3/include/bits/basic_string.h +++ b/libstdc++-v3/include/bits/basic_string.h @@ -4608,7 +4608,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 #endif // _GLIBCXX_RESOLVE_LIB_DEFECTS - // DR 1261. Insufficent overloads for to_string / to_wstring + // DR 1261. Insufficient overloads for to_string / to_wstring _GLIBCXX_NODISCARD inline string diff --git a/libstdc++-v3/include/bits/chrono.h b/libstdc++-v3/include/bits/chrono.h index d639cfaa4851..cf8e7e84321d 100644 --- a/libstdc++-v3/include/bits/chrono.h +++ b/libstdc++-v3/include/bits/chrono.h @@ -1217,7 +1217,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION // To support the (forward) evolution of the library's defined // clocks, wrap inside inline namespace so that the current - // defintions of system_clock, steady_clock, and + // definitions of system_clock, steady_clock, and // high_resolution_clock types are uniquely mangled. This way, new // code can use the latests clocks, while the library can contain // compatibility definitions for previous versions. At some diff --git a/libstdc++-v3/include/bits/chrono_io.h b/libstdc++-v3/include/bits/chrono_io.h index a8b73f1569e6..f8bb485d165b 100644 --- a/libstdc++-v3/include/bits/chrono_io.h +++ b/libstdc++-v3/include/bits/chrono_io.h @@ -164,7 +164,7 @@ namespace __detail } /// @endcond - /** Return an object that asssociates timezone info with a local time. + /** Return an object that associates timezone info with a local time. * * A `chrono::local_time` object has no timezone associated with it. This * function creates an object that allows formatting a `local_time` as diff --git a/libstdc++-v3/include/bits/cpyfunc_impl.h b/libstdc++-v3/include/bits/cpyfunc_impl.h index 580295a5d635..f293718900b9 100644 --- a/libstdc++-v3/include/bits/cpyfunc_impl.h +++ b/libstdc++-v3/include/bits/cpyfunc_impl.h @@ -170,7 +170,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION copyable_function& operator=(copyable_function&& __x) noexcept { - // Standard requires support of self assigment, by specifying it as + // Standard requires support of self assignment, by specifying it as // copy and swap. if (this != std::addressof(__x)) [[likely]] { diff --git a/libstdc++-v3/include/bits/funcref_impl.h b/libstdc++-v3/include/bits/funcref_impl.h index 9fc8432b42be..db85f173aab9 100644 --- a/libstdc++-v3/include/bits/funcref_impl.h +++ b/libstdc++-v3/include/bits/funcref_impl.h @@ -78,7 +78,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION using _ArgsSignature = _Res(_ArgTypes...) noexcept(_Noex); using _TargetQuals = int _GLIBCXX_MOF_CV&; - // [func.wrap.ref.ctor]/1 is-invokable-using + // [func.wrap.ref.ctor]/1 is-invocable-using template<typename... _Tps> static constexpr bool __is_invocable_using = __conditional_t<_Noex, @@ -101,7 +101,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION requires (!is_same_v<remove_cv_t<_Vt>, function_ref>) && (!is_member_pointer_v<_Vt>) // We deviate from standard by having this condition, that forces - // function references to use _Fn* constructors. This simplies + // function references to use _Fn* constructors. This simplifies // implementation and provide better diagnostic when used in // constant expression (above constructor is not constexpr). && (!is_function_v<_Vt>) diff --git a/libstdc++-v3/include/bits/locale_conv.h b/libstdc++-v3/include/bits/locale_conv.h index 5ef557cc1e1f..1d2f17d3f8e5 100644 --- a/libstdc++-v3/include/bits/locale_conv.h +++ b/libstdc++-v3/include/bits/locale_conv.h @@ -286,7 +286,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 wstring_convert(_Codecvt* __pcvt) : _M_cvt(__pcvt, "wstring_convert") { } - /** Construct with an initial converstion state. + /** Construct with an initial conversion state. * * @param __pcvt The facet to use for conversions. * @param __state Initial conversion state. diff --git a/libstdc++-v3/include/bits/mofunc_impl.h b/libstdc++-v3/include/bits/mofunc_impl.h index 91a78bfca018..15823ab66683 100644 --- a/libstdc++-v3/include/bits/mofunc_impl.h +++ b/libstdc++-v3/include/bits/mofunc_impl.h @@ -162,7 +162,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION move_only_function& operator=(move_only_function&& __x) noexcept { - // Standard requires support of self assigment, by specifying it as + // Standard requires support of self assignment, by specifying it as // copy and swap. if (this != std::addressof(__x)) [[likely]] { diff --git a/libstdc++-v3/include/bits/shared_ptr_base.h b/libstdc++-v3/include/bits/shared_ptr_base.h index 7366f1e04702..88cac4a06f41 100644 --- a/libstdc++-v3/include/bits/shared_ptr_base.h +++ b/libstdc++-v3/include/bits/shared_ptr_base.h @@ -891,7 +891,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION static constexpr size_t _S_tail() { - // The array elemenent type. + // The array element type. using _Tp = typename allocator_traits<_Alloc>::value_type; // The space needed to store a _Sp_counted_array object. diff --git a/libstdc++-v3/include/bits/simd_details.h b/libstdc++-v3/include/bits/simd_details.h index e2002b6de824..fb4edf5b0767 100644 --- a/libstdc++-v3/include/bits/simd_details.h +++ b/libstdc++-v3/include/bits/simd_details.h @@ -284,7 +284,7 @@ namespace simd * * @tparam _Np The number of elements. * @tparam _Nreg The number of registers needed to store @p _Np elements. - * @tparam _Var Determines how complex value-types are layed out and whether mask types use + * @tparam _Var Determines how complex value-types are laid out and whether mask types use * bit-masks or vector-masks. */ template <int _Np, int _Nreg, underlying_type_t<_AbiVariant> _Var> @@ -919,7 +919,7 @@ namespace simd * On IvyBridge, (vec<float> == 0.f) == (rebind_t<int, vec<float>> == 0) does not compile. It does * compile on basically every other target, though. This is due to the difference in ABI tag: * _Abi<8, 1, [...]> vs. _Abi<8, 2, [...]> (8 elements, 1 vs. 2 registers). - * I know how to define this funtion for libstdc++ to avoid interconvertible masks. The question + * I know how to define this function for libstdc++ to avoid interconvertible masks. The question * is whether we can specify this in general for C++29. * * Idea: Is rebind_t<integer-from<...>, mask>::abi_type the same type as diff --git a/libstdc++-v3/include/bits/stl_algo.h b/libstdc++-v3/include/bits/stl_algo.h index adf9b9e0f280..b1a6a10d589e 100644 --- a/libstdc++-v3/include/bits/stl_algo.h +++ b/libstdc++-v3/include/bits/stl_algo.h @@ -479,7 +479,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION * @param __first An input iterator. * @param __last An input iterator. * @param __pred A predicate. - * @return True if the range @p [__first,__last) is partioned by @p __pred, + * @return True if the range @p [__first,__last) is partitioned by @p __pred, * i.e. if all elements that satisfy @p __pred appear before those that * do not. */ @@ -3542,7 +3542,7 @@ _GLIBCXX_END_INLINE_ABI_NAMESPACE(_V2) #pragma GCC diagnostic pop /** - * @brief Checks whether a permutaion of the second sequence is equal + * @brief Checks whether a permutation of the second sequence is equal * to the first sequence. * @ingroup non_mutating_algorithms * @param __first1 Start of first range. diff --git a/libstdc++-v3/include/bits/stl_deque.h b/libstdc++-v3/include/bits/stl_deque.h index 28f61d2ccd37..29a3f1b62896 100644 --- a/libstdc++-v3/include/bits/stl_deque.h +++ b/libstdc++-v3/include/bits/stl_deque.h @@ -1837,7 +1837,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER insert_range(const_iterator __pos, _Rg&& __rg); /** - * @brief Prepend a range at the begining of the deque. + * @brief Prepend a range at the beginning of the deque. * @param __rg A range of values that are convertible to `value_type`. * @since C++23 */ diff --git a/libstdc++-v3/include/bits/stl_iterator.h b/libstdc++-v3/include/bits/stl_iterator.h index ea083543c1d4..747e4a44c274 100644 --- a/libstdc++-v3/include/bits/stl_iterator.h +++ b/libstdc++-v3/include/bits/stl_iterator.h @@ -1744,7 +1744,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION inline _GLIBCXX17_CONSTEXPR bool operator==(const move_iterator<_Iterator>& __x, const move_iterator<_Iterator>& __y) - // N.B. No contraints, x.base() == y.base() is always well-formed. + // N.B. No constraints, x.base() == y.base() is always well-formed. { return __x.base() == __y.base(); } #ifdef __cpp_lib_three_way_comparison diff --git a/libstdc++-v3/include/bits/stl_map.h b/libstdc++-v3/include/bits/stl_map.h index 88a8faab9244..c7d3e9c3b735 100644 --- a/libstdc++-v3/include/bits/stl_map.h +++ b/libstdc++-v3/include/bits/stl_map.h @@ -262,7 +262,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER && _Alloc_traits::_S_always_equal()) : _M_t(std::move(__m._M_t), _Pair_alloc_type(__a)) { } - /// Allocator-extended initialier-list constructor. + /// Allocator-extended initializer-list constructor. map(initializer_list<value_type> __l, const allocator_type& __a) : _M_t(_Pair_alloc_type(__a)) { _M_t._M_insert_range_unique(__l.begin(), __l.end()); } diff --git a/libstdc++-v3/include/bits/stl_multimap.h b/libstdc++-v3/include/bits/stl_multimap.h index 6f4e425d7710..04f54cb16611 100644 --- a/libstdc++-v3/include/bits/stl_multimap.h +++ b/libstdc++-v3/include/bits/stl_multimap.h @@ -253,7 +253,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER && _Alloc_traits::_S_always_equal()) : _M_t(std::move(__m._M_t), _Pair_alloc_type(__a)) { } - /// Allocator-extended initialier-list constructor. + /// Allocator-extended initializer-list constructor. multimap(initializer_list<value_type> __l, const allocator_type& __a) : _M_t(_Pair_alloc_type(__a)) { _M_t._M_insert_range_equal(__l.begin(), __l.end()); } diff --git a/libstdc++-v3/include/bits/stl_multiset.h b/libstdc++-v3/include/bits/stl_multiset.h index 64047ad7631f..3a9f6260e6af 100644 --- a/libstdc++-v3/include/bits/stl_multiset.h +++ b/libstdc++-v3/include/bits/stl_multiset.h @@ -263,7 +263,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER && _Alloc_traits::_S_always_equal()) : _M_t(std::move(__m._M_t), _Key_alloc_type(__a)) { } - /// Allocator-extended initialier-list constructor. + /// Allocator-extended initializer-list constructor. multiset(initializer_list<value_type> __l, const allocator_type& __a) : _M_t(_Key_alloc_type(__a)) { _M_t._M_insert_range_equal(__l.begin(), __l.end()); } diff --git a/libstdc++-v3/include/bits/stl_set.h b/libstdc++-v3/include/bits/stl_set.h index ce35e28cde78..10e45b0be4cf 100644 --- a/libstdc++-v3/include/bits/stl_set.h +++ b/libstdc++-v3/include/bits/stl_set.h @@ -267,7 +267,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER && _Alloc_traits::_S_always_equal()) : _M_t(std::move(__x._M_t), _Key_alloc_type(__a)) { } - /// Allocator-extended initialier-list constructor. + /// Allocator-extended initializer-list constructor. set(initializer_list<value_type> __l, const allocator_type& __a) : _M_t(_Key_alloc_type(__a)) { _M_t._M_insert_range_unique(__l.begin(), __l.end()); } diff --git a/libstdc++-v3/include/bits/unicode.h b/libstdc++-v3/include/bits/unicode.h index 09f7c2d7bfb3..8f414f1091e7 100644 --- a/libstdc++-v3/include/bits/unicode.h +++ b/libstdc++-v3/include/bits/unicode.h @@ -97,7 +97,7 @@ namespace __unicode // read outside those bounds (incrementing or decrementing at the boundary // is erroneously idempotent). // - // On construction, the iterator attemps to decode a single code point from + // On construction, the iterator attempts to decode a single code point from // the input range and then encode it into an internal buffer in the output // format, e.g. if the input is UTF-8 and the output is UTF-16, it might read // three char8_t code units from the input and store two char16_t code units diff --git a/libstdc++-v3/include/bits/unique_ptr.h b/libstdc++-v3/include/bits/unique_ptr.h index f4b2e33d13de..4199496d73b7 100644 --- a/libstdc++-v3/include/bits/unique_ptr.h +++ b/libstdc++-v3/include/bits/unique_ptr.h @@ -1129,7 +1129,7 @@ namespace __detail make_unique(_Args&&...) = delete; #if __cplusplus > 201703L - /** Create a default-initialied object owned by a `unique_ptr`. + /** Create a default-initialized object owned by a `unique_ptr`. * @tparam _Tp A non-array object type. * @returns A `unique_ptr<_Tp>` that owns the new object. * @since C++20 diff --git a/libstdc++-v3/include/bits/version.h b/libstdc++-v3/include/bits/version.h index c31893e34c4e..33eecbfb83b0 100644 --- a/libstdc++-v3/include/bits/version.h +++ b/libstdc++-v3/include/bits/version.h @@ -41,7 +41,7 @@ // // This will generate the FTMs you named, and let you use them in your code as // if it was user code. All macros are also exposed under __glibcxx_NAME even -// if unwanted, to permit bits and other FTMs to depend on them for condtional +// if unwanted, to permit bits and other FTMs to depend on them for conditional // computation without exposing extra FTMs to user code. #ifdef _GLIBCXX_SYSHDR diff --git a/libstdc++-v3/include/experimental/bits/simd.h b/libstdc++-v3/include/experimental/bits/simd.h index ce0867fd8eb8..5b3f622c6ea0 100644 --- a/libstdc++-v3/include/experimental/bits/simd.h +++ b/libstdc++-v3/include/experimental/bits/simd.h @@ -1516,7 +1516,7 @@ template <> template <typename _Tp, size_t _Np, typename = void> struct __vector_type_n {}; -// substition failure for 0-element case +// substitution failure for 0-element case template <typename _Tp> struct __vector_type_n<_Tp, 0, void> {}; diff --git a/libstdc++-v3/include/experimental/bits/simd_fixed_size.h b/libstdc++-v3/include/experimental/bits/simd_fixed_size.h index c0f1ae422f86..40787ef77317 100644 --- a/libstdc++-v3/include/experimental/bits/simd_fixed_size.h +++ b/libstdc++-v3/include/experimental/bits/simd_fixed_size.h @@ -734,7 +734,7 @@ template <typename _Tp, size_t _Np, __to_simd_tuple<_Tp, _Np - _R::_S_first_size, 0>( __fromX...)}; - // ill-formed if some unforseen pattern is needed + // ill-formed if some unforeseen pattern is needed else __assert_unreachable<_Tp>(); } diff --git a/libstdc++-v3/include/experimental/bits/simd_x86_conversions.h b/libstdc++-v3/include/experimental/bits/simd_x86_conversions.h index ee2497fba0c0..d105c22d7a3f 100644 --- a/libstdc++-v3/include/experimental/bits/simd_x86_conversions.h +++ b/libstdc++-v3/include/experimental/bits/simd_x86_conversions.h @@ -1301,7 +1301,7 @@ template <typename _To, typename _V, typename _Traits> // split low 32-bits, because if __hi32 is a small negative // number, the 24-bit mantissa may lose important information if // any of the high 8 bits of __lo32 is set, leading to - // catastrophic cancelation in the FMA + // catastrophic cancellation in the FMA const __m512 __hi16 = _mm512_cvtepu32_ps(_mm512_set1_epi32(0xffff0000u) & __lo32); const __m512 __lo16 @@ -1347,7 +1347,7 @@ template <typename _To, typename _V, typename _Traits> else if constexpr (__f64_to_ibw) //{{{2 { // one-arg __f64_to_ibw goes via _SimdWrapper<int, ?>. The fallback - // would go via two independet conversions to _SimdWrapper<_To> and + // would go via two independent conversions to _SimdWrapper<_To> and // subsequent interleaving. This is better, because f64->__i32 // allows to combine __v0 and __v1 into one register: if constexpr // (__z_to_x || __y_to_x) { diff --git a/libstdc++-v3/include/ext/concurrence.h b/libstdc++-v3/include/ext/concurrence.h index b840bd3a7d73..02ccff552ba8 100644 --- a/libstdc++-v3/include/ext/concurrence.h +++ b/libstdc++-v3/include/ext/concurrence.h @@ -53,7 +53,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION // _S_atomic multi-threaded code using atomic operations. enum _Lock_policy { _S_single, _S_mutex, _S_atomic }; - // Compile time constant that indicates prefered locking policy in + // Compile time constant that indicates preferred locking policy in // the current configuration. _GLIBCXX17_INLINE const _Lock_policy __default_lock_policy = #ifndef __GTHREADS diff --git a/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp b/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp index 551b3b67766a..5c21d062ffa3 100644 --- a/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp +++ b/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp @@ -253,7 +253,7 @@ namespace detail typedef ov_tree_set<Key, null_type, at0t, at1t, _Alloc> type; }; - /// Specialization colision-chaining hash map. + /// Specialization collision-chaining hash map. template<typename Key, typename Mapped, typename _Alloc, typename Policy_Tl> struct container_base_dispatch<Key, Mapped, _Alloc, cc_hash_tag, Policy_Tl> { @@ -275,7 +275,7 @@ namespace detail at3t::value, at4t, at2t> type; }; - /// Specialization colision-chaining hash set. + /// Specialization collision-chaining hash set. template<typename Key, typename _Alloc, typename Policy_Tl> struct container_base_dispatch<Key, null_type, _Alloc, cc_hash_tag, Policy_Tl> diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp index 38afd944397a..db0e99a9c975 100644 --- a/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp +++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp @@ -67,7 +67,7 @@ namespace __gnu_pbds /// Decides whether a metadata object should be moved to the front /// of the list. A list-update based containers object will call /// this method to decide whether to move a node to the front of - /// the list. The method shoule return true if the node should be + /// the list. The method should return true if the node should be /// moved to the front of the list. bool operator()(metadata_reference) const; diff --git a/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp index 78b4bc9ae469..a59206f08fcc 100644 --- a/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp +++ b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp @@ -35,7 +35,7 @@ /** * @file tree_policy/sample_tree_node_update.hpp - * Contains a samle node update functor. + * Contains a sample node update functor. */ #ifndef PB_DS_SAMPLE_TREE_NODE_UPDATOR_HPP diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp index 582aa5846af2..fcf81122fd2e 100644 --- a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp +++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp @@ -35,7 +35,7 @@ /** * @file trie_policy/sample_trie_node_update.hpp - * Contains a samle node update functor. + * Contains a sample node update functor. */ #ifndef PB_DS_SAMPLE_TRIE_NODE_UPDATOR_HPP diff --git a/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp b/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp index c324758552c3..3e399c73d433 100644 --- a/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp +++ b/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp @@ -93,7 +93,7 @@ namespace __gnu_pbds inline iterator find_by_order(size_type); - /// Returns the order of a key within a sequence. For exapmle, if + /// Returns the order of a key within a sequence. For example, if /// r_key is the smallest key, this method will return 0; if r_key /// is a key between the smallest and next key, this method will /// return 1; if r_key is a key larger than the largest key, this diff --git a/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp b/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp index 091fd764c7f0..a08d81251027 100644 --- a/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp +++ b/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp @@ -283,7 +283,7 @@ namespace __gnu_pbds inline iterator find_by_order(size_type); - /// Returns the order of a key within a sequence. For exapmle, if + /// Returns the order of a key within a sequence. For example, if /// r_key is the smallest key, this method will return 0; if r_key /// is a key between the smallest and next key, this method will /// return 1; if r_key is a key larger than the largest key, this @@ -291,7 +291,7 @@ namespace __gnu_pbds inline size_type order_of_key(key_const_reference) const; - /// Returns the order of a prefix within a sequence. For exapmle, + /// Returns the order of a prefix within a sequence. For example, /// if [b, e] is the smallest prefix, this method will return 0; if /// r_key is a key between the smallest and next key, this method /// will return 1; if r_key is a key larger than the largest key, diff --git a/libstdc++-v3/include/parallel/multiway_merge.h b/libstdc++-v3/include/parallel/multiway_merge.h index 5f32b32f4222..65ff6dbbbe13 100644 --- a/libstdc++-v3/include/parallel/multiway_merge.h +++ b/libstdc++-v3/include/parallel/multiway_merge.h @@ -1001,7 +1001,7 @@ namespace __gnu_parallel /** * @brief Stable sorting functor. * - * Used to reduce code instanciation in multiway_merge_sampling_splitting. + * Used to reduce code instantiation in multiway_merge_sampling_splitting. */ template<bool __stable, class _RAIter, class _StrictWeakOrdering> struct _SamplingSorter diff --git a/libstdc++-v3/include/pstl/parallel_backend_tbb.h b/libstdc++-v3/include/pstl/parallel_backend_tbb.h index ff5236f39071..00a8b9fb635c 100644 --- a/libstdc++-v3/include/pstl/parallel_backend_tbb.h +++ b/libstdc++-v3/include/pstl/parallel_backend_tbb.h @@ -205,7 +205,7 @@ __parallel_transform_reduce(__pstl::__internal::__tbb_backend_tag, _ExecutionPol _Up __u, _Tp __init, _Cp __combine, _Rp __brick_reduce) { __tbb_backend::__par_trans_red_body<_Index, _Up, _Tp, _Cp, _Rp> __body(__u, __init, __combine, __brick_reduce); - // The grain size of 3 is used in order to provide mininum 2 elements for each body + // The grain size of 3 is used in order to provide minimum 2 elements for each body tbb::this_task_arena::isolate( [__first, __last, &__body]() { tbb::parallel_reduce(tbb::blocked_range<_Index>(__first, __last, 3), __body); }); return __body.sum(); @@ -740,7 +740,7 @@ class __merge_func _SizeType _M_zs; _Compare _M_comp; _LeafMerge _M_leaf_merge; - _SizeType _M_nsort; //number of elements to be sorted for partial_sort alforithm + _SizeType _M_nsort; //number of elements to be sorted for partial_sort algorithm static const _SizeType __merge_cut_off = _PSTL_MERGE_CUT_OFF; @@ -1114,7 +1114,7 @@ class __stable_sort_func _Compare _M_comp; _LeafSort _M_leaf_sort; bool _M_root; - _SizeType _M_nsort; //zero or number of elements to be sorted for partial_sort alforithm + _SizeType _M_nsort; //zero or number of elements to be sorted for partial_sort algorithm public: __stable_sort_func(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator2 __zs, @@ -1179,7 +1179,7 @@ __parallel_stable_sort(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&& typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _DifferenceType; const _DifferenceType __n = __xe - __xs; if (__nsort == __n) - __nsort = 0; // 'partial_sort' becames 'sort' + __nsort = 0; // 'partial_sort' becomes 'sort' const _DifferenceType __sort_cut_off = _PSTL_STABLE_SORT_CUT_OFF; if (__n > __sort_cut_off) diff --git a/libstdc++-v3/include/tr1/shared_ptr.h b/libstdc++-v3/include/tr1/shared_ptr.h index be04cdd0aa7d..906e258229a2 100644 --- a/libstdc++-v3/include/tr1/shared_ptr.h +++ b/libstdc++-v3/include/tr1/shared_ptr.h @@ -595,7 +595,7 @@ namespace tr1 explicit __shared_ptr(std::auto_ptr<_Tp1>& __r) : _M_ptr(__r.get()), _M_refcount() - { // TODO requries delete __r.release() well-formed + { // TODO requires delete __r.release() well-formed __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) typedef int _IsComplete[sizeof(_Tp1)]; _Tp1* __tmp = __r.get(); diff --git a/libstdc++-v3/libsupc++/hash_bytes.cc b/libstdc++-v3/libsupc++/hash_bytes.cc index e789f661f787..7f3d92496973 100644 --- a/libstdc++-v3/libsupc++/hash_bytes.cc +++ b/libstdc++-v3/libsupc++/hash_bytes.cc @@ -29,7 +29,7 @@ // This file also defines _Fnv_hash_bytes, another primitive with // exactly the same interface but using a different hash algorithm, // Fowler / Noll / Vo (FNV) Hash (type FNV-1a). The Murmur hash -// function apears to be better in both speed and hash quality, and +// function appears to be better in both speed and hash quality, and // FNV is provided primarily for backward compatibility. #include <bits/hash_bytes.h> diff --git a/libstdc++-v3/libsupc++/vmi_class_type_info.cc b/libstdc++-v3/libsupc++/vmi_class_type_info.cc index aabadfd50d28..5b880250991c 100644 --- a/libstdc++-v3/libsupc++/vmi_class_type_info.cc +++ b/libstdc++-v3/libsupc++/vmi_class_type_info.cc @@ -75,7 +75,7 @@ __do_find_public_src (ptrdiff_t src2dst, // to bias any optimizations. To that end we make no particular effort towards // early fail answers or early success answers. Instead we try to minimize // work by filling in things lazily (when we know we need the information), -// and opportunisticly take early success or failure results. +// and opportunistically take early success or failure results. bool __vmi_class_type_info:: __do_dyncast (ptrdiff_t src2dst, __sub_kind access_path, diff --git a/libstdc++-v3/src/c++17/fast_float/fast_float.h b/libstdc++-v3/src/c++17/fast_float/fast_float.h index 3da58f2850ce..6a61defac93c 100644 --- a/libstdc++-v3/src/c++17/fast_float/fast_float.h +++ b/libstdc++-v3/src/c++17/fast_float/fast_float.h @@ -60,7 +60,7 @@ struct parse_options { /** * This function parses the character sequence [first,last) for a number. It parses floating-point numbers expecting - * a locale-indepent format equivalent to what is used by std::strtod in the default ("C") locale. + * a locale-independent format equivalent to what is used by std::strtod in the default ("C") locale. * The resulting floating-point value is the closest floating-point values (using either float or double), * using the "round to even" convention for values that would otherwise fall right in-between two values. * That is, we provide exact parsing according to the IEEE standard. @@ -2924,7 +2924,7 @@ fastfloat_really_inline bool rounds_to_nearest() noexcept { // However, it is expected to be much faster than the fegetround() // function call. // - // The volatile keywoard prevents the compiler from computing the function + // The volatile keyword prevents the compiler from computing the function // at compile-time. // There might be other ways to prevent compile-time optimizations (e.g., asm). // The value does not need to be std::numeric_limits<float>::min(), any small
