46 multiset<_Key, _Compare, _Allocator>, _Allocator,
47 __gnu_debug::_Safe_node_sequence>,
48 public _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator>
50 typedef _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator>
_Base;
58 template<
typename _ItT,
typename _SeqT,
typename _CatT>
59 friend class ::__gnu_debug::_Safe_iterator;
66 _Base_ref(
const _Base& __r) : _M_ref(__r) { }
74 typedef _Key value_type;
75 typedef _Compare key_compare;
76 typedef _Compare value_compare;
78 typedef typename _Base::reference reference;
79 typedef typename _Base::const_reference const_reference;
86 typedef typename _Base::size_type size_type;
87 typedef typename _Base::difference_type difference_type;
88 typedef typename _Base::pointer pointer;
89 typedef typename _Base::const_pointer const_pointer;
95#if __cplusplus < 201103L
108 const _Compare& __comp = _Compare(),
129 template<
typename _InputIterator>
133 __glibcxx_check_valid_constructor_range(__first, __last)),
136#if __glibcxx_containers_ranges
141 template<std::__detail::__container_compatible_range<value_type> _Rg>
148 template<std::__detail::__container_compatible_range<value_type> _Rg>
158 explicit multiset(
const _Compare& __comp,
160 :
_Base(__comp, __a) { }
162 template<
typename _InputIterator>
164 const _Compare& __comp = _Compare(),
167 __glibcxx_check_valid_constructor_range(__first, __last)),
172 :
_Base(__x._M_ref) { }
174#if __cplusplus >= 201103L
176 operator=(
const multiset&) =
default;
184 _Base::operator=(
__l);
185 this->_M_invalidate_all();
190 using _Base::get_allocator;
195 {
return iterator(_Base::begin(),
this); }
203 {
return iterator(_Base::end(),
this); }
225#if __cplusplus >= 201103L
227 cbegin()
const noexcept
231 cend()
const noexcept
235 crbegin()
const noexcept
239 crend()
const noexcept
246 using _Base::max_size;
249#if __cplusplus >= 201103L
250 template<
typename...
_Args>
255 template<
typename...
_Args>
269 insert(
const value_type& __x)
270 {
return iterator(_Base::insert(__x),
this); }
272#if __cplusplus >= 201103L
274 insert(value_type&& __x)
275 {
return { _Base::insert(
std::move(__x)),
this }; }
285#if __cplusplus >= 201103L
294 template<
typename _InputIterator>
299 __glibcxx_check_valid_range2(__first, __last,
__dist);
301 if (
__dist.second >= __gnu_debug::__dp_sign)
302 _Base::insert(__gnu_debug::__unsafe(__first),
303 __gnu_debug::__unsafe(__last));
305 _Base::insert(__first, __last);
308#if __cplusplus >= 201103L
311 { _Base::insert(
__l); }
314#if __cplusplus > 201402L
315 using node_type =
typename _Base::node_type;
335 insert(node_type&&
__nh)
348#if __cplusplus >= 201103L
349 _GLIBCXX_ABI_TAG_CXX11
378 _Base::equal_range(__x);
379 size_type __count = 0;
390#if __cplusplus >= 201103L
391 _GLIBCXX_ABI_TAG_CXX11
401 _GLIBCXX_DEBUG_VERIFY(
__victim != _Base::cend(),
402 _M_message(__gnu_debug::__msg_valid_range)
403 ._M_iterator(__first,
"first")
404 ._M_iterator(__last,
"last"));
408 return { _Base::erase(__first.base(), __last.
base()),
this };
420 _GLIBCXX_DEBUG_VERIFY(
__victim != _Base::end(),
421 _M_message(__gnu_debug::__msg_valid_range)
422 ._M_iterator(__first,
"first")
423 ._M_iterator(__last,
"last"));
426 _Base::erase(__first.base(), __last.
base());
441 this->_M_invalidate_all();
446 using _Base::key_comp;
447 using _Base::value_comp;
452 {
return iterator(_Base::find(__x),
this); }
460#if __cplusplus > 201103L
461 template<
typename _Kt,
463 typename __has_is_transparent<_Compare, _Kt>::type>
466 {
return { _Base::find(__x),
this }; }
468 template<
typename _Kt,
470 typename __has_is_transparent<_Compare, _Kt>::type>
472 find(
const _Kt& __x)
const
473 {
return { _Base::find(__x),
this }; }
480 {
return iterator(_Base::lower_bound(__x),
this); }
485 lower_bound(
const key_type& __x)
const
488#if __cplusplus > 201103L
489 template<
typename _Kt,
491 typename __has_is_transparent<_Compare, _Kt>::type>
493 lower_bound(
const _Kt& __x)
494 {
return { _Base::lower_bound(__x),
this }; }
496 template<
typename _Kt,
498 typename __has_is_transparent<_Compare, _Kt>::type>
500 lower_bound(
const _Kt& __x)
const
501 {
return { _Base::lower_bound(__x),
this }; }
506 {
return iterator(_Base::upper_bound(__x),
this); }
511 upper_bound(
const key_type& __x)
const
514#if __cplusplus > 201103L
515 template<
typename _Kt,
517 typename __has_is_transparent<_Compare, _Kt>::type>
519 upper_bound(
const _Kt& __x)
520 {
return { _Base::upper_bound(__x),
this }; }
522 template<
typename _Kt,
524 typename __has_is_transparent<_Compare, _Kt>::type>
526 upper_bound(
const _Kt& __x)
const
527 {
return { _Base::upper_bound(__x),
this }; }
534 _Base::equal_range(__x);
542 equal_range(
const key_type& __x)
const
545 _Base::equal_range(__x);
550#if __cplusplus > 201103L
551 template<
typename _Kt,
553 typename __has_is_transparent<_Compare, _Kt>::type>
555 equal_range(
const _Kt& __x)
557 auto __res = _Base::equal_range(__x);
558 return { {
__res.first,
this }, {
__res.second,
this } };
561 template<
typename _Kt,
563 typename __has_is_transparent<_Compare, _Kt>::type>
565 equal_range(
const _Kt& __x)
const
567 auto __res = _Base::equal_range(__x);
568 return { {
__res.first,
this }, {
__res.second,
this } };