OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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:
This commit is contained in:
Jonathan Wakely 2021-04-06 15:52:19 +01:00
parent 4bbd51afaa
commit f0b883464c
95 changed files with 522 additions and 520 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
libstdc++-v3/include/bits/atomic_base.h
View File

@ -1942,7 +1942,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
#endif // C++2a
// @} group atomics
/// @} group atomics
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

12
libstdc++-v3/include/bits/basic_ios.h
View File

@ -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.

2
libstdc++-v3/include/bits/forward_list.h
View File

@ -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

6
libstdc++-v3/include/bits/fs_dir.h
View File

@ -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

2
libstdc++-v3/include/bits/fs_ops.h
View File

@ -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

2
libstdc++-v3/include/bits/fs_path.h
View File

@ -1330,7 +1330,7 @@ namespace __detail
return _M_at_end == __rhs._M_at_end;
}
// @} group filesystem
/// @} group filesystem
_GLIBCXX_END_NAMESPACE_CXX11
} // namespace filesystem

2
libstdc++-v3/include/bits/functional_hash.h
View File

@ -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.

2
libstdc++-v3/include/bits/gslice.h
View File

@ -177,7 +177,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this;
}
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/bits/gslice_array.h
View File

@ -215,7 +215,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right)
#undef _DEFINE_VALARRAY_OPERATOR
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/bits/hashtable_policy.h
View File

@ -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

2
libstdc++-v3/include/bits/indirect_array.h
View File

@ -204,7 +204,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right)
#undef _DEFINE_VALARRAY_OPERATOR
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

12
libstdc++-v3/include/bits/locale_classes.h
View File

@ -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)

36
libstdc++-v3/include/bits/locale_facets.h
View File

@ -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>

28
libstdc++-v3/include/bits/locale_facets_nonio.h
View File

@ -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

2
libstdc++-v3/include/bits/mask_array.h
View File

@ -205,7 +205,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right)
#undef _DEFINE_VALARRAY_OPERATOR
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/bits/refwrap.h
View File

@ -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

42
libstdc++-v3/include/bits/regex.h
View File

@ -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

2
libstdc++-v3/include/bits/regex_automaton.h
View File

@ -392,7 +392,7 @@ namespace __detail
_StateIdT _M_end;
};
//@} regex-detail
///@} regex-detail
} // namespace __detail
_GLIBCXX_END_NAMESPACE_VERSION

2
libstdc++-v3/include/bits/regex_compiler.h
View File

@ -552,7 +552,7 @@ namespace __detail
#endif
};
//@} regex-detail
///@} regex-detail
} // namespace __detail
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

8
libstdc++-v3/include/bits/regex_constants.h
View File

@ -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

6
libstdc++-v3/include/bits/regex_error.h
View File

@ -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);

2
libstdc++-v3/include/bits/regex_executor.h
View File

@ -250,7 +250,7 @@ namespace __detail
bool _M_has_sol;
};
//@} regex-detail
///@} regex-detail
} // namespace __detail
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

2
libstdc++-v3/include/bits/regex_scanner.h
View File

@ -264,7 +264,7 @@ namespace __detail
void (_Scanner::* _M_eat_escape)();
};
//@} regex-detail
///@} regex-detail
} // namespace __detail
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

6
libstdc++-v3/include/bits/shared_ptr.h
View File

@ -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

14
libstdc++-v3/include/bits/shared_ptr_atomic.h
View File

@ -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

2
libstdc++-v3/include/bits/shared_ptr_base.h
View File

@ -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.

2
libstdc++-v3/include/bits/slice_array.h
View File

@ -276,7 +276,7 @@ _DEFINE_VALARRAY_OPERATOR(>>, __shift_right)
#undef _DEFINE_VALARRAY_OPERATOR
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

4
libstdc++-v3/include/bits/specfun.h
View File

@ -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__

2
libstdc++-v3/include/bits/std_function.h
View File

@ -630,7 +630,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
}
return nullptr;
}
// @}
/// @}
private:
using _Invoker_type = _Res (*)(const _Any_data&, _ArgTypes&&...);

2
libstdc++-v3/include/bits/std_mutex.h
View File

@ -241,7 +241,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
mutex_type& _M_device;
};
// @} group mutexes
/// @} group mutexes
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace
#endif // C++11

16
libstdc++-v3/include/bits/stl_deque.h
View File

@ -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

8
libstdc++-v3/include/bits/stl_iterator.h
View File

@ -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

8
libstdc++-v3/include/bits/stl_iterator_base_types.h
View File

@ -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>

46
libstdc++-v3/include/bits/stl_map.h
View File

@ -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

46
libstdc++-v3/include/bits/stl_multimap.h
View File

@ -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

24
libstdc++-v3/include/bits/stl_multiset.h
View File

@ -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

2
libstdc++-v3/include/bits/stl_numeric.h
View File

@ -403,7 +403,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
return ++__result;
}
// @} group numeric_ops
/// @} group numeric_ops
#undef _GLIBCXX_MOVE_IF_20

2
libstdc++-v3/include/bits/stl_pair.h
View File

@ -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.

32
libstdc++-v3/include/bits/stl_set.h
View File

@ -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

2
libstdc++-v3/include/bits/stl_uninitialized.h
View File

@ -1051,7 +1051,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
/// @endcond
#endif
// @} group memory
/// @} group memory
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

6
libstdc++-v3/include/bits/stream_iterator.h
View File

@ -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

8
libstdc++-v3/include/bits/streambuf_iterator.h
View File

@ -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,

6
libstdc++-v3/include/bits/unique_ptr.h
View File

@ -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

112
libstdc++-v3/include/bits/unordered_map.h
View File

@ -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.

104
libstdc++-v3/include/bits/unordered_set.h
View File

@ -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.

2
libstdc++-v3/include/decimal/decimal
View File

@ -484,7 +484,7 @@ namespace decimal
#define _GLIBCXX_USE_DECIMAL_ 1
} // namespace decimal
// @} group decimal
/// @} group decimal
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

6
libstdc++-v3/include/experimental/any
View File

@ -412,7 +412,7 @@ inline namespace fundamentals_v1
return std::move(*__p);
__throw_bad_any_cast();
}
// @}
/// @}
/// @cond undocumented
template<typename _Tp>
@ -479,7 +479,7 @@ inline namespace fundamentals_v1
return static_cast<_ValueType*>(__any_caster<_ValueType>(__any));
return nullptr;
}
// @}
/// @}
template<typename _Tp>
void
@ -555,7 +555,7 @@ inline namespace fundamentals_v1
_S_manage(_Op, const any*, _Arg*) { }
};
// @} group any
/// @} group any
} // namespace fundamentals_v1
} // namespace experimental

2
libstdc++-v3/include/experimental/array
View File

@ -104,7 +104,7 @@ template <typename _Tp, size_t _Nm>
return experimental::__to_array(__a, make_index_sequence<_Nm>{});
}
// @} group make_array
/// @} group make_array
} // namespace fundamentals_v2
} // namespace experimental

2
libstdc++-v3/include/experimental/bits/fs_dir.h
View File

@ -351,7 +351,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CXX11
_GLIBCXX_END_NAMESPACE_CXX11
// @} group filesystem-ts
/// @} group filesystem-ts
} // namespace v1
} // namespace filesystem
} // namespace experimental

2
libstdc++-v3/include/experimental/bits/fs_fwd.h
View File

@ -279,7 +279,7 @@ _GLIBCXX_END_NAMESPACE_CXX11
bool is_regular_file(file_status) noexcept;
bool is_symlink(file_status) noexcept;
// @} group filesystem-ts
/// @} group filesystem-ts
} // namespace v1
} // namespace filesystem
} // namespace experimental

2
libstdc++-v3/include/experimental/bits/fs_ops.h
View File

@ -288,7 +288,7 @@ inline namespace v1
path temp_directory_path();
path temp_directory_path(error_code& __ec);
// @} group filesystem-ts
/// @} group filesystem-ts
} // namespace v1
} // namespace filesystem
} // namespace experimental

2
libstdc++-v3/include/experimental/bits/fs_path.h
View File

@ -1275,7 +1275,7 @@ namespace __detail
return _M_at_end == __rhs._M_at_end;
}
// @} group filesystem-ts
/// @} group filesystem-ts
_GLIBCXX_END_NAMESPACE_CXX11
} // namespace v1
} // namespace filesystem

16
libstdc++-v3/include/experimental/buffer
View File

@ -172,7 +172,7 @@ inline namespace v1
buffer_sequence_end(const _Cont& __c) -> decltype(__c.end())
{ return __c.end(); }
// @}
/// @}
/** @brief buffer type traits
@ -250,7 +250,7 @@ inline namespace v1
template<typename _Tp>
constexpr bool is_dynamic_buffer_v = is_dynamic_buffer<_Tp>::value;
// @}
/// @}
/// buffer size
template<typename _ConstBufferSequence>
@ -727,7 +727,7 @@ inline namespace v1
return net::read(__stream, __b, __completion_condition, __ec);
}
// @}
/// @}
/** @brief asynchronous read operations
* @{
@ -775,7 +775,7 @@ inline namespace v1
std::forward<_CompletionToken>(__token));
}
// @}
/// @}
#if 0
/** @brief synchronous write operations:
@ -811,7 +811,7 @@ inline namespace v1
size_t write(_SyncWriteStream& __stream, _DynamicBuffer&& __b,
_CompletionCondition __completion_condition, error_code& __ec);
// @}
/// @}
/** @brief asynchronous write operations
* @{
@ -839,7 +839,7 @@ inline namespace v1
_CompletionCondition __completion_condition,
_CompletionToken&& __token);
// @}
/// @}
/** @brief synchronous delimited read operations
* @{
@ -856,7 +856,7 @@ inline namespace v1
size_t read_until(_SyncReadStream& __s, _DynamicBuffer&& __b,
string_view __delim, error_code& __ec);
// @}
/// @}
/** @brief asynchronous delimited read operations
* @{
@ -871,7 +871,7 @@ inline namespace v1
_DynamicBuffer&& __b, string_view __delim,
_CompletionToken&& __token);
// @}
/// @}
#endif
/// @}

42
libstdc++-v3/include/experimental/internet
View File

@ -126,7 +126,7 @@ namespace ip
struct v4_mapped_t {};
constexpr v4_mapped_t v4_mapped;
// @}
/// @}
/// An IPv4 address.
class address_v4
@ -541,7 +541,7 @@ namespace ip
operator>=(const address_v4& __a, const address_v4& __b) noexcept
{ return !(__a < __b); }
// @}
/// @}
/** ip::address_v6 comparisons
* @{
@ -585,7 +585,7 @@ namespace ip
operator>=(const address_v6& __a, const address_v6& __b) noexcept
{ return !(__a < __b); }
// @}
/// @}
/** ip::address comparisons
* @{
@ -623,7 +623,7 @@ namespace ip
operator>=(const address& __a, const address& __b) noexcept
{ return !(__a < __b); }
// @}
/// @}
/** ip::address_v4 creation
* @{
@ -695,7 +695,7 @@ namespace ip
make_address_v4(string_view __str)
{ return make_address_v4(__str, __throw_on_error{"make_address_v4"}); }
// @}
/// @}
/** ip::address_v6 creation
* @{
@ -867,7 +867,7 @@ namespace ip
make_address_v6(string_view __str)
{ return make_address_v6(__str, __throw_on_error{"make_address_v6"}); }
// @}
/// @}
/** ip::address creation
* @{
@ -912,7 +912,7 @@ namespace ip
make_address(string_view __str)
{ return make_address(__str, __throw_on_error{"make_address"}); }
// @}
/// @}
/// ip::address I/O
template<typename _CharT, typename _Traits>
@ -1093,7 +1093,7 @@ namespace ip
using address_v4_range = basic_address_range<address_v4>;
// @}
/// @}
/** An IPv6 address range.
* @{
@ -1134,7 +1134,7 @@ namespace ip
using address_v6_range = basic_address_range<address_v6>;
// @}
/// @}
bool
operator==(const network_v4& __a, const network_v4& __b) noexcept;
@ -1307,7 +1307,7 @@ namespace ip
operator!=(const network_v4& __a, const network_v4& __b) noexcept
{ return !(__a == __b); }
// @}
/// @}
/** ip::network_v6 comparisons
* @{
@ -1324,7 +1324,7 @@ namespace ip
operator!=(const network_v6& __a, const network_v6& __b) noexcept
{ return !(__a == __b); }
// @}
/// @}
/** ip::network_v4 creation
* @{
@ -1356,7 +1356,7 @@ namespace ip
make_network_v4(string_view __str)
{ return make_network_v4(__str, __throw_on_error{"make_network_v4"}); }
// @}
/// @}
/** ip::network_v6 creation
* @{
@ -1384,7 +1384,7 @@ namespace ip
make_network_v6(string_view __str)
{ return make_network_v6(__str, __throw_on_error{"make_network_v6"}); }
// @}
/// @}
/// ip::network_v4 I/O
template<typename _CharT, typename _Traits>
@ -1566,7 +1566,7 @@ namespace ip
const basic_endpoint<_InternetProtocol>& __b)
{ return !(__a < __b); }
// @}
/// @}
/// basic_endpoint I/O
template<typename _CharT, typename _Traits, typename _InternetProtocol>
@ -1640,7 +1640,7 @@ namespace ip
const basic_resolver_entry<_InternetProtocol>& __b)
{ return !(__a == __b); }
// @}
/// @}
/** Base class defining flags for name/address resolution.
* @{
@ -1706,7 +1706,7 @@ namespace ip
// TODO define resolver_base::flags static constants for C++14 mode
// @}
/// @}
/** Container for results of name/address resolution.
* @{
@ -1788,7 +1788,7 @@ namespace ip
const basic_resolver_results<_InternetProtocol>& __b)
{ return !(__a == __b); }
// @}
/// @}
/// Perform name/address resolution.
template<typename _InternetProtocol>
@ -2071,7 +2071,7 @@ namespace ip
host_name()
{ return host_name(std::allocator<char>{}, __throw_on_error{"host_name"}); }
// @}
/// @}
/// The TCP byte-stream protocol.
class tcp
@ -2126,7 +2126,7 @@ namespace ip
operator!=(const tcp& __a, const tcp& __b)
{ return !(__a == __b); }
// @}
/// @}
/// The UDP datagram protocol.
class udp
@ -2165,7 +2165,7 @@ namespace ip
operator!=(const udp& __a, const udp& __b)
{ return !(__a == __b); }
// @}
/// @}
/// Restrict a socket created for an IPv6 protocol to IPv6 only.
struct v6_only : __sockopt_crtp<v6_only, bool>
@ -2395,7 +2395,7 @@ namespace ip
} // namespace multicast
// @}
/// @}
} // namespace ip
} // namespace v1

4
libstdc++-v3/include/experimental/optional
View File

@ -910,8 +910,8 @@ inline namespace fundamentals_v1
make_optional(_Tp&& __t)
{ return optional<decay_t<_Tp>> { std::forward<_Tp>(__t) }; }
// @} relates experimental::optional
// @} group optional
/// @} relates experimental::optional
/// @} group optional
} // namespace fundamentals_v1
} // namespace experimental

2
libstdc++-v3/include/experimental/propagate_const
View File

@ -422,7 +422,7 @@ inline namespace fundamentals_v2
return __pt._M_t;
}
// @} group propagate_const
/// @} group propagate_const
} // namespace fundamentals_v2
} // namespace experimental

10
libstdc++-v3/include/experimental/socket
View File

@ -2265,7 +2265,7 @@ inline namespace v1
protocol_type _M_protocol;
};
// @}
/// @}
/** @brief Socket streams
* @{
@ -2436,7 +2436,7 @@ inline namespace v1
__streambuf_type _M_sb;
};
// @}
/// @}
/** @brief synchronous connect operations
* @{
@ -2557,7 +2557,7 @@ inline namespace v1
__ec);
}
// @}
/// @}
/** @brief asynchronous connect operations
* @{
@ -2607,11 +2607,11 @@ inline namespace v1
forward<_CompletionToken>(__token));
}
// @}
/// @}
#endif // _GLIBCXX_HAVE_UNISTD_H
// @}
/// @}
} // namespace v1
} // namespace net

8
libstdc++-v3/include/ext/pb_ds/assoc_container.hpp
View File

@ -516,7 +516,7 @@ namespace __gnu_pbds
swap(gp_hash_table& other)
{ base_type::swap(other); }
};
//@} hash-based
///@} hash-based
#undef PB_DS_GP_HASH_BASE
@ -780,7 +780,7 @@ namespace __gnu_pbds
swap(trie& other)
{ base_type::swap(other); }
};
//@} branch-based
///@} branch-based
#undef PB_DS_TRIE_BASE
#undef PB_DS_TRIE_NODE_AND_IT_TRAITS
@ -852,10 +852,10 @@ namespace __gnu_pbds
swap(list_update& other)
{ base_type::swap(other); }
};
//@} list-based
///@} list-based
#undef PB_DS_LU_BASE
// @} group containers-pbds
/// @} group containers-pbds
} // namespace __gnu_pbds
#endif

2
libstdc++-v3/include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp
View File

@ -107,7 +107,7 @@ namespace __gnu_pbds
/// Dispatched type.
typedef thin_heap<_VTp, Cmp_Fn, _Alloc> type;
};
//@} group pbds
///@} group pbds
} // namespace detail
} // namespace __gnu_pbds

2
libstdc++-v3/include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp
View File

@ -96,7 +96,7 @@ namespace __gnu_pbds
public:
typedef typename tree_metadata_helper<__node_u, null_update>::type type;
};
//@}
///@}
} // namespace detail
} // namespace __gnu_pbds

2
libstdc++-v3/include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp
View File

@ -96,7 +96,7 @@ namespace __gnu_pbds
public:
typedef typename trie_metadata_helper<__node_u, null_update>::type type;
};
//@}
///@}
} // namespace detail
} // namespace __gnu_pbds

2
libstdc++-v3/include/ext/pb_ds/detail/types_traits.hpp
View File

@ -191,7 +191,7 @@ namespace __gnu_pbds
store_extra m_store_extra_indicator;
no_throw_indicator m_no_throw_copies_indicator;
};
//@}
///@}
} // namespace detail
} // namespace __gnu_pbds

2
libstdc++-v3/include/ext/pb_ds/exception.hpp
View File

@ -87,7 +87,7 @@ namespace __gnu_pbds
inline void
__throw_resize_error()
{ _GLIBCXX_THROW_OR_ABORT(resize_error()); }
//@}
///@}
} // namespace __gnu_pbds
#endif

2
libstdc++-v3/include/ext/pb_ds/priority_queue.hpp
View File

@ -152,5 +152,5 @@ namespace __gnu_pbds
{ base_type::swap(other); }
};
} // namespace __gnu_pbds
//@} heap-based
///@} heap-based
#endif

10
libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp
View File

@ -113,7 +113,7 @@ namespace __gnu_pbds
*/
struct range_invalidation_guarantee : public point_invalidation_guarantee
{ };
//@}
///@}
/**
@ -184,8 +184,8 @@ namespace __gnu_pbds
/// Thin heap.
struct thin_heap_tag : public priority_queue_tag { };
//@}
//@}
///@}
///@}
/**
@ -438,7 +438,7 @@ namespace __gnu_pbds
reverse_iteration = base_type::reverse_iteration
};
};
//@}
///@}
namespace detail
@ -448,7 +448,7 @@ namespace __gnu_pbds
typename Policy_Tl = null_type>
struct container_base_dispatch;
} // namespace detail
//@}
///@}
} // namespace __gnu_pbds
#endif

14
libstdc++-v3/include/ext/random
View File

@ -1043,7 +1043,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_ndy(result_type(0), __p.sigma())
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.
@ -1295,7 +1295,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_gd(__p.mu(), __p.omega() / __p.mu())
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.
@ -1540,7 +1540,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_ud()
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.
@ -1801,7 +1801,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_gd2(__p.nu(), __p.mu() / __p.nu())
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.
@ -2040,7 +2040,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
+1.5707963267948966192313216916397514L)
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.
@ -3303,7 +3303,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
: _M_param(__p)
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.
@ -3709,7 +3709,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
: _M_param(__p), _M_uosd()
{ }
// @}
/// @}
/**
* @brief Resets the distribution state.

4
libstdc++-v3/include/std/any
View File

@ -488,7 +488,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return static_cast<_ValueType>(std::move(*__p));
__throw_bad_any_cast();
}
// @}
/// @}
/// @cond undocumented
template<typename _Tp>
@ -547,7 +547,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return static_cast<_ValueType*>(__any_caster<_ValueType>(__any));
return nullptr;
}
// @}
/// @}
template<typename _Tp>
void

2
libstdc++-v3/include/std/atomic
View File

@ -1637,7 +1637,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
#endif // C++2a
// @} group atomics
/// @} group atomics
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

32
libstdc++-v3/include/std/bitset
View File

@ -961,7 +961,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
#endif
// 23.3.5.2 bitset operations:
//@{
///@{
/**
* Operations on bitsets.
* @param __rhs A same-sized bitset.
@ -988,9 +988,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_do_xor(__rhs);
return *this;
}
//@}
///@}
//@{
///@{
/**
* Operations on bitsets.
* @param __position The number of places to shift.
@ -1022,9 +1022,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_do_reset();
return *this;
}
//@}
///@}
//@{
///@{
/**
* These versions of single-bit set, reset, flip, and test are
* extensions from the SGI version. They do no range checking.
@ -1065,7 +1065,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_Unchecked_test(size_t __pos) const _GLIBCXX_NOEXCEPT
{ return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos))
!= static_cast<_WordT>(0)); }
//@}
///@}
// Set, reset, and flip.
/**
@ -1144,7 +1144,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
operator~() const _GLIBCXX_NOEXCEPT
{ return bitset<_Nb>(*this).flip(); }
//@{
///@{
/**
* @brief Array-indexing support.
* @param __position Index into the %bitset.
@ -1166,7 +1166,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_GLIBCXX_CONSTEXPR bool
operator[](size_t __position) const
{ return _Unchecked_test(__position); }
//@}
///@}
/**
* @brief Returns a numerical interpretation of the %bitset.
@ -1300,7 +1300,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
size() const _GLIBCXX_NOEXCEPT
{ return _Nb; }
//@{
///@{
/// These comparisons for equality/inequality are, well, @e bitwise.
bool
operator==(const bitset<_Nb>& __rhs) const _GLIBCXX_NOEXCEPT
@ -1311,7 +1311,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
operator!=(const bitset<_Nb>& __rhs) const _GLIBCXX_NOEXCEPT
{ return !this->_M_is_equal(__rhs); }
#endif
//@}
///@}
/**
* @brief Tests the value of a bit.
@ -1352,7 +1352,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
none() const _GLIBCXX_NOEXCEPT
{ return !this->_M_is_any(); }
//@{
///@{
/// Self-explanatory.
bitset<_Nb>
operator<<(size_t __position) const _GLIBCXX_NOEXCEPT
@ -1361,7 +1361,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
bitset<_Nb>
operator>>(size_t __position) const _GLIBCXX_NOEXCEPT
{ return bitset<_Nb>(*this) >>= __position; }
//@}
///@}
/**
* @brief Finds the index of the first "on" bit.
@ -1421,7 +1421,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
}
// 23.3.5.3 bitset operations:
//@{
///@{
/**
* @brief Global bitwise operations on bitsets.
* @param __x A bitset.
@ -1456,9 +1456,9 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
__result ^= __y;
return __result;
}
//@}
///@}
//@{
///@{
/**
* @brief Global I/O operators for bitsets.
*
@ -1548,7 +1548,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
__x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1'));
return __os << __tmp;
}
//@}
///@}
_GLIBCXX_END_NAMESPACE_CONTAINER
} // namespace std

6
libstdc++-v3/include/std/chrono
View File

@ -165,7 +165,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
struct common_type<chrono::time_point<_Clock, _Duration>>
{ using type = chrono::time_point<_Clock, _Duration>; };
// @} group chrono
/// @} group chrono
namespace chrono
{
@ -1070,7 +1070,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
const time_point<_Clock, _Dur2>& __rhs)
{ return !(__lhs < __rhs); }
// @}
/// @}
// Clocks.
@ -3130,7 +3130,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
};
#endif // C++20
// @}
/// @}
} // namespace chrono
#if __cplusplus > 201103L

26
libstdc++-v3/include/std/complex
View File

@ -325,7 +325,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
}
// Operators:
//@{
///@{
/// Return new complex value @a x plus @a y.
template<typename _Tp>
inline _GLIBCXX20_CONSTEXPR complex<_Tp>
@ -353,9 +353,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__r += __x;
return __r;
}
//@}
///@}
//@{
///@{
/// Return new complex value @a x minus @a y.
template<typename _Tp>
inline _GLIBCXX20_CONSTEXPR complex<_Tp>
@ -383,9 +383,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__r += __x;
return __r;
}
//@}
///@}
//@{
///@{
/// Return new complex value @a x times @a y.
template<typename _Tp>
inline _GLIBCXX20_CONSTEXPR complex<_Tp>
@ -413,9 +413,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__r *= __x;
return __r;
}
//@}
///@}
//@{
///@{
/// Return new complex value @a x divided by @a y.
template<typename _Tp>
inline _GLIBCXX20_CONSTEXPR complex<_Tp>
@ -443,7 +443,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__r /= __y;
return __r;
}
//@}
///@}
/// Return @a x.
template<typename _Tp>
@ -457,7 +457,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator-(const complex<_Tp>& __x)
{ return complex<_Tp>(-__x.real(), -__x.imag()); }
//@{
///@{
/// Return true if @a x is equal to @a y.
template<typename _Tp>
inline _GLIBCXX_CONSTEXPR bool
@ -474,9 +474,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
inline _GLIBCXX_CONSTEXPR bool
operator==(const _Tp& __x, const complex<_Tp>& __y)
{ return __x == __y.real() && _Tp() == __y.imag(); }
//@}
///@}
//@{
///@{
/// Return false if @a x is equal to @a y.
template<typename _Tp>
inline _GLIBCXX_CONSTEXPR bool
@ -493,7 +493,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator!=(const _Tp& __x, const complex<_Tp>& __y)
{ return __x != __y.real() || _Tp() != __y.imag(); }
#endif
//@}
///@}
/// Extraction operator for complex values.
template<typename _Tp, typename _CharT, class _Traits>
@ -1552,7 +1552,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
#endif
#endif
// @} group complex_numbers
/// @} group complex_numbers
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/std/condition_variable
View File

@ -442,7 +442,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} // end inline namespace
// @} group condition_variables
/// @} group condition_variables
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

4
libstdc++-v3/include/std/fstream
View File

@ -160,7 +160,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
bool _M_reading;
bool _M_writing;
//@{
///@{
/**
* Necessary bits for putback buffer management.
*
@ -170,7 +170,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
char_type* _M_pback_cur_save;
char_type* _M_pback_end_save;
bool _M_pback_init;
//@}
///@}
// Cached codecvt facet.
const __codecvt_type* _M_codecvt;

2
libstdc++-v3/include/std/future
View File

@ -1774,7 +1774,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
#endif // _GLIBCXX_ASYNC_ABI_COMPAT
#endif // _GLIBCXX_HAS_GTHREADS
// @} group futures
/// @} group futures
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

4
libstdc++-v3/include/std/iostream
View File

@ -56,7 +56,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* startup and termination. For more information, see the section of the
* manual linked to above.
*/
//@{
///@{
extern istream cin; /// Linked to standard input
extern ostream cout; /// Linked to standard output
extern ostream cerr; /// Linked to standard error (unbuffered)
@ -68,7 +68,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
extern wostream wcerr; /// Linked to standard error (unbuffered)
extern wostream wclog; /// Linked to standard error (buffered)
#endif
//@}
///@}
// For construction of filebuffers for cout, cin, cerr, clog et. al.
static ios_base::Init __ioinit;

28
libstdc++-v3/include/std/istream
View File

@ -107,7 +107,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
class sentry;
friend class sentry;
//@{
///@{
/**
* @brief Interface for manipulators.
*
@ -133,9 +133,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__pf(*this);
return *this;
}
//@}
///@}
//@{
///@{
/**
* @name Extractors
*
@ -155,7 +155,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* be rethrown if badbit is set in the exceptions mask.
*/
//@{
///@{
/**
* @brief Integer arithmetic extractors
* @param __n A variable of builtin integral type.
@ -199,9 +199,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator>>(unsigned long long& __n)
{ return _M_extract(__n); }
#endif
//@}
///@}
//@{
///@{
/**
* @brief Floating point arithmetic extractors
* @param __f A variable of builtin floating point type.
@ -221,7 +221,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__istream_type&
operator>>(long double& __f)
{ return _M_extract(__f); }
//@}
///@}
/**
* @brief Basic arithmetic extractors
@ -257,7 +257,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/
__istream_type&
operator>>(__streambuf_type* __sb);
//@}
///@}
// [27.6.1.3] unformatted input
/**
@ -269,7 +269,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
gcount() const
{ return _M_gcount; }
//@{
///@{
/**
* @name Unformatted Input Functions
*
@ -600,7 +600,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/
__istream_type&
seekg(off_type, ios_base::seekdir);
//@}
///@}
protected:
basic_istream()
@ -735,7 +735,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ return _M_ok; }
};
//@{
///@{
/**
* @brief Character extractors
* @param __in An input stream.
@ -760,7 +760,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
inline basic_istream<char, _Traits>&
operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
{ return (__in >> reinterpret_cast<char&>(__c)); }
//@}
///@}
template<typename _CharT, typename _Traits>
@ -769,7 +769,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
void __istream_extract(istream&, char*, streamsize);
//@{
///@{
/**
* @brief Character string extractors
* @param __in An input stream.
@ -852,7 +852,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator>>(basic_istream<char, _Traits>& __in, signed char (&__s)[_Num])
{ return __in >> reinterpret_cast<char(&)[_Num]>(__s); }
#endif
//@}
///@}
/**
* @brief Template class basic_iostream

2
libstdc++-v3/include/std/mutex
View File

@ -884,7 +884,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
}
#endif // _GLIBCXX_HAS_GTHREADS
// @} group mutexes
/// @} group mutexes
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/std/numeric
View File

@ -712,7 +712,7 @@ namespace __detail
return __result;
}
// @} group numeric_ops
/// @} group numeric_ops
#endif // C++17
_GLIBCXX_END_NAMESPACE_VERSION

28
libstdc++-v3/include/std/ostream
View File

@ -96,7 +96,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
class sentry;
friend class sentry;
//@{
///@{
/**
* @brief Interface for manipulators.
*
@ -132,9 +132,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__pf(*this);
return *this;
}
//@}
///@}
//@{
///@{
/**
* @name Inserters
*
@ -153,7 +153,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* be rethrown.
*/
//@{
///@{
/**
* @brief Integer arithmetic inserters
* @param __n A variable of builtin integral type.
@ -205,9 +205,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator<<(unsigned long long __n)
{ return _M_insert(__n); }
#endif
//@}
///@}
//@{
///@{
/**
* @brief Floating point arithmetic inserters
* @param __f A variable of builtin floating point type.
@ -231,7 +231,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__ostream_type&
operator<<(long double __f)
{ return _M_insert(__f); }
//@}
///@}
/**
* @brief Pointer arithmetic inserters
@ -274,9 +274,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/
__ostream_type&
operator<<(__streambuf_type* __sb);
//@}
///@}
//@{
///@{
/**
* @name Unformatted Output Functions
*
@ -339,7 +339,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/
__ostream_type&
write(const char_type* __s, streamsize __n);
//@}
///@}
/**
* @brief Synchronizing the stream buffer.
@ -485,7 +485,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ return _M_ok; }
};
//@{
///@{
/**
* @brief Character inserters
* @param __out An output stream.
@ -568,9 +568,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator<<(basic_ostream<wchar_t, _Traits>&, char32_t) = delete;
#endif // _GLIBCXX_USE_WCHAR_T
#endif // C++20
//@}
///@}
//@{
///@{
/**
* @brief String inserters
* @param __out An output stream.
@ -664,7 +664,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator<<(basic_ostream<wchar_t, _Traits>&, const char32_t*) = delete;
#endif // _GLIBCXX_USE_WCHAR_T
#endif // C++20
//@}
///@}
// Standard basic_ostream manipulators

2
libstdc++-v3/include/std/ratio
View File

@ -567,7 +567,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
typedef ratio< 1000000000000000, 1> peta;
typedef ratio< 1000000000000000000, 1> exa;
// @} group ratio
/// @} group ratio
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/std/shared_mutex
View File

@ -851,7 +851,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
swap(shared_lock<_Mutex>& __x, shared_lock<_Mutex>& __y) noexcept
{ __x.swap(__y); }
// @} group mutexes
/// @} group mutexes
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/std/stdexcept
View File

@ -299,7 +299,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
virtual ~underflow_error() _GLIBCXX_NOTHROW;
};
// @} group exceptions
/// @} group exceptions
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

20
libstdc++-v3/include/std/streambuf
View File

@ -122,7 +122,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
class basic_streambuf
{
public:
//@{
///@{
/**
* These are standard types. They permit a standardized way of
* referring to names of (or names dependent on) the template
@ -133,12 +133,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
typedef typename traits_type::int_type int_type;
typedef typename traits_type::pos_type pos_type;
typedef typename traits_type::off_type off_type;
//@}
///@}
//@{
///@{
/// This is a non-standard type.
typedef basic_streambuf<char_type, traits_type> __streambuf_type;
//@}
///@}
friend class basic_ios<char_type, traits_type>;
friend class basic_istream<char_type, traits_type>;
@ -232,7 +232,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ return _M_buf_locale; }
// [27.5.2.2.2] buffer management and positioning
//@{
///@{
/**
* @brief Entry points for derived buffer functions.
*
@ -274,7 +274,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/
int
pubsync() { return this->sync(); }
//@}
///@}
// [27.5.2.2.3] get area
/**
@ -472,7 +472,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ }
// [27.5.2.3.1] get area access
//@{
///@{
/**
* @brief Access to the get area.
*
@ -491,7 +491,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
char_type*
egptr() const { return _M_in_end; }
//@}
///@}
/**
* @brief Moving the read position.
@ -519,7 +519,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
}
// [27.5.2.3.2] put area access
//@{
///@{
/**
* @brief Access to the put area.
*
@ -538,7 +538,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
char_type*
epptr() const { return _M_out_end; }
//@}
///@}
/**
* @brief Moving the write position.

2
libstdc++-v3/include/std/system_error
View File

@ -263,7 +263,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator<<(basic_ostream<_CharT, _Traits>& __os, const error_code& __e)
{ return (__os << __e.category().name() << ':' << __e.value()); }
// @}
/// @}
error_condition make_error_condition(errc) noexcept;

2
libstdc++-v3/include/std/thread
View File

@ -297,7 +297,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
};
#endif // __cpp_lib_jthread
// @} group threads
/// @} group threads
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

4
libstdc++-v3/include/std/valarray
View File

@ -595,7 +595,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return _M_data[__i];
}
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace
@ -1245,7 +1245,7 @@ _DEFINE_BINARY_OPERATOR(>=, __greater_equal)
{ return std::__addressof(__va[0]) + __va.size(); }
#endif // C++11
// @} group numeric_arrays
/// @} group numeric_arrays
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

2
libstdc++-v3/include/std/variant
View File

@ -23,7 +23,7 @@
// <http://www.gnu.org/licenses/>.
/** @file variant
* This is the <variant> C++ Library header.
* This is the `<variant>` C++ Library header.
*/
#ifndef _GLIBCXX_VARIANT

6
libstdc++-v3/include/tr1/cmath
View File

@ -1057,7 +1057,7 @@ namespace tr1
#endif // __cplusplus < 201103L
// @}
/// @}
#endif /* _GLIBCXX_USE_C99_MATH_TR1 */
@ -1618,7 +1618,7 @@ namespace tr1
return __detail::__sph_neumann<__type>(__n, __x);
}
// @} tr1_math_spec_func
/// @} tr1_math_spec_func
} // namespace tr1
@ -1698,7 +1698,7 @@ namespace tr1
return __detail::__hyperg<__type>(__a, __b, __c, __x);
}
// @} tr1_math_spec_func
/// @} tr1_math_spec_func
} // namespace tr1

52
libstdc++-v3/include/tr1/regex
View File

@ -53,7 +53,7 @@ namespace tr1
* @defgroup tr1_regex Regular Expressions
* A facility for performing regular expression pattern matching.
*/
//@{
///@{
/** @namespace std::regex_constants
* @brief ISO C++ 0x entities sub namespace for regex.
@ -63,7 +63,7 @@ namespace regex_constants
/**
* @name 5.1 Regular Expression Syntax Options
*/
//@{
///@{
enum __syntax_option
{
_S_icase,
@ -174,7 +174,7 @@ namespace regex_constants
*/
static const syntax_option_type egrep = 1 << _S_egrep;
//@}
///@}
/**
* @name 5.2 Matching Rules
@ -185,7 +185,7 @@ namespace regex_constants
* below for any bitmask elements set.
*
*/
//@{
///@{
enum __match_flag
{
@ -315,12 +315,12 @@ namespace regex_constants
*/
static const match_flag_type format_first_only = 1 << _S_first_only;
//@}
///@}
/**
* @name 5.3 Error Types
*/
//@{
///@{
enum error_type
{
@ -396,7 +396,7 @@ namespace regex_constants
*/
static const error_type error_stack(_S_error_stack);
//@}
///@}
}
// [7.8] Class regex_error
@ -735,7 +735,7 @@ namespace regex_constants
* @name Constants
* tr1 [7.8.1] std [28.8.1]
*/
//@{
///@{
static const regex_constants::syntax_option_type icase
= regex_constants::icase;
static const regex_constants::syntax_option_type nosubs
@ -756,7 +756,7 @@ namespace regex_constants
= regex_constants::grep;
static const regex_constants::syntax_option_type egrep
= regex_constants::egrep;
//@}
///@}
// [7.8.2] construct/copy/destroy
/**
@ -1787,7 +1787,7 @@ namespace regex_constants
/**
* @name 10.? Public Types
*/
//@{
///@{
typedef sub_match<_Bi_iter> value_type;
typedef typename _Base_type::const_reference const_reference;
typedef const_reference reference;
@ -1799,13 +1799,13 @@ namespace regex_constants
typedef _Allocator allocator_type;
typedef typename iterator_traits<_Bi_iter>::value_type char_type;
typedef basic_string<char_type> string_type;
//@}
///@}
public:
/**
* @name 10.1 Construction, Copying, and Destruction
*/
//@{
///@{
/**
* @brief Constructs a default %match_results container.
@ -1841,12 +1841,12 @@ namespace regex_constants
~match_results()
{ }
//@}
///@}
/**
* @name 10.2 Size
*/
//@{
///@{
/**
* @brief Gets the number of matches and submatches.
@ -1874,12 +1874,12 @@ namespace regex_constants
empty() const
{ return size() == 0; }
//@}
///@}
/**
* @name 10.3 Element Access
*/
//@{
///@{
/**
* @brief Gets the length of the indicated submatch.
@ -1988,7 +1988,7 @@ namespace regex_constants
{ return _Base_type::end(); }
#endif
//@}
///@}
/**
* @name 10.4 Formatting
@ -1998,7 +1998,7 @@ namespace regex_constants
* and escape sequences accepted by these functions are
* determined by their @p flags parameter as documented above.
*/
//@{
///@{
/**
* @todo Implement this function.
@ -2017,12 +2017,12 @@ namespace regex_constants
regex_constants::match_flag_type __flags
= regex_constants::format_default) const;
//@}
///@}
/**
* @name 10.5 Allocator
*/
//@{
///@{
/**
* @brief Gets a copy of the allocator.
@ -2031,12 +2031,12 @@ namespace regex_constants
//get_allocator() const;
using _Base_type::get_allocator;
//@}
///@}
/**
* @name 10.6 Swap
*/
//@{
///@{
/**
* @brief Swaps the contents of two match_results.
@ -2049,7 +2049,7 @@ namespace regex_constants
std::swap(_M_prefix, __that._M_prefix);
std::swap(_M_suffix, __that._M_suffix);
}
//@}
///@}
private:
bool _M_matched;
@ -2105,7 +2105,7 @@ namespace regex_constants
/**
* @name Matching, Searching, and Replacing
*/
//@{
///@{
/**
* @brief Determines if there is a match between the regular expression @p e
@ -2432,7 +2432,7 @@ namespace regex_constants
return __result;
}
//@}
///@}
// tr1 [7.12.1] std [28.12] Class template regex_iterator
/**
@ -2718,7 +2718,7 @@ namespace regex_constants
typedef regex_token_iterator<wstring::const_iterator> wsregex_token_iterator;
#endif
//@}
///@}
}
_GLIBCXX_END_NAMESPACE_VERSION

24
libstdc++-v3/include/tr2/dynamic_bitset
View File

@ -748,7 +748,7 @@ namespace tr2
}
// 23.3.5.2 dynamic_bitset operations:
//@{
///@{
/**
* @brief Operations on dynamic_bitsets.
* @param __rhs A same-sized dynamic_bitset.
@ -789,9 +789,9 @@ namespace tr2
this->_M_do_dif(__rhs);
return *this;
}
//@}
///@}
//@{
///@{
/**
* @brief Operations on dynamic_bitsets.
* @param __pos The number of places to shift.
@ -823,7 +823,7 @@ namespace tr2
this->_M_do_reset();
return *this;
}
//@}
///@}
// Set, reset, and flip.
/**
@ -905,7 +905,7 @@ namespace tr2
operator~() const
{ return dynamic_bitset<_WordT, _Alloc>(*this).flip(); }
//@{
///@{
/**
* @brief Array-indexing support.
* @param __pos Index into the %dynamic_bitset.
@ -921,7 +921,7 @@ namespace tr2
const_reference
operator[](size_type __pos) const
{ return _M_unchecked_test(__pos); }
//@}
///@}
/**
* @brief Returns a numerical interpretation of the %dynamic_bitset.
@ -1052,7 +1052,7 @@ namespace tr2
none() const
{ return !this->_M_is_any(); }
//@{
///@{
/// Self-explanatory.
dynamic_bitset
operator<<(size_type __pos) const
@ -1061,7 +1061,7 @@ namespace tr2
dynamic_bitset
operator>>(size_type __pos) const
{ return dynamic_bitset(*this) >>= __pos; }
//@}
///@}
/**
* @brief Finds the index of the first "on" bit.
@ -1115,7 +1115,7 @@ namespace tr2
}
//@{
///@{
/// These comparisons for equality/inequality are, well, @e bitwise.
template<typename _WordT, typename _Alloc>
@ -1141,10 +1141,10 @@ namespace tr2
operator>=(const dynamic_bitset<_WordT, _Alloc>& __lhs,
const dynamic_bitset<_WordT, _Alloc>& __rhs)
{ return !(__lhs < __rhs); }
//@}
///@}
// 23.3.5.3 bitset operations:
//@{
///@{
/**
* @brief Global bitwise operations on bitsets.
* @param __x A bitset.
@ -1192,7 +1192,7 @@ namespace tr2
__result -= __y;
return __result;
}
//@}
///@}
/// Stream output operator for dynamic_bitset.
template <typename _CharT, typename _Traits,

2
libstdc++-v3/libsupc++/atomic_lockfree_defines.h
View File

@ -61,6 +61,6 @@
#define ATOMIC_POINTER_LOCK_FREE __GCC_ATOMIC_POINTER_LOCK_FREE
#endif
// @} group atomics
/// @} group atomics
#endif

2
libstdc++-v3/libsupc++/exception
View File

@ -111,7 +111,7 @@ namespace std
int uncaught_exceptions() _GLIBCXX_USE_NOEXCEPT __attribute__ ((__pure__));
#endif
// @} group exceptions
/// @} group exceptions
} // namespace std
namespace __gnu_cxx

4
libstdc++-v3/libsupc++/exception.h
View File

@ -45,7 +45,7 @@ namespace std
* @defgroup exceptions Exceptions
* @ingroup diagnostics
*
* Classes and functions for reporting errors via exception classes.
* Classes and functions for reporting errors via exceptions.
* @{
*/
@ -75,6 +75,8 @@ namespace std
what() const _GLIBCXX_TXN_SAFE_DYN _GLIBCXX_NOTHROW;
};
/// @}
} // namespace std
}

2
libstdc++-v3/libsupc++/exception_ptr.h
View File

@ -263,7 +263,7 @@ namespace std
#undef _GLIBCXX_EH_PTR_USED
// @} group exceptions
/// @} group exceptions
} // namespace std
} // extern "C++"

2
libstdc++-v3/libsupc++/nested_exception.h
View File

@ -159,7 +159,7 @@ namespace std
rethrow_if_nested(const _Ex& __ex)
{ std::__rethrow_if_nested_impl(std::__addressof(__ex)); }
// @} group exceptions
/// @} group exceptions
} // namespace std
} // extern "C++"