29 #ifndef _GLIBCXX_DEBUG_MULTIMAP_H 30 #define _GLIBCXX_DEBUG_MULTIMAP_H 1 37 namespace std _GLIBCXX_VISIBILITY(default)
42 template<
typename _Key,
typename _Tp,
typename _Compare = std::less<_Key>,
43 typename _Allocator = std::allocator<std::pair<const _Key, _Tp> > >
46 multimap<_Key, _Tp, _Compare, _Allocator>, _Allocator,
47 __gnu_debug::_Safe_node_sequence>,
48 public _GLIBCXX_STD_C::multimap<_Key, _Tp, _Compare, _Allocator>
50 typedef _GLIBCXX_STD_C::multimap<
51 _Key, _Tp, _Compare, _Allocator>
_Base;
61 typedef _Key key_type;
62 typedef _Tp mapped_type;
64 typedef _Compare key_compare;
65 typedef _Allocator allocator_type;
66 typedef typename _Base::reference reference;
67 typedef typename _Base::const_reference const_reference;
74 typedef typename _Base::size_type size_type;
75 typedef typename _Base::difference_type difference_type;
76 typedef typename _Base::pointer pointer;
77 typedef typename _Base::const_pointer const_pointer;
83 #if __cplusplus < 201103L 84 multimap() : _Base() { }
86 multimap(
const multimap& __x)
92 multimap(
const multimap&) =
default;
93 multimap(multimap&&) =
default;
96 const _Compare& __c = _Compare(),
97 const allocator_type& __a = allocator_type())
98 : _Base(__l, __c, __a) { }
101 multimap(
const allocator_type& __a)
104 multimap(
const multimap& __m,
const allocator_type& __a)
105 : _Base(__m, __a) { }
107 multimap(multimap&& __m,
const allocator_type& __a)
108 : _Safe(std::move(__m._M_safe()), __a),
109 _Base(std::move(__m._M_base()), __a) { }
112 : _Base(__l, __a) { }
114 template<
typename _InputIterator>
115 multimap(_InputIterator __first, _InputIterator __last,
116 const allocator_type& __a)
117 : _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
119 __gnu_debug::__base(__last), __a) { }
121 ~multimap() =
default;
124 explicit multimap(
const _Compare& __comp,
125 const _Allocator& __a = _Allocator())
126 : _Base(__comp, __a) { }
128 template<
typename _InputIterator>
129 multimap(_InputIterator __first, _InputIterator __last,
130 const _Compare& __comp = _Compare(),
131 const _Allocator& __a = _Allocator())
132 : _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
134 __gnu_debug::__base(__last),
137 multimap(
const _Base& __x)
140 #if __cplusplus < 201103L 142 operator=(
const multimap& __x)
144 this->_M_safe() = __x;
150 operator=(
const multimap&) =
default;
153 operator=(multimap&&) =
default;
159 this->_M_invalidate_all();
164 using _Base::get_allocator;
168 begin() _GLIBCXX_NOEXCEPT
169 {
return iterator(_Base::begin(),
this); }
172 begin()
const _GLIBCXX_NOEXCEPT
173 {
return const_iterator(_Base::begin(),
this); }
176 end() _GLIBCXX_NOEXCEPT
177 {
return iterator(_Base::end(),
this); }
180 end()
const _GLIBCXX_NOEXCEPT
181 {
return const_iterator(_Base::end(),
this); }
184 rbegin() _GLIBCXX_NOEXCEPT
185 {
return reverse_iterator(end()); }
187 const_reverse_iterator
188 rbegin()
const _GLIBCXX_NOEXCEPT
189 {
return const_reverse_iterator(end()); }
192 rend() _GLIBCXX_NOEXCEPT
193 {
return reverse_iterator(begin()); }
195 const_reverse_iterator
196 rend()
const _GLIBCXX_NOEXCEPT
197 {
return const_reverse_iterator(begin()); }
199 #if __cplusplus >= 201103L 201 cbegin()
const noexcept
202 {
return const_iterator(_Base::begin(),
this); }
205 cend()
const noexcept
206 {
return const_iterator(_Base::end(),
this); }
208 const_reverse_iterator
209 crbegin()
const noexcept
210 {
return const_reverse_iterator(end()); }
212 const_reverse_iterator
213 crend()
const noexcept
214 {
return const_reverse_iterator(begin()); }
220 using _Base::max_size;
223 #if __cplusplus >= 201103L 224 template<
typename... _Args>
226 emplace(_Args&&... __args)
228 return iterator(_Base::emplace(std::forward<_Args>(__args)...),
this);
231 template<
typename... _Args>
233 emplace_hint(const_iterator __pos, _Args&&... __args)
236 return iterator(_Base::emplace_hint(__pos.
base(),
237 std::forward<_Args>(__args)...),
243 insert(
const value_type& __x)
244 {
return iterator(_Base::insert(__x),
this); }
246 #if __cplusplus >= 201103L 250 insert(value_type&& __x)
251 {
return { _Base::insert(std::move(__x)),
this }; }
253 template<
typename _Pair,
typename =
typename 254 std::enable_if<std::is_constructible<value_type,
255 _Pair&&>::value>::type>
258 {
return iterator(_Base::insert(std::forward<_Pair>(__x)),
this); }
261 #if __cplusplus >= 201103L 264 { _Base::insert(__list); }
268 #if __cplusplus >= 201103L 269 insert(const_iterator __position,
const value_type& __x)
271 insert(iterator __position,
const value_type& __x)
275 return iterator(_Base::insert(__position.
base(), __x),
this);
278 #if __cplusplus >= 201103L 282 insert(const_iterator __position, value_type&& __x)
285 return { _Base::insert(__position.
base(), std::move(__x)),
this };
288 template<
typename _Pair,
typename =
typename 289 std::enable_if<std::is_constructible<value_type,
290 _Pair&&>::value>::type>
292 insert(const_iterator __position, _Pair&& __x)
295 return iterator(_Base::insert(__position.
base(),
296 std::forward<_Pair>(__x)),
this);
300 template<
typename _InputIterator>
302 insert(_InputIterator __first, _InputIterator __last)
305 __glibcxx_check_valid_range2(__first, __last, __dist);
307 if (__dist.
second >= __gnu_debug::__dp_sign)
308 _Base::insert(__gnu_debug::__unsafe(__first),
309 __gnu_debug::__unsafe(__last));
311 _Base::insert(__first, __last);
314 #if __cplusplus > 201402L 315 using node_type =
typename _Base::node_type;
318 extract(const_iterator __position)
322 return _Base::extract(__position.
base());
326 extract(
const key_type& __key)
328 const auto __position = find(__key);
329 if (__position != end())
330 return extract(__position);
335 insert(node_type&& __nh)
336 {
return iterator(_Base::insert(std::move(__nh)),
this); }
339 insert(const_iterator __hint, node_type&& __nh)
342 return iterator(_Base::insert(__hint.
base(), std::move(__nh)),
this);
348 #if __cplusplus >= 201103L 350 erase(const_iterator __position)
354 return iterator(_Base::erase(__position.
base()),
this);
358 erase(iterator __position)
359 {
return erase(const_iterator(__position)); }
362 erase(iterator __position)
366 _Base::erase(__position.
base());
371 erase(
const key_type& __x)
374 _Base::equal_range(__x);
375 size_type __count = 0;
376 _Base_iterator __victim = __victims.
first;
377 while (__victim != __victims.
second)
380 _Base::erase(__victim++);
386 #if __cplusplus >= 201103L 388 erase(const_iterator __first, const_iterator __last)
393 for (_Base_const_iterator __victim = __first.
base();
394 __victim != __last.
base(); ++__victim)
396 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
397 _M_message(__gnu_debug::__msg_valid_range)
398 ._M_iterator(__first,
"first")
399 ._M_iterator(__last,
"last"));
402 return iterator(_Base::erase(__first.
base(), __last.
base()),
this);
406 erase(iterator __first, iterator __last)
411 for (_Base_iterator __victim = __first.
base();
412 __victim != __last.
base(); ++__victim)
414 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
415 _M_message(__gnu_debug::__msg_valid_range)
416 ._M_iterator(__first,
"first")
417 ._M_iterator(__last,
"last"));
420 _Base::erase(__first.
base(), __last.
base());
426 _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) )
433 clear() _GLIBCXX_NOEXCEPT
435 this->_M_invalidate_all();
440 using _Base::key_comp;
441 using _Base::value_comp;
445 find(
const key_type& __x)
446 {
return iterator(_Base::find(__x),
this); }
448 #if __cplusplus > 201103L 449 template<
typename _Kt,
451 typename __has_is_transparent<_Compare, _Kt>::type>
454 {
return { _Base::find(__x),
this }; }
458 find(
const key_type& __x)
const 459 {
return const_iterator(_Base::find(__x),
this); }
461 #if __cplusplus > 201103L 462 template<
typename _Kt,
464 typename __has_is_transparent<_Compare, _Kt>::type>
466 find(
const _Kt& __x)
const 467 {
return { _Base::find(__x),
this }; }
473 lower_bound(
const key_type& __x)
474 {
return iterator(_Base::lower_bound(__x),
this); }
476 #if __cplusplus > 201103L 477 template<
typename _Kt,
479 typename __has_is_transparent<_Compare, _Kt>::type>
481 lower_bound(
const _Kt& __x)
482 {
return { _Base::lower_bound(__x),
this }; }
486 lower_bound(
const key_type& __x)
const 487 {
return const_iterator(_Base::lower_bound(__x),
this); }
489 #if __cplusplus > 201103L 490 template<
typename _Kt,
492 typename __has_is_transparent<_Compare, _Kt>::type>
494 lower_bound(
const _Kt& __x)
const 495 {
return { _Base::lower_bound(__x),
this }; }
499 upper_bound(
const key_type& __x)
500 {
return iterator(_Base::upper_bound(__x),
this); }
502 #if __cplusplus > 201103L 503 template<
typename _Kt,
505 typename __has_is_transparent<_Compare, _Kt>::type>
507 upper_bound(
const _Kt& __x)
508 {
return { _Base::upper_bound(__x),
this }; }
512 upper_bound(
const key_type& __x)
const 513 {
return const_iterator(_Base::upper_bound(__x),
this); }
515 #if __cplusplus > 201103L 516 template<
typename _Kt,
518 typename __has_is_transparent<_Compare, _Kt>::type>
520 upper_bound(
const _Kt& __x)
const 521 {
return { _Base::upper_bound(__x),
this }; }
525 equal_range(
const key_type& __x)
528 _Base::equal_range(__x);
530 iterator(__res.
second,
this));
533 #if __cplusplus > 201103L 534 template<
typename _Kt,
536 typename __has_is_transparent<_Compare, _Kt>::type>
538 equal_range(
const _Kt& __x)
540 auto __res = _Base::equal_range(__x);
541 return { { __res.first,
this }, { __res.second,
this } };
546 equal_range(
const key_type& __x)
const 549 _Base::equal_range(__x);
551 const_iterator(__res.
second,
this));
554 #if __cplusplus > 201103L 555 template<
typename _Kt,
557 typename __has_is_transparent<_Compare, _Kt>::type>
559 equal_range(
const _Kt& __x)
const 561 auto __res = _Base::equal_range(__x);
562 return { { __res.first,
this }, { __res.second,
this } };
567 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
570 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
573 template<
typename _Key,
typename _Tp,
574 typename _Compare,
typename _Allocator>
578 {
return __lhs._M_base() == __rhs._M_base(); }
580 template<
typename _Key,
typename _Tp,
581 typename _Compare,
typename _Allocator>
585 {
return __lhs._M_base() != __rhs._M_base(); }
587 template<
typename _Key,
typename _Tp,
588 typename _Compare,
typename _Allocator>
590 operator<(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
592 {
return __lhs._M_base() < __rhs._M_base(); }
594 template<
typename _Key,
typename _Tp,
595 typename _Compare,
typename _Allocator>
597 operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
599 {
return __lhs._M_base() <= __rhs._M_base(); }
601 template<
typename _Key,
typename _Tp,
602 typename _Compare,
typename _Allocator>
606 {
return __lhs._M_base() >= __rhs._M_base(); }
608 template<
typename _Key,
typename _Tp,
609 typename _Compare,
typename _Allocator>
613 {
return __lhs._M_base() > __rhs._M_base(); }
615 template<
typename _Key,
typename _Tp,
616 typename _Compare,
typename _Allocator>
620 _GLIBCXX_NOEXCEPT_IF(noexcept(__lhs.swap(__rhs)))
621 { __lhs.swap(__rhs); }
Safe class dealing with some allocator dependent operations.
#define __glibcxx_check_insert(_Position)
_T2 second
first is a copy of the first object
void _M_invalidate_if(_Predicate __pred)
constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)
A convenience wrapper for creating a pair from two objects.
Like _Safe_sequence but with a special _M_invalidate_all implementation not invalidating past-the-end...
Struct holding two objects of arbitrary type.
#define __glibcxx_check_erase(_Position)
Class std::multimap with safety/checking/debug instrumentation.
#define __glibcxx_check_erase_range(_First, _Last)
ISO C++ entities toplevel namespace is std.
_Iterator & base() noexcept
Return the underlying iterator.
_T1 first
second_type is the second bound type