1 // Debugging unordered_set/unordered_multiset implementation -*- C++ -*-
3 // Copyright (C) 2003-2020 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_all();
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 = _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 #if __cpp_impl_three_way_comparison < 201907L
616 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
618 operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
619 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
620 { return !(__x == __y); }
623 /// Class std::unordered_multiset with safety/checking/debug instrumentation.
624 template<typename _Value,
625 typename _Hash = std::hash<_Value>,
626 typename _Pred = std::equal_to<_Value>,
627 typename _Alloc = std::allocator<_Value> >
628 class unordered_multiset
629 : public __gnu_debug::_Safe_container<
630 unordered_multiset<_Value, _Hash, _Pred, _Alloc>, _Alloc,
631 __gnu_debug::_Safe_unordered_container>,
632 public _GLIBCXX_STD_C::unordered_multiset<_Value, _Hash, _Pred, _Alloc>
634 typedef _GLIBCXX_STD_C::unordered_multiset<
635 _Value, _Hash, _Pred, _Alloc> _Base;
636 typedef __gnu_debug::_Safe_container<unordered_multiset,
637 _Alloc, __gnu_debug::_Safe_unordered_container> _Safe;
638 typedef typename _Base::const_iterator _Base_const_iterator;
639 typedef typename _Base::iterator _Base_iterator;
640 typedef typename _Base::const_local_iterator
641 _Base_const_local_iterator;
642 typedef typename _Base::local_iterator _Base_local_iterator;
644 template<typename _ItT, typename _SeqT, typename _CatT>
645 friend class ::__gnu_debug::_Safe_iterator;
646 template<typename _ItT, typename _SeqT>
647 friend class ::__gnu_debug::_Safe_local_iterator;
650 typedef typename _Base::size_type size_type;
651 typedef typename _Base::hasher hasher;
652 typedef typename _Base::key_equal key_equal;
653 typedef typename _Base::allocator_type allocator_type;
655 typedef typename _Base::key_type key_type;
656 typedef typename _Base::value_type value_type;
658 typedef __gnu_debug::_Safe_iterator<
659 _Base_iterator, unordered_multiset> iterator;
660 typedef __gnu_debug::_Safe_iterator<
661 _Base_const_iterator, unordered_multiset> const_iterator;
662 typedef __gnu_debug::_Safe_local_iterator<
663 _Base_local_iterator, unordered_multiset> local_iterator;
664 typedef __gnu_debug::_Safe_local_iterator<
665 _Base_const_local_iterator, unordered_multiset> const_local_iterator;
667 unordered_multiset() = default;
670 unordered_multiset(size_type __n,
671 const hasher& __hf = hasher(),
672 const key_equal& __eql = key_equal(),
673 const allocator_type& __a = allocator_type())
674 : _Base(__n, __hf, __eql, __a) { }
676 template<typename _InputIterator>
677 unordered_multiset(_InputIterator __first, _InputIterator __last,
679 const hasher& __hf = hasher(),
680 const key_equal& __eql = key_equal(),
681 const allocator_type& __a = allocator_type())
682 : _Base(__gnu_debug::__base(
683 __glibcxx_check_valid_constructor_range(__first, __last)),
684 __gnu_debug::__base(__last), __n,
685 __hf, __eql, __a) { }
687 unordered_multiset(const unordered_multiset&) = default;
689 unordered_multiset(const _Base& __x)
692 unordered_multiset(unordered_multiset&&) = default;
695 unordered_multiset(const allocator_type& __a)
698 unordered_multiset(const unordered_multiset& __uset,
699 const allocator_type& __a)
700 : _Base(__uset, __a) { }
702 unordered_multiset(unordered_multiset&& __uset,
703 const allocator_type& __a)
704 : _Safe(std::move(__uset._M_safe()), __a),
705 _Base(std::move(__uset._M_base()), __a) { }
707 unordered_multiset(initializer_list<value_type> __l,
709 const hasher& __hf = hasher(),
710 const key_equal& __eql = key_equal(),
711 const allocator_type& __a = allocator_type())
712 : _Base(__l, __n, __hf, __eql, __a) { }
714 unordered_multiset(size_type __n, const allocator_type& __a)
715 : unordered_multiset(__n, hasher(), key_equal(), __a)
718 unordered_multiset(size_type __n, const hasher& __hf,
719 const allocator_type& __a)
720 : unordered_multiset(__n, __hf, key_equal(), __a)
723 template<typename _InputIterator>
724 unordered_multiset(_InputIterator __first, _InputIterator __last,
726 const allocator_type& __a)
727 : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a)
730 template<typename _InputIterator>
731 unordered_multiset(_InputIterator __first, _InputIterator __last,
732 size_type __n, const hasher& __hf,
733 const allocator_type& __a)
734 : unordered_multiset(__first, __last, __n, __hf, key_equal(), __a)
737 unordered_multiset(initializer_list<value_type> __l,
739 const allocator_type& __a)
740 : unordered_multiset(__l, __n, hasher(), key_equal(), __a)
743 unordered_multiset(initializer_list<value_type> __l,
744 size_type __n, const hasher& __hf,
745 const allocator_type& __a)
746 : unordered_multiset(__l, __n, __hf, key_equal(), __a)
749 ~unordered_multiset() = default;
752 operator=(const unordered_multiset&) = default;
755 operator=(unordered_multiset&&) = default;
758 operator=(initializer_list<value_type> __l)
760 this->_M_base() = __l;
761 this->_M_invalidate_all();
766 swap(unordered_multiset& __x)
767 noexcept( noexcept(declval<_Base&>().swap(__x)) )
777 this->_M_invalidate_all();
782 { return { _Base::begin(), this }; }
785 begin() const noexcept
786 { return { _Base::begin(), this }; }
790 { return { _Base::end(), this }; }
794 { return { _Base::end(), this }; }
797 cbegin() const noexcept
798 { return { _Base::cbegin(), this }; }
801 cend() const noexcept
802 { return { _Base::cend(), this }; }
808 __glibcxx_check_bucket_index(__b);
809 return { _Base::begin(__b), this };
815 __glibcxx_check_bucket_index(__b);
816 return { _Base::end(__b), this };
820 begin(size_type __b) const
822 __glibcxx_check_bucket_index(__b);
823 return { _Base::begin(__b), this };
827 end(size_type __b) const
829 __glibcxx_check_bucket_index(__b);
830 return { _Base::end(__b), this };
834 cbegin(size_type __b) const
836 __glibcxx_check_bucket_index(__b);
837 return { _Base::cbegin(__b), this };
841 cend(size_type __b) const
843 __glibcxx_check_bucket_index(__b);
844 return { _Base::cend(__b), this };
848 bucket_size(size_type __b) const
850 __glibcxx_check_bucket_index(__b);
851 return _Base::bucket_size(__b);
855 max_load_factor() const noexcept
856 { return _Base::max_load_factor(); }
859 max_load_factor(float __f)
861 __glibcxx_check_max_load_factor(__f);
862 _Base::max_load_factor(__f);
865 template<typename... _Args>
867 emplace(_Args&&... __args)
869 size_type __bucket_count = this->bucket_count();
870 auto __it = _Base::emplace(std::forward<_Args>(__args)...);
871 _M_check_rehashed(__bucket_count);
872 return { __it, this };
875 template<typename... _Args>
877 emplace_hint(const_iterator __hint, _Args&&... __args)
879 __glibcxx_check_insert(__hint);
880 size_type __bucket_count = this->bucket_count();
881 auto __it = _Base::emplace_hint(__hint.base(),
882 std::forward<_Args>(__args)...);
883 _M_check_rehashed(__bucket_count);
884 return { __it, this };
888 insert(const value_type& __obj)
890 size_type __bucket_count = this->bucket_count();
891 auto __it = _Base::insert(__obj);
892 _M_check_rehashed(__bucket_count);
893 return { __it, this };
897 insert(const_iterator __hint, const value_type& __obj)
899 __glibcxx_check_insert(__hint);
900 size_type __bucket_count = this->bucket_count();
901 auto __it = _Base::insert(__hint.base(), __obj);
902 _M_check_rehashed(__bucket_count);
903 return { __it, this };
907 insert(value_type&& __obj)
909 size_type __bucket_count = this->bucket_count();
910 auto __it = _Base::insert(std::move(__obj));
911 _M_check_rehashed(__bucket_count);
912 return { __it, this };
916 insert(const_iterator __hint, value_type&& __obj)
918 __glibcxx_check_insert(__hint);
919 size_type __bucket_count = this->bucket_count();
920 auto __it = _Base::insert(__hint.base(), std::move(__obj));
921 _M_check_rehashed(__bucket_count);
922 return { __it, this };
926 insert(std::initializer_list<value_type> __l)
928 size_type __bucket_count = this->bucket_count();
930 _M_check_rehashed(__bucket_count);
933 template<typename _InputIterator>
935 insert(_InputIterator __first, _InputIterator __last)
937 typename __gnu_debug::_Distance_traits<_InputIterator>::__type __dist;
938 __glibcxx_check_valid_range2(__first, __last, __dist);
939 size_type __bucket_count = this->bucket_count();
941 if (__dist.second >= __gnu_debug::__dp_sign)
942 _Base::insert(__gnu_debug::__unsafe(__first),
943 __gnu_debug::__unsafe(__last));
945 _Base::insert(__first, __last);
947 _M_check_rehashed(__bucket_count);
950 #if __cplusplus > 201402L
951 using node_type = typename _Base::node_type;
954 extract(const_iterator __position)
956 __glibcxx_check_erase(__position);
957 return _M_extract(__position.base());
961 extract(const key_type& __key)
963 const auto __position = _Base::find(__key);
964 if (__position != _Base::end())
965 return _M_extract(__position);
970 insert(node_type&& __nh)
971 { return { _Base::insert(std::move(__nh)), this }; }
974 insert(const_iterator __hint, node_type&& __nh)
976 __glibcxx_check_insert(__hint);
977 return { _Base::insert(__hint.base(), std::move(__nh)), this };
984 find(const key_type& __key)
985 { return { _Base::find(__key), this }; }
988 find(const key_type& __key) const
989 { return { _Base::find(__key), this }; }
991 std::pair<iterator, iterator>
992 equal_range(const key_type& __key)
994 auto __res = _Base::equal_range(__key);
995 return { { __res.first, this }, { __res.second, this } };
998 std::pair<const_iterator, const_iterator>
999 equal_range(const key_type& __key) const
1001 auto __res = _Base::equal_range(__key);
1002 return { { __res.first, this }, { __res.second, this } };
1006 erase(const key_type& __key)
1009 auto __pair = _Base::equal_range(__key);
1010 for (auto __victim = __pair.first; __victim != __pair.second;)
1012 _M_invalidate(__victim);
1013 __victim = _Base::erase(__victim);
1021 erase(const_iterator __it)
1023 __glibcxx_check_erase(__it);
1024 return { _M_erase(__it.base()), this };
1028 erase(iterator __it)
1030 __glibcxx_check_erase(__it);
1031 return { _M_erase(__it.base()), this };
1035 erase(const_iterator __first, const_iterator __last)
1037 __glibcxx_check_erase_range(__first, __last);
1038 for (auto __tmp = __first.base(); __tmp != __last.base(); ++__tmp)
1040 _GLIBCXX_DEBUG_VERIFY(__tmp != _Base::cend(),
1041 _M_message(__gnu_debug::__msg_valid_range)
1042 ._M_iterator(__first, "first")
1043 ._M_iterator(__last, "last"));
1044 _M_invalidate(__tmp);
1046 return { _Base::erase(__first.base(), __last.base()), this };
1050 _M_base() noexcept { return *this; }
1053 _M_base() const noexcept { return *this; }
1057 _M_check_rehashed(size_type __prev_count)
1059 if (__prev_count != this->bucket_count())
1060 this->_M_invalidate_all();
1064 _M_invalidate(_Base_const_iterator __victim)
1066 this->_M_invalidate_if(
1067 [__victim](_Base_const_iterator __it) { return __it == __victim; });
1068 this->_M_invalidate_local_if(
1069 [__victim](_Base_const_local_iterator __it)
1070 { return __it._M_curr() == __victim._M_cur; });
1074 _M_erase(_Base_const_iterator __victim)
1076 _M_invalidate(__victim);
1077 size_type __bucket_count = this->bucket_count();
1078 _Base_iterator __next = _Base::erase(__victim);
1079 _M_check_rehashed(__bucket_count);
1083 #if __cplusplus > 201402L
1085 _M_extract(_Base_const_iterator __victim)
1087 _M_invalidate(__victim);
1088 return _Base::extract(__victim);
1093 #if __cpp_deduction_guides >= 201606
1095 template<typename _InputIterator,
1097 hash<typename iterator_traits<_InputIterator>::value_type>,
1099 equal_to<typename iterator_traits<_InputIterator>::value_type>,
1100 typename _Allocator =
1101 allocator<typename iterator_traits<_InputIterator>::value_type>,
1102 typename = _RequireInputIter<_InputIterator>,
1103 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1104 typename = _RequireNotAllocator<_Pred>,
1105 typename = _RequireAllocator<_Allocator>>
1106 unordered_multiset(_InputIterator, _InputIterator,
1107 unordered_multiset<int>::size_type = {},
1108 _Hash = _Hash(), _Pred = _Pred(),
1109 _Allocator = _Allocator())
1110 -> unordered_multiset<typename iterator_traits<_InputIterator>::value_type,
1111 _Hash, _Pred, _Allocator>;
1113 template<typename _Tp, typename _Hash = hash<_Tp>,
1114 typename _Pred = equal_to<_Tp>,
1115 typename _Allocator = allocator<_Tp>,
1116 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1117 typename = _RequireNotAllocator<_Pred>,
1118 typename = _RequireAllocator<_Allocator>>
1119 unordered_multiset(initializer_list<_Tp>,
1120 unordered_multiset<int>::size_type = {},
1121 _Hash = _Hash(), _Pred = _Pred(),
1122 _Allocator = _Allocator())
1123 -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;
1125 template<typename _InputIterator, typename _Allocator,
1126 typename = _RequireInputIter<_InputIterator>,
1127 typename = _RequireAllocator<_Allocator>>
1128 unordered_multiset(_InputIterator, _InputIterator,
1129 unordered_multiset<int>::size_type, _Allocator)
1130 -> unordered_multiset<typename iterator_traits<_InputIterator>::value_type,
1132 iterator_traits<_InputIterator>::value_type>,
1134 iterator_traits<_InputIterator>::value_type>,
1137 template<typename _InputIterator, typename _Hash, typename _Allocator,
1138 typename = _RequireInputIter<_InputIterator>,
1139 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1140 typename = _RequireAllocator<_Allocator>>
1141 unordered_multiset(_InputIterator, _InputIterator,
1142 unordered_multiset<int>::size_type,
1144 -> unordered_multiset<typename
1145 iterator_traits<_InputIterator>::value_type,
1149 iterator_traits<_InputIterator>::value_type>,
1152 template<typename _Tp, typename _Allocator,
1153 typename = _RequireAllocator<_Allocator>>
1154 unordered_multiset(initializer_list<_Tp>,
1155 unordered_multiset<int>::size_type, _Allocator)
1156 -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1158 template<typename _Tp, typename _Hash, typename _Allocator,
1159 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1160 typename = _RequireAllocator<_Allocator>>
1161 unordered_multiset(initializer_list<_Tp>,
1162 unordered_multiset<int>::size_type, _Hash, _Allocator)
1163 -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1167 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
1169 swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1170 unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1171 noexcept(noexcept(__x.swap(__y)))
1174 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
1176 operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1177 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1178 { return __x._M_base() == __y._M_base(); }
1180 #if __cpp_impl_three_way_comparison < 201907L
1181 template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
1183 operator!=(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1184 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1185 { return !(__x == __y); }
1188 } // namespace __debug