59#pragma GCC system_header
74#define __glibcxx_want_allocator_traits_is_always_equal
75#define __glibcxx_want_containers_ranges
76#define __glibcxx_want_erase_if
77#define __glibcxx_want_generic_associative_lookup
78#define __glibcxx_want_map_try_emplace
79#define __glibcxx_want_node_extract
80#define __glibcxx_want_nonmember_container_access
81#define __glibcxx_want_tuple_like
82#define __glibcxx_want_associative_heterogeneous_erasure
83#define __glibcxx_want_associative_heterogeneous_insertion
86#if __cplusplus >= 201703L
88namespace std _GLIBCXX_VISIBILITY(default)
90_GLIBCXX_BEGIN_NAMESPACE_VERSION
93 template<
typename _Key,
typename _Tp,
typename _Cmp = std::less<_Key>>
96 polymorphic_allocator<pair<const _Key, _Tp>>>;
97 template<
typename _Key,
typename _Tp,
typename _Cmp = std::less<_Key>>
100 polymorphic_allocator<pair<const _Key, _Tp>>>;
102_GLIBCXX_END_NAMESPACE_VERSION
106#ifdef __cpp_lib_erase_if
107namespace std _GLIBCXX_VISIBILITY(default)
109_GLIBCXX_BEGIN_NAMESPACE_VERSION
110 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc,
112 inline typename _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Alloc>::size_type
113 erase_if(_GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Alloc>&
__cont,
115 {
return __detail::__erase_nodes_if(
__cont,
__cont, __pred); }
117 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc,
119 inline typename _GLIBCXX_STD_C::multimap<_Key, _Tp,
120 _Compare, _Alloc>::size_type
121 erase_if(_GLIBCXX_STD_C::multimap<_Key, _Tp, _Compare, _Alloc>&
__cont,
123 {
return __detail::__erase_nodes_if(
__cont,
__cont, __pred); }
124_GLIBCXX_END_NAMESPACE_VERSION
ISO C++ entities toplevel namespace is std.
A standard container made up of (key,value) pairs, which can be retrieved based on a key,...
A standard container made up of (key,value) pairs, which can be retrieved based on a key,...