diff options
author | Jonathan Wakely <jwakely@redhat.com> | 2021-04-06 15:52:19 +0100 |
---|---|---|
committer | Jonathan Wakely <jwakely@redhat.com> | 2021-04-06 16:43:24 +0100 |
commit | f0b883464c58cb2f3f521776e65008b1fa75f79e (patch) | |
tree | f96b9f14540fad2648f8eb4a174037e93c3b48d0 /libstdc++-v3/include/bits | |
parent | 4bbd51afaa4a3c116fb538d912b35e126be80b41 (diff) |
libstdc++: Fix doxygen markup for group close commands
A change in Doxygen 1.8.16 means that "// @}" is no longer recognized by
Doxygen, so doesn't close a @{ group. A "///" comment needs to be used.
libstdc++-v3/ChangeLog:
* include/bits/atomic_base.h: Fix doxygen group close.
* include/bits/basic_ios.h: Likewise.
* include/bits/forward_list.h: Likewise.
* include/bits/fs_dir.h: Likewise.
* include/bits/fs_ops.h: Likewise.
* include/bits/fs_path.h: Likewise.
* include/bits/functional_hash.h: Likewise.
* include/bits/gslice.h: Likewise.
* include/bits/gslice_array.h: Likewise.
* include/bits/hashtable_policy.h: Likewise.
* include/bits/indirect_array.h: Likewise.
* include/bits/locale_classes.h: Likewise.
* include/bits/locale_facets.h: Likewise.
* include/bits/locale_facets_nonio.h: Likewise.
* include/bits/mask_array.h: Likewise.
* include/bits/refwrap.h: Likewise.
* include/bits/regex.h: Likewise.
* include/bits/regex_automaton.h: Likewise.
* include/bits/regex_compiler.h: Likewise.
* include/bits/regex_constants.h: Likewise.
* include/bits/regex_error.h: Likewise.
* include/bits/regex_executor.h: Likewise.
* include/bits/regex_scanner.h: Likewise.
* include/bits/shared_ptr.h: Likewise.
* include/bits/shared_ptr_atomic.h: Likewise.
* include/bits/shared_ptr_base.h: Likewise.
* include/bits/slice_array.h: Likewise.
* include/bits/specfun.h: Likewise.
* include/bits/std_function.h: Likewise.
* include/bits/std_mutex.h: Likewise.
* include/bits/stl_deque.h: Likewise.
* include/bits/stl_iterator.h: Likewise.
* include/bits/stl_iterator_base_types.h: Likewise.
* include/bits/stl_map.h: Likewise.
* include/bits/stl_multimap.h: Likewise.
* include/bits/stl_multiset.h: Likewise.
* include/bits/stl_numeric.h: Likewise.
* include/bits/stl_pair.h: Likewise.
* include/bits/stl_set.h: Likewise.
* include/bits/stl_uninitialized.h: Likewise.
* include/bits/stream_iterator.h: Likewise.
* include/bits/streambuf_iterator.h: Likewise.
* include/bits/unique_ptr.h: Likewise.
* include/bits/unordered_map.h: Likewise.
* include/bits/unordered_set.h: Likewise.
* include/decimal/decimal: Likewise.
* include/experimental/any: Likewise.
* include/experimental/array: Likewise.
* include/experimental/bits/fs_dir.h: Likewise.
* include/experimental/bits/fs_fwd.h: Likewise.
* include/experimental/bits/fs_ops.h: Likewise.
* include/experimental/bits/fs_path.h: Likewise.
* include/experimental/buffer: Likewise.
* include/experimental/internet: Likewise.
* include/experimental/optional: Likewise.
* include/experimental/propagate_const: Likewise.
* include/experimental/socket: Likewise.
* include/ext/pb_ds/assoc_container.hpp: Likewise.
* include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp:
Likewise.
* include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp: Likewise.
* include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp: Likewise.
* include/ext/pb_ds/detail/types_traits.hpp: Likewise.
* include/ext/pb_ds/exception.hpp: Likewise.
* include/ext/pb_ds/priority_queue.hpp: Likewise.
* include/ext/pb_ds/tag_and_trait.hpp: Likewise.
* include/ext/random: Likewise.
* include/std/any: Likewise.
* include/std/atomic: Likewise.
* include/std/bitset: Likewise.
* include/std/chrono: Likewise.
* include/std/complex: Likewise.
* include/std/condition_variable: Likewise.
* include/std/fstream: Likewise.
* include/std/future: Likewise.
* include/std/iostream: Likewise.
* include/std/istream: Likewise.
* include/std/mutex: Likewise.
* include/std/numeric: Likewise.
* include/std/ostream: Likewise.
* include/std/ratio: Likewise.
* include/std/shared_mutex: Likewise.
* include/std/stdexcept: Likewise.
* include/std/streambuf: Likewise.
* include/std/system_error: Likewise.
* include/std/thread: Likewise.
* include/std/valarray: Likewise.
* include/std/variant: Likewise.
* include/tr1/cmath: Likewise.
* include/tr1/regex: Likewise.
* include/tr2/dynamic_bitset: Likewise.
* libsupc++/atomic_lockfree_defines.h: Likewise.
* libsupc++/exception: Likewise.
* libsupc++/exception.h: Likewise.
* libsupc++/exception_ptr.h: Likewise.
* libsupc++/nested_exception.h: Likewise.
libstdc++-v3/ChangeLog:
* include/tr1/regex:
Diffstat (limited to 'libstdc++-v3/include/bits')
45 files changed, 317 insertions, 317 deletions
diff --git a/libstdc++-v3/include/bits/atomic_base.h b/libstdc++-v3/include/bits/atomic_base.h index 2dc00676054..b75f61138a7 100644 --- a/libstdc++-v3/include/bits/atomic_base.h +++ b/libstdc++-v3/include/bits/atomic_base.h @@ -1942,7 +1942,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION #endif // C++2a - // @} group atomics + /// @} group atomics _GLIBCXX_END_NAMESPACE_VERSION } // namespace std diff --git a/libstdc++-v3/include/bits/basic_ios.h b/libstdc++-v3/include/bits/basic_ios.h index 45ff73ca724..aac59ac2c15 100644 --- a/libstdc++-v3/include/bits/basic_ios.h +++ b/libstdc++-v3/include/bits/basic_ios.h @@ -67,7 +67,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION class basic_ios : public ios_base { public: - //@{ + ///@{ /** * These are standard types. They permit a standardized way of * referring to names of (or names dependent on) the template @@ -78,9 +78,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION typedef typename _Traits::pos_type pos_type; typedef typename _Traits::off_type off_type; typedef _Traits traits_type; - //@} + ///@} - //@{ + ///@{ /** * These are non-standard types. */ @@ -89,7 +89,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION __num_put_type; typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > __num_get_type; - //@} + ///@} // Data members: protected: @@ -106,7 +106,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION const __num_get_type* _M_num_get; public: - //@{ + ///@{ /** * @brief The quick-and-easy status check. * @@ -124,7 +124,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION bool operator!() const { return this->fail(); } - //@} + ///@} /** * @brief Returns the error state of the stream buffer. diff --git a/libstdc++-v3/include/bits/forward_list.h b/libstdc++-v3/include/bits/forward_list.h index f5291136682..e61746848f6 100644 --- a/libstdc++-v3/include/bits/forward_list.h +++ b/libstdc++-v3/include/bits/forward_list.h @@ -1152,7 +1152,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER splice_after(const_iterator __pos, forward_list&, const_iterator __before, const_iterator __last) noexcept { _M_splice_after(__pos, __before, __last); } - // @} + /// @} private: #if __cplusplus > 201703L diff --git a/libstdc++-v3/include/bits/fs_dir.h b/libstdc++-v3/include/bits/fs_dir.h index 16546e3f15f..2674ca6b115 100644 --- a/libstdc++-v3/include/bits/fs_dir.h +++ b/libstdc++-v3/include/bits/fs_dir.h @@ -455,7 +455,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 inline directory_iterator end(directory_iterator) noexcept { return directory_iterator(); } - // @} + /// @} /// Iterator type for recursively traversing a directory hierarchy. class recursive_directory_iterator @@ -553,11 +553,11 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 inline recursive_directory_iterator end(recursive_directory_iterator) noexcept { return recursive_directory_iterator(); } - // @} + /// @} _GLIBCXX_END_NAMESPACE_CXX11 - // @} group filesystem + /// @} group filesystem } // namespace filesystem // Use explicit instantiations of these types. Any inconsistency in the diff --git a/libstdc++-v3/include/bits/fs_ops.h b/libstdc++-v3/include/bits/fs_ops.h index 78e110e1b07..a3851335f34 100644 --- a/libstdc++-v3/include/bits/fs_ops.h +++ b/libstdc++-v3/include/bits/fs_ops.h @@ -302,7 +302,7 @@ namespace filesystem path weakly_canonical(const path& __p); path weakly_canonical(const path& __p, error_code& __ec); - // @} group filesystem + /// @} group filesystem } // namespace filesystem _GLIBCXX_END_NAMESPACE_VERSION diff --git a/libstdc++-v3/include/bits/fs_path.h b/libstdc++-v3/include/bits/fs_path.h index 1645c53cf53..ad2518f414c 100644 --- a/libstdc++-v3/include/bits/fs_path.h +++ b/libstdc++-v3/include/bits/fs_path.h @@ -1330,7 +1330,7 @@ namespace __detail return _M_at_end == __rhs._M_at_end; } - // @} group filesystem + /// @} group filesystem _GLIBCXX_END_NAMESPACE_CXX11 } // namespace filesystem diff --git a/libstdc++-v3/include/bits/functional_hash.h b/libstdc++-v3/include/bits/functional_hash.h index ac1d7e2979e..7be8ebfa2d3 100644 --- a/libstdc++-v3/include/bits/functional_hash.h +++ b/libstdc++-v3/include/bits/functional_hash.h @@ -270,7 +270,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION }; #endif - // @} group hashes + /// @} group hashes // Hint about performance of hash functor. If not fast the hash-based // containers will cache the hash code. diff --git a/libstdc++-v3/include/bits/gslice.h b/libstdc++-v3/include/bits/gslice.h index ded39f210ae..ae2052bd355 100644 --- a/libstdc++-v3/include/bits/gslice.h +++ b/libstdc++-v3/include/bits/gslice.h @@ -177,7 +177,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION return *this; } - // @} group numeric_arrays + /// @} group numeric_arrays _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/gslice_array.h b/libstdc++-v3/include/bits/gslice_array.h index 3bbfa6e08d0..4f3309d842e 100644 --- a/libstdc++-v3/include/bits/gslice_array.h +++ b/libstdc++-v3/include/bits/gslice_array.h @@ -215,7 +215,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right) #undef _DEFINE_VALARRAY_OPERATOR - // @} group numeric_arrays + /// @} group numeric_arrays _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/hashtable_policy.h b/libstdc++-v3/include/bits/hashtable_policy.h index 90797f8dbda..ad8a4ec5f07 100644 --- a/libstdc++-v3/include/bits/hashtable_policy.h +++ b/libstdc++-v3/include/bits/hashtable_policy.h @@ -1939,7 +1939,7 @@ namespace __detail __buckets_alloc_traits::deallocate(__alloc, __ptr, __bkt_count); } - //@} hashtable-detail + ///@} hashtable-detail } // namespace __detail _GLIBCXX_END_NAMESPACE_VERSION } // namespace std diff --git a/libstdc++-v3/include/bits/indirect_array.h b/libstdc++-v3/include/bits/indirect_array.h index f097e0c84d4..a3dc6059988 100644 --- a/libstdc++-v3/include/bits/indirect_array.h +++ b/libstdc++-v3/include/bits/indirect_array.h @@ -204,7 +204,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right) #undef _DEFINE_VALARRAY_OPERATOR - // @} group numeric_arrays + /// @} group numeric_arrays _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/locale_classes.h b/libstdc++-v3/include/bits/locale_classes.h index b619f2abbc3..f939fddb24e 100644 --- a/libstdc++-v3/include/bits/locale_classes.h +++ b/libstdc++-v3/include/bits/locale_classes.h @@ -85,7 +85,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION template<typename _Cache> friend struct __use_cache; - //@{ + ///@{ /** * @brief Category values. * @@ -104,7 +104,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION static const category messages = 1L << 5; static const category all = (ctype | numeric | collate | time | monetary | messages); - //@} + ///@} // Construct/copy/destroy: @@ -649,11 +649,11 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef basic_string<_CharT> string_type; - //@} + ///@} protected: // Underlying "C" library locale information saved from @@ -822,11 +822,11 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION class _GLIBCXX_NAMESPACE_CXX11 collate_byname : public collate<_CharT> { public: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef basic_string<_CharT> string_type; - //@} + ///@} explicit collate_byname(const char* __s, size_t __refs = 0) diff --git a/libstdc++-v3/include/bits/locale_facets.h b/libstdc++-v3/include/bits/locale_facets.h index a322556e378..03724cf7d68 100644 --- a/libstdc++-v3/include/bits/locale_facets.h +++ b/libstdc++-v3/include/bits/locale_facets.h @@ -1674,11 +1674,11 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef basic_string<_CharT> string_type; - //@} + ///@} typedef __numpunct_cache<_CharT> __cache_type; protected: @@ -1956,11 +1956,11 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef _InIter iter_type; - //@} + ///@} /// Numpunct facet id. static locale::id id; @@ -2003,7 +2003,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL ios_base::iostate& __err, bool& __v) const { return this->do_get(__in, __end, __io, __err, __v); } - //@{ + ///@{ /** * @brief Numeric parsing. * @@ -2066,9 +2066,9 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL ios_base::iostate& __err, unsigned long long& __v) const { return this->do_get(__in, __end, __io, __err, __v); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Numeric parsing. * @@ -2109,7 +2109,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const { return this->do_get(__in, __end, __io, __err, __v); } - //@} + ///@} /** * @brief Numeric parsing. @@ -2196,7 +2196,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL return __ret; } - //@{ + ///@{ /** * @brief Numeric parsing. * @@ -2290,7 +2290,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long double&) const; #endif - //@} + ///@} }; template<typename _CharT, typename _InIter> @@ -2314,11 +2314,11 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef _OutIter iter_type; - //@} + ///@} /// Numpunct facet id. static locale::id id; @@ -2352,7 +2352,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const { return this->do_put(__s, __io, __fill, __v); } - //@{ + ///@{ /** * @brief Numeric formatting. * @@ -2409,9 +2409,9 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL unsigned long long __v) const { return this->do_put(__s, __io, __fill, __v); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Numeric formatting. * @@ -2461,7 +2461,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL put(iter_type __s, ios_base& __io, char_type __fill, long double __v) const { return this->do_put(__s, __io, __fill, __v); } - //@} + ///@} /** * @brief Numeric formatting. @@ -2512,7 +2512,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL virtual ~num_put() { } - //@{ + ///@{ /** * @brief Numeric formatting. * @@ -2577,7 +2577,7 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL virtual iter_type do_put(iter_type, ios_base&, char_type, long double) const; #endif - //@} + ///@} }; template <typename _CharT, typename _OutIter> diff --git a/libstdc++-v3/include/bits/locale_facets_nonio.h b/libstdc++-v3/include/bits/locale_facets_nonio.h index 7814663114c..e518df9f4b6 100644 --- a/libstdc++-v3/include/bits/locale_facets_nonio.h +++ b/libstdc++-v3/include/bits/locale_facets_nonio.h @@ -369,11 +369,11 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef _InIter iter_type; - //@} + ///@} /// Numpunct facet id. static locale::id id; @@ -798,11 +798,11 @@ _GLIBCXX_END_NAMESPACE_CXX11 { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef _OutIter iter_type; - //@} + ///@} /// Numpunct facet id. static locale::id id; @@ -1025,11 +1025,11 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef basic_string<_CharT> string_type; - //@} + ///@} typedef __moneypunct_cache<_CharT, _Intl> __cache_type; private: @@ -1201,7 +1201,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 frac_digits() const { return this->do_frac_digits(); } - //@{ + ///@{ /** * @brief Return pattern for money values. * @@ -1240,7 +1240,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 pattern neg_format() const { return this->do_neg_format(); } - //@} + ///@} protected: /// Destructor. @@ -1469,12 +1469,12 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL_OR_CXX11 { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef _InIter iter_type; typedef basic_string<_CharT> string_type; - //@} + ///@} /// Numpunct facet id. static locale::id id; @@ -1629,12 +1629,12 @@ _GLIBCXX_BEGIN_NAMESPACE_LDBL_OR_CXX11 class money_put : public locale::facet { public: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef _OutIter iter_type; typedef basic_string<_CharT> string_type; - //@} + ///@} /// Numpunct facet id. static locale::id id; @@ -1816,11 +1816,11 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 { public: // Types: - //@{ + ///@{ /// Public typedefs typedef _CharT char_type; typedef basic_string<_CharT> string_type; - //@} + ///@} protected: // Underlying "C" library locale information saved from diff --git a/libstdc++-v3/include/bits/mask_array.h b/libstdc++-v3/include/bits/mask_array.h index 360dddce317..3889bd151a6 100644 --- a/libstdc++-v3/include/bits/mask_array.h +++ b/libstdc++-v3/include/bits/mask_array.h @@ -205,7 +205,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right) #undef _DEFINE_VALARRAY_OPERATOR - // @} group numeric_arrays + /// @} group numeric_arrays _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/refwrap.h b/libstdc++-v3/include/bits/refwrap.h index f445c3df7d6..adfbe214693 100644 --- a/libstdc++-v3/include/bits/refwrap.h +++ b/libstdc++-v3/include/bits/refwrap.h @@ -391,7 +391,7 @@ _GLIBCXX_MEM_FN_TRAITS(&& noexcept, false_type, true_type) cref(reference_wrapper<_Tp> __t) noexcept { return { __t.get() }; } - // @} + /// @} _GLIBCXX_END_NAMESPACE_VERSION } // namespace std diff --git a/libstdc++-v3/include/bits/regex.h b/libstdc++-v3/include/bits/regex.h index 4d53c63a875..4d331c82e74 100644 --- a/libstdc++-v3/include/bits/regex.h +++ b/libstdc++-v3/include/bits/regex.h @@ -403,7 +403,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 * @name Constants * std [28.8.1](1) */ - //@{ + ///@{ static constexpr flag_type icase = regex_constants::icase; static constexpr flag_type nosubs = regex_constants::nosubs; static constexpr flag_type optimize = regex_constants::optimize; @@ -414,7 +414,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 static constexpr flag_type awk = regex_constants::awk; static constexpr flag_type grep = regex_constants::grep; static constexpr flag_type egrep = regex_constants::egrep; - //@} + ///@} // [7.8.2] construct/copy/destroy /** @@ -941,7 +941,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 int compare(const value_type* __s) const { return this->_M_str().compare(__s); } - // @} + /// @} /// @cond undocumented // Non-standard, used by comparison operators @@ -1650,7 +1650,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 const sub_match<_Bi_iter>& __m) { return __os << __m.str(); } - // @} relates sub_match + /// @} relates sub_match // [7.10] Class template match_results @@ -1704,7 +1704,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 /** * @name 28.10 Public Types */ - //@{ + ///@{ typedef sub_match<_Bi_iter> value_type; typedef const value_type& const_reference; typedef value_type& reference; @@ -1715,13 +1715,13 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 typedef _Alloc allocator_type; typedef typename __iter_traits::value_type char_type; typedef std::basic_string<char_type> string_type; - //@} + ///@} public: /** * @name 28.10.1 Construction, Copying, and Destruction */ - //@{ + ///@{ /** * @brief Constructs a default %match_results container. @@ -1765,7 +1765,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 */ ~match_results() = default; - //@} + ///@} // 28.10.2, state: /** @@ -1778,7 +1778,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 /** * @name 28.10.2 Size */ - //@{ + ///@{ /** * @brief Gets the number of matches and submatches. @@ -1806,12 +1806,12 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 empty() const noexcept { return size() == 0; } - //@} + ///@} /** * @name 28.10.4 Element Access */ - //@{ + ///@{ /** * @brief Gets the length of the indicated submatch. @@ -1931,7 +1931,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 cend() const noexcept { return this->end(); } - //@} + ///@} /** * @name 28.10.5 Formatting @@ -1941,7 +1941,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 * escape sequences accepted by these functions are determined by * their @p flags parameter as documented above. */ - //@{ + ///@{ /** * @pre ready() == true @@ -1992,12 +1992,12 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 return __result; } - //@} + ///@} /** * @name 28.10.6 Allocator */ - //@{ + ///@{ /** * @brief Gets a copy of the allocator. @@ -2006,12 +2006,12 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 get_allocator() const noexcept { return _Base_type::get_allocator(); } - //@} + ///@} /** * @name 28.10.7 Swap */ - //@{ + ///@{ /** * @brief Swaps the contents of two match_results. @@ -2023,7 +2023,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 _Base_type::swap(__that); swap(_M_begin, __that._M_begin); } - //@} + ///@} private: template<typename, typename, typename> @@ -2150,7 +2150,7 @@ _GLIBCXX_END_NAMESPACE_CXX11 /** * @name Matching, Searching, and Replacing */ - //@{ + ///@{ /** * @brief Determines if there is a match between the regular expression @p e @@ -2612,7 +2612,7 @@ _GLIBCXX_END_NAMESPACE_CXX11 return __result; } - //@} + ///@} _GLIBCXX_BEGIN_NAMESPACE_CXX11 @@ -2975,7 +2975,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11 typedef regex_token_iterator<wstring::const_iterator> wsregex_token_iterator; #endif - //@} // group regex + ///@} // group regex _GLIBCXX_END_NAMESPACE_CXX11 _GLIBCXX_END_NAMESPACE_VERSION diff --git a/libstdc++-v3/include/bits/regex_automaton.h b/libstdc++-v3/include/bits/regex_automaton.h index 58cc22659ed..872a17fe8cb 100644 --- a/libstdc++-v3/include/bits/regex_automaton.h +++ b/libstdc++-v3/include/bits/regex_automaton.h @@ -392,7 +392,7 @@ namespace __detail _StateIdT _M_end; }; - //@} regex-detail + ///@} regex-detail } // namespace __detail _GLIBCXX_END_NAMESPACE_VERSION diff --git a/libstdc++-v3/include/bits/regex_compiler.h b/libstdc++-v3/include/bits/regex_compiler.h index d0a927a7574..bf7dcc54dba 100644 --- a/libstdc++-v3/include/bits/regex_compiler.h +++ b/libstdc++-v3/include/bits/regex_compiler.h @@ -552,7 +552,7 @@ namespace __detail #endif }; - //@} regex-detail + ///@} regex-detail } // namespace __detail _GLIBCXX_END_NAMESPACE_VERSION } // namespace std diff --git a/libstdc++-v3/include/bits/regex_constants.h b/libstdc++-v3/include/bits/regex_constants.h index 616bd0b887f..340421a5abd 100644 --- a/libstdc++-v3/include/bits/regex_constants.h +++ b/libstdc++-v3/include/bits/regex_constants.h @@ -50,7 +50,7 @@ namespace regex_constants /** * @name 5.1 Regular Expression Syntax Options */ - //@{ + ///@{ enum __syntax_option { _S_icase, @@ -216,7 +216,7 @@ namespace regex_constants operator^=(syntax_option_type& __a, syntax_option_type __b) { return __a = __a ^ __b; } - //@} + ///@} /** * @name 5.2 Matching Rules @@ -227,7 +227,7 @@ namespace regex_constants * below for any bitmask elements set. * */ - //@{ + ///@{ enum __match_flag { @@ -407,7 +407,7 @@ namespace regex_constants operator^=(match_flag_type& __a, match_flag_type __b) { return __a = __a ^ __b; } - //@} + ///@} } // namespace regex_constants /* @} */ // group regex diff --git a/libstdc++-v3/include/bits/regex_error.h b/libstdc++-v3/include/bits/regex_error.h index 8b85ce707d4..27593833544 100644 --- a/libstdc++-v3/include/bits/regex_error.h +++ b/libstdc++-v3/include/bits/regex_error.h @@ -44,7 +44,7 @@ namespace regex_constants /** * @name 5.3 Error Types */ - //@{ + ///@{ enum error_type { @@ -119,7 +119,7 @@ namespace regex_constants */ constexpr error_type error_stack(_S_error_stack); - //@} + ///@} } // namespace regex_constants // [7.8] Class regex_error @@ -161,7 +161,7 @@ namespace regex_constants friend void __throw_regex_error(regex_constants::error_type, const char*); }; - //@} // group regex + ///@} // group regex void __throw_regex_error(regex_constants::error_type __ecode); diff --git a/libstdc++-v3/include/bits/regex_executor.h b/libstdc++-v3/include/bits/regex_executor.h index 26c90285da7..4a641eeee6c 100644 --- a/libstdc++-v3/include/bits/regex_executor.h +++ b/libstdc++-v3/include/bits/regex_executor.h @@ -250,7 +250,7 @@ namespace __detail bool _M_has_sol; }; - //@} regex-detail + ///@} regex-detail } // namespace __detail _GLIBCXX_END_NAMESPACE_VERSION } // namespace std diff --git a/libstdc++-v3/include/bits/regex_scanner.h b/libstdc++-v3/include/bits/regex_scanner.h index c6c52dcf73e..e810fa7dd31 100644 --- a/libstdc++-v3/include/bits/regex_scanner.h +++ b/libstdc++-v3/include/bits/regex_scanner.h @@ -264,7 +264,7 @@ namespace __detail void (_Scanner::* _M_eat_escape)(); }; - //@} regex-detail + ///@} regex-detail } // namespace __detail _GLIBCXX_END_NAMESPACE_VERSION } // namespace std diff --git a/libstdc++-v3/include/bits/shared_ptr.h b/libstdc++-v3/include/bits/shared_ptr.h index cbcd2d46fb4..ac4aa20b794 100644 --- a/libstdc++-v3/include/bits/shared_ptr.h +++ b/libstdc++-v3/include/bits/shared_ptr.h @@ -662,7 +662,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION #endif // C++20 #endif // C++17 - // @} + /// @} /** * @brief A non-owning observer for a pointer owned by a shared_ptr @@ -889,8 +889,8 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION } }; - // @} relates shared_ptr - // @} group pointer_abstractions + /// @} relates shared_ptr + /// @} group pointer_abstractions #if __cplusplus >= 201703L namespace __detail::__variant diff --git a/libstdc++-v3/include/bits/shared_ptr_atomic.h b/libstdc++-v3/include/bits/shared_ptr_atomic.h index 9a7aaba4f85..6e94d83c46d 100644 --- a/libstdc++-v3/include/bits/shared_ptr_atomic.h +++ b/libstdc++-v3/include/bits/shared_ptr_atomic.h @@ -87,7 +87,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION atomic_is_lock_free(const shared_ptr<_Tp>* __p) { return std::atomic_is_lock_free<_Tp, __default_lock_policy>(__p); } - // @} + /// @} /** * @brief Atomic load for shared_ptr objects. @@ -123,7 +123,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION inline __shared_ptr<_Tp, _Lp> atomic_load(const __shared_ptr<_Tp, _Lp>* __p) { return std::atomic_load_explicit(__p, memory_order_seq_cst); } - // @} + /// @} /** * @brief Atomic store for shared_ptr objects. @@ -162,7 +162,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION inline void atomic_store(__shared_ptr<_Tp, _Lp>* __p, __shared_ptr<_Tp, _Lp> __r) { std::atomic_store_explicit(__p, std::move(__r), memory_order_seq_cst); } - // @} + /// @} /** * @brief Atomic exchange for shared_ptr objects. @@ -207,7 +207,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION return std::atomic_exchange_explicit(__p, std::move(__r), memory_order_seq_cst); } - // @} + /// @} /** * @brief Atomic compare-and-swap for shared_ptr objects. @@ -325,10 +325,10 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION return std::atomic_compare_exchange_weak_explicit(__p, __v, std::move(__w), memory_order_seq_cst, memory_order_seq_cst); } - // @} + /// @} - // @} relates shared_ptr - // @} group pointer_abstractions + /// @} relates shared_ptr + /// @} group pointer_abstractions _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/shared_ptr_base.h b/libstdc++-v3/include/bits/shared_ptr_base.h index b24900b2008..8766b61fd81 100644 --- a/libstdc++-v3/include/bits/shared_ptr_base.h +++ b/libstdc++-v3/include/bits/shared_ptr_base.h @@ -1328,7 +1328,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION bool owner_before(__weak_ptr<_Tp1, _Lp> const& __rhs) const noexcept { return _M_refcount._M_less(__rhs._M_refcount); } - // @} + /// @} protected: // This constructor is non-standard, it is used by allocate_shared. diff --git a/libstdc++-v3/include/bits/slice_array.h b/libstdc++-v3/include/bits/slice_array.h index 7fcc77db657..bdced19e789 100644 --- a/libstdc++-v3/include/bits/slice_array.h +++ b/libstdc++-v3/include/bits/slice_array.h @@ -276,7 +276,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right) #undef _DEFINE_VALARRAY_OPERATOR - // @} group numeric_arrays + /// @} group numeric_arrays _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/specfun.h b/libstdc++-v3/include/bits/specfun.h index 97ebc300110..513ec3c24cd 100644 --- a/libstdc++-v3/include/bits/specfun.h +++ b/libstdc++-v3/include/bits/specfun.h @@ -1196,7 +1196,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION return __detail::__sph_neumann<__type>(__n, __x); } - // @} group mathsf + /// @} group mathsf _GLIBCXX_END_NAMESPACE_VERSION } // namespace std @@ -1380,7 +1380,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION return std::__detail::__hyperg<__type>(__a, __b, __c, __x); } - // @} + /// @} _GLIBCXX_END_NAMESPACE_VERSION } // namespace __gnu_cxx #endif // __STRICT_ANSI__ diff --git a/libstdc++-v3/include/bits/std_function.h b/libstdc++-v3/include/bits/std_function.h index 2cd5d5bcceb..31eba2b822c 100644 --- a/libstdc++-v3/include/bits/std_function.h +++ b/libstdc++-v3/include/bits/std_function.h @@ -630,7 +630,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION } return nullptr; } - // @} + /// @} private: using _Invoker_type = _Res (*)(const _Any_data&, _ArgTypes&&...); diff --git a/libstdc++-v3/include/bits/std_mutex.h b/libstdc++-v3/include/bits/std_mutex.h index 3a394601868..357c6891438 100644 --- a/libstdc++-v3/include/bits/std_mutex.h +++ b/libstdc++-v3/include/bits/std_mutex.h @@ -241,7 +241,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION mutex_type& _M_device; }; - // @} group mutexes + /// @} group mutexes _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif // C++11 diff --git a/libstdc++-v3/include/bits/stl_deque.h b/libstdc++-v3/include/bits/stl_deque.h index 8bba7a3740f..20c73b4fc3c 100644 --- a/libstdc++-v3/include/bits/stl_deque.h +++ b/libstdc++-v3/include/bits/stl_deque.h @@ -1838,7 +1838,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER } // called by the second initialize_dispatch above - //@{ + ///@{ /** * @brief Fills the deque with whatever is in [first,last). * @param __first An input iterator. @@ -1859,7 +1859,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER void _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag); - //@} + ///@} /** * @brief Fills the %deque with copies of value. @@ -1943,7 +1943,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER } } - //@{ + ///@{ /// Helper functions for push_* and pop_*. #if __cplusplus < 201103L void _M_push_back_aux(const value_type&); @@ -1960,7 +1960,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER void _M_pop_back_aux(); void _M_pop_front_aux(); - //@} + ///@} // Internal insert functions follow. The *_aux functions do the actual // insertion work when all shortcuts fail. @@ -2083,7 +2083,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER _M_shrink_to_fit(); #endif - //@{ + ///@{ /// Memory-handling helpers for the previous internal insert functions. iterator _M_reserve_elements_at_front(size_type __n) @@ -2110,10 +2110,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER void _M_new_elements_at_back(size_type __new_elements); - //@} + ///@} - //@{ + ///@{ /** * @brief Memory-handling helpers for the major %map. * @@ -2139,7 +2139,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER void _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front); - //@} + ///@} #if __cplusplus >= 201103L // Constant-time, nothrow move assignment when source object's memory diff --git a/libstdc++-v3/include/bits/stl_iterator.h b/libstdc++-v3/include/bits/stl_iterator.h index ac8a7c4b1a8..dc8b101e8f8 100644 --- a/libstdc++-v3/include/bits/stl_iterator.h +++ b/libstdc++-v3/include/bits/stl_iterator.h @@ -400,7 +400,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { return __t.operator->(); } }; - //@{ + ///@{ /** * @param __x A %reverse_iterator. * @param __y A %reverse_iterator. @@ -535,7 +535,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION const reverse_iterator<_IteratorR>& __y) { return __y.base() <=> __x.base(); } #endif // C++20 - //@} + ///@} #if __cplusplus < 201103L template<typename _Iterator> @@ -964,7 +964,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { return insert_iterator<_Container>(__x, __i); } #endif - // @} group iterators + /// @} group iterators _GLIBCXX_END_NAMESPACE_VERSION } // namespace @@ -2245,7 +2245,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION }; #endif // C++20 - // @} group iterators + /// @} group iterators template<typename _Iterator> auto diff --git a/libstdc++-v3/include/bits/stl_iterator_base_types.h b/libstdc++-v3/include/bits/stl_iterator_base_types.h index a2de9725901..71cf41f866d 100644 --- a/libstdc++-v3/include/bits/stl_iterator_base_types.h +++ b/libstdc++-v3/include/bits/stl_iterator_base_types.h @@ -79,7 +79,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION * @defgroup iterators Iterators * Abstractions for uniform iterating through various underlying types. */ - //@{ + ///@{ /** * @defgroup iterator_tags Iterator Tags @@ -88,7 +88,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION * are. Different underlying algorithms can then be used based on the * different operations supported by different iterator types. */ - //@{ + ///@{ /// Marking input iterators. struct input_iterator_tag { }; @@ -110,7 +110,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION /// Contiguous iterators point to objects stored contiguously in memory. struct contiguous_iterator_tag : public random_access_iterator_tag { }; #endif - //@} + ///@} /** * @brief Common %iterator class. @@ -238,7 +238,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION __iterator_category(const _Iter&) { return typename iterator_traits<_Iter>::iterator_category(); } - //@} + ///@} #if __cplusplus >= 201103L template<typename _Iter> diff --git a/libstdc++-v3/include/bits/stl_map.h b/libstdc++-v3/include/bits/stl_map.h index d55fc6b8335..535dbeb745a 100644 --- a/libstdc++-v3/include/bits/stl_map.h +++ b/libstdc++-v3/include/bits/stl_map.h @@ -816,7 +816,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER insert(_Pair&& __x) { return _M_t._M_emplace_unique(std::forward<_Pair>(__x)); } #endif - // @} + /// @} #if __cplusplus >= 201103L /** @@ -878,7 +878,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER std::forward<_Pair>(__x)); } #endif - // @} + /// @} /** * @brief Template function that attempts to insert a range of elements. @@ -1036,7 +1036,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator erase(iterator __position) { return _M_t.erase(__position); } - // @} + /// @} #else /** * @brief Erases an element from a %map. @@ -1152,7 +1152,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // [23.3.1.3] map operations - //@{ + ///@{ /** * @brief Tries to locate an element in a %map. * @param __x Key of (key, value) %pair to be located. @@ -1175,9 +1175,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER find(const _Kt& __x) -> decltype(_M_t._M_find_tr(__x)) { return _M_t._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Tries to locate an element in a %map. * @param __x Key of (key, value) %pair to be located. @@ -1200,9 +1200,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER find(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x)) { return _M_t._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the number of elements with given key. * @param __x Key of (key, value) pairs to be located. @@ -1221,10 +1221,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER count(const _Kt& __x) const -> decltype(_M_t._M_count_tr(__x)) { return _M_t._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of (key, value) pairs to be located. @@ -1239,10 +1239,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x), void(), true) { return _M_t._M_find_tr(__x) != _M_t.end(); } - //@} + ///@} #endif - //@{ + ///@{ /** * @brief Finds the beginning of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -1265,9 +1265,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) { return iterator(_M_t._M_lower_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the beginning of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -1290,9 +1290,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x))) { return const_iterator(_M_t._M_lower_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the end of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -1310,9 +1310,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) { return iterator(_M_t._M_upper_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the end of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -1330,9 +1330,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x))) { return const_iterator(_M_t._M_upper_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key of (key, value) pairs to be located. @@ -1359,9 +1359,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x))) { return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key of (key, value) pairs to be located. @@ -1392,7 +1392,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER _M_t._M_equal_range_tr(__x)); } #endif - //@} + ///@} template<typename _K1, typename _T1, typename _C1, typename _A1> friend bool diff --git a/libstdc++-v3/include/bits/stl_multimap.h b/libstdc++-v3/include/bits/stl_multimap.h index 524b0d8b3d3..8157981d0bc 100644 --- a/libstdc++-v3/include/bits/stl_multimap.h +++ b/libstdc++-v3/include/bits/stl_multimap.h @@ -551,7 +551,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER insert(_Pair&& __x) { return _M_t._M_emplace_equal(std::forward<_Pair>(__x)); } #endif - // @} + /// @} /** * @brief Inserts a std::pair into the %multimap. @@ -597,7 +597,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER std::forward<_Pair>(__x)); } #endif - // @} + /// @} /** * @brief A template function that attempts to insert a range @@ -707,7 +707,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator erase(iterator __position) { return _M_t.erase(__position); } - // @} + /// @} #else /** * @brief Erases an element from a %multimap. @@ -827,7 +827,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // multimap operations - //@{ + ///@{ /** * @brief Tries to locate an element in a %multimap. * @param __x Key of (key, value) pair to be located. @@ -849,9 +849,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER find(const _Kt& __x) -> decltype(_M_t._M_find_tr(__x)) { return _M_t._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Tries to locate an element in a %multimap. * @param __x Key of (key, value) pair to be located. @@ -873,9 +873,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER find(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x)) { return _M_t._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the number of elements with given key. * @param __x Key of (key, value) pairs to be located. @@ -891,10 +891,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER count(const _Kt& __x) const -> decltype(_M_t._M_count_tr(__x)) { return _M_t._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of (key, value) pairs to be located. @@ -909,10 +909,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x), void(), true) { return _M_t._M_find_tr(__x) != _M_t.end(); } - //@} + ///@} #endif - //@{ + ///@{ /** * @brief Finds the beginning of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -935,9 +935,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) { return iterator(_M_t._M_lower_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the beginning of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -960,9 +960,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x))) { return const_iterator(_M_t._M_lower_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the end of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -980,9 +980,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) { return iterator(_M_t._M_upper_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the end of a subsequence matching given key. * @param __x Key of (key, value) pair to be located. @@ -1000,9 +1000,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x))) { return const_iterator(_M_t._M_upper_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key of (key, value) pairs to be located. @@ -1027,9 +1027,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x))) { return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key of (key, value) pairs to be located. @@ -1058,7 +1058,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER _M_t._M_equal_range_tr(__x)); } #endif - //@} + ///@} template<typename _K1, typename _T1, typename _C1, typename _A1> friend bool diff --git a/libstdc++-v3/include/bits/stl_multiset.h b/libstdc++-v3/include/bits/stl_multiset.h index 633e71ec3d6..ef987600733 100644 --- a/libstdc++-v3/include/bits/stl_multiset.h +++ b/libstdc++-v3/include/bits/stl_multiset.h @@ -720,7 +720,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // multiset operations: - //@{ + ///@{ /** * @brief Finds the number of elements with given key. * @param __x Key of elements to be located. @@ -736,10 +736,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER count(const _Kt& __x) const -> decltype(_M_t._M_count_tr(__x)) { return _M_t._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of elements to be located. @@ -754,12 +754,12 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x), void(), true) { return _M_t._M_find_tr(__x) != _M_t.end(); } - //@} + ///@} #endif // _GLIBCXX_RESOLVE_LIB_DEFECTS // 214. set::find() missing const overload - //@{ + ///@{ /** * @brief Tries to locate an element in a %set. * @param __x Element to be located. @@ -792,9 +792,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator{_M_t._M_find_tr(__x)}) { return const_iterator{_M_t._M_find_tr(__x)}; } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the beginning of a subsequence matching given key. * @param __x Key to be located. @@ -827,9 +827,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) { return iterator(_M_t._M_lower_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the end of a subsequence matching given key. * @param __x Key to be located. @@ -857,9 +857,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) { return iterator(_M_t._M_upper_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key to be located. @@ -896,7 +896,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x))) { return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); } #endif - //@} + ///@} template<typename _K1, typename _C1, typename _A1> friend bool diff --git a/libstdc++-v3/include/bits/stl_numeric.h b/libstdc++-v3/include/bits/stl_numeric.h index b419ac2a1b8..24aba081e05 100644 --- a/libstdc++-v3/include/bits/stl_numeric.h +++ b/libstdc++-v3/include/bits/stl_numeric.h @@ -403,7 +403,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO return ++__result; } - // @} group numeric_ops + /// @} group numeric_ops #undef _GLIBCXX_MOVE_IF_20 diff --git a/libstdc++-v3/include/bits/stl_pair.h b/libstdc++-v3/include/bits/stl_pair.h index 6c993e15c93..70262f9508f 100644 --- a/libstdc++-v3/include/bits/stl_pair.h +++ b/libstdc++-v3/include/bits/stl_pair.h @@ -542,7 +542,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION #endif #endif // __cplusplus >= 201103L - // @} relates pair + /// @} relates pair /** * @brief A convenience wrapper for creating a pair from two objects. diff --git a/libstdc++-v3/include/bits/stl_set.h b/libstdc++-v3/include/bits/stl_set.h index 66ff0051c28..a9b9695bca8 100644 --- a/libstdc++-v3/include/bits/stl_set.h +++ b/libstdc++-v3/include/bits/stl_set.h @@ -115,14 +115,14 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER public: // typedefs: - //@{ + ///@{ /// Public typedefs. typedef _Key key_type; typedef _Key value_type; typedef _Compare key_compare; typedef _Compare value_compare; typedef _Alloc allocator_type; - //@} + ///@} private: typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template @@ -135,7 +135,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef __gnu_cxx::__alloc_traits<_Key_alloc_type> _Alloc_traits; public: - //@{ + ///@{ /// Iterator-related typedefs. typedef typename _Alloc_traits::pointer pointer; typedef typename _Alloc_traits::const_pointer const_pointer; @@ -150,7 +150,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; typedef typename _Rep_type::size_type size_type; typedef typename _Rep_type::difference_type difference_type; - //@} + ///@} #if __cplusplus > 201402L using node_type = typename _Rep_type::node_type; @@ -735,7 +735,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // set operations: - //@{ + ///@{ /** * @brief Finds the number of elements. * @param __x Element to located. @@ -755,10 +755,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_t._M_count_tr(__x)) { return _M_t._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of elements to be located. @@ -773,12 +773,12 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x), void(), true) { return _M_t._M_find_tr(__x) != _M_t.end(); } - //@} + ///@} #endif // _GLIBCXX_RESOLVE_LIB_DEFECTS // 214. set::find() missing const overload - //@{ + ///@{ /** * @brief Tries to locate an element in a %set. * @param __x Element to be located. @@ -811,9 +811,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator{_M_t._M_find_tr(__x)}) { return const_iterator{_M_t._M_find_tr(__x)}; } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the beginning of a subsequence matching given key. * @param __x Key to be located. @@ -846,9 +846,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x))) { return const_iterator(_M_t._M_lower_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the end of a subsequence matching given key. * @param __x Key to be located. @@ -876,9 +876,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) { return const_iterator(_M_t._M_upper_bound_tr(__x)); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key to be located. @@ -915,7 +915,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x))) { return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); } #endif - //@} + ///@} template<typename _K1, typename _C1, typename _A1> friend bool diff --git a/libstdc++-v3/include/bits/stl_uninitialized.h b/libstdc++-v3/include/bits/stl_uninitialized.h index ace83000b20..f7b24818fc4 100644 --- a/libstdc++-v3/include/bits/stl_uninitialized.h +++ b/libstdc++-v3/include/bits/stl_uninitialized.h @@ -1051,7 +1051,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION /// @endcond #endif - // @} group memory + /// @} group memory _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/stream_iterator.h b/libstdc++-v3/include/bits/stream_iterator.h index f4ee8ef5208..fd8920b8d01 100644 --- a/libstdc++-v3/include/bits/stream_iterator.h +++ b/libstdc++-v3/include/bits/stream_iterator.h @@ -177,7 +177,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION : public iterator<output_iterator_tag, void, void, void, void> { public: - //@{ + ///@{ /// Public typedef #if __cplusplus > 201703L using difference_type = ptrdiff_t; @@ -185,7 +185,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION typedef _CharT char_type; typedef _Traits traits_type; typedef basic_ostream<_CharT, _Traits> ostream_type; - //@} + ///@} private: ostream_type* _M_stream; @@ -249,7 +249,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { return *this; } }; - // @} group iterators + /// @} group iterators _GLIBCXX_END_NAMESPACE_VERSION } // namespace diff --git a/libstdc++-v3/include/bits/streambuf_iterator.h b/libstdc++-v3/include/bits/streambuf_iterator.h index ace7673af9b..22af3fd5995 100644 --- a/libstdc++-v3/include/bits/streambuf_iterator.h +++ b/libstdc++-v3/include/bits/streambuf_iterator.h @@ -53,7 +53,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { public: // Types: - //@{ + ///@{ /// Public typedefs #if __cplusplus < 201103L typedef _CharT& reference; // Changed to _CharT by LWG 445 @@ -68,7 +68,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION typedef typename _Traits::int_type int_type; typedef basic_streambuf<_CharT, _Traits> streambuf_type; typedef basic_istream<_CharT, _Traits> istream_type; - //@} + ///@} template<typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, @@ -240,7 +240,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { public: // Types: - //@{ + ///@{ /// Public typedefs #if __cplusplus > 201703L using difference_type = ptrdiff_t; @@ -249,7 +249,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION typedef _Traits traits_type; typedef basic_streambuf<_CharT, _Traits> streambuf_type; typedef basic_ostream<_CharT, _Traits> ostream_type; - //@} + ///@} template<typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, diff --git a/libstdc++-v3/include/bits/unique_ptr.h b/libstdc++-v3/include/bits/unique_ptr.h index 805ad76c233..6e5537536e8 100644 --- a/libstdc++-v3/include/bits/unique_ptr.h +++ b/libstdc++-v3/include/bits/unique_ptr.h @@ -906,7 +906,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION return compare_three_way()(__x.get(), static_cast<pointer>(nullptr)); } #endif - // @} relates unique_ptr + /// @} relates unique_ptr /// @cond undocumented template<typename _Up, typename _Ptr = typename _Up::pointer, @@ -991,7 +991,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION make_unique_for_overwrite(_Args&&...) = delete; #endif // C++20 - // @} relates unique_ptr + /// @} relates unique_ptr #endif // C++14 #if __cplusplus > 201703L && __cpp_concepts @@ -1009,7 +1009,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION } #endif // C++20 - // @} group pointer_abstractions + /// @} group pointer_abstractions #if __cplusplus >= 201703L namespace __detail::__variant diff --git a/libstdc++-v3/include/bits/unordered_map.h b/libstdc++-v3/include/bits/unordered_map.h index d617d2d923d..2261e6685ea 100644 --- a/libstdc++-v3/include/bits/unordered_map.h +++ b/libstdc++-v3/include/bits/unordered_map.h @@ -106,7 +106,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER public: // typedefs: - //@{ + ///@{ /// Public typedefs. typedef typename _Hashtable::key_type key_type; typedef typename _Hashtable::value_type value_type; @@ -114,9 +114,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Hashtable::hasher hasher; typedef typename _Hashtable::key_equal key_equal; typedef typename _Hashtable::allocator_type allocator_type; - //@} + ///@} - //@{ + ///@{ /// Iterator-related typedefs. typedef typename _Hashtable::pointer pointer; typedef typename _Hashtable::const_pointer const_pointer; @@ -128,7 +128,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Hashtable::const_local_iterator const_local_iterator; typedef typename _Hashtable::size_type size_type; typedef typename _Hashtable::difference_type difference_type; - //@} + ///@} #if __cplusplus > 201402L using node_type = typename _Hashtable::node_type; @@ -325,7 +325,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER begin() noexcept { return _M_h.begin(); } - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points to the first * element in the %unordered_map. @@ -337,7 +337,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator cbegin() const noexcept { return _M_h.begin(); } - //@} + ///@} /** * Returns a read/write iterator that points one past the last element in @@ -347,7 +347,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER end() noexcept { return _M_h.end(); } - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points one past the last * element in the %unordered_map. @@ -359,7 +359,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator cend() const noexcept { return _M_h.end(); } - //@} + ///@} // modifiers. @@ -529,7 +529,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER } #endif // C++17 - //@{ + ///@{ /** * @brief Attempts to insert a std::pair into the %unordered_map. @@ -562,9 +562,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER pair<iterator, bool>> insert(_Pair&& __x) { return _M_h.emplace(std::forward<_Pair>(__x)); } - //@} + ///@} - //@{ + ///@{ /** * @brief Attempts to insert a std::pair into the %unordered_map. * @param __hint An iterator that serves as a hint as to where the @@ -600,7 +600,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator> insert(const_iterator __hint, _Pair&& __x) { return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); } - //@} + ///@} /** * @brief A template function that attempts to insert a range of @@ -722,7 +722,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER } #endif - //@{ + ///@{ /** * @brief Erases an element from an %unordered_map. * @param __position An iterator pointing to the element to be erased. @@ -744,7 +744,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator erase(iterator __position) { return _M_h.erase(__position); } - //@} + ///@} /** * @brief Erases elements according to the provided key. @@ -852,7 +852,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // lookup. - //@{ + ///@{ /** * @brief Tries to locate an element in an %unordered_map. * @param __x Key to be located. @@ -885,9 +885,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER find(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x)) { return _M_h._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the number of elements. * @param __x Key to count. @@ -907,10 +907,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER count(const _Kt& __x) const -> decltype(_M_h._M_count_tr(__x)) { return _M_h._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of elements to be located. @@ -925,10 +925,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x), void(), true) { return _M_h._M_find_tr(__x) != _M_h.end(); } - //@} + ///@} #endif - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key to be located. @@ -960,9 +960,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_equal_range_tr(__x)) { return _M_h._M_equal_range_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Subscript ( @c [] ) access to %unordered_map data. * @param __k The key for which data should be retrieved. @@ -982,9 +982,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER mapped_type& operator[](key_type&& __k) { return _M_h[std::move(__k)]; } - //@} + ///@} - //@{ + ///@{ /** * @brief Access to %unordered_map data. * @param __k The key for which data should be retrieved. @@ -999,7 +999,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const mapped_type& at(const key_type& __k) const { return _M_h.at(__k); } - //@} + ///@} // bucket interface. @@ -1041,7 +1041,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER begin(size_type __n) { return _M_h.begin(__n); } - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to the first * bucket element. @@ -1055,7 +1055,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cbegin(size_type __n) const { return _M_h.cbegin(__n); } - //@} + ///@} /** * @brief Returns a read/write iterator pointing to one past the last @@ -1067,7 +1067,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER end(size_type __n) { return _M_h.end(__n); } - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to one past * the last bucket elements. @@ -1081,7 +1081,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cend(size_type __n) const { return _M_h.cend(__n); } - //@} + ///@} // hash policy. @@ -1249,7 +1249,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER public: // typedefs: - //@{ + ///@{ /// Public typedefs. typedef typename _Hashtable::key_type key_type; typedef typename _Hashtable::value_type value_type; @@ -1257,9 +1257,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Hashtable::hasher hasher; typedef typename _Hashtable::key_equal key_equal; typedef typename _Hashtable::allocator_type allocator_type; - //@} + ///@} - //@{ + ///@{ /// Iterator-related typedefs. typedef typename _Hashtable::pointer pointer; typedef typename _Hashtable::const_pointer const_pointer; @@ -1271,7 +1271,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Hashtable::const_local_iterator const_local_iterator; typedef typename _Hashtable::size_type size_type; typedef typename _Hashtable::difference_type difference_type; - //@} + ///@} #if __cplusplus > 201402L using node_type = typename _Hashtable::node_type; @@ -1467,7 +1467,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER begin() noexcept { return _M_h.begin(); } - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points to the first * element in the %unordered_multimap. @@ -1479,7 +1479,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator cbegin() const noexcept { return _M_h.begin(); } - //@} + ///@} /** * Returns a read/write iterator that points one past the last element in @@ -1489,7 +1489,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER end() noexcept { return _M_h.end(); } - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points one past the last * element in the %unordered_multimap. @@ -1501,7 +1501,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator cend() const noexcept { return _M_h.end(); } - //@} + ///@} // modifiers. @@ -1552,7 +1552,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER emplace_hint(const_iterator __pos, _Args&&... __args) { return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); } - //@{ + ///@{ /** * @brief Inserts a std::pair into the %unordered_multimap. * @param __x Pair to be inserted (see std::make_pair for easy @@ -1574,9 +1574,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator> insert(_Pair&& __x) { return _M_h.emplace(std::forward<_Pair>(__x)); } - //@} + ///@} - //@{ + ///@{ /** * @brief Inserts a std::pair into the %unordered_multimap. * @param __hint An iterator that serves as a hint as to where the @@ -1610,7 +1610,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator> insert(const_iterator __hint, _Pair&& __x) { return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); } - //@} + ///@} /** * @brief A template function that attempts to insert a range of @@ -1663,7 +1663,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER { return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); } #endif // C++17 - //@{ + ///@{ /** * @brief Erases an element from an %unordered_multimap. * @param __position An iterator pointing to the element to be erased. @@ -1685,7 +1685,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator erase(iterator __position) { return _M_h.erase(__position); } - //@} + ///@} /** * @brief Erases elements according to the provided key. @@ -1795,7 +1795,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // lookup. - //@{ + ///@{ /** * @brief Tries to locate an element in an %unordered_multimap. * @param __x Key to be located. @@ -1828,9 +1828,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER find(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x)) { return _M_h._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the number of elements. * @param __x Key to count. @@ -1846,10 +1846,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER count(const _Kt& __x) const -> decltype(_M_h._M_count_tr(__x)) { return _M_h._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of elements to be located. @@ -1864,10 +1864,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x), void(), true) { return _M_h._M_find_tr(__x) != _M_h.end(); } - //@} + ///@} #endif - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key to be located. @@ -1897,7 +1897,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_equal_range_tr(__x)) { return _M_h._M_equal_range_tr(__x); } #endif - //@} + ///@} // bucket interface. @@ -1939,7 +1939,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER begin(size_type __n) { return _M_h.begin(__n); } - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to the first * bucket element. @@ -1953,7 +1953,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cbegin(size_type __n) const { return _M_h.cbegin(__n); } - //@} + ///@} /** * @brief Returns a read/write iterator pointing to one past the last @@ -1965,7 +1965,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER end(size_type __n) { return _M_h.end(__n); } - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to one past * the last bucket elements. @@ -1979,7 +1979,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cend(size_type __n) const { return _M_h.cend(__n); } - //@} + ///@} // hash policy. diff --git a/libstdc++-v3/include/bits/unordered_set.h b/libstdc++-v3/include/bits/unordered_set.h index 63c1a7efd8a..ac4a890d25a 100644 --- a/libstdc++-v3/include/bits/unordered_set.h +++ b/libstdc++-v3/include/bits/unordered_set.h @@ -101,16 +101,16 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER public: // typedefs: - //@{ + ///@{ /// Public typedefs. typedef typename _Hashtable::key_type key_type; typedef typename _Hashtable::value_type value_type; typedef typename _Hashtable::hasher hasher; typedef typename _Hashtable::key_equal key_equal; typedef typename _Hashtable::allocator_type allocator_type; - //@} + ///@} - //@{ + ///@{ /// Iterator-related typedefs. typedef typename _Hashtable::pointer pointer; typedef typename _Hashtable::const_pointer const_pointer; @@ -122,7 +122,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Hashtable::const_local_iterator const_local_iterator; typedef typename _Hashtable::size_type size_type; typedef typename _Hashtable::difference_type difference_type; - //@} + ///@} #if __cplusplus > 201402L using node_type = typename _Hashtable::node_type; @@ -311,7 +311,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // iterators. - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points to the first * element in the %unordered_set. @@ -323,9 +323,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator begin() const noexcept { return _M_h.begin(); } - //@} + ///@} - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points one past the last * element in the %unordered_set. @@ -337,7 +337,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator end() const noexcept { return _M_h.end(); } - //@} + ///@} /** * Returns a read-only (constant) iterator that points to the first @@ -403,7 +403,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER emplace_hint(const_iterator __pos, _Args&&... __args) { return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); } - //@{ + ///@{ /** * @brief Attempts to insert an element into the %unordered_set. * @param __x Element to be inserted. @@ -424,9 +424,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER std::pair<iterator, bool> insert(value_type&& __x) { return _M_h.insert(std::move(__x)); } - //@} + ///@} - //@{ + ///@{ /** * @brief Attempts to insert an element into the %unordered_set. * @param __hint An iterator that serves as a hint as to where the @@ -453,7 +453,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator insert(const_iterator __hint, value_type&& __x) { return _M_h.insert(__hint, std::move(__x)); } - //@} + ///@} /** * @brief A template function that attempts to insert a range of @@ -505,7 +505,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER { return _M_h._M_reinsert_node(std::move(__nh)).position; } #endif // C++17 - //@{ + ///@{ /** * @brief Erases an element from an %unordered_set. * @param __position An iterator pointing to the element to be erased. @@ -527,7 +527,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator erase(iterator __position) { return _M_h.erase(__position); } - //@} + ///@} /** * @brief Erases elements according to the provided key. @@ -634,7 +634,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // lookup. - //@{ + ///@{ /** * @brief Tries to locate an element in an %unordered_set. * @param __x Element to be located. @@ -669,9 +669,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_find_tr(__k)) { return _M_h._M_find_tr(__k); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the number of elements. * @param __x Element to located. @@ -692,10 +692,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_count_tr(__k)) { return _M_h._M_count_tr(__k); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of elements to be located. @@ -710,10 +710,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __k) const -> decltype(_M_h._M_find_tr(__k), void(), true) { return _M_h._M_find_tr(__k) != _M_h.end(); } - //@} + ///@} #endif - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key to be located. @@ -745,7 +745,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_equal_range_tr(__k)) { return _M_h._M_equal_range_tr(__k); } #endif - //@} + ///@} // bucket interface. @@ -777,7 +777,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER bucket(const key_type& __key) const { return _M_h.bucket(__key); } - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to the first * bucket element. @@ -795,9 +795,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cbegin(size_type __n) const { return _M_h.cbegin(__n); } - //@} + ///@} - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to one past * the last bucket elements. @@ -815,7 +815,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cend(size_type __n) const { return _M_h.cend(__n); } - //@} + ///@} // hash policy. @@ -967,16 +967,16 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER public: // typedefs: - //@{ + ///@{ /// Public typedefs. typedef typename _Hashtable::key_type key_type; typedef typename _Hashtable::value_type value_type; typedef typename _Hashtable::hasher hasher; typedef typename _Hashtable::key_equal key_equal; typedef typename _Hashtable::allocator_type allocator_type; - //@} + ///@} - //@{ + ///@{ /// Iterator-related typedefs. typedef typename _Hashtable::pointer pointer; typedef typename _Hashtable::const_pointer const_pointer; @@ -988,7 +988,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER typedef typename _Hashtable::const_local_iterator const_local_iterator; typedef typename _Hashtable::size_type size_type; typedef typename _Hashtable::difference_type difference_type; - //@} + ///@} #if __cplusplus > 201402L using node_type = typename _Hashtable::node_type; @@ -1176,7 +1176,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // iterators. - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points to the first * element in the %unordered_multiset. @@ -1188,9 +1188,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator begin() const noexcept { return _M_h.begin(); } - //@} + ///@} - //@{ + ///@{ /** * Returns a read-only (constant) iterator that points one past the last * element in the %unordered_multiset. @@ -1202,7 +1202,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_iterator end() const noexcept { return _M_h.end(); } - //@} + ///@} /** * Returns a read-only (constant) iterator that points to the first @@ -1256,7 +1256,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER emplace_hint(const_iterator __pos, _Args&&... __args) { return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); } - //@{ + ///@{ /** * @brief Inserts an element into the %unordered_multiset. * @param __x Element to be inserted. @@ -1271,9 +1271,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator insert(value_type&& __x) { return _M_h.insert(std::move(__x)); } - //@} + ///@} - //@{ + ///@{ /** * @brief Inserts an element into the %unordered_multiset. * @param __hint An iterator that serves as a hint as to where the @@ -1297,7 +1297,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator insert(const_iterator __hint, value_type&& __x) { return _M_h.insert(__hint, std::move(__x)); } - //@} + ///@} /** * @brief A template function that inserts a range of elements. @@ -1348,7 +1348,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER { return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); } #endif // C++17 - //@{ + ///@{ /** * @brief Erases an element from an %unordered_multiset. * @param __position An iterator pointing to the element to be erased. @@ -1371,7 +1371,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER iterator erase(iterator __position) { return _M_h.erase(__position); } - //@} + ///@} /** @@ -1484,7 +1484,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // lookup. - //@{ + ///@{ /** * @brief Tries to locate an element in an %unordered_multiset. * @param __x Element to be located. @@ -1519,9 +1519,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_find_tr(__x)) { return _M_h._M_find_tr(__x); } #endif - //@} + ///@} - //@{ + ///@{ /** * @brief Finds the number of elements. * @param __x Element to located. @@ -1537,10 +1537,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER count(const _Kt& __x) const -> decltype(_M_h._M_count_tr(__x)) { return _M_h._M_count_tr(__x); } #endif - //@} + ///@} #if __cplusplus > 201703L - //@{ + ///@{ /** * @brief Finds whether an element with the given key exists. * @param __x Key of elements to be located. @@ -1555,10 +1555,10 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER contains(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x), void(), true) { return _M_h._M_find_tr(__x) != _M_h.end(); } - //@} + ///@} #endif - //@{ + ///@{ /** * @brief Finds a subsequence matching given key. * @param __x Key to be located. @@ -1588,7 +1588,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER -> decltype(_M_h._M_equal_range_tr(__x)) { return _M_h._M_equal_range_tr(__x); } #endif - //@} + ///@} // bucket interface. @@ -1620,7 +1620,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER bucket(const key_type& __key) const { return _M_h.bucket(__key); } - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to the first * bucket element. @@ -1638,9 +1638,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cbegin(size_type __n) const { return _M_h.cbegin(__n); } - //@} + ///@} - //@{ + ///@{ /** * @brief Returns a read-only (constant) iterator pointing to one past * the last bucket elements. @@ -1658,7 +1658,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER const_local_iterator cend(size_type __n) const { return _M_h.cend(__n); } - //@} + ///@} // hash policy. |