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 268 auto __res = _Base::insert(std::move(__x));
269 return {
iterator(__res.first,
this), __res.second };
272 template<
typename _Pair,
typename =
typename 274 _Pair&&>::value>::type>
279 = _Base::insert(std::forward<_Pair>(__x));
285 #if __cplusplus >= 201103L 288 { _Base::insert(__list); }
292 #if __cplusplus >= 201103L 299 return iterator(_Base::insert(__position.
base(), __x),
this);
302 #if __cplusplus >= 201103L 309 return { _Base::insert(__position.
base(), std::move(__x)),
this };
312 template<
typename _Pair,
typename =
typename 314 _Pair&&>::value>::type>
320 std::forward<_Pair>(__x)),
this);
324 template<
typename _InputIterator>
326 insert(_InputIterator __first, _InputIterator __last)
329 __glibcxx_check_valid_range2(__first, __last, __dist);
331 if (__dist.
second >= __gnu_debug::__dp_sign)
332 _Base::insert(__gnu_debug::__unsafe(__first),
333 __gnu_debug::__unsafe(__last));
335 _Base::insert(__first, __last);
339 #if __cplusplus > 201402L 340 template <
typename... _Args>
342 try_emplace(
const key_type& __k, _Args&&... __args)
344 auto __res = _Base::try_emplace(__k,
345 std::forward<_Args>(__args)...);
346 return {
iterator(__res.first,
this), __res.second };
349 template <
typename... _Args>
351 try_emplace(key_type&& __k, _Args&&... __args)
353 auto __res = _Base::try_emplace(std::move(__k),
354 std::forward<_Args>(__args)...);
355 return {
iterator(__res.first,
this), __res.second };
358 template <
typename... _Args>
365 std::forward<_Args>(__args)...),
369 template <
typename... _Args>
371 try_emplace(
const_iterator __hint, key_type&& __k, _Args&&... __args)
374 return iterator(_Base::try_emplace(__hint.
base(), std::move(__k),
375 std::forward<_Args>(__args)...),
379 template <
typename _Obj>
381 insert_or_assign(
const key_type& __k, _Obj&& __obj)
383 auto __res = _Base::insert_or_assign(__k,
384 std::forward<_Obj>(__obj));
385 return {
iterator(__res.first,
this), __res.second };
388 template <
typename _Obj>
390 insert_or_assign(key_type&& __k, _Obj&& __obj)
392 auto __res = _Base::insert_or_assign(std::move(__k),
393 std::forward<_Obj>(__obj));
394 return {
iterator(__res.first,
this), __res.second };
397 template <
typename _Obj>
400 const key_type& __k, _Obj&& __obj)
403 return iterator(_Base::insert_or_assign(__hint.
base(), __k,
404 std::forward<_Obj>(__obj)),
408 template <
typename _Obj>
410 insert_or_assign(
const_iterator __hint, key_type&& __k, _Obj&& __obj)
415 std::forward<_Obj>(__obj)),
420 #if __cplusplus > 201402L 421 using node_type =
typename _Base::node_type;
422 using insert_return_type = _Node_insert_return<iterator, node_type>;
429 return _Base::extract(__position.
base());
433 extract(
const key_type& __key)
435 const auto __position = find(__key);
436 if (__position != end())
437 return extract(__position);
442 insert(node_type&& __nh)
444 auto __ret = _Base::insert(std::move(__nh));
446 return { __pos, __ret.inserted, std::move(__ret.node) };
453 return iterator(_Base::insert(__hint.
base(), std::move(__nh)),
this);
459 #if __cplusplus >= 201103L 477 _Base::erase(__position.
base());
482 erase(
const key_type& __x)
485 if (__victim == _Base::end())
490 _Base::erase(__victim);
495 #if __cplusplus >= 201103L 503 __victim != __last.
base(); ++__victim)
505 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
506 _M_message(__gnu_debug::__msg_valid_range)
507 ._M_iterator(__first,
"first")
508 ._M_iterator(__last,
"last"));
521 __victim != __last.
base(); ++__victim)
523 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
524 _M_message(__gnu_debug::__msg_valid_range)
525 ._M_iterator(__first,
"first")
526 ._M_iterator(__last,
"last"));
529 _Base::erase(__first.
base(), __last.
base());
535 _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) )
542 clear() _GLIBCXX_NOEXCEPT
544 this->_M_invalidate_all();
549 using _Base::key_comp;
550 using _Base::value_comp;
554 find(
const key_type& __x)
555 {
return iterator(_Base::find(__x),
this); }
557 #if __cplusplus > 201103L 558 template<
typename _Kt,
560 typename __has_is_transparent<_Compare, _Kt>::type>
563 {
return { _Base::find(__x),
this }; }
567 find(
const key_type& __x)
const 570 #if __cplusplus > 201103L 571 template<
typename _Kt,
573 typename __has_is_transparent<_Compare, _Kt>::type>
575 find(
const _Kt& __x)
const 576 {
return { _Base::find(__x),
this }; }
582 lower_bound(
const key_type& __x)
583 {
return iterator(_Base::lower_bound(__x),
this); }
585 #if __cplusplus > 201103L 586 template<
typename _Kt,
588 typename __has_is_transparent<_Compare, _Kt>::type>
590 lower_bound(
const _Kt& __x)
591 {
return { _Base::lower_bound(__x),
this }; }
595 lower_bound(
const key_type& __x)
const 598 #if __cplusplus > 201103L 599 template<
typename _Kt,
601 typename __has_is_transparent<_Compare, _Kt>::type>
603 lower_bound(
const _Kt& __x)
const 604 {
return { _Base::lower_bound(__x),
this }; }
608 upper_bound(
const key_type& __x)
609 {
return iterator(_Base::upper_bound(__x),
this); }
611 #if __cplusplus > 201103L 612 template<
typename _Kt,
614 typename __has_is_transparent<_Compare, _Kt>::type>
616 upper_bound(
const _Kt& __x)
617 {
return { _Base::upper_bound(__x),
this }; }
621 upper_bound(
const key_type& __x)
const 624 #if __cplusplus > 201103L 625 template<
typename _Kt,
627 typename __has_is_transparent<_Compare, _Kt>::type>
629 upper_bound(
const _Kt& __x)
const 630 {
return { _Base::upper_bound(__x),
this }; }
634 equal_range(
const key_type& __x)
637 _Base::equal_range(__x);
642 #if __cplusplus > 201103L 643 template<
typename _Kt,
645 typename __has_is_transparent<_Compare, _Kt>::type>
647 equal_range(
const _Kt& __x)
649 auto __res = _Base::equal_range(__x);
650 return { { __res.first,
this }, { __res.second,
this } };
655 equal_range(
const key_type& __x)
const 658 _Base::equal_range(__x);
663 #if __cplusplus > 201103L 664 template<
typename _Kt,
666 typename __has_is_transparent<_Compare, _Kt>::type>
668 equal_range(
const _Kt& __x)
const 670 auto __res = _Base::equal_range(__x);
671 return { { __res.first,
this }, { __res.second,
this } };
676 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
679 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
682 #if __cpp_deduction_guides >= 201606 684 template<
typename _InputIterator,
687 typename = _RequireInputIter<_InputIterator>,
688 typename = _RequireAllocator<_Allocator>>
689 map(_InputIterator, _InputIterator,
690 _Compare = _Compare(), _Allocator = _Allocator())
692 _Compare, _Allocator>;
694 template<
typename _Key,
typename _Tp,
typename _Compare = less<_Key>,
695 typename _Allocator = allocator<pair<const _Key, _Tp>>,
696 typename = _RequireAllocator<_Allocator>>
698 _Compare = _Compare(), _Allocator = _Allocator())
701 template <
typename _InputIterator,
typename _Allocator,
702 typename = _RequireInputIter<_InputIterator>,
703 typename = _RequireAllocator<_Allocator>>
704 map(_InputIterator, _InputIterator, _Allocator)
708 template<
typename _Key,
typename _Tp,
typename _Allocator,
709 typename = _RequireAllocator<_Allocator>>
715 template<
typename _Key,
typename _Tp,
716 typename _Compare,
typename _Allocator>
720 {
return __lhs._M_base() == __rhs._M_base(); }
722 template<
typename _Key,
typename _Tp,
723 typename _Compare,
typename _Allocator>
727 {
return __lhs._M_base() != __rhs._M_base(); }
729 template<
typename _Key,
typename _Tp,
730 typename _Compare,
typename _Allocator>
732 operator<(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
733 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
734 {
return __lhs._M_base() < __rhs._M_base(); }
736 template<
typename _Key,
typename _Tp,
737 typename _Compare,
typename _Allocator>
739 operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
740 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
741 {
return __lhs._M_base() <= __rhs._M_base(); }
743 template<
typename _Key,
typename _Tp,
744 typename _Compare,
typename _Allocator>
746 operator>=(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
747 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
748 {
return __lhs._M_base() >= __rhs._M_base(); }
750 template<
typename _Key,
typename _Tp,
751 typename _Compare,
typename _Allocator>
753 operator>(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
754 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
755 {
return __lhs._M_base() > __rhs._M_base(); }
757 template<
typename _Key,
typename _Tp,
758 typename _Compare,
typename _Allocator>
760 swap(map<_Key, _Tp, _Compare, _Allocator>& __lhs,
761 map<_Key, _Tp, _Compare, _Allocator>& __rhs)
762 _GLIBCXX_NOEXCEPT_IF(noexcept(__lhs.swap(__rhs)))
763 { __lhs.swap(__rhs); }
Define a member typedef type only if a boolean constant is true.
#define __glibcxx_check_erase_range(_First, _Last)
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.
_T2 second
first is a copy of the first object
Like _Safe_sequence but with a special _M_invalidate_all implementation not invalidating past-the-end...
A standard container made up of (key,value) pairs, which can be retrieved based on a key...
_T1 first
second_type is the second bound type
_Iterator & base() noexcept
Return the underlying iterator.
One of the comparison functors.
ISO C++ entities toplevel namespace is std.
The standard allocator, as per [20.4].
Class std::map with safety/checking/debug instrumentation.
void _M_invalidate_if(_Predicate __pred)
Safe class dealing with some allocator dependent operations.
#define __glibcxx_check_erase(_Position)
Struct holding two objects of arbitrary type.
#define __glibcxx_check_insert(_Position)