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;
59 template<
typename _ItT,
typename _SeqT,
typename _CatT>
60 friend class ::__gnu_debug::_Safe_iterator;
67 _Base_ref(
const _Base& __r) : _M_ref(__r) { }
74 typedef _Key key_type;
75 typedef _Tp mapped_type;
77 typedef _Compare key_compare;
78 typedef _Allocator allocator_type;
79 typedef typename _Base::reference reference;
80 typedef typename _Base::const_reference const_reference;
87 typedef typename _Base::size_type size_type;
88 typedef typename _Base::difference_type difference_type;
89 typedef typename _Base::pointer pointer;
90 typedef typename _Base::const_pointer const_pointer;
96 #if __cplusplus < 201103L
105 map(
const map&) =
default;
109 const _Compare& __c = _Compare(),
110 const allocator_type& __a = allocator_type())
111 :
_Base(__l, __c, __a) { }
114 map(
const allocator_type& __a)
117 map(
const map& __m,
const __type_identity_t<allocator_type>& __a)
118 :
_Base(__m, __a) { }
120 map(
map&& __m,
const __type_identity_t<allocator_type>& __a)
126 :
_Base(__l, __a) { }
128 template<
typename _InputIterator>
129 map(_InputIterator __first, _InputIterator __last,
130 const allocator_type& __a)
132 __glibcxx_check_valid_constructor_range(__first, __last)),
136 #if __glibcxx_containers_ranges
141 template<std::__detail::__container_compatible_range<value_type> _Rg>
142 map(std::from_range_t __t, _Rg&& __rg,
144 const allocator_type& __a = allocator_type())
145 :
_Base(__t, std::forward<_Rg>(__rg), __c, __a)
148 template<std::__detail::__container_compatible_range<value_type> _Rg>
149 map(std::from_range_t __t, _Rg&& __rg,
150 const allocator_type& __a = allocator_type())
151 :
_Base(__t, std::forward<_Rg>(__rg), __a)
159 :
_Base(__x._M_ref) { }
161 explicit map(
const _Compare& __comp,
162 const _Allocator& __a = _Allocator())
163 :
_Base(__comp, __a) { }
165 template<
typename _InputIterator>
166 map(_InputIterator __first, _InputIterator __last,
167 const _Compare& __comp = _Compare(),
168 const _Allocator& __a = _Allocator())
170 __glibcxx_check_valid_constructor_range(__first, __last)),
174 #if __cplusplus >= 201103L
176 operator=(
const map&) =
default;
179 operator=(
map&&) =
default;
184 _Base::operator=(__l);
185 this->_M_invalidate_all();
192 using _Base::get_allocator;
196 begin() _GLIBCXX_NOEXCEPT
197 {
return iterator(_Base::begin(),
this); }
200 begin()
const _GLIBCXX_NOEXCEPT
204 end() _GLIBCXX_NOEXCEPT
205 {
return iterator(_Base::end(),
this); }
208 end()
const _GLIBCXX_NOEXCEPT
212 rbegin() _GLIBCXX_NOEXCEPT
216 rbegin()
const _GLIBCXX_NOEXCEPT
220 rend() _GLIBCXX_NOEXCEPT
224 rend()
const _GLIBCXX_NOEXCEPT
227 #if __cplusplus >= 201103L
229 cbegin()
const noexcept
233 cend()
const noexcept
237 crbegin()
const noexcept
241 crend()
const noexcept
248 using _Base::max_size;
251 using _Base::operator[];
258 #if __cplusplus >= 201103L
259 template<
typename... _Args>
261 emplace(_Args&&... __args)
263 auto __res = _Base::emplace(std::forward<_Args>(__args)...);
264 return { { __res.first,
this }, __res.second };
267 template<
typename... _Args>
274 _Base::emplace_hint(__pos.
base(), std::forward<_Args>(__args)...),
288 #if __cplusplus >= 201103L
294 auto __res = _Base::insert(
std::move(__x));
295 return { { __res.first,
this }, __res.second };
298 template<
typename _Pair,
typename =
typename
300 _Pair&&>::value>::type>
304 auto __res = _Base::insert(std::forward<_Pair>(__x));
305 return { { __res.first,
this }, __res.second };
309 #if __cplusplus >= 201103L
312 { _Base::insert(__list); }
316 #if __cplusplus >= 201103L
323 return iterator(_Base::insert(__position.
base(), __x),
this);
326 #if __cplusplus >= 201103L
333 return { _Base::insert(__position.
base(),
std::move(__x)),
this };
336 template<
typename _Pair,
typename =
typename
338 _Pair&&>::value>::type>
345 _Base::insert(__position.
base(), std::forward<_Pair>(__x)),
351 template<
typename _InputIterator>
353 insert(_InputIterator __first, _InputIterator __last)
356 __glibcxx_check_valid_range2(__first, __last, __dist);
358 if (__dist.
second >= __gnu_debug::__dp_sign)
359 _Base::insert(__gnu_debug::__unsafe(__first),
360 __gnu_debug::__unsafe(__last));
362 _Base::insert(__first, __last);
366 #ifdef __glibcxx_map_try_emplace
367 template <
typename... _Args>
369 try_emplace(
const key_type& __k, _Args&&... __args)
371 auto __res = _Base::try_emplace(__k,
372 std::forward<_Args>(__args)...);
373 return { { __res.first,
this }, __res.second };
376 template <
typename... _Args>
378 try_emplace(key_type&& __k, _Args&&... __args)
380 auto __res = _Base::try_emplace(
std::move(__k),
381 std::forward<_Args>(__args)...);
382 return { { __res.first,
this }, __res.second };
385 template <
typename... _Args>
393 _Base::try_emplace(__hint.
base(), __k,
394 std::forward<_Args>(__args)...),
399 template <
typename... _Args>
401 try_emplace(
const_iterator __hint, key_type&& __k, _Args&&... __args)
407 std::forward<_Args>(__args)...),
412 template <
typename _Obj>
414 insert_or_assign(
const key_type& __k, _Obj&& __obj)
416 auto __res = _Base::insert_or_assign(__k,
417 std::forward<_Obj>(__obj));
418 return { { __res.first,
this }, __res.second };
421 template <
typename _Obj>
423 insert_or_assign(key_type&& __k, _Obj&& __obj)
425 auto __res = _Base::insert_or_assign(
std::move(__k),
426 std::forward<_Obj>(__obj));
427 return { { __res.first,
this }, __res.second };
430 template <
typename _Obj>
433 const key_type& __k, _Obj&& __obj)
438 _Base::insert_or_assign(__hint.
base(), __k,
439 std::forward<_Obj>(__obj)),
444 template <
typename _Obj>
446 insert_or_assign(
const_iterator __hint, key_type&& __k, _Obj&& __obj)
452 std::forward<_Obj>(__obj)),
458 #if __cplusplus > 201402L
459 using node_type =
typename _Base::node_type;
467 return _Base::extract(__position.
base());
471 extract(
const key_type& __key)
473 const auto __position = find(__key);
474 if (__position != end())
475 return extract(__position);
480 insert(node_type&& __nh)
482 auto __ret = _Base::insert(
std::move(__nh));
484 { { __ret.position,
this }, __ret.inserted,
std::move(__ret.node) };
491 return { _Base::insert(__hint.
base(),
std::move(__nh)),
this };
497 #if __cplusplus >= 201103L
502 return { erase(__position.
base()),
this };
508 __glibcxx_check_erase2(__position);
510 return _Base::erase(__position);
513 _GLIBCXX_ABI_TAG_CXX11
523 _Base::erase(__position.
base());
528 erase(
const key_type& __x)
531 if (__victim == _Base::end())
536 _Base::erase(__victim);
541 #if __cplusplus >= 201103L
549 __victim != __last.
base(); ++__victim)
551 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::cend(),
552 _M_message(__gnu_debug::__msg_valid_range)
553 ._M_iterator(__first,
"first")
554 ._M_iterator(__last,
"last"));
558 return { _Base::erase(__first.base(), __last.
base()),
this };
568 __victim != __last.
base(); ++__victim)
570 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
571 _M_message(__gnu_debug::__msg_valid_range)
572 ._M_iterator(__first,
"first")
573 ._M_iterator(__last,
"last"));
576 _Base::erase(__first.base(), __last.
base());
582 _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) )
589 clear() _GLIBCXX_NOEXCEPT
591 this->_M_invalidate_all();
596 using _Base::key_comp;
597 using _Base::value_comp;
601 find(
const key_type& __x)
602 {
return iterator(_Base::find(__x),
this); }
604 #if __cplusplus > 201103L
605 template<
typename _Kt,
607 typename __has_is_transparent<_Compare, _Kt>::type>
610 {
return { _Base::find(__x),
this }; }
614 find(
const key_type& __x)
const
617 #if __cplusplus > 201103L
618 template<
typename _Kt,
620 typename __has_is_transparent<_Compare, _Kt>::type>
622 find(
const _Kt& __x)
const
623 {
return { _Base::find(__x),
this }; }
629 lower_bound(
const key_type& __x)
630 {
return iterator(_Base::lower_bound(__x),
this); }
632 #if __cplusplus > 201103L
633 template<
typename _Kt,
635 typename __has_is_transparent<_Compare, _Kt>::type>
637 lower_bound(
const _Kt& __x)
638 {
return { _Base::lower_bound(__x),
this }; }
642 lower_bound(
const key_type& __x)
const
645 #if __cplusplus > 201103L
646 template<
typename _Kt,
648 typename __has_is_transparent<_Compare, _Kt>::type>
650 lower_bound(
const _Kt& __x)
const
651 {
return { _Base::lower_bound(__x),
this }; }
655 upper_bound(
const key_type& __x)
656 {
return iterator(_Base::upper_bound(__x),
this); }
658 #if __cplusplus > 201103L
659 template<
typename _Kt,
661 typename __has_is_transparent<_Compare, _Kt>::type>
663 upper_bound(
const _Kt& __x)
664 {
return { _Base::upper_bound(__x),
this }; }
668 upper_bound(
const key_type& __x)
const
671 #if __cplusplus > 201103L
672 template<
typename _Kt,
674 typename __has_is_transparent<_Compare, _Kt>::type>
676 upper_bound(
const _Kt& __x)
const
677 {
return { _Base::upper_bound(__x),
this }; }
681 equal_range(
const key_type& __x)
684 _Base::equal_range(__x);
689 #if __cplusplus > 201103L
690 template<
typename _Kt,
692 typename __has_is_transparent<_Compare, _Kt>::type>
694 equal_range(
const _Kt& __x)
696 auto __res = _Base::equal_range(__x);
697 return { { __res.first,
this }, { __res.second,
this } };
702 equal_range(
const key_type& __x)
const
705 _Base::equal_range(__x);
710 #if __cplusplus > 201103L
711 template<
typename _Kt,
713 typename __has_is_transparent<_Compare, _Kt>::type>
715 equal_range(
const _Kt& __x)
const
717 auto __res = _Base::equal_range(__x);
718 return { { __res.first,
this }, { __res.second,
this } };
723 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
726 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
729 #if __cpp_deduction_guides >= 201606
731 template<
typename _InputIterator,
734 typename = _RequireInputIter<_InputIterator>,
735 typename = _RequireNotAllocator<_Compare>,
736 typename = _RequireAllocator<_Allocator>>
737 map(_InputIterator, _InputIterator,
738 _Compare = _Compare(), _Allocator = _Allocator())
740 _Compare, _Allocator>;
742 template<
typename _Key,
typename _Tp,
typename _Compare = less<_Key>,
743 typename _Allocator = allocator<pair<const _Key, _Tp>>,
744 typename = _RequireNotAllocator<_Compare>,
745 typename = _RequireAllocator<_Allocator>>
747 _Compare = _Compare(), _Allocator = _Allocator())
750 template <
typename _InputIterator,
typename _Allocator,
751 typename = _RequireInputIter<_InputIterator>,
752 typename = _RequireAllocator<_Allocator>>
753 map(_InputIterator, _InputIterator, _Allocator)
757 template<
typename _Key,
typename _Tp,
typename _Allocator,
758 typename = _RequireAllocator<_Allocator>>
762 #if __glibcxx_containers_ranges
763 template<ranges::input_range _Rg,
765 __allocator_like _Alloc =
767 map(from_range_t, _Rg&&, _Compare = _Compare(), _Alloc = _Alloc())
769 __detail::__range_mapped_type<_Rg>,
772 template<ranges::input_range _Rg, __allocator_like _Alloc>
773 map(from_range_t, _Rg&&, _Alloc)
775 __detail::__range_mapped_type<_Rg>,
781 template<
typename _Key,
typename _Tp,
782 typename _Compare,
typename _Allocator>
786 {
return __lhs._M_base() == __rhs._M_base(); }
788 #if __cpp_lib_three_way_comparison
789 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
790 inline __detail::__synth3way_t<pair<const _Key, _Tp>>
793 {
return __lhs._M_base() <=> __rhs._M_base(); }
795 template<
typename _Key,
typename _Tp,
796 typename _Compare,
typename _Allocator>
798 operator!=(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
799 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
800 {
return __lhs._M_base() != __rhs._M_base(); }
802 template<
typename _Key,
typename _Tp,
803 typename _Compare,
typename _Allocator>
805 operator<(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
806 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
807 {
return __lhs._M_base() < __rhs._M_base(); }
809 template<
typename _Key,
typename _Tp,
810 typename _Compare,
typename _Allocator>
812 operator<=(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
813 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
814 {
return __lhs._M_base() <= __rhs._M_base(); }
816 template<
typename _Key,
typename _Tp,
817 typename _Compare,
typename _Allocator>
819 operator>=(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
820 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
821 {
return __lhs._M_base() >= __rhs._M_base(); }
823 template<
typename _Key,
typename _Tp,
824 typename _Compare,
typename _Allocator>
826 operator>(
const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
827 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
828 {
return __lhs._M_base() > __rhs._M_base(); }
831 template<
typename _Key,
typename _Tp,
832 typename _Compare,
typename _Allocator>
834 swap(map<_Key, _Tp, _Compare, _Allocator>& __lhs,
835 map<_Key, _Tp, _Compare, _Allocator>& __rhs)
836 _GLIBCXX_NOEXCEPT_IF(noexcept(__lhs.swap(__rhs)))
837 { __lhs.swap(__rhs); }
#define __glibcxx_check_insert(_Position)
#define __glibcxx_check_erase_range(_First, _Last)
#define __glibcxx_check_erase(_Position)
constexpr bool operator<=(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr bool operator>=(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr bool operator<(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr bool operator>(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
ISO C++ entities toplevel namespace is std.
constexpr auto empty(const _Container &__cont) noexcept(noexcept(__cont.empty())) -> decltype(__cont.empty())
Return whether a container is empty.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
constexpr _Iterator __base(_Iterator __it)
Define a member typedef type only if a boolean constant is true.
The standard allocator, as per C++03 [20.4.1].
constexpr _Iterator & base() noexcept
Return the underlying iterator.
Return type of insert(node_handle&&) on unique maps/sets.
One of the comparison functors.
Struct holding two objects of arbitrary type.
_T1 first
The first member.
_T2 second
The second member.
A standard container made up of (key,value) pairs, which can be retrieved based on a key,...
void _M_invalidate_if(_Predicate __pred)
Class std::map with safety/checking/debug instrumentation.
Safe class dealing with some allocator dependent operations.
Like _Safe_sequence but with a special _M_invalidate_all implementation not invalidating past-the-end...