29 #ifndef _GLIBCXX_DEBUG_UNORDERED_SET
30 #define _GLIBCXX_DEBUG_UNORDERED_SET 1
32 #pragma GCC system_header
34 #if __cplusplus < 201103L
38 namespace std _GLIBCXX_VISIBILITY(default) {
namespace __debug {
39 template<
typename _Key,
typename _Hash,
typename _Pred,
typename _Allocator>
41 template<
typename _Key,
typename _Hash,
typename _Pred,
typename _Allocator>
51 namespace std _GLIBCXX_VISIBILITY(default)
56 template<
typename _Value,
62 unordered_set<_Value, _Hash, _Pred, _Alloc>, _Alloc,
63 __gnu_debug::_Safe_unordered_container>,
64 public _GLIBCXX_STD_C::unordered_set<_Value, _Hash, _Pred, _Alloc>
66 typedef _GLIBCXX_STD_C::unordered_set<
67 _Value, _Hash, _Pred, _Alloc> _Base;
71 typedef typename _Base::const_iterator _Base_const_iterator;
72 typedef typename _Base::iterator _Base_iterator;
73 typedef typename _Base::const_local_iterator _Base_const_local_iterator;
74 typedef typename _Base::local_iterator _Base_local_iterator;
76 template<
typename _ItT,
typename _SeqT,
typename _CatT>
77 friend class ::__gnu_debug::_Safe_iterator;
78 template<
typename _ItT,
typename _SeqT>
79 friend class ::__gnu_debug::_Safe_local_iterator;
82 typedef typename _Base::size_type size_type;
83 typedef typename _Base::hasher hasher;
84 typedef typename _Base::key_equal key_equal;
85 typedef typename _Base::allocator_type allocator_type;
87 typedef typename _Base::key_type key_type;
88 typedef typename _Base::value_type value_type;
97 _Base_const_local_iterator,
unordered_set> const_local_iterator;
103 const hasher& __hf = hasher(),
104 const key_equal& __eql = key_equal(),
105 const allocator_type& __a = allocator_type())
106 : _Base(__n, __hf, __eql, __a) { }
108 template<
typename _InputIterator>
109 unordered_set(_InputIterator __first, _InputIterator __last,
111 const hasher& __hf = hasher(),
112 const key_equal& __eql = key_equal(),
113 const allocator_type& __a = allocator_type())
114 : _Base(__gnu_debug::
__base(
115 __glibcxx_check_valid_constructor_range(__first, __last)),
116 __gnu_debug::
__base(__last), __n,
117 __hf, __eql, __a) { }
119 unordered_set(
const unordered_set&) =
default;
121 unordered_set(
const _Base& __x)
124 unordered_set(unordered_set&&) =
default;
127 unordered_set(
const allocator_type& __a)
130 unordered_set(
const unordered_set& __uset,
131 const allocator_type& __a)
132 : _Base(__uset, __a) { }
134 unordered_set(unordered_set&& __uset,
135 const allocator_type& __a)
136 : _Safe(std::move(__uset._M_safe()), __a),
137 _Base(std::move(__uset._M_base()), __a) { }
139 unordered_set(initializer_list<value_type> __l,
141 const hasher& __hf = hasher(),
142 const key_equal& __eql = key_equal(),
143 const allocator_type& __a = allocator_type())
144 : _Base(__l, __n, __hf, __eql, __a) { }
146 unordered_set(size_type __n,
const allocator_type& __a)
147 : unordered_set(__n, hasher(), key_equal(), __a)
150 unordered_set(size_type __n,
const hasher& __hf,
151 const allocator_type& __a)
152 : unordered_set(__n, __hf, key_equal(), __a)
155 template<
typename _InputIterator>
156 unordered_set(_InputIterator __first, _InputIterator __last,
158 const allocator_type& __a)
159 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a)
162 template<
typename _InputIterator>
163 unordered_set(_InputIterator __first, _InputIterator __last,
164 size_type __n,
const hasher& __hf,
165 const allocator_type& __a)
166 : unordered_set(__first, __last, __n, __hf, key_equal(), __a)
169 unordered_set(initializer_list<value_type> __l,
171 const allocator_type& __a)
172 : unordered_set(__l, __n, hasher(), key_equal(), __a)
175 unordered_set(initializer_list<value_type> __l,
176 size_type __n,
const hasher& __hf,
177 const allocator_type& __a)
178 : unordered_set(__l, __n, __hf, key_equal(), __a)
181 ~unordered_set() =
default;
184 operator=(
const unordered_set&) =
default;
187 operator=(unordered_set&&) =
default;
190 operator=(initializer_list<value_type> __l)
193 this->_M_invalidate_all();
198 swap(unordered_set& __x)
199 noexcept( noexcept(declval<_Base&>().swap(__x)) )
209 this->_M_invalidate_all();
214 {
return { _Base::begin(),
this }; }
217 begin() const noexcept
218 {
return { _Base::begin(),
this }; }
222 {
return { _Base::end(),
this }; }
226 {
return { _Base::end(),
this }; }
229 cbegin() const noexcept
230 {
return { _Base::cbegin(),
this }; }
233 cend() const noexcept
234 {
return { _Base::cend(),
this }; }
240 __glibcxx_check_bucket_index(__b);
241 return { _Base::begin(__b),
this };
247 __glibcxx_check_bucket_index(__b);
248 return { _Base::end(__b),
this };
252 begin(size_type __b)
const
254 __glibcxx_check_bucket_index(__b);
255 return { _Base::begin(__b),
this };
259 end(size_type __b)
const
261 __glibcxx_check_bucket_index(__b);
262 return { _Base::end(__b),
this };
266 cbegin(size_type __b)
const
268 __glibcxx_check_bucket_index(__b);
269 return { _Base::cbegin(__b),
this };
273 cend(size_type __b)
const
275 __glibcxx_check_bucket_index(__b);
276 return { _Base::cend(__b),
this };
280 bucket_size(size_type __b)
const
282 __glibcxx_check_bucket_index(__b);
283 return _Base::bucket_size(__b);
287 max_load_factor() const noexcept
288 {
return _Base::max_load_factor(); }
291 max_load_factor(
float __f)
293 __glibcxx_check_max_load_factor(__f);
294 _Base::max_load_factor(__f);
297 template<
typename... _Args>
299 emplace(_Args&&... __args)
301 size_type __bucket_count = this->bucket_count();
302 auto __res = _Base::emplace(std::forward<_Args>(__args)...);
303 _M_check_rehashed(__bucket_count);
304 return { { __res.first,
this }, __res.second };
307 template<
typename... _Args>
309 emplace_hint(const_iterator __hint, _Args&&... __args)
312 size_type __bucket_count = this->bucket_count();
313 auto __it = _Base::emplace_hint(__hint.base(),
314 std::forward<_Args>(__args)...);
315 _M_check_rehashed(__bucket_count);
316 return { __it,
this };
320 insert(
const value_type& __obj)
322 size_type __bucket_count = this->bucket_count();
323 auto __res = _Base::insert(__obj);
324 _M_check_rehashed(__bucket_count);
325 return { { __res.first,
this }, __res.second };
329 insert(const_iterator __hint,
const value_type& __obj)
332 size_type __bucket_count = this->bucket_count();
333 auto __it = _Base::insert(__hint.base(), __obj);
334 _M_check_rehashed(__bucket_count);
335 return { __it,
this };
339 insert(value_type&& __obj)
341 size_type __bucket_count = this->bucket_count();
342 auto __res = _Base::insert(std::move(__obj));
343 _M_check_rehashed(__bucket_count);
344 return { { __res.first,
this }, __res.second };
348 insert(const_iterator __hint, value_type&& __obj)
351 size_type __bucket_count = this->bucket_count();
352 auto __it = _Base::insert(__hint.base(), std::move(__obj));
353 _M_check_rehashed(__bucket_count);
354 return { __it,
this };
360 size_type __bucket_count = this->bucket_count();
362 _M_check_rehashed(__bucket_count);
365 template<
typename _InputIterator>
367 insert(_InputIterator __first, _InputIterator __last)
370 __glibcxx_check_valid_range2(__first, __last, __dist);
371 size_type __bucket_count = this->bucket_count();
373 if (__dist.
second >= __gnu_debug::__dp_sign)
374 _Base::insert(__gnu_debug::__unsafe(__first),
375 __gnu_debug::__unsafe(__last));
377 _Base::insert(__first, __last);
379 _M_check_rehashed(__bucket_count);
382 #if __cplusplus > 201402L
383 using node_type =
typename _Base::node_type;
384 using insert_return_type = _Node_insert_return<iterator, node_type>;
387 extract(const_iterator __position)
390 return _M_extract(__position.base());
394 extract(
const key_type& __key)
396 const auto __position = _Base::find(__key);
397 if (__position != _Base::end())
398 return _M_extract(__position);
403 insert(node_type&& __nh)
405 auto __ret = _Base::insert(std::move(__nh));
407 { { __ret.position,
this }, __ret.inserted, std::move(__ret.node) };
411 insert(const_iterator __hint, node_type&& __nh)
414 return { _Base::insert(__hint.base(), std::move(__nh)),
this };
421 find(
const key_type& __key)
422 {
return { _Base::find(__key),
this }; }
425 find(
const key_type& __key)
const
426 {
return { _Base::find(__key),
this }; }
429 equal_range(
const key_type& __key)
431 auto __res = _Base::equal_range(__key);
432 return { { __res.first,
this }, { __res.second,
this } };
436 equal_range(
const key_type& __key)
const
438 auto __res = _Base::equal_range(__key);
439 return { { __res.first,
this }, { __res.second,
this } };
443 erase(
const key_type& __key)
446 auto __victim = _Base::find(__key);
447 if (__victim != _Base::end())
456 erase(const_iterator __it)
459 return { _M_erase(__it.base()),
this };
466 return { _M_erase(__it.base()),
this };
470 erase(const_iterator __first, const_iterator __last)
473 for (
auto __tmp = __first.base(); __tmp != __last.
base(); ++__tmp)
475 _GLIBCXX_DEBUG_VERIFY(__tmp != _Base::cend(),
476 _M_message(__gnu_debug::__msg_valid_range)
477 ._M_iterator(__first,
"first")
478 ._M_iterator(__last,
"last"));
479 _M_invalidate(__tmp);
482 size_type __bucket_count = this->bucket_count();
483 auto __next = _Base::erase(__first.base(), __last.base());
484 _M_check_rehashed(__bucket_count);
485 return { __next,
this };
489 _M_base() noexcept {
return *
this; }
492 _M_base() const noexcept {
return *
this; }
496 _M_check_rehashed(size_type __prev_count)
498 if (__prev_count != this->bucket_count())
499 this->_M_invalidate_all();
503 _M_invalidate(_Base_const_iterator __victim)
506 [__victim](_Base_const_iterator __it) {
return __it == __victim; });
508 [__victim](_Base_const_local_iterator __it)
509 {
return __it._M_curr() == __victim._M_cur; });
513 _M_erase(_Base_const_iterator __victim)
515 _M_invalidate(__victim);
516 size_type __bucket_count = this->bucket_count();
517 _Base_iterator __next = _Base::erase(__victim);
518 _M_check_rehashed(__bucket_count);
522 #if __cplusplus > 201402L
524 _M_extract(_Base_const_iterator __victim)
526 _M_invalidate(__victim);
527 return _Base::extract(__victim);
532 #if __cpp_deduction_guides >= 201606
534 template<
typename _InputIterator,
536 hash<typename iterator_traits<_InputIterator>::value_type>,
538 equal_to<typename iterator_traits<_InputIterator>::value_type>,
539 typename _Allocator =
540 allocator<typename iterator_traits<_InputIterator>::value_type>,
541 typename = _RequireInputIter<_InputIterator>,
542 typename = _RequireNotAllocatorOrIntegral<_Hash>,
543 typename = _RequireNotAllocator<_Pred>,
544 typename = _RequireAllocator<_Allocator>>
545 unordered_set(_InputIterator, _InputIterator,
546 unordered_set<int>::size_type = {},
547 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
548 -> unordered_set<
typename iterator_traits<_InputIterator>::value_type,
549 _Hash, _Pred, _Allocator>;
551 template<
typename _Tp,
typename _Hash = hash<_Tp>,
552 typename _Pred = equal_to<_Tp>,
553 typename _Allocator = allocator<_Tp>,
554 typename = _RequireNotAllocatorOrIntegral<_Hash>,
555 typename = _RequireNotAllocator<_Pred>,
556 typename = _RequireAllocator<_Allocator>>
557 unordered_set(initializer_list<_Tp>,
558 unordered_set<int>::size_type = {},
559 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
560 -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
562 template<
typename _InputIterator,
typename _Allocator,
563 typename = _RequireInputIter<_InputIterator>,
564 typename = _RequireAllocator<_Allocator>>
565 unordered_set(_InputIterator, _InputIterator,
566 unordered_set<int>::size_type, _Allocator)
567 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
569 typename iterator_traits<_InputIterator>::value_type>,
571 typename iterator_traits<_InputIterator>::value_type>,
574 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
575 typename = _RequireInputIter<_InputIterator>,
576 typename = _RequireNotAllocatorOrIntegral<_Hash>,
577 typename = _RequireAllocator<_Allocator>>
578 unordered_set(_InputIterator, _InputIterator,
579 unordered_set<int>::size_type,
581 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
584 typename iterator_traits<_InputIterator>::value_type>,
587 template<
typename _Tp,
typename _Allocator,
588 typename = _RequireAllocator<_Allocator>>
589 unordered_set(initializer_list<_Tp>,
590 unordered_set<int>::size_type, _Allocator)
591 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
593 template<
typename _Tp,
typename _Hash,
typename _Allocator,
594 typename = _RequireNotAllocatorOrIntegral<_Hash>,
595 typename = _RequireAllocator<_Allocator>>
596 unordered_set(initializer_list<_Tp>,
597 unordered_set<int>::size_type, _Hash, _Allocator)
598 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
602 template<
typename _Value,
typename _Hash,
typename _Pred,
typename _Alloc>
604 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
605 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
606 noexcept(noexcept(__x.swap(__y)))
609 template<
typename _Value,
typename _Hash,
typename _Pred,
typename _Alloc>
611 operator==(
const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
612 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
613 {
return __x._M_base() == __y._M_base(); }
615 template<
typename _Value,
typename _Hash,
typename _Pred,
typename _Alloc>
617 operator!=(
const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
618 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
619 {
return !(__x == __y); }
623 template<
typename _Value,
627 class unordered_multiset
629 unordered_multiset<_Value, _Hash, _Pred, _Alloc>, _Alloc,
630 __gnu_debug::_Safe_unordered_container>,
631 public _GLIBCXX_STD_C::unordered_multiset<_Value, _Hash, _Pred, _Alloc>
633 typedef _GLIBCXX_STD_C::unordered_multiset<
634 _Value, _Hash, _Pred, _Alloc> _Base;
637 typedef typename _Base::const_iterator _Base_const_iterator;
638 typedef typename _Base::iterator _Base_iterator;
639 typedef typename _Base::const_local_iterator
640 _Base_const_local_iterator;
641 typedef typename _Base::local_iterator _Base_local_iterator;
643 template<
typename _ItT,
typename _SeqT,
typename _CatT>
644 friend class ::__gnu_debug::_Safe_iterator;
645 template<
typename _ItT,
typename _SeqT>
646 friend class ::__gnu_debug::_Safe_local_iterator;
649 typedef typename _Base::size_type size_type;
650 typedef typename _Base::hasher hasher;
651 typedef typename _Base::key_equal key_equal;
652 typedef typename _Base::allocator_type allocator_type;
654 typedef typename _Base::key_type key_type;
655 typedef typename _Base::value_type value_type;
658 _Base_iterator, unordered_multiset> iterator;
660 _Base_const_iterator, unordered_multiset> const_iterator;
662 _Base_local_iterator, unordered_multiset> local_iterator;
664 _Base_const_local_iterator, unordered_multiset> const_local_iterator;
666 unordered_multiset() =
default;
669 unordered_multiset(size_type __n,
670 const hasher& __hf = hasher(),
671 const key_equal& __eql = key_equal(),
672 const allocator_type& __a = allocator_type())
673 : _Base(__n, __hf, __eql, __a) { }
675 template<
typename _InputIterator>
676 unordered_multiset(_InputIterator __first, _InputIterator __last,
678 const hasher& __hf = hasher(),
679 const key_equal& __eql = key_equal(),
680 const allocator_type& __a = allocator_type())
681 : _Base(__gnu_debug::
__base(
682 __glibcxx_check_valid_constructor_range(__first, __last)),
683 __gnu_debug::
__base(__last), __n,
684 __hf, __eql, __a) { }
686 unordered_multiset(
const unordered_multiset&) =
default;
688 unordered_multiset(
const _Base& __x)
691 unordered_multiset(unordered_multiset&&) =
default;
694 unordered_multiset(
const allocator_type& __a)
697 unordered_multiset(
const unordered_multiset& __uset,
698 const allocator_type& __a)
699 : _Base(__uset, __a) { }
701 unordered_multiset(unordered_multiset&& __uset,
702 const allocator_type& __a)
703 : _Safe(std::move(__uset._M_safe()), __a),
704 _Base(std::move(__uset._M_base()), __a) { }
706 unordered_multiset(initializer_list<value_type> __l,
708 const hasher& __hf = hasher(),
709 const key_equal& __eql = key_equal(),
710 const allocator_type& __a = allocator_type())
711 : _Base(__l, __n, __hf, __eql, __a) { }
713 unordered_multiset(size_type __n,
const allocator_type& __a)
714 : unordered_multiset(__n, hasher(), key_equal(), __a)
717 unordered_multiset(size_type __n,
const hasher& __hf,
718 const allocator_type& __a)
719 : unordered_multiset(__n, __hf, key_equal(), __a)
722 template<
typename _InputIterator>
723 unordered_multiset(_InputIterator __first, _InputIterator __last,
725 const allocator_type& __a)
726 : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a)
729 template<
typename _InputIterator>
730 unordered_multiset(_InputIterator __first, _InputIterator __last,
731 size_type __n,
const hasher& __hf,
732 const allocator_type& __a)
733 : unordered_multiset(__first, __last, __n, __hf, key_equal(), __a)
736 unordered_multiset(initializer_list<value_type> __l,
738 const allocator_type& __a)
739 : unordered_multiset(__l, __n, hasher(), key_equal(), __a)
742 unordered_multiset(initializer_list<value_type> __l,
743 size_type __n,
const hasher& __hf,
744 const allocator_type& __a)
745 : unordered_multiset(__l, __n, __hf, key_equal(), __a)
748 ~unordered_multiset() =
default;
751 operator=(
const unordered_multiset&) =
default;
754 operator=(unordered_multiset&&) =
default;
757 operator=(initializer_list<value_type> __l)
759 this->_M_base() = __l;
760 this->_M_invalidate_all();
765 swap(unordered_multiset& __x)
776 this->_M_invalidate_all();
781 {
return { _Base::begin(),
this }; }
784 begin() const noexcept
785 {
return { _Base::begin(),
this }; }
789 {
return { _Base::end(),
this }; }
793 {
return { _Base::end(),
this }; }
797 {
return { _Base::cbegin(),
this }; }
800 cend() const noexcept
801 {
return { _Base::cend(),
this }; }
807 __glibcxx_check_bucket_index(__b);
808 return { _Base::begin(__b),
this };
814 __glibcxx_check_bucket_index(__b);
815 return { _Base::end(__b),
this };
819 begin(size_type __b)
const
821 __glibcxx_check_bucket_index(__b);
822 return { _Base::begin(__b),
this };
826 end(size_type __b)
const
828 __glibcxx_check_bucket_index(__b);
829 return { _Base::end(__b),
this };
833 cbegin(size_type __b)
const
835 __glibcxx_check_bucket_index(__b);
836 return { _Base::cbegin(__b),
this };
840 cend(size_type __b)
const
842 __glibcxx_check_bucket_index(__b);
843 return { _Base::cend(__b),
this };
847 bucket_size(size_type __b)
const
849 __glibcxx_check_bucket_index(__b);
850 return _Base::bucket_size(__b);
854 max_load_factor() const noexcept
855 {
return _Base::max_load_factor(); }
858 max_load_factor(
float __f)
860 __glibcxx_check_max_load_factor(__f);
861 _Base::max_load_factor(__f);
864 template<
typename... _Args>
866 emplace(_Args&&... __args)
868 size_type __bucket_count = this->bucket_count();
869 auto __it = _Base::emplace(std::forward<_Args>(__args)...);
870 _M_check_rehashed(__bucket_count);
871 return { __it,
this };
874 template<
typename... _Args>
876 emplace_hint(const_iterator __hint, _Args&&... __args)
879 size_type __bucket_count = this->bucket_count();
880 auto __it = _Base::emplace_hint(__hint.base(),
881 std::forward<_Args>(__args)...);
882 _M_check_rehashed(__bucket_count);
883 return { __it,
this };
887 insert(
const value_type& __obj)
889 size_type __bucket_count = this->bucket_count();
890 auto __it = _Base::insert(__obj);
891 _M_check_rehashed(__bucket_count);
892 return { __it,
this };
896 insert(const_iterator __hint,
const value_type& __obj)
899 size_type __bucket_count = this->bucket_count();
900 auto __it = _Base::insert(__hint.base(), __obj);
901 _M_check_rehashed(__bucket_count);
902 return { __it,
this };
906 insert(value_type&& __obj)
908 size_type __bucket_count = this->bucket_count();
909 auto __it = _Base::insert(std::move(__obj));
910 _M_check_rehashed(__bucket_count);
911 return { __it,
this };
915 insert(const_iterator __hint, value_type&& __obj)
918 size_type __bucket_count = this->bucket_count();
919 auto __it = _Base::insert(__hint.base(), std::move(__obj));
920 _M_check_rehashed(__bucket_count);
921 return { __it,
this };
927 size_type __bucket_count = this->bucket_count();
929 _M_check_rehashed(__bucket_count);
932 template<
typename _InputIterator>
934 insert(_InputIterator __first, _InputIterator __last)
937 __glibcxx_check_valid_range2(__first, __last, __dist);
938 size_type __bucket_count = this->bucket_count();
940 if (__dist.
second >= __gnu_debug::__dp_sign)
941 _Base::insert(__gnu_debug::__unsafe(__first),
942 __gnu_debug::__unsafe(__last));
944 _Base::insert(__first, __last);
946 _M_check_rehashed(__bucket_count);
949 #if __cplusplus > 201402L
950 using node_type =
typename _Base::node_type;
953 extract(const_iterator __position)
956 return _M_extract(__position.base());
960 extract(
const key_type& __key)
962 const auto __position = _Base::find(__key);
963 if (__position != _Base::end())
964 return _M_extract(__position);
969 insert(node_type&& __nh)
970 {
return { _Base::insert(std::move(__nh)),
this }; }
973 insert(const_iterator __hint, node_type&& __nh)
976 return { _Base::insert(__hint.base(), std::move(__nh)),
this };
983 find(
const key_type& __key)
984 {
return { _Base::find(__key),
this }; }
987 find(
const key_type& __key)
const
988 {
return { _Base::find(__key),
this }; }
991 equal_range(
const key_type& __key)
993 auto __res = _Base::equal_range(__key);
994 return { { __res.first,
this }, { __res.second,
this } };
998 equal_range(
const key_type& __key)
const
1000 auto __res = _Base::equal_range(__key);
1001 return { { __res.first,
this }, { __res.second,
this } };
1005 erase(
const key_type& __key)
1008 auto __pair = _Base::equal_range(__key);
1009 for (
auto __victim = __pair.first; __victim != __pair.second;)
1011 _M_invalidate(__victim);
1012 __victim = _Base::erase(__victim);
1020 erase(const_iterator __it)
1023 return { _M_erase(__it.base()),
this };
1027 erase(iterator __it)
1030 return { _M_erase(__it.base()),
this };
1034 erase(const_iterator __first, const_iterator __last)
1037 for (
auto __tmp = __first.base(); __tmp != __last.base(); ++__tmp)
1039 _GLIBCXX_DEBUG_VERIFY(__tmp != _Base::cend(),
1040 _M_message(__gnu_debug::__msg_valid_range)
1041 ._M_iterator(__first,
"first")
1042 ._M_iterator(__last,
"last"));
1043 _M_invalidate(__tmp);
1045 return { _Base::erase(__first.base(), __last.base()),
this };
1049 _M_base() noexcept {
return *
this; }
1052 _M_base() const noexcept {
return *
this; }
1056 _M_check_rehashed(size_type __prev_count)
1058 if (__prev_count != this->bucket_count())
1059 this->_M_invalidate_all();
1063 _M_invalidate(_Base_const_iterator __victim)
1066 [__victim](_Base_const_iterator __it) {
return __it == __victim; });
1068 [__victim](_Base_const_local_iterator __it)
1069 {
return __it._M_curr() == __victim._M_cur; });
1073 _M_erase(_Base_const_iterator __victim)
1075 _M_invalidate(__victim);
1076 size_type __bucket_count = this->bucket_count();
1077 _Base_iterator __next = _Base::erase(__victim);
1078 _M_check_rehashed(__bucket_count);
1082 #if __cplusplus > 201402L
1084 _M_extract(_Base_const_iterator __victim)
1086 _M_invalidate(__victim);
1087 return _Base::extract(__victim);
1092 #if __cpp_deduction_guides >= 201606
1094 template<
typename _InputIterator,
1096 hash<typename iterator_traits<_InputIterator>::value_type>,
1098 equal_to<typename iterator_traits<_InputIterator>::value_type>,
1099 typename _Allocator =
1100 allocator<typename iterator_traits<_InputIterator>::value_type>,
1101 typename = _RequireInputIter<_InputIterator>,
1102 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1103 typename = _RequireNotAllocator<_Pred>,
1104 typename = _RequireAllocator<_Allocator>>
1105 unordered_multiset(_InputIterator, _InputIterator,
1106 unordered_multiset<int>::size_type = {},
1107 _Hash = _Hash(), _Pred = _Pred(),
1108 _Allocator = _Allocator())
1109 -> unordered_multiset<
typename iterator_traits<_InputIterator>::value_type,
1110 _Hash, _Pred, _Allocator>;
1112 template<
typename _Tp,
typename _Hash = hash<_Tp>,
1113 typename _Pred = equal_to<_Tp>,
1114 typename _Allocator = allocator<_Tp>,
1115 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1116 typename = _RequireNotAllocator<_Pred>,
1117 typename = _RequireAllocator<_Allocator>>
1118 unordered_multiset(initializer_list<_Tp>,
1119 unordered_multiset<int>::size_type = {},
1120 _Hash = _Hash(), _Pred = _Pred(),
1121 _Allocator = _Allocator())
1122 -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;
1124 template<
typename _InputIterator,
typename _Allocator,
1125 typename = _RequireInputIter<_InputIterator>,
1126 typename = _RequireAllocator<_Allocator>>
1127 unordered_multiset(_InputIterator, _InputIterator,
1128 unordered_multiset<int>::size_type, _Allocator)
1129 -> unordered_multiset<typename iterator_traits<_InputIterator>::value_type,
1131 iterator_traits<_InputIterator>::value_type>,
1133 iterator_traits<_InputIterator>::value_type>,
1136 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
1137 typename = _RequireInputIter<_InputIterator>,
1138 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1139 typename = _RequireAllocator<_Allocator>>
1140 unordered_multiset(_InputIterator, _InputIterator,
1141 unordered_multiset<int>::size_type,
1143 -> unordered_multiset<
typename
1144 iterator_traits<_InputIterator>::value_type,
1148 iterator_traits<_InputIterator>::value_type>,
1151 template<
typename _Tp,
typename _Allocator,
1152 typename = _RequireAllocator<_Allocator>>
1153 unordered_multiset(initializer_list<_Tp>,
1154 unordered_multiset<int>::size_type, _Allocator)
1155 -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1157 template<
typename _Tp,
typename _Hash,
typename _Allocator,
1158 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1159 typename = _RequireAllocator<_Allocator>>
1160 unordered_multiset(initializer_list<_Tp>,
1161 unordered_multiset<int>::size_type, _Hash, _Allocator)
1162 -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1166 template<
typename _Value,
typename _Hash,
typename _Pred,
typename _Alloc>
1168 swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1169 unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1173 template<
typename _Value,
typename _Hash,
typename _Pred,
typename _Alloc>
1175 operator==(
const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1176 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1177 {
return __x._M_base() == __y._M_base(); }
1179 template<
typename _Value,
typename _Hash,
typename _Pred,
typename _Alloc>
1181 operator!=(
const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1182 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1183 {
return !(__x == __y); }
Class std::unordered_multiset with safety/checking/debug instrumentation.
Safe class dealing with some allocator dependent operations.
constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to one past the last element of the initializer_list. ...
constexpr auto cend(const _Container &__cont) noexcept(noexcept(std::end(__cont))) -> decltype(std::end(__cont))
Return an iterator pointing to one past the last element of the const container.
_Iterator & base() noexcept
Return the underlying iterator.
A standard container composed of unique keys (containing at most one of each key value) in which the ...
Struct holding two objects of arbitrary type.
enable_if< ::__array_traits< _Tp, _Nm >::_Is_swappable::value >::type noexcept(noexcept(__one.swap(__two)))
swap
The standard allocator, as per [20.4].
_Iterator __base(_Iterator __it)
void _M_invalidate_local_if(_Predicate __pred)
_T2 second
first is a copy of the first object
Class std::unordered_set with safety/checking/debug instrumentation.
constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to the first element of the initializer_list.
Primary class template hash.
void _M_invalidate_if(_Predicate __pred)
#define __glibcxx_check_erase_range(_First, _Last)
#define __glibcxx_check_insert(_Position)
constexpr auto cbegin(const _Container &__cont) noexcept(noexcept(std::begin(__cont))) -> decltype(std::begin(__cont))
Return an iterator pointing to the first element of the const container.
One of the comparison functors.
#define __glibcxx_check_erase(_Position)
Base class for constructing a safe unordered container type that tracks iterators that reference it...