1 // Debugging unordered_set/unordered_multiset implementation -*- C++ -*-
3 // Copyright (C) 2003-2019 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 /** @file debug/unordered_set
26 * This file is a GNU debug extension to the Standard C++ Library.
29 #ifndef _GLIBCXX_DEBUG_UNORDERED_SET
30 #define _GLIBCXX_DEBUG_UNORDERED_SET 1
32 #pragma GCC system_header
34 #if __cplusplus < 201103L
35 # include <bits/c++0x_warning.h>
37 # include <bits/c++config.h>
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>
42 class unordered_multiset;
43 } } // namespace std::__debug
44 # include <unordered_set>
46 #include <debug/safe_unordered_container.h>
47 #include <debug/safe_container.h>
48 #include <debug/safe_iterator.h>
49 #include <debug/safe_local_iterator.h>
51 namespace std _GLIBCXX_VISIBILITY(default)
55 /// Class std::unordered_set with safety/checking/debug instrumentation.
56 template<typename _Value,
57 typename _Hash = std::hash<_Value>,
58 typename _Pred = std::equal_to<_Value>,
59 typename _Alloc = std::allocator<_Value> >
61 : public __gnu_debug::_Safe_container<
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;
68 typedef __gnu_debug::_Safe_container<
69 unordered_set, _Alloc, __gnu_debug::_Safe_unordered_container> _Safe;
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;
90 typedef __gnu_debug::_Safe_iterator<
91 _Base_iterator, unordered_set> iterator;
92 typedef __gnu_debug::_Safe_iterator<
93 _Base_const_iterator, unordered_set> const_iterator;
94 typedef __gnu_debug::_Safe_local_iterator<
95 _Base_local_iterator, unordered_set> local_iterator;
96 typedef __gnu_debug::_Safe_local_iterator<
97 _Base_const_local_iterator, unordered_set> const_local_iterator;
99 unordered_set() = default;
102 unordered_set(size_type __n,
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>
298 std::pair<iterator, bool>
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)
311 __glibcxx_check_insert(__hint);
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 };
319 std::pair<iterator, bool>
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)
331 __glibcxx_check_insert(__hint);
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 };
338 std::pair<iterator, bool>
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)
350 __glibcxx_check_insert(__hint);
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 };
358 insert(std::initializer_list<value_type> __l)
360 size_type __bucket_count = this->bucket_count();
362 _M_check_rehashed(__bucket_count);
365 template<typename _InputIterator>
367 insert(_InputIterator __first, _InputIterator __last)
369 typename __gnu_debug::_Distance_traits<_InputIterator>::__type __dist;
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)
389 __glibcxx_check_erase(__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)
413 __glibcxx_check_insert(__hint);
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 }; }
428 std::pair<iterator, iterator>
429 equal_range(const key_type& __key)
431 auto __res = _Base::equal_range(__key);
432 return { { __res.first, this }, { __res.second, this } };
435 std::pair<const_iterator, const_iterator>
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)
458 __glibcxx_check_erase(__it);
459 return { _M_erase(__it.base()), this };
465 __glibcxx_check_erase(__it);
466 return { _M_erase(__it.base()), this };
470 erase(const_iterator __first, const_iterator __last)
472 __glibcxx_check_erase_range(__first, __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_locals();
503 _M_invalidate(_Base_const_iterator __victim)
505 this->_M_invalidate_if(
506 [__victim](_Base_const_iterator __it) { return __it == __victim; });
507 this->_M_invalidate_local_if(
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 = _RequireAllocator<_Allocator>>
543 unordered_set(_InputIterator, _InputIterator,
544 unordered_set<int>::size_type = {},
545 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
546 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
547 _Hash, _Pred, _Allocator>;
549 template<typename _Tp, typename _Hash = hash<_Tp>,
550 typename _Pred = equal_to<_Tp>,
551 typename _Allocator = allocator<_Tp>,
552 typename = _RequireAllocator<_Allocator>>
553 unordered_set(initializer_list<_Tp>,
554 unordered_set<int>::size_type = {},
555 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
556 -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
558 template<typename _InputIterator, typename _Allocator,
559 typename = _RequireInputIter<_InputIterator>,
560 typename = _RequireAllocator<_Allocator>>
561 unordered_set(_InputIterator, _InputIterator,
562 unordered_set<int>::size_type, _Allocator)
563 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
565 typename iterator_traits<_InputIterator>::value_type>,
567 typename iterator_traits<_InputIterator>::value_type>,
570 template<typename _InputIterator, typename _Hash, typename _Allocator,
571 typename = _RequireInputIter<_InputIterator>,
572 typename = _RequireAllocator<_Allocator>>
573 unordered_set(_InputIterator, _InputIterator,
574 unordered_set<int>::size_type,
576 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
579 typename iterator_traits<_InputIterator>::value_type>,
582 template<typename _Tp, typename _Allocator,
583 typename = _RequireAllocator<_Allocator>>
584 unordered_set(initializer_list<_Tp>,
585 unordered_set<int>::size_type, _Allocator)
586 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
588 template<typename _Tp, typename _Hash, typename _Allocator,
589 typename = _RequireAllocator<_Allocator>>
590 unordered_set(initializer_list<_Tp>,
591 unordered_set<int>::size_type, _Hash, _Allocator)
592 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
596 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
598 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
599 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
600 noexcept(noexcept(__x.swap(__y)))
603 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
605 operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
606 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
607 { return __x._M_base() == __y._M_base(); }
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 == __y); }
616 /// Class std::unordered_multiset with safety/checking/debug instrumentation.
617 template<typename _Value,
618 typename _Hash = std::hash<_Value>,
619 typename _Pred = std::equal_to<_Value>,
620 typename _Alloc = std::allocator<_Value> >
621 class unordered_multiset
622 : public __gnu_debug::_Safe_container<
623 unordered_multiset<_Value, _Hash, _Pred, _Alloc>, _Alloc,
624 __gnu_debug::_Safe_unordered_container>,
625 public _GLIBCXX_STD_C::unordered_multiset<_Value, _Hash, _Pred, _Alloc>
627 typedef _GLIBCXX_STD_C::unordered_multiset<
628 _Value, _Hash, _Pred, _Alloc> _Base;
629 typedef __gnu_debug::_Safe_container<unordered_multiset,
630 _Alloc, __gnu_debug::_Safe_unordered_container> _Safe;
631 typedef typename _Base::const_iterator _Base_const_iterator;
632 typedef typename _Base::iterator _Base_iterator;
633 typedef typename _Base::const_local_iterator
634 _Base_const_local_iterator;
635 typedef typename _Base::local_iterator _Base_local_iterator;
637 template<typename _ItT, typename _SeqT, typename _CatT>
638 friend class ::__gnu_debug::_Safe_iterator;
639 template<typename _ItT, typename _SeqT>
640 friend class ::__gnu_debug::_Safe_local_iterator;
643 typedef typename _Base::size_type size_type;
644 typedef typename _Base::hasher hasher;
645 typedef typename _Base::key_equal key_equal;
646 typedef typename _Base::allocator_type allocator_type;
648 typedef typename _Base::key_type key_type;
649 typedef typename _Base::value_type value_type;
651 typedef __gnu_debug::_Safe_iterator<
652 _Base_iterator, unordered_multiset> iterator;
653 typedef __gnu_debug::_Safe_iterator<
654 _Base_const_iterator, unordered_multiset> const_iterator;
655 typedef __gnu_debug::_Safe_local_iterator<
656 _Base_local_iterator, unordered_multiset> local_iterator;
657 typedef __gnu_debug::_Safe_local_iterator<
658 _Base_const_local_iterator, unordered_multiset> const_local_iterator;
660 unordered_multiset() = default;
663 unordered_multiset(size_type __n,
664 const hasher& __hf = hasher(),
665 const key_equal& __eql = key_equal(),
666 const allocator_type& __a = allocator_type())
667 : _Base(__n, __hf, __eql, __a) { }
669 template<typename _InputIterator>
670 unordered_multiset(_InputIterator __first, _InputIterator __last,
672 const hasher& __hf = hasher(),
673 const key_equal& __eql = key_equal(),
674 const allocator_type& __a = allocator_type())
675 : _Base(__gnu_debug::__base(
676 __glibcxx_check_valid_constructor_range(__first, __last)),
677 __gnu_debug::__base(__last), __n,
678 __hf, __eql, __a) { }
680 unordered_multiset(const unordered_multiset&) = default;
682 unordered_multiset(const _Base& __x)
685 unordered_multiset(unordered_multiset&&) = default;
688 unordered_multiset(const allocator_type& __a)
691 unordered_multiset(const unordered_multiset& __uset,
692 const allocator_type& __a)
693 : _Base(__uset, __a) { }
695 unordered_multiset(unordered_multiset&& __uset,
696 const allocator_type& __a)
697 : _Safe(std::move(__uset._M_safe()), __a),
698 _Base(std::move(__uset._M_base()), __a) { }
700 unordered_multiset(initializer_list<value_type> __l,
702 const hasher& __hf = hasher(),
703 const key_equal& __eql = key_equal(),
704 const allocator_type& __a = allocator_type())
705 : _Base(__l, __n, __hf, __eql, __a) { }
707 unordered_multiset(size_type __n, const allocator_type& __a)
708 : unordered_multiset(__n, hasher(), key_equal(), __a)
711 unordered_multiset(size_type __n, const hasher& __hf,
712 const allocator_type& __a)
713 : unordered_multiset(__n, __hf, key_equal(), __a)
716 template<typename _InputIterator>
717 unordered_multiset(_InputIterator __first, _InputIterator __last,
719 const allocator_type& __a)
720 : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a)
723 template<typename _InputIterator>
724 unordered_multiset(_InputIterator __first, _InputIterator __last,
725 size_type __n, const hasher& __hf,
726 const allocator_type& __a)
727 : unordered_multiset(__first, __last, __n, __hf, key_equal(), __a)
730 unordered_multiset(initializer_list<value_type> __l,
732 const allocator_type& __a)
733 : unordered_multiset(__l, __n, hasher(), key_equal(), __a)
736 unordered_multiset(initializer_list<value_type> __l,
737 size_type __n, const hasher& __hf,
738 const allocator_type& __a)
739 : unordered_multiset(__l, __n, __hf, key_equal(), __a)
742 ~unordered_multiset() = default;
745 operator=(const unordered_multiset&) = default;
748 operator=(unordered_multiset&&) = default;
751 operator=(initializer_list<value_type> __l)
753 this->_M_base() = __l;
754 this->_M_invalidate_all();
759 swap(unordered_multiset& __x)
760 noexcept( noexcept(declval<_Base&>().swap(__x)) )
770 this->_M_invalidate_all();
775 { return { _Base::begin(), this }; }
778 begin() const noexcept
779 { return { _Base::begin(), this }; }
783 { return { _Base::end(), this }; }
787 { return { _Base::end(), this }; }
790 cbegin() const noexcept
791 { return { _Base::cbegin(), this }; }
794 cend() const noexcept
795 { return { _Base::cend(), this }; }
801 __glibcxx_check_bucket_index(__b);
802 return { _Base::begin(__b), this };
808 __glibcxx_check_bucket_index(__b);
809 return { _Base::end(__b), this };
813 begin(size_type __b) const
815 __glibcxx_check_bucket_index(__b);
816 return { _Base::begin(__b), this };
820 end(size_type __b) const
822 __glibcxx_check_bucket_index(__b);
823 return { _Base::end(__b), this };
827 cbegin(size_type __b) const
829 __glibcxx_check_bucket_index(__b);
830 return { _Base::cbegin(__b), this };
834 cend(size_type __b) const
836 __glibcxx_check_bucket_index(__b);
837 return { _Base::cend(__b), this };
841 bucket_size(size_type __b) const
843 __glibcxx_check_bucket_index(__b);
844 return _Base::bucket_size(__b);
848 max_load_factor() const noexcept
849 { return _Base::max_load_factor(); }
852 max_load_factor(float __f)
854 __glibcxx_check_max_load_factor(__f);
855 _Base::max_load_factor(__f);
858 template<typename... _Args>
860 emplace(_Args&&... __args)
862 size_type __bucket_count = this->bucket_count();
863 auto __it = _Base::emplace(std::forward<_Args>(__args)...);
864 _M_check_rehashed(__bucket_count);
865 return { __it, this };
868 template<typename... _Args>
870 emplace_hint(const_iterator __hint, _Args&&... __args)
872 __glibcxx_check_insert(__hint);
873 size_type __bucket_count = this->bucket_count();
874 auto __it = _Base::emplace_hint(__hint.base(),
875 std::forward<_Args>(__args)...);
876 _M_check_rehashed(__bucket_count);
877 return { __it, this };
881 insert(const value_type& __obj)
883 size_type __bucket_count = this->bucket_count();
884 auto __it = _Base::insert(__obj);
885 _M_check_rehashed(__bucket_count);
886 return { __it, this };
890 insert(const_iterator __hint, const value_type& __obj)
892 __glibcxx_check_insert(__hint);
893 size_type __bucket_count = this->bucket_count();
894 auto __it = _Base::insert(__hint.base(), __obj);
895 _M_check_rehashed(__bucket_count);
896 return { __it, this };
900 insert(value_type&& __obj)
902 size_type __bucket_count = this->bucket_count();
903 auto __it = _Base::insert(std::move(__obj));
904 _M_check_rehashed(__bucket_count);
905 return { __it, this };
909 insert(const_iterator __hint, value_type&& __obj)
911 __glibcxx_check_insert(__hint);
912 size_type __bucket_count = this->bucket_count();
913 auto __it = _Base::insert(__hint.base(), std::move(__obj));
914 _M_check_rehashed(__bucket_count);
915 return { __it, this };
919 insert(std::initializer_list<value_type> __l)
921 size_type __bucket_count = this->bucket_count();
923 _M_check_rehashed(__bucket_count);
926 template<typename _InputIterator>
928 insert(_InputIterator __first, _InputIterator __last)
930 typename __gnu_debug::_Distance_traits<_InputIterator>::__type __dist;
931 __glibcxx_check_valid_range2(__first, __last, __dist);
932 size_type __bucket_count = this->bucket_count();
934 if (__dist.second >= __gnu_debug::__dp_sign)
935 _Base::insert(__gnu_debug::__unsafe(__first),
936 __gnu_debug::__unsafe(__last));
938 _Base::insert(__first, __last);
940 _M_check_rehashed(__bucket_count);
943 #if __cplusplus > 201402L
944 using node_type = typename _Base::node_type;
947 extract(const_iterator __position)
949 __glibcxx_check_erase(__position);
950 return _M_extract(__position.base());
954 extract(const key_type& __key)
956 const auto __position = _Base::find(__key);
957 if (__position != _Base::end())
958 return _M_extract(__position);
963 insert(node_type&& __nh)
964 { return { _Base::insert(std::move(__nh)), this }; }
967 insert(const_iterator __hint, node_type&& __nh)
969 __glibcxx_check_insert(__hint);
970 return { _Base::insert(__hint.base(), std::move(__nh)), this };
977 find(const key_type& __key)
978 { return { _Base::find(__key), this }; }
981 find(const key_type& __key) const
982 { return { _Base::find(__key), this }; }
984 std::pair<iterator, iterator>
985 equal_range(const key_type& __key)
987 auto __res = _Base::equal_range(__key);
988 return { { __res.first, this }, { __res.second, this } };
991 std::pair<const_iterator, const_iterator>
992 equal_range(const key_type& __key) const
994 auto __res = _Base::equal_range(__key);
995 return { { __res.first, this }, { __res.second, this } };
999 erase(const key_type& __key)
1002 auto __pair = _Base::equal_range(__key);
1003 for (auto __victim = __pair.first; __victim != __pair.second;)
1005 _M_invalidate(__victim);
1006 __victim = _Base::erase(__victim);
1014 erase(const_iterator __it)
1016 __glibcxx_check_erase(__it);
1017 return { _M_erase(__it.base()), this };
1021 erase(iterator __it)
1023 __glibcxx_check_erase(__it);
1024 return { _M_erase(__it.base()), this };
1028 erase(const_iterator __first, const_iterator __last)
1030 __glibcxx_check_erase_range(__first, __last);
1031 for (auto __tmp = __first.base(); __tmp != __last.base(); ++__tmp)
1033 _GLIBCXX_DEBUG_VERIFY(__tmp != _Base::cend(),
1034 _M_message(__gnu_debug::__msg_valid_range)
1035 ._M_iterator(__first, "first")
1036 ._M_iterator(__last, "last"));
1037 _M_invalidate(__tmp);
1039 return { _Base::erase(__first.base(), __last.base()), this };
1043 _M_base() noexcept { return *this; }
1046 _M_base() const noexcept { return *this; }
1050 _M_check_rehashed(size_type __prev_count)
1052 if (__prev_count != this->bucket_count())
1053 this->_M_invalidate_locals();
1057 _M_invalidate(_Base_const_iterator __victim)
1059 this->_M_invalidate_if(
1060 [__victim](_Base_const_iterator __it) { return __it == __victim; });
1061 this->_M_invalidate_local_if(
1062 [__victim](_Base_const_local_iterator __it)
1063 { return __it._M_curr() == __victim._M_cur; });
1067 _M_erase(_Base_const_iterator __victim)
1069 _M_invalidate(__victim);
1070 size_type __bucket_count = this->bucket_count();
1071 _Base_iterator __next = _Base::erase(__victim);
1072 _M_check_rehashed(__bucket_count);
1076 #if __cplusplus > 201402L
1078 _M_extract(_Base_const_iterator __victim)
1080 _M_invalidate(__victim);
1081 return _Base::extract(__victim);
1086 #if __cpp_deduction_guides >= 201606
1088 template<typename _InputIterator,
1090 hash<typename iterator_traits<_InputIterator>::value_type>,
1092 equal_to<typename iterator_traits<_InputIterator>::value_type>,
1093 typename _Allocator =
1094 allocator<typename iterator_traits<_InputIterator>::value_type>,
1095 typename = _RequireInputIter<_InputIterator>,
1096 typename = _RequireAllocator<_Allocator>>
1097 unordered_multiset(_InputIterator, _InputIterator,
1098 unordered_multiset<int>::size_type = {},
1099 _Hash = _Hash(), _Pred = _Pred(),
1100 _Allocator = _Allocator())
1101 -> unordered_multiset<typename iterator_traits<_InputIterator>::value_type,
1102 _Hash, _Pred, _Allocator>;
1104 template<typename _Tp, typename _Hash = hash<_Tp>,
1105 typename _Pred = equal_to<_Tp>,
1106 typename _Allocator = allocator<_Tp>,
1107 typename = _RequireAllocator<_Allocator>>
1108 unordered_multiset(initializer_list<_Tp>,
1109 unordered_multiset<int>::size_type = {},
1110 _Hash = _Hash(), _Pred = _Pred(),
1111 _Allocator = _Allocator())
1112 -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;
1114 template<typename _InputIterator, typename _Allocator,
1115 typename = _RequireInputIter<_InputIterator>,
1116 typename = _RequireAllocator<_Allocator>>
1117 unordered_multiset(_InputIterator, _InputIterator,
1118 unordered_multiset<int>::size_type, _Allocator)
1119 -> unordered_multiset<typename iterator_traits<_InputIterator>::value_type,
1121 iterator_traits<_InputIterator>::value_type>,
1123 iterator_traits<_InputIterator>::value_type>,
1126 template<typename _InputIterator, typename _Hash, typename _Allocator,
1127 typename = _RequireInputIter<_InputIterator>,
1128 typename = _RequireAllocator<_Allocator>>
1129 unordered_multiset(_InputIterator, _InputIterator,
1130 unordered_multiset<int>::size_type,
1132 -> unordered_multiset<typename
1133 iterator_traits<_InputIterator>::value_type,
1137 iterator_traits<_InputIterator>::value_type>,
1140 template<typename _Tp, typename _Allocator,
1141 typename = _RequireAllocator<_Allocator>>
1142 unordered_multiset(initializer_list<_Tp>,
1143 unordered_multiset<int>::size_type, _Allocator)
1144 -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1146 template<typename _Tp, typename _Hash, typename _Allocator,
1147 typename = _RequireAllocator<_Allocator>>
1148 unordered_multiset(initializer_list<_Tp>,
1149 unordered_multiset<int>::size_type, _Hash, _Allocator)
1150 -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1154 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
1156 swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1157 unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1158 noexcept(noexcept(__x.swap(__y)))
1161 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
1163 operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1164 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1165 { return __x._M_base() == __y._M_base(); }
1167 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
1169 operator!=(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1170 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1171 { return !(__x == __y); }
1173 } // namespace __debug