29 #ifndef _GLIBCXX_DEBUG_MAP_H
30 #define _GLIBCXX_DEBUG_MAP_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 map<_Key, _Tp, _Compare, _Allocator>, _Allocator,
47 __gnu_debug::_Safe_node_sequence>,
48 public _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator>
50 typedef _GLIBCXX_STD_C::map<
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
96 const _Compare& __c = _Compare(),
97 const allocator_type& __a = allocator_type())
98 :
_Base(__l, __c, __a) { }
101 map(
const allocator_type& __a)
104 map(
const map& __m,
const allocator_type& __a)
105 :
_Base(__m, __a) { }
107 map(
map&& __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 map(_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)
128 explicit map(
const _Compare& __comp,
129 const _Allocator& __a = _Allocator())
130 :
_Base(__comp, __a) { }
132 template<
typename _InputIterator>
133 map(_InputIterator __first, _InputIterator __last,
134 const _Compare& __comp = _Compare(),
135 const _Allocator& __a = _Allocator())
136 :
_Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
138 __gnu_debug::__base(__last),
141 #if __cplusplus < 201103L
143 operator=(
const map& __x)
145 this->_M_safe() = __x;
151 operator=(
const map&) =
default;
154 operator=(
map&&) =
default;
160 this->_M_invalidate_all();
167 using _Base::get_allocator;
171 begin() _GLIBCXX_NOEXCEPT
172 {
return iterator(_Base::begin(),
this); }
175 begin()
const _GLIBCXX_NOEXCEPT
179 end() _GLIBCXX_NOEXCEPT
180 {
return iterator(_Base::end(),
this); }
183 end()
const _GLIBCXX_NOEXCEPT
187 rbegin() _GLIBCXX_NOEXCEPT
191 rbegin()
const _GLIBCXX_NOEXCEPT
195 rend() _GLIBCXX_NOEXCEPT
199 rend()
const _GLIBCXX_NOEXCEPT
202 #if __cplusplus >= 201103L
204 cbegin()
const noexcept
208 cend()
const noexcept
212 crbegin()
const noexcept
216 crend()
const noexcept
223 using _Base::max_size;
226 using _Base::operator[];
233 #if __cplusplus >= 201103L
234 template<
typename... _Args>
236 emplace(_Args&&... __args)
238 auto __res = _Base::emplace(std::forward<_Args>(__args)...);
243 template<
typename... _Args>
249 std::forward<_Args>(__args)...),
262 #if __cplusplus >= 201103L
263 template<
typename _Pair,
typename =
typename
264 std::enable_if<std::is_constructible<
value_type,
265 _Pair&&>::value>::type>
270 = _Base::insert(std::forward<_Pair>(__x));
276 #if __cplusplus >= 201103L
279 { _Base::insert(__list); }
283 #if __cplusplus >= 201103L
290 return iterator(_Base::insert(__position.
base(), __x),
this);
293 #if __cplusplus >= 201103L
294 template<
typename _Pair,
typename =
typename
295 std::enable_if<std::is_constructible<
value_type,
296 _Pair&&>::value>::type>
302 std::forward<_Pair>(__x)),
this);
306 template<
typename _InputIterator>
308 insert(_InputIterator __first, _InputIterator __last)
311 __glibcxx_check_valid_range2(__first, __last, __dist);
313 if (__dist.
second >= __gnu_debug::__dp_sign)
314 _Base::insert(__gnu_debug::__unsafe(__first),
315 __gnu_debug::__unsafe(__last));
317 _Base::insert(__first, __last);
321 #if __cplusplus > 201402L
322 template <
typename... _Args>
324 try_emplace(
const key_type& __k, _Args&&... __args)
326 auto __res = _Base::try_emplace(__k,
327 std::forward<_Args>(__args)...);
328 return {
iterator(__res.first,
this), __res.second };
331 template <
typename... _Args>
333 try_emplace(key_type&& __k, _Args&&... __args)
335 auto __res = _Base::try_emplace(std::move(__k),
336 std::forward<_Args>(__args)...);
337 return {
iterator(__res.first,
this), __res.second };
340 template <
typename... _Args>
347 std::forward<_Args>(__args)...),
351 template <
typename... _Args>
353 try_emplace(
const_iterator __hint, key_type&& __k, _Args&&... __args)
356 return iterator(_Base::try_emplace(__hint.
base(), std::move(__k),
357 std::forward<_Args>(__args)...),
361 template <
typename _Obj>
363 insert_or_assign(
const key_type& __k, _Obj&& __obj)
365 auto __res = _Base::insert_or_assign(__k,
366 std::forward<_Obj>(__obj));
367 return {
iterator(__res.first,
this), __res.second };
370 template <
typename _Obj>
372 insert_or_assign(key_type&& __k, _Obj&& __obj)
374 auto __res = _Base::insert_or_assign(std::move(__k),
375 std::forward<_Obj>(__obj));
376 return {
iterator(__res.first,
this), __res.second };
379 template <
typename _Obj>
382 const key_type& __k, _Obj&& __obj)
385 return iterator(_Base::insert_or_assign(__hint.
base(), __k,
386 std::forward<_Obj>(__obj)),
390 template <
typename _Obj>
392 insert_or_assign(
const_iterator __hint, key_type&& __k, _Obj&& __obj)
397 std::forward<_Obj>(__obj)),
402 #if __cplusplus > 201402L
403 using node_type =
typename _Base::node_type;
405 struct insert_return_type
417 return _Base::extract(__position.
base());
421 extract(
const key_type& __key)
423 const auto __position = find(__key);
424 if (__position != end())
425 return extract(__position);
430 insert(node_type&& __nh)
432 auto __ret = _Base::insert(std::move(__nh));
434 return { __ret.inserted, __pos, std::move(__ret.node) };
441 return iterator(_Base::insert(__hint.
base(), std::move(__nh)),
this);
447 #if __cplusplus >= 201103L
465 _Base::erase(__position.
base());
470 erase(
const key_type& __x)
473 if (__victim == _Base::end())
478 _Base::erase(__victim);
483 #if __cplusplus >= 201103L
491 __victim != __last.
base(); ++__victim)
493 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
494 _M_message(__gnu_debug::__msg_valid_range)
495 ._M_iterator(__first,
"first")
496 ._M_iterator(__last,
"last"));
509 __victim != __last.
base(); ++__victim)
511 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
512 _M_message(__gnu_debug::__msg_valid_range)
513 ._M_iterator(__first,
"first")
514 ._M_iterator(__last,
"last"));
517 _Base::erase(__first.
base(), __last.
base());
523 _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) )
530 clear() _GLIBCXX_NOEXCEPT
532 this->_M_invalidate_all();
537 using _Base::key_comp;
538 using _Base::value_comp;
542 find(
const key_type& __x)
543 {
return iterator(_Base::find(__x),
this); }
545 #if __cplusplus > 201103L
546 template<
typename _Kt,
548 typename __has_is_transparent<_Compare, _Kt>::type>
551 {
return { _Base::find(__x),
this }; }
555 find(
const key_type& __x)
const
558 #if __cplusplus > 201103L
559 template<
typename _Kt,
561 typename __has_is_transparent<_Compare, _Kt>::type>
563 find(
const _Kt& __x)
const
564 {
return { _Base::find(__x),
this }; }
570 lower_bound(
const key_type& __x)
571 {
return iterator(_Base::lower_bound(__x),
this); }
573 #if __cplusplus > 201103L
574 template<
typename _Kt,
576 typename __has_is_transparent<_Compare, _Kt>::type>
578 lower_bound(
const _Kt& __x)
579 {
return { _Base::lower_bound(__x),
this }; }
583 lower_bound(
const key_type& __x)
const
586 #if __cplusplus > 201103L
587 template<
typename _Kt,
589 typename __has_is_transparent<_Compare, _Kt>::type>
591 lower_bound(
const _Kt& __x)
const
592 {
return { _Base::lower_bound(__x),
this }; }
596 upper_bound(
const key_type& __x)
597 {
return iterator(_Base::upper_bound(__x),
this); }
599 #if __cplusplus > 201103L
600 template<
typename _Kt,
602 typename __has_is_transparent<_Compare, _Kt>::type>
604 upper_bound(
const _Kt& __x)
605 {
return { _Base::upper_bound(__x),
this }; }
609 upper_bound(
const key_type& __x)
const
612 #if __cplusplus > 201103L
613 template<
typename _Kt,
615 typename __has_is_transparent<_Compare, _Kt>::type>
617 upper_bound(
const _Kt& __x)
const
618 {
return { _Base::upper_bound(__x),
this }; }
622 equal_range(
const key_type& __x)
625 _Base::equal_range(__x);
630 #if __cplusplus > 201103L
631 template<
typename _Kt,
633 typename __has_is_transparent<_Compare, _Kt>::type>
635 equal_range(
const _Kt& __x)
637 auto __res = _Base::equal_range(__x);
638 return { { __res.first,
this }, { __res.second,
this } };
643 equal_range(
const key_type& __x)
const
646 _Base::equal_range(__x);
651 #if __cplusplus > 201103L
652 template<
typename _Kt,
654 typename __has_is_transparent<_Compare, _Kt>::type>
656 equal_range(
const _Kt& __x)
const
658 auto __res = _Base::equal_range(__x);
659 return { { __res.first,
this }, { __res.second,
this } };
664 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
667 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
670 template<
typename _Key,
typename _Tp,
671 typename _Compare,
typename _Allocator>
675 {
return __lhs._M_base() == __rhs._M_base(); }
677 template<
typename _Key,
typename _Tp,
678 typename _Compare,
typename _Allocator>
682 {
return __lhs._M_base() != __rhs._M_base(); }
684 template<
typename _Key,
typename _Tp,
685 typename _Compare,
typename _Allocator>
687 operator<(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
688 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
689 {
return __lhs._M_base() < __rhs._M_base(); }
691 template<
typename _Key,
typename _Tp,
692 typename _Compare,
typename _Allocator>
694 operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
695 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
696 {
return __lhs._M_base() <= __rhs._M_base(); }
698 template<
typename _Key,
typename _Tp,
699 typename _Compare,
typename _Allocator>
701 operator>=(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
702 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
703 {
return __lhs._M_base() >= __rhs._M_base(); }
705 template<
typename _Key,
typename _Tp,
706 typename _Compare,
typename _Allocator>
708 operator>(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
709 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
710 {
return __lhs._M_base() > __rhs._M_base(); }
712 template<
typename _Key,
typename _Tp,
713 typename _Compare,
typename _Allocator>
715 swap(map<_Key, _Tp, _Compare, _Allocator>& __lhs,
716 map<_Key, _Tp, _Compare, _Allocator>& __rhs)
717 _GLIBCXX_NOEXCEPT_IF(noexcept(__lhs.swap(__rhs)))
718 { __lhs.swap(__rhs); }
Like _Safe_sequence but with a special _M_invalidate_all implementation not invalidating past-the-end...
Class std::map with safety/checking/debug instrumentation.
#define __glibcxx_check_erase_range(_First, _Last)
#define __glibcxx_check_insert(_Position)
_Iterator & base() noexcept
Return the underlying iterator.
Safe class dealing with some allocator dependent operations.
#define __glibcxx_check_erase(_Position)
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.
A standard container made up of (key,value) pairs, which can be retrieved based on a key...
_T2 second
first is a copy of the first object
Struct holding two objects of arbitrary type.
_T1 first
second_type is the second bound type