2 //===----------------------------------------------------------------------===//
4 // The LLVM Compiler Infrastructure
6 // This file is dual licensed under the MIT and the University of Illinois Open
7 // Source Licenses. See LICENSE.TXT for details.
9 //===----------------------------------------------------------------------===//
11 #ifndef _LIBCPP__HASH_TABLE
12 #define _LIBCPP__HASH_TABLE
15 #include <initializer_list>
21 #include <type_traits>
25 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
26 #pragma GCC system_header
30 #include <__undef_macros>
33 _LIBCPP_BEGIN_NAMESPACE_STD
35 template <class _Key, class _Tp>
36 struct __hash_value_type;
38 template <class _Key, class _Cp, class _Hash,
39 bool = is_empty<_Hash>::value && !__libcpp_is_final<_Hash>::value>
40 class __unordered_map_hasher;
42 template <class _Key, class _Cp, class _Pred,
43 bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value
45 class __unordered_map_equal;
47 #ifndef _LIBCPP_CXX03_LANG
49 struct __is_hash_value_type_imp : false_type {};
51 template <class _Key, class _Value>
52 struct __is_hash_value_type_imp<__hash_value_type<_Key, _Value>> : true_type {};
54 template <class ..._Args>
55 struct __is_hash_value_type : false_type {};
58 struct __is_hash_value_type<_One> : __is_hash_value_type_imp<typename __uncvref<_One>::type> {};
62 size_t __next_prime(size_t __n);
64 template <class _NodePtr>
65 struct __hash_node_base
67 typedef typename pointer_traits<_NodePtr>::element_type __node_type;
68 typedef __hash_node_base __first_node;
69 typedef typename __rebind_pointer<_NodePtr, __first_node>::type __node_base_pointer;
70 typedef _NodePtr __node_pointer;
72 #if defined(_LIBCPP_ABI_FIX_UNORDERED_NODE_POINTER_UB)
73 typedef __node_base_pointer __next_pointer;
75 typedef typename conditional<
76 is_pointer<__node_pointer>::value,
78 __node_pointer>::type __next_pointer;
81 __next_pointer __next_;
83 _LIBCPP_INLINE_VISIBILITY
84 __next_pointer __ptr() _NOEXCEPT {
85 return static_cast<__next_pointer>(
86 pointer_traits<__node_base_pointer>::pointer_to(*this));
89 _LIBCPP_INLINE_VISIBILITY
90 __node_pointer __upcast() _NOEXCEPT {
91 return static_cast<__node_pointer>(
92 pointer_traits<__node_base_pointer>::pointer_to(*this));
95 _LIBCPP_INLINE_VISIBILITY
96 size_t __hash() const _NOEXCEPT {
97 return static_cast<__node_type const&>(*this).__hash_;
100 _LIBCPP_INLINE_VISIBILITY __hash_node_base() _NOEXCEPT : __next_(nullptr) {}
103 template <class _Tp, class _VoidPtr>
105 : public __hash_node_base
107 typename __rebind_pointer<_VoidPtr, __hash_node<_Tp, _VoidPtr> >::type
110 typedef _Tp __node_value_type;
113 __node_value_type __value_;
116 inline _LIBCPP_INLINE_VISIBILITY
118 __is_hash_power2(size_t __bc)
120 return __bc > 2 && !(__bc & (__bc - 1));
123 inline _LIBCPP_INLINE_VISIBILITY
125 __constrain_hash(size_t __h, size_t __bc)
127 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) :
128 (__h < __bc ? __h : __h % __bc);
131 inline _LIBCPP_INLINE_VISIBILITY
133 __next_hash_pow2(size_t __n)
135 return __n < 2 ? __n : (size_t(1) << (std::numeric_limits<size_t>::digits - __clz(__n-1)));
139 template <class _Tp, class _Hash, class _Equal, class _Alloc> class __hash_table;
141 template <class _NodePtr> class _LIBCPP_TEMPLATE_VIS __hash_iterator;
142 template <class _ConstNodePtr> class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
143 template <class _NodePtr> class _LIBCPP_TEMPLATE_VIS __hash_local_iterator;
144 template <class _ConstNodePtr> class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
145 template <class _HashIterator> class _LIBCPP_TEMPLATE_VIS __hash_map_iterator;
146 template <class _HashIterator> class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
149 struct __hash_key_value_types {
150 static_assert(!is_reference<_Tp>::value && !is_const<_Tp>::value, "");
151 typedef _Tp key_type;
152 typedef _Tp __node_value_type;
153 typedef _Tp __container_value_type;
154 static const bool __is_map = false;
156 _LIBCPP_INLINE_VISIBILITY
157 static key_type const& __get_key(_Tp const& __v) {
160 _LIBCPP_INLINE_VISIBILITY
161 static __container_value_type const& __get_value(__node_value_type const& __v) {
164 _LIBCPP_INLINE_VISIBILITY
165 static __container_value_type* __get_ptr(__node_value_type& __n) {
166 return _VSTD::addressof(__n);
168 #ifndef _LIBCPP_CXX03_LANG
169 _LIBCPP_INLINE_VISIBILITY
170 static __container_value_type&& __move(__node_value_type& __v) {
171 return _VSTD::move(__v);
176 template <class _Key, class _Tp>
177 struct __hash_key_value_types<__hash_value_type<_Key, _Tp> > {
178 typedef _Key key_type;
179 typedef _Tp mapped_type;
180 typedef __hash_value_type<_Key, _Tp> __node_value_type;
181 typedef pair<const _Key, _Tp> __container_value_type;
182 typedef __container_value_type __map_value_type;
183 static const bool __is_map = true;
185 _LIBCPP_INLINE_VISIBILITY
186 static key_type const& __get_key(__container_value_type const& __v) {
191 _LIBCPP_INLINE_VISIBILITY
192 static typename enable_if<__is_same_uncvref<_Up, __node_value_type>::value,
193 __container_value_type const&>::type
194 __get_value(_Up& __t) {
195 return __t.__get_value();
199 _LIBCPP_INLINE_VISIBILITY
200 static typename enable_if<__is_same_uncvref<_Up, __container_value_type>::value,
201 __container_value_type const&>::type
202 __get_value(_Up& __t) {
206 _LIBCPP_INLINE_VISIBILITY
207 static __container_value_type* __get_ptr(__node_value_type& __n) {
208 return _VSTD::addressof(__n.__get_value());
210 #ifndef _LIBCPP_CXX03_LANG
211 _LIBCPP_INLINE_VISIBILITY
212 static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) {
219 template <class _Tp, class _AllocPtr, class _KVTypes = __hash_key_value_types<_Tp>,
220 bool = _KVTypes::__is_map>
221 struct __hash_map_pointer_types {};
223 template <class _Tp, class _AllocPtr, class _KVTypes>
224 struct __hash_map_pointer_types<_Tp, _AllocPtr, _KVTypes, true> {
225 typedef typename _KVTypes::__map_value_type _Mv;
226 typedef typename __rebind_pointer<_AllocPtr, _Mv>::type
227 __map_value_type_pointer;
228 typedef typename __rebind_pointer<_AllocPtr, const _Mv>::type
229 __const_map_value_type_pointer;
232 template <class _NodePtr, class _NodeT = typename pointer_traits<_NodePtr>::element_type>
233 struct __hash_node_types;
235 template <class _NodePtr, class _Tp, class _VoidPtr>
236 struct __hash_node_types<_NodePtr, __hash_node<_Tp, _VoidPtr> >
237 : public __hash_key_value_types<_Tp>, __hash_map_pointer_types<_Tp, _VoidPtr>
240 typedef __hash_key_value_types<_Tp> __base;
243 typedef ptrdiff_t difference_type;
244 typedef size_t size_type;
246 typedef typename __rebind_pointer<_NodePtr, void>::type __void_pointer;
248 typedef typename pointer_traits<_NodePtr>::element_type __node_type;
249 typedef _NodePtr __node_pointer;
251 typedef __hash_node_base<__node_pointer> __node_base_type;
252 typedef typename __rebind_pointer<_NodePtr, __node_base_type>::type
255 typedef typename __node_base_type::__next_pointer __next_pointer;
257 typedef _Tp __node_value_type;
258 typedef typename __rebind_pointer<_VoidPtr, __node_value_type>::type
259 __node_value_type_pointer;
260 typedef typename __rebind_pointer<_VoidPtr, const __node_value_type>::type
261 __const_node_value_type_pointer;
264 static_assert(!is_const<__node_type>::value,
265 "_NodePtr should never be a pointer to const");
266 static_assert((is_same<typename pointer_traits<_VoidPtr>::element_type, void>::value),
267 "_VoidPtr does not point to unqualified void type");
268 static_assert((is_same<typename __rebind_pointer<_VoidPtr, __node_type>::type,
269 _NodePtr>::value), "_VoidPtr does not rebind to _NodePtr.");
272 template <class _HashIterator>
273 struct __hash_node_types_from_iterator;
274 template <class _NodePtr>
275 struct __hash_node_types_from_iterator<__hash_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
276 template <class _NodePtr>
277 struct __hash_node_types_from_iterator<__hash_const_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
278 template <class _NodePtr>
279 struct __hash_node_types_from_iterator<__hash_local_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
280 template <class _NodePtr>
281 struct __hash_node_types_from_iterator<__hash_const_local_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
284 template <class _NodeValueTp, class _VoidPtr>
285 struct __make_hash_node_types {
286 typedef __hash_node<_NodeValueTp, _VoidPtr> _NodeTp;
287 typedef typename __rebind_pointer<_VoidPtr, _NodeTp>::type _NodePtr;
288 typedef __hash_node_types<_NodePtr> type;
291 template <class _NodePtr>
292 class _LIBCPP_TEMPLATE_VIS __hash_iterator
294 typedef __hash_node_types<_NodePtr> _NodeTypes;
295 typedef _NodePtr __node_pointer;
296 typedef typename _NodeTypes::__next_pointer __next_pointer;
298 __next_pointer __node_;
301 typedef forward_iterator_tag iterator_category;
302 typedef typename _NodeTypes::__node_value_type value_type;
303 typedef typename _NodeTypes::difference_type difference_type;
304 typedef value_type& reference;
305 typedef typename _NodeTypes::__node_value_type_pointer pointer;
307 _LIBCPP_INLINE_VISIBILITY __hash_iterator() _NOEXCEPT : __node_(nullptr) {
308 _LIBCPP_DEBUG_MODE(__get_db()->__insert_i(this));
311 #if _LIBCPP_DEBUG_LEVEL >= 2
312 _LIBCPP_INLINE_VISIBILITY
313 __hash_iterator(const __hash_iterator& __i)
314 : __node_(__i.__node_)
316 __get_db()->__iterator_copy(this, &__i);
319 _LIBCPP_INLINE_VISIBILITY
322 __get_db()->__erase_i(this);
325 _LIBCPP_INLINE_VISIBILITY
326 __hash_iterator& operator=(const __hash_iterator& __i)
330 __get_db()->__iterator_copy(this, &__i);
331 __node_ = __i.__node_;
335 #endif // _LIBCPP_DEBUG_LEVEL >= 2
337 _LIBCPP_INLINE_VISIBILITY
338 reference operator*() const {
339 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
340 "Attempted to dereference a non-dereferenceable unordered container iterator");
341 return __node_->__upcast()->__value_;
344 _LIBCPP_INLINE_VISIBILITY
345 pointer operator->() const {
346 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
347 "Attempted to dereference a non-dereferenceable unordered container iterator");
348 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
351 _LIBCPP_INLINE_VISIBILITY
352 __hash_iterator& operator++() {
353 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
354 "Attempted to increment non-incrementable unordered container iterator");
355 __node_ = __node_->__next_;
359 _LIBCPP_INLINE_VISIBILITY
360 __hash_iterator operator++(int)
362 __hash_iterator __t(*this);
367 friend _LIBCPP_INLINE_VISIBILITY
368 bool operator==(const __hash_iterator& __x, const __hash_iterator& __y)
370 return __x.__node_ == __y.__node_;
372 friend _LIBCPP_INLINE_VISIBILITY
373 bool operator!=(const __hash_iterator& __x, const __hash_iterator& __y)
374 {return !(__x == __y);}
377 #if _LIBCPP_DEBUG_LEVEL >= 2
378 _LIBCPP_INLINE_VISIBILITY
379 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
382 __get_db()->__insert_ic(this, __c);
385 _LIBCPP_INLINE_VISIBILITY
386 __hash_iterator(__next_pointer __node) _NOEXCEPT
390 template <class, class, class, class> friend class __hash_table;
391 template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
392 template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_iterator;
393 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
394 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
397 template <class _NodePtr>
398 class _LIBCPP_TEMPLATE_VIS __hash_const_iterator
400 static_assert(!is_const<typename pointer_traits<_NodePtr>::element_type>::value, "");
401 typedef __hash_node_types<_NodePtr> _NodeTypes;
402 typedef _NodePtr __node_pointer;
403 typedef typename _NodeTypes::__next_pointer __next_pointer;
405 __next_pointer __node_;
408 typedef __hash_iterator<_NodePtr> __non_const_iterator;
410 typedef forward_iterator_tag iterator_category;
411 typedef typename _NodeTypes::__node_value_type value_type;
412 typedef typename _NodeTypes::difference_type difference_type;
413 typedef const value_type& reference;
414 typedef typename _NodeTypes::__const_node_value_type_pointer pointer;
417 _LIBCPP_INLINE_VISIBILITY __hash_const_iterator() _NOEXCEPT : __node_(nullptr) {
418 _LIBCPP_DEBUG_MODE(__get_db()->__insert_i(this));
421 _LIBCPP_INLINE_VISIBILITY
422 __hash_const_iterator(const __non_const_iterator& __x) _NOEXCEPT
423 : __node_(__x.__node_)
425 _LIBCPP_DEBUG_MODE(__get_db()->__iterator_copy(this, &__x));
428 #if _LIBCPP_DEBUG_LEVEL >= 2
429 _LIBCPP_INLINE_VISIBILITY
430 __hash_const_iterator(const __hash_const_iterator& __i)
431 : __node_(__i.__node_)
433 __get_db()->__iterator_copy(this, &__i);
436 _LIBCPP_INLINE_VISIBILITY
437 ~__hash_const_iterator()
439 __get_db()->__erase_i(this);
442 _LIBCPP_INLINE_VISIBILITY
443 __hash_const_iterator& operator=(const __hash_const_iterator& __i)
447 __get_db()->__iterator_copy(this, &__i);
448 __node_ = __i.__node_;
452 #endif // _LIBCPP_DEBUG_LEVEL >= 2
454 _LIBCPP_INLINE_VISIBILITY
455 reference operator*() const {
456 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
457 "Attempted to dereference a non-dereferenceable unordered container const_iterator");
458 return __node_->__upcast()->__value_;
460 _LIBCPP_INLINE_VISIBILITY
461 pointer operator->() const {
462 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
463 "Attempted to dereference a non-dereferenceable unordered container const_iterator");
464 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
467 _LIBCPP_INLINE_VISIBILITY
468 __hash_const_iterator& operator++() {
469 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
470 "Attempted to increment non-incrementable unordered container const_iterator");
471 __node_ = __node_->__next_;
475 _LIBCPP_INLINE_VISIBILITY
476 __hash_const_iterator operator++(int)
478 __hash_const_iterator __t(*this);
483 friend _LIBCPP_INLINE_VISIBILITY
484 bool operator==(const __hash_const_iterator& __x, const __hash_const_iterator& __y)
486 return __x.__node_ == __y.__node_;
488 friend _LIBCPP_INLINE_VISIBILITY
489 bool operator!=(const __hash_const_iterator& __x, const __hash_const_iterator& __y)
490 {return !(__x == __y);}
493 #if _LIBCPP_DEBUG_LEVEL >= 2
494 _LIBCPP_INLINE_VISIBILITY
495 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
498 __get_db()->__insert_ic(this, __c);
501 _LIBCPP_INLINE_VISIBILITY
502 __hash_const_iterator(__next_pointer __node) _NOEXCEPT
506 template <class, class, class, class> friend class __hash_table;
507 template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
508 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
509 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
512 template <class _NodePtr>
513 class _LIBCPP_TEMPLATE_VIS __hash_local_iterator
515 typedef __hash_node_types<_NodePtr> _NodeTypes;
516 typedef _NodePtr __node_pointer;
517 typedef typename _NodeTypes::__next_pointer __next_pointer;
519 __next_pointer __node_;
521 size_t __bucket_count_;
524 typedef forward_iterator_tag iterator_category;
525 typedef typename _NodeTypes::__node_value_type value_type;
526 typedef typename _NodeTypes::difference_type difference_type;
527 typedef value_type& reference;
528 typedef typename _NodeTypes::__node_value_type_pointer pointer;
530 _LIBCPP_INLINE_VISIBILITY __hash_local_iterator() _NOEXCEPT : __node_(nullptr) {
531 _LIBCPP_DEBUG_MODE(__get_db()->__insert_i(this));
534 #if _LIBCPP_DEBUG_LEVEL >= 2
535 _LIBCPP_INLINE_VISIBILITY
536 __hash_local_iterator(const __hash_local_iterator& __i)
537 : __node_(__i.__node_),
538 __bucket_(__i.__bucket_),
539 __bucket_count_(__i.__bucket_count_)
541 __get_db()->__iterator_copy(this, &__i);
544 _LIBCPP_INLINE_VISIBILITY
545 ~__hash_local_iterator()
547 __get_db()->__erase_i(this);
550 _LIBCPP_INLINE_VISIBILITY
551 __hash_local_iterator& operator=(const __hash_local_iterator& __i)
555 __get_db()->__iterator_copy(this, &__i);
556 __node_ = __i.__node_;
557 __bucket_ = __i.__bucket_;
558 __bucket_count_ = __i.__bucket_count_;
562 #endif // _LIBCPP_DEBUG_LEVEL >= 2
564 _LIBCPP_INLINE_VISIBILITY
565 reference operator*() const {
566 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
567 "Attempted to dereference a non-dereferenceable unordered container local_iterator");
568 return __node_->__upcast()->__value_;
571 _LIBCPP_INLINE_VISIBILITY
572 pointer operator->() const {
573 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
574 "Attempted to dereference a non-dereferenceable unordered container local_iterator");
575 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
578 _LIBCPP_INLINE_VISIBILITY
579 __hash_local_iterator& operator++() {
580 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
581 "Attempted to increment non-incrementable unordered container local_iterator");
582 __node_ = __node_->__next_;
583 if (__node_ != nullptr && __constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
588 _LIBCPP_INLINE_VISIBILITY
589 __hash_local_iterator operator++(int)
591 __hash_local_iterator __t(*this);
596 friend _LIBCPP_INLINE_VISIBILITY
597 bool operator==(const __hash_local_iterator& __x, const __hash_local_iterator& __y)
599 return __x.__node_ == __y.__node_;
601 friend _LIBCPP_INLINE_VISIBILITY
602 bool operator!=(const __hash_local_iterator& __x, const __hash_local_iterator& __y)
603 {return !(__x == __y);}
606 #if _LIBCPP_DEBUG_LEVEL >= 2
607 _LIBCPP_INLINE_VISIBILITY
608 __hash_local_iterator(__next_pointer __node, size_t __bucket,
609 size_t __bucket_count, const void* __c) _NOEXCEPT
612 __bucket_count_(__bucket_count)
614 __get_db()->__insert_ic(this, __c);
615 if (__node_ != nullptr)
616 __node_ = __node_->__next_;
619 _LIBCPP_INLINE_VISIBILITY
620 __hash_local_iterator(__next_pointer __node, size_t __bucket,
621 size_t __bucket_count) _NOEXCEPT
624 __bucket_count_(__bucket_count)
626 if (__node_ != nullptr)
627 __node_ = __node_->__next_;
630 template <class, class, class, class> friend class __hash_table;
631 template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
632 template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_iterator;
635 template <class _ConstNodePtr>
636 class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator
638 typedef __hash_node_types<_ConstNodePtr> _NodeTypes;
639 typedef _ConstNodePtr __node_pointer;
640 typedef typename _NodeTypes::__next_pointer __next_pointer;
642 __next_pointer __node_;
644 size_t __bucket_count_;
646 typedef pointer_traits<__node_pointer> __pointer_traits;
647 typedef typename __pointer_traits::element_type __node;
648 typedef typename remove_const<__node>::type __non_const_node;
649 typedef typename __rebind_pointer<__node_pointer, __non_const_node>::type
650 __non_const_node_pointer;
652 typedef __hash_local_iterator<__non_const_node_pointer>
653 __non_const_iterator;
655 typedef forward_iterator_tag iterator_category;
656 typedef typename _NodeTypes::__node_value_type value_type;
657 typedef typename _NodeTypes::difference_type difference_type;
658 typedef const value_type& reference;
659 typedef typename _NodeTypes::__const_node_value_type_pointer pointer;
662 _LIBCPP_INLINE_VISIBILITY __hash_const_local_iterator() _NOEXCEPT : __node_(nullptr) {
663 _LIBCPP_DEBUG_MODE(__get_db()->__insert_i(this));
666 _LIBCPP_INLINE_VISIBILITY
667 __hash_const_local_iterator(const __non_const_iterator& __x) _NOEXCEPT
668 : __node_(__x.__node_),
669 __bucket_(__x.__bucket_),
670 __bucket_count_(__x.__bucket_count_)
672 _LIBCPP_DEBUG_MODE(__get_db()->__iterator_copy(this, &__x));
675 #if _LIBCPP_DEBUG_LEVEL >= 2
676 _LIBCPP_INLINE_VISIBILITY
677 __hash_const_local_iterator(const __hash_const_local_iterator& __i)
678 : __node_(__i.__node_),
679 __bucket_(__i.__bucket_),
680 __bucket_count_(__i.__bucket_count_)
682 __get_db()->__iterator_copy(this, &__i);
685 _LIBCPP_INLINE_VISIBILITY
686 ~__hash_const_local_iterator()
688 __get_db()->__erase_i(this);
691 _LIBCPP_INLINE_VISIBILITY
692 __hash_const_local_iterator& operator=(const __hash_const_local_iterator& __i)
696 __get_db()->__iterator_copy(this, &__i);
697 __node_ = __i.__node_;
698 __bucket_ = __i.__bucket_;
699 __bucket_count_ = __i.__bucket_count_;
703 #endif // _LIBCPP_DEBUG_LEVEL >= 2
705 _LIBCPP_INLINE_VISIBILITY
706 reference operator*() const {
707 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
708 "Attempted to dereference a non-dereferenceable unordered container const_local_iterator");
709 return __node_->__upcast()->__value_;
712 _LIBCPP_INLINE_VISIBILITY
713 pointer operator->() const {
714 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
715 "Attempted to dereference a non-dereferenceable unordered container const_local_iterator");
716 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
719 _LIBCPP_INLINE_VISIBILITY
720 __hash_const_local_iterator& operator++() {
721 _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
722 "Attempted to increment non-incrementable unordered container const_local_iterator");
723 __node_ = __node_->__next_;
724 if (__node_ != nullptr && __constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
729 _LIBCPP_INLINE_VISIBILITY
730 __hash_const_local_iterator operator++(int)
732 __hash_const_local_iterator __t(*this);
737 friend _LIBCPP_INLINE_VISIBILITY
738 bool operator==(const __hash_const_local_iterator& __x, const __hash_const_local_iterator& __y)
740 return __x.__node_ == __y.__node_;
742 friend _LIBCPP_INLINE_VISIBILITY
743 bool operator!=(const __hash_const_local_iterator& __x, const __hash_const_local_iterator& __y)
744 {return !(__x == __y);}
747 #if _LIBCPP_DEBUG_LEVEL >= 2
748 _LIBCPP_INLINE_VISIBILITY
749 __hash_const_local_iterator(__next_pointer __node, size_t __bucket,
750 size_t __bucket_count, const void* __c) _NOEXCEPT
753 __bucket_count_(__bucket_count)
755 __get_db()->__insert_ic(this, __c);
756 if (__node_ != nullptr)
757 __node_ = __node_->__next_;
760 _LIBCPP_INLINE_VISIBILITY
761 __hash_const_local_iterator(__next_pointer __node, size_t __bucket,
762 size_t __bucket_count) _NOEXCEPT
765 __bucket_count_(__bucket_count)
767 if (__node_ != nullptr)
768 __node_ = __node_->__next_;
771 template <class, class, class, class> friend class __hash_table;
772 template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
775 template <class _Alloc>
776 class __bucket_list_deallocator
778 typedef _Alloc allocator_type;
779 typedef allocator_traits<allocator_type> __alloc_traits;
780 typedef typename __alloc_traits::size_type size_type;
782 __compressed_pair<size_type, allocator_type> __data_;
784 typedef typename __alloc_traits::pointer pointer;
786 _LIBCPP_INLINE_VISIBILITY
787 __bucket_list_deallocator()
788 _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
791 _LIBCPP_INLINE_VISIBILITY
792 __bucket_list_deallocator(const allocator_type& __a, size_type __size)
793 _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value)
794 : __data_(__size, __a) {}
796 #ifndef _LIBCPP_CXX03_LANG
797 _LIBCPP_INLINE_VISIBILITY
798 __bucket_list_deallocator(__bucket_list_deallocator&& __x)
799 _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
800 : __data_(_VSTD::move(__x.__data_))
806 _LIBCPP_INLINE_VISIBILITY
807 size_type& size() _NOEXCEPT {return __data_.first();}
808 _LIBCPP_INLINE_VISIBILITY
809 size_type size() const _NOEXCEPT {return __data_.first();}
811 _LIBCPP_INLINE_VISIBILITY
812 allocator_type& __alloc() _NOEXCEPT {return __data_.second();}
813 _LIBCPP_INLINE_VISIBILITY
814 const allocator_type& __alloc() const _NOEXCEPT {return __data_.second();}
816 _LIBCPP_INLINE_VISIBILITY
817 void operator()(pointer __p) _NOEXCEPT
819 __alloc_traits::deallocate(__alloc(), __p, size());
823 template <class _Alloc> class __hash_map_node_destructor;
825 template <class _Alloc>
826 class __hash_node_destructor
828 typedef _Alloc allocator_type;
829 typedef allocator_traits<allocator_type> __alloc_traits;
832 typedef typename __alloc_traits::pointer pointer;
834 typedef __hash_node_types<pointer> _NodeTypes;
836 allocator_type& __na_;
838 __hash_node_destructor& operator=(const __hash_node_destructor&);
841 bool __value_constructed;
843 _LIBCPP_INLINE_VISIBILITY
844 explicit __hash_node_destructor(allocator_type& __na,
845 bool __constructed = false) _NOEXCEPT
847 __value_constructed(__constructed)
850 _LIBCPP_INLINE_VISIBILITY
851 void operator()(pointer __p) _NOEXCEPT
853 if (__value_constructed)
854 __alloc_traits::destroy(__na_, _NodeTypes::__get_ptr(__p->__value_));
856 __alloc_traits::deallocate(__na_, __p, 1);
859 template <class> friend class __hash_map_node_destructor;
862 #if _LIBCPP_STD_VER > 14
863 template <class _NodeType, class _Alloc>
864 struct __generic_container_node_destructor;
866 template <class _Tp, class _VoidPtr, class _Alloc>
867 struct __generic_container_node_destructor<__hash_node<_Tp, _VoidPtr>, _Alloc>
868 : __hash_node_destructor<_Alloc>
870 using __hash_node_destructor<_Alloc>::__hash_node_destructor;
874 #ifndef _LIBCPP_CXX03_LANG
875 template <class _Key, class _Hash, class _Equal, class _Alloc>
876 struct __diagnose_hash_table_helper {
877 static constexpr bool __trigger_diagnostics()
878 _LIBCPP_DIAGNOSE_WARNING(__check_hash_requirements<_Key, _Hash>::value
879 && !__invokable<_Hash const&, _Key const&>::value,
880 "the specified hash functor does not provide a const call operator")
881 _LIBCPP_DIAGNOSE_WARNING(is_copy_constructible<_Equal>::value
882 && !__invokable<_Equal const&, _Key const&, _Key const&>::value,
883 "the specified comparator type does not provide a const call operator")
885 static_assert(__check_hash_requirements<_Key, _Hash>::value,
886 "the specified hash does not meet the Hash requirements");
887 static_assert(is_copy_constructible<_Equal>::value,
888 "the specified comparator is required to be copy constructible");
893 template <class _Key, class _Value, class _Hash, class _Equal, class _Alloc>
894 struct __diagnose_hash_table_helper<
895 __hash_value_type<_Key, _Value>,
896 __unordered_map_hasher<_Key, __hash_value_type<_Key, _Value>, _Hash>,
897 __unordered_map_equal<_Key, __hash_value_type<_Key, _Value>, _Equal>,
899 : __diagnose_hash_table_helper<_Key, _Hash, _Equal, _Alloc>
902 #endif // _LIBCPP_CXX03_LANG
904 template <class _Tp, class _Hash, class _Equal, class _Alloc>
908 typedef _Tp value_type;
909 typedef _Hash hasher;
910 typedef _Equal key_equal;
911 typedef _Alloc allocator_type;
914 typedef allocator_traits<allocator_type> __alloc_traits;
916 __make_hash_node_types<value_type, typename __alloc_traits::void_pointer>::type
920 typedef typename _NodeTypes::__node_value_type __node_value_type;
921 typedef typename _NodeTypes::__container_value_type __container_value_type;
922 typedef typename _NodeTypes::key_type key_type;
923 typedef value_type& reference;
924 typedef const value_type& const_reference;
925 typedef typename __alloc_traits::pointer pointer;
926 typedef typename __alloc_traits::const_pointer const_pointer;
927 #ifndef _LIBCPP_ABI_FIX_UNORDERED_CONTAINER_SIZE_TYPE
928 typedef typename __alloc_traits::size_type size_type;
930 typedef typename _NodeTypes::size_type size_type;
932 typedef typename _NodeTypes::difference_type difference_type;
936 typedef typename _NodeTypes::__node_type __node;
937 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
938 typedef allocator_traits<__node_allocator> __node_traits;
939 typedef typename _NodeTypes::__void_pointer __void_pointer;
940 typedef typename _NodeTypes::__node_pointer __node_pointer;
941 typedef typename _NodeTypes::__node_pointer __node_const_pointer;
942 typedef typename _NodeTypes::__node_base_type __first_node;
943 typedef typename _NodeTypes::__node_base_pointer __node_base_pointer;
944 typedef typename _NodeTypes::__next_pointer __next_pointer;
947 // check for sane allocator pointer rebinding semantics. Rebinding the
948 // allocator for a new pointer type should be exactly the same as rebinding
949 // the pointer using 'pointer_traits'.
950 static_assert((is_same<__node_pointer, typename __node_traits::pointer>::value),
951 "Allocator does not rebind pointers in a sane manner.");
952 typedef typename __rebind_alloc_helper<__node_traits, __first_node>::type
953 __node_base_allocator;
954 typedef allocator_traits<__node_base_allocator> __node_base_traits;
955 static_assert((is_same<__node_base_pointer, typename __node_base_traits::pointer>::value),
956 "Allocator does not rebind pointers in a sane manner.");
960 typedef typename __rebind_alloc_helper<__node_traits, __next_pointer>::type __pointer_allocator;
961 typedef __bucket_list_deallocator<__pointer_allocator> __bucket_list_deleter;
962 typedef unique_ptr<__next_pointer[], __bucket_list_deleter> __bucket_list;
963 typedef allocator_traits<__pointer_allocator> __pointer_alloc_traits;
964 typedef typename __bucket_list_deleter::pointer __node_pointer_pointer;
966 #ifndef _LIBCPP_CXX03_LANG
967 static_assert(__diagnose_hash_table_helper<_Tp, _Hash, _Equal, _Alloc>::__trigger_diagnostics(), "");
970 // --- Member data begin ---
971 __bucket_list __bucket_list_;
972 __compressed_pair<__first_node, __node_allocator> __p1_;
973 __compressed_pair<size_type, hasher> __p2_;
974 __compressed_pair<float, key_equal> __p3_;
975 // --- Member data end ---
977 _LIBCPP_INLINE_VISIBILITY
978 size_type& size() _NOEXCEPT {return __p2_.first();}
980 _LIBCPP_INLINE_VISIBILITY
981 size_type size() const _NOEXCEPT {return __p2_.first();}
983 _LIBCPP_INLINE_VISIBILITY
984 hasher& hash_function() _NOEXCEPT {return __p2_.second();}
985 _LIBCPP_INLINE_VISIBILITY
986 const hasher& hash_function() const _NOEXCEPT {return __p2_.second();}
988 _LIBCPP_INLINE_VISIBILITY
989 float& max_load_factor() _NOEXCEPT {return __p3_.first();}
990 _LIBCPP_INLINE_VISIBILITY
991 float max_load_factor() const _NOEXCEPT {return __p3_.first();}
993 _LIBCPP_INLINE_VISIBILITY
994 key_equal& key_eq() _NOEXCEPT {return __p3_.second();}
995 _LIBCPP_INLINE_VISIBILITY
996 const key_equal& key_eq() const _NOEXCEPT {return __p3_.second();}
998 _LIBCPP_INLINE_VISIBILITY
999 __node_allocator& __node_alloc() _NOEXCEPT {return __p1_.second();}
1000 _LIBCPP_INLINE_VISIBILITY
1001 const __node_allocator& __node_alloc() const _NOEXCEPT
1002 {return __p1_.second();}
1005 typedef __hash_iterator<__node_pointer> iterator;
1006 typedef __hash_const_iterator<__node_pointer> const_iterator;
1007 typedef __hash_local_iterator<__node_pointer> local_iterator;
1008 typedef __hash_const_local_iterator<__node_pointer> const_local_iterator;
1010 _LIBCPP_INLINE_VISIBILITY
1013 is_nothrow_default_constructible<__bucket_list>::value &&
1014 is_nothrow_default_constructible<__first_node>::value &&
1015 is_nothrow_default_constructible<__node_allocator>::value &&
1016 is_nothrow_default_constructible<hasher>::value &&
1017 is_nothrow_default_constructible<key_equal>::value);
1018 _LIBCPP_INLINE_VISIBILITY
1019 __hash_table(const hasher& __hf, const key_equal& __eql);
1020 __hash_table(const hasher& __hf, const key_equal& __eql,
1021 const allocator_type& __a);
1022 explicit __hash_table(const allocator_type& __a);
1023 __hash_table(const __hash_table& __u);
1024 __hash_table(const __hash_table& __u, const allocator_type& __a);
1025 #ifndef _LIBCPP_CXX03_LANG
1026 __hash_table(__hash_table&& __u)
1028 is_nothrow_move_constructible<__bucket_list>::value &&
1029 is_nothrow_move_constructible<__first_node>::value &&
1030 is_nothrow_move_constructible<__node_allocator>::value &&
1031 is_nothrow_move_constructible<hasher>::value &&
1032 is_nothrow_move_constructible<key_equal>::value);
1033 __hash_table(__hash_table&& __u, const allocator_type& __a);
1034 #endif // _LIBCPP_CXX03_LANG
1037 __hash_table& operator=(const __hash_table& __u);
1038 #ifndef _LIBCPP_CXX03_LANG
1039 _LIBCPP_INLINE_VISIBILITY
1040 __hash_table& operator=(__hash_table&& __u)
1042 __node_traits::propagate_on_container_move_assignment::value &&
1043 is_nothrow_move_assignable<__node_allocator>::value &&
1044 is_nothrow_move_assignable<hasher>::value &&
1045 is_nothrow_move_assignable<key_equal>::value);
1047 template <class _InputIterator>
1048 void __assign_unique(_InputIterator __first, _InputIterator __last);
1049 template <class _InputIterator>
1050 void __assign_multi(_InputIterator __first, _InputIterator __last);
1052 _LIBCPP_INLINE_VISIBILITY
1053 size_type max_size() const _NOEXCEPT
1055 return std::min<size_type>(
1056 __node_traits::max_size(__node_alloc()),
1057 numeric_limits<difference_type >::max()
1061 pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
1062 iterator __node_insert_multi(__node_pointer __nd);
1063 iterator __node_insert_multi(const_iterator __p,
1064 __node_pointer __nd);
1066 #ifndef _LIBCPP_CXX03_LANG
1067 template <class _Key, class ..._Args>
1068 _LIBCPP_INLINE_VISIBILITY
1069 pair<iterator, bool> __emplace_unique_key_args(_Key const& __k, _Args&&... __args);
1071 template <class... _Args>
1072 _LIBCPP_INLINE_VISIBILITY
1073 pair<iterator, bool> __emplace_unique_impl(_Args&&... __args);
1075 template <class _Pp>
1076 _LIBCPP_INLINE_VISIBILITY
1077 pair<iterator, bool> __emplace_unique(_Pp&& __x) {
1078 return __emplace_unique_extract_key(_VSTD::forward<_Pp>(__x),
1079 __can_extract_key<_Pp, key_type>());
1082 template <class _First, class _Second>
1083 _LIBCPP_INLINE_VISIBILITY
1085 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1086 pair<iterator, bool>
1087 >::type __emplace_unique(_First&& __f, _Second&& __s) {
1088 return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
1089 _VSTD::forward<_Second>(__s));
1092 template <class... _Args>
1093 _LIBCPP_INLINE_VISIBILITY
1094 pair<iterator, bool> __emplace_unique(_Args&&... __args) {
1095 return __emplace_unique_impl(_VSTD::forward<_Args>(__args)...);
1098 template <class _Pp>
1099 _LIBCPP_INLINE_VISIBILITY
1100 pair<iterator, bool>
1101 __emplace_unique_extract_key(_Pp&& __x, __extract_key_fail_tag) {
1102 return __emplace_unique_impl(_VSTD::forward<_Pp>(__x));
1104 template <class _Pp>
1105 _LIBCPP_INLINE_VISIBILITY
1106 pair<iterator, bool>
1107 __emplace_unique_extract_key(_Pp&& __x, __extract_key_self_tag) {
1108 return __emplace_unique_key_args(__x, _VSTD::forward<_Pp>(__x));
1110 template <class _Pp>
1111 _LIBCPP_INLINE_VISIBILITY
1112 pair<iterator, bool>
1113 __emplace_unique_extract_key(_Pp&& __x, __extract_key_first_tag) {
1114 return __emplace_unique_key_args(__x.first, _VSTD::forward<_Pp>(__x));
1117 template <class... _Args>
1118 _LIBCPP_INLINE_VISIBILITY
1119 iterator __emplace_multi(_Args&&... __args);
1120 template <class... _Args>
1121 _LIBCPP_INLINE_VISIBILITY
1122 iterator __emplace_hint_multi(const_iterator __p, _Args&&... __args);
1125 _LIBCPP_INLINE_VISIBILITY
1126 pair<iterator, bool>
1127 __insert_unique(__container_value_type&& __x) {
1128 return __emplace_unique_key_args(_NodeTypes::__get_key(__x), _VSTD::move(__x));
1131 template <class _Pp, class = typename enable_if<
1132 !__is_same_uncvref<_Pp, __container_value_type>::value
1134 _LIBCPP_INLINE_VISIBILITY
1135 pair<iterator, bool> __insert_unique(_Pp&& __x) {
1136 return __emplace_unique(_VSTD::forward<_Pp>(__x));
1139 template <class _Pp>
1140 _LIBCPP_INLINE_VISIBILITY
1141 iterator __insert_multi(_Pp&& __x) {
1142 return __emplace_multi(_VSTD::forward<_Pp>(__x));
1145 template <class _Pp>
1146 _LIBCPP_INLINE_VISIBILITY
1147 iterator __insert_multi(const_iterator __p, _Pp&& __x) {
1148 return __emplace_hint_multi(__p, _VSTD::forward<_Pp>(__x));
1151 #else // !defined(_LIBCPP_CXX03_LANG)
1152 template <class _Key, class _Args>
1153 _LIBCPP_INLINE_VISIBILITY
1154 pair<iterator, bool> __emplace_unique_key_args(_Key const&, _Args& __args);
1156 iterator __insert_multi(const __container_value_type& __x);
1157 iterator __insert_multi(const_iterator __p, const __container_value_type& __x);
1160 _LIBCPP_INLINE_VISIBILITY
1161 pair<iterator, bool> __insert_unique(const __container_value_type& __x) {
1162 return __emplace_unique_key_args(_NodeTypes::__get_key(__x), __x);
1165 #if _LIBCPP_STD_VER > 14
1166 template <class _NodeHandle, class _InsertReturnType>
1167 _LIBCPP_INLINE_VISIBILITY
1168 _InsertReturnType __node_handle_insert_unique(_NodeHandle&& __nh);
1169 template <class _NodeHandle>
1170 _LIBCPP_INLINE_VISIBILITY
1171 iterator __node_handle_insert_unique(const_iterator __hint,
1172 _NodeHandle&& __nh);
1174 template <class _NodeHandle>
1175 _LIBCPP_INLINE_VISIBILITY
1176 iterator __node_handle_insert_multi(_NodeHandle&& __nh);
1177 template <class _NodeHandle>
1178 _LIBCPP_INLINE_VISIBILITY
1179 iterator __node_handle_insert_multi(const_iterator __hint, _NodeHandle&& __nh);
1181 template <class _NodeHandle>
1182 _LIBCPP_INLINE_VISIBILITY
1183 _NodeHandle __node_handle_extract(key_type const& __key);
1184 template <class _NodeHandle>
1185 _LIBCPP_INLINE_VISIBILITY
1186 _NodeHandle __node_handle_extract(const_iterator __it);
1189 void clear() _NOEXCEPT;
1190 void rehash(size_type __n);
1191 _LIBCPP_INLINE_VISIBILITY void reserve(size_type __n)
1192 {rehash(static_cast<size_type>(ceil(__n / max_load_factor())));}
1194 _LIBCPP_INLINE_VISIBILITY
1195 size_type bucket_count() const _NOEXCEPT
1197 return __bucket_list_.get_deleter().size();
1200 _LIBCPP_INLINE_VISIBILITY
1201 iterator begin() _NOEXCEPT;
1202 _LIBCPP_INLINE_VISIBILITY
1203 iterator end() _NOEXCEPT;
1204 _LIBCPP_INLINE_VISIBILITY
1205 const_iterator begin() const _NOEXCEPT;
1206 _LIBCPP_INLINE_VISIBILITY
1207 const_iterator end() const _NOEXCEPT;
1209 template <class _Key>
1210 _LIBCPP_INLINE_VISIBILITY
1211 size_type bucket(const _Key& __k) const
1213 _LIBCPP_ASSERT(bucket_count() > 0,
1214 "unordered container::bucket(key) called when bucket_count() == 0");
1215 return __constrain_hash(hash_function()(__k), bucket_count());
1218 template <class _Key>
1219 iterator find(const _Key& __x);
1220 template <class _Key>
1221 const_iterator find(const _Key& __x) const;
1223 typedef __hash_node_destructor<__node_allocator> _Dp;
1224 typedef unique_ptr<__node, _Dp> __node_holder;
1226 iterator erase(const_iterator __p);
1227 iterator erase(const_iterator __first, const_iterator __last);
1228 template <class _Key>
1229 size_type __erase_unique(const _Key& __k);
1230 template <class _Key>
1231 size_type __erase_multi(const _Key& __k);
1232 __node_holder remove(const_iterator __p) _NOEXCEPT;
1234 template <class _Key>
1235 _LIBCPP_INLINE_VISIBILITY
1236 size_type __count_unique(const _Key& __k) const;
1237 template <class _Key>
1238 size_type __count_multi(const _Key& __k) const;
1240 template <class _Key>
1241 pair<iterator, iterator>
1242 __equal_range_unique(const _Key& __k);
1243 template <class _Key>
1244 pair<const_iterator, const_iterator>
1245 __equal_range_unique(const _Key& __k) const;
1247 template <class _Key>
1248 pair<iterator, iterator>
1249 __equal_range_multi(const _Key& __k);
1250 template <class _Key>
1251 pair<const_iterator, const_iterator>
1252 __equal_range_multi(const _Key& __k) const;
1254 void swap(__hash_table& __u)
1255 #if _LIBCPP_STD_VER <= 11
1257 __is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value
1258 && (!allocator_traits<__pointer_allocator>::propagate_on_container_swap::value
1259 || __is_nothrow_swappable<__pointer_allocator>::value)
1260 && (!__node_traits::propagate_on_container_swap::value
1261 || __is_nothrow_swappable<__node_allocator>::value)
1264 _NOEXCEPT_DEBUG_(__is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value);
1267 _LIBCPP_INLINE_VISIBILITY
1268 size_type max_bucket_count() const _NOEXCEPT
1269 {return max_size(); }
1270 size_type bucket_size(size_type __n) const;
1271 _LIBCPP_INLINE_VISIBILITY float load_factor() const _NOEXCEPT
1273 size_type __bc = bucket_count();
1274 return __bc != 0 ? (float)size() / __bc : 0.f;
1276 _LIBCPP_INLINE_VISIBILITY void max_load_factor(float __mlf) _NOEXCEPT
1278 _LIBCPP_ASSERT(__mlf > 0,
1279 "unordered container::max_load_factor(lf) called with lf <= 0");
1280 max_load_factor() = _VSTD::max(__mlf, load_factor());
1283 _LIBCPP_INLINE_VISIBILITY
1285 begin(size_type __n)
1287 _LIBCPP_ASSERT(__n < bucket_count(),
1288 "unordered container::begin(n) called with n >= bucket_count()");
1289 #if _LIBCPP_DEBUG_LEVEL >= 2
1290 return local_iterator(__bucket_list_[__n], __n, bucket_count(), this);
1292 return local_iterator(__bucket_list_[__n], __n, bucket_count());
1296 _LIBCPP_INLINE_VISIBILITY
1300 _LIBCPP_ASSERT(__n < bucket_count(),
1301 "unordered container::end(n) called with n >= bucket_count()");
1302 #if _LIBCPP_DEBUG_LEVEL >= 2
1303 return local_iterator(nullptr, __n, bucket_count(), this);
1305 return local_iterator(nullptr, __n, bucket_count());
1309 _LIBCPP_INLINE_VISIBILITY
1310 const_local_iterator
1311 cbegin(size_type __n) const
1313 _LIBCPP_ASSERT(__n < bucket_count(),
1314 "unordered container::cbegin(n) called with n >= bucket_count()");
1315 #if _LIBCPP_DEBUG_LEVEL >= 2
1316 return const_local_iterator(__bucket_list_[__n], __n, bucket_count(), this);
1318 return const_local_iterator(__bucket_list_[__n], __n, bucket_count());
1322 _LIBCPP_INLINE_VISIBILITY
1323 const_local_iterator
1324 cend(size_type __n) const
1326 _LIBCPP_ASSERT(__n < bucket_count(),
1327 "unordered container::cend(n) called with n >= bucket_count()");
1328 #if _LIBCPP_DEBUG_LEVEL >= 2
1329 return const_local_iterator(nullptr, __n, bucket_count(), this);
1331 return const_local_iterator(nullptr, __n, bucket_count());
1335 #if _LIBCPP_DEBUG_LEVEL >= 2
1337 bool __dereferenceable(const const_iterator* __i) const;
1338 bool __decrementable(const const_iterator* __i) const;
1339 bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
1340 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
1342 #endif // _LIBCPP_DEBUG_LEVEL >= 2
1345 void __rehash(size_type __n);
1347 #ifndef _LIBCPP_CXX03_LANG
1348 template <class ..._Args>
1349 __node_holder __construct_node(_Args&& ...__args);
1351 template <class _First, class ..._Rest>
1352 __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest);
1353 #else // _LIBCPP_CXX03_LANG
1354 __node_holder __construct_node(const __container_value_type& __v);
1355 __node_holder __construct_node_hash(size_t __hash, const __container_value_type& __v);
1359 _LIBCPP_INLINE_VISIBILITY
1360 void __copy_assign_alloc(const __hash_table& __u)
1361 {__copy_assign_alloc(__u, integral_constant<bool,
1362 __node_traits::propagate_on_container_copy_assignment::value>());}
1363 void __copy_assign_alloc(const __hash_table& __u, true_type);
1364 _LIBCPP_INLINE_VISIBILITY
1365 void __copy_assign_alloc(const __hash_table&, false_type) {}
1367 #ifndef _LIBCPP_CXX03_LANG
1368 void __move_assign(__hash_table& __u, false_type);
1369 void __move_assign(__hash_table& __u, true_type)
1371 is_nothrow_move_assignable<__node_allocator>::value &&
1372 is_nothrow_move_assignable<hasher>::value &&
1373 is_nothrow_move_assignable<key_equal>::value);
1374 _LIBCPP_INLINE_VISIBILITY
1375 void __move_assign_alloc(__hash_table& __u)
1377 !__node_traits::propagate_on_container_move_assignment::value ||
1378 (is_nothrow_move_assignable<__pointer_allocator>::value &&
1379 is_nothrow_move_assignable<__node_allocator>::value))
1380 {__move_assign_alloc(__u, integral_constant<bool,
1381 __node_traits::propagate_on_container_move_assignment::value>());}
1382 _LIBCPP_INLINE_VISIBILITY
1383 void __move_assign_alloc(__hash_table& __u, true_type)
1385 is_nothrow_move_assignable<__pointer_allocator>::value &&
1386 is_nothrow_move_assignable<__node_allocator>::value)
1388 __bucket_list_.get_deleter().__alloc() =
1389 _VSTD::move(__u.__bucket_list_.get_deleter().__alloc());
1390 __node_alloc() = _VSTD::move(__u.__node_alloc());
1392 _LIBCPP_INLINE_VISIBILITY
1393 void __move_assign_alloc(__hash_table&, false_type) _NOEXCEPT {}
1394 #endif // _LIBCPP_CXX03_LANG
1396 void __deallocate_node(__next_pointer __np) _NOEXCEPT;
1397 __next_pointer __detach() _NOEXCEPT;
1399 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1400 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
1403 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1405 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table()
1407 is_nothrow_default_constructible<__bucket_list>::value &&
1408 is_nothrow_default_constructible<__first_node>::value &&
1409 is_nothrow_default_constructible<__node_allocator>::value &&
1410 is_nothrow_default_constructible<hasher>::value &&
1411 is_nothrow_default_constructible<key_equal>::value)
1417 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1419 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const hasher& __hf,
1420 const key_equal& __eql)
1421 : __bucket_list_(nullptr, __bucket_list_deleter()),
1428 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1429 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const hasher& __hf,
1430 const key_equal& __eql,
1431 const allocator_type& __a)
1432 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
1433 __p1_(__second_tag(), __node_allocator(__a)),
1439 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1440 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const allocator_type& __a)
1441 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
1442 __p1_(__second_tag(), __node_allocator(__a)),
1448 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1449 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const __hash_table& __u)
1450 : __bucket_list_(nullptr,
1451 __bucket_list_deleter(allocator_traits<__pointer_allocator>::
1452 select_on_container_copy_construction(
1453 __u.__bucket_list_.get_deleter().__alloc()), 0)),
1454 __p1_(__second_tag(), allocator_traits<__node_allocator>::
1455 select_on_container_copy_construction(__u.__node_alloc())),
1456 __p2_(0, __u.hash_function()),
1461 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1462 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const __hash_table& __u,
1463 const allocator_type& __a)
1464 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
1465 __p1_(__second_tag(), __node_allocator(__a)),
1466 __p2_(0, __u.hash_function()),
1471 #ifndef _LIBCPP_CXX03_LANG
1473 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1474 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(__hash_table&& __u)
1476 is_nothrow_move_constructible<__bucket_list>::value &&
1477 is_nothrow_move_constructible<__first_node>::value &&
1478 is_nothrow_move_constructible<__node_allocator>::value &&
1479 is_nothrow_move_constructible<hasher>::value &&
1480 is_nothrow_move_constructible<key_equal>::value)
1481 : __bucket_list_(_VSTD::move(__u.__bucket_list_)),
1482 __p1_(_VSTD::move(__u.__p1_)),
1483 __p2_(_VSTD::move(__u.__p2_)),
1484 __p3_(_VSTD::move(__u.__p3_))
1488 __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
1489 __p1_.first().__ptr();
1490 __u.__p1_.first().__next_ = nullptr;
1495 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1496 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(__hash_table&& __u,
1497 const allocator_type& __a)
1498 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
1499 __p1_(__second_tag(), __node_allocator(__a)),
1500 __p2_(0, _VSTD::move(__u.hash_function())),
1501 __p3_(_VSTD::move(__u.__p3_))
1503 if (__a == allocator_type(__u.__node_alloc()))
1505 __bucket_list_.reset(__u.__bucket_list_.release());
1506 __bucket_list_.get_deleter().size() = __u.__bucket_list_.get_deleter().size();
1507 __u.__bucket_list_.get_deleter().size() = 0;
1510 __p1_.first().__next_ = __u.__p1_.first().__next_;
1511 __u.__p1_.first().__next_ = nullptr;
1512 __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
1513 __p1_.first().__ptr();
1514 size() = __u.size();
1520 #endif // _LIBCPP_CXX03_LANG
1522 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1523 __hash_table<_Tp, _Hash, _Equal, _Alloc>::~__hash_table()
1525 #if defined(_LIBCPP_CXX03_LANG)
1526 static_assert((is_copy_constructible<key_equal>::value),
1527 "Predicate must be copy-constructible.");
1528 static_assert((is_copy_constructible<hasher>::value),
1529 "Hasher must be copy-constructible.");
1532 __deallocate_node(__p1_.first().__next_);
1533 #if _LIBCPP_DEBUG_LEVEL >= 2
1534 __get_db()->__erase_c(this);
1538 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1540 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__copy_assign_alloc(
1541 const __hash_table& __u, true_type)
1543 if (__node_alloc() != __u.__node_alloc())
1546 __bucket_list_.reset();
1547 __bucket_list_.get_deleter().size() = 0;
1549 __bucket_list_.get_deleter().__alloc() = __u.__bucket_list_.get_deleter().__alloc();
1550 __node_alloc() = __u.__node_alloc();
1553 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1554 __hash_table<_Tp, _Hash, _Equal, _Alloc>&
1555 __hash_table<_Tp, _Hash, _Equal, _Alloc>::operator=(const __hash_table& __u)
1559 __copy_assign_alloc(__u);
1560 hash_function() = __u.hash_function();
1561 key_eq() = __u.key_eq();
1562 max_load_factor() = __u.max_load_factor();
1563 __assign_multi(__u.begin(), __u.end());
1568 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1570 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__deallocate_node(__next_pointer __np)
1573 __node_allocator& __na = __node_alloc();
1574 while (__np != nullptr)
1576 __next_pointer __next = __np->__next_;
1577 #if _LIBCPP_DEBUG_LEVEL >= 2
1578 __c_node* __c = __get_db()->__find_c_and_lock(this);
1579 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1582 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1583 if (__i->__node_ == __np)
1585 (*__p)->__c_ = nullptr;
1586 if (--__c->end_ != __p)
1587 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1590 __get_db()->unlock();
1592 __node_pointer __real_np = __np->__upcast();
1593 __node_traits::destroy(__na, _NodeTypes::__get_ptr(__real_np->__value_));
1594 __node_traits::deallocate(__na, __real_np, 1);
1599 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1600 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer
1601 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__detach() _NOEXCEPT
1603 size_type __bc = bucket_count();
1604 for (size_type __i = 0; __i < __bc; ++__i)
1605 __bucket_list_[__i] = nullptr;
1607 __next_pointer __cache = __p1_.first().__next_;
1608 __p1_.first().__next_ = nullptr;
1612 #ifndef _LIBCPP_CXX03_LANG
1614 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1616 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__move_assign(
1617 __hash_table& __u, true_type)
1619 is_nothrow_move_assignable<__node_allocator>::value &&
1620 is_nothrow_move_assignable<hasher>::value &&
1621 is_nothrow_move_assignable<key_equal>::value)
1624 __bucket_list_.reset(__u.__bucket_list_.release());
1625 __bucket_list_.get_deleter().size() = __u.__bucket_list_.get_deleter().size();
1626 __u.__bucket_list_.get_deleter().size() = 0;
1627 __move_assign_alloc(__u);
1628 size() = __u.size();
1629 hash_function() = _VSTD::move(__u.hash_function());
1630 max_load_factor() = __u.max_load_factor();
1631 key_eq() = _VSTD::move(__u.key_eq());
1632 __p1_.first().__next_ = __u.__p1_.first().__next_;
1635 __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
1636 __p1_.first().__ptr();
1637 __u.__p1_.first().__next_ = nullptr;
1640 #if _LIBCPP_DEBUG_LEVEL >= 2
1641 __get_db()->swap(this, &__u);
1645 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1647 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__move_assign(
1648 __hash_table& __u, false_type)
1650 if (__node_alloc() == __u.__node_alloc())
1651 __move_assign(__u, true_type());
1654 hash_function() = _VSTD::move(__u.hash_function());
1655 key_eq() = _VSTD::move(__u.key_eq());
1656 max_load_factor() = __u.max_load_factor();
1657 if (bucket_count() != 0)
1659 __next_pointer __cache = __detach();
1660 #ifndef _LIBCPP_NO_EXCEPTIONS
1663 #endif // _LIBCPP_NO_EXCEPTIONS
1664 const_iterator __i = __u.begin();
1665 while (__cache != nullptr && __u.size() != 0)
1667 __cache->__upcast()->__value_ =
1668 _VSTD::move(__u.remove(__i++)->__value_);
1669 __next_pointer __next = __cache->__next_;
1670 __node_insert_multi(__cache->__upcast());
1673 #ifndef _LIBCPP_NO_EXCEPTIONS
1677 __deallocate_node(__cache);
1680 #endif // _LIBCPP_NO_EXCEPTIONS
1681 __deallocate_node(__cache);
1683 const_iterator __i = __u.begin();
1684 while (__u.size() != 0)
1686 __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__value_));
1687 __node_insert_multi(__h.get());
1693 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1695 __hash_table<_Tp, _Hash, _Equal, _Alloc>&
1696 __hash_table<_Tp, _Hash, _Equal, _Alloc>::operator=(__hash_table&& __u)
1698 __node_traits::propagate_on_container_move_assignment::value &&
1699 is_nothrow_move_assignable<__node_allocator>::value &&
1700 is_nothrow_move_assignable<hasher>::value &&
1701 is_nothrow_move_assignable<key_equal>::value)
1703 __move_assign(__u, integral_constant<bool,
1704 __node_traits::propagate_on_container_move_assignment::value>());
1708 #endif // _LIBCPP_CXX03_LANG
1710 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1711 template <class _InputIterator>
1713 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_unique(_InputIterator __first,
1714 _InputIterator __last)
1716 typedef iterator_traits<_InputIterator> _ITraits;
1717 typedef typename _ITraits::value_type _ItValueType;
1718 static_assert((is_same<_ItValueType, __container_value_type>::value),
1719 "__assign_unique may only be called with the containers value type");
1721 if (bucket_count() != 0)
1723 __next_pointer __cache = __detach();
1724 #ifndef _LIBCPP_NO_EXCEPTIONS
1727 #endif // _LIBCPP_NO_EXCEPTIONS
1728 for (; __cache != nullptr && __first != __last; ++__first)
1730 __cache->__upcast()->__value_ = *__first;
1731 __next_pointer __next = __cache->__next_;
1732 __node_insert_unique(__cache->__upcast());
1735 #ifndef _LIBCPP_NO_EXCEPTIONS
1739 __deallocate_node(__cache);
1742 #endif // _LIBCPP_NO_EXCEPTIONS
1743 __deallocate_node(__cache);
1745 for (; __first != __last; ++__first)
1746 __insert_unique(*__first);
1749 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1750 template <class _InputIterator>
1752 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_multi(_InputIterator __first,
1753 _InputIterator __last)
1755 typedef iterator_traits<_InputIterator> _ITraits;
1756 typedef typename _ITraits::value_type _ItValueType;
1757 static_assert((is_same<_ItValueType, __container_value_type>::value ||
1758 is_same<_ItValueType, __node_value_type>::value),
1759 "__assign_multi may only be called with the containers value type"
1760 " or the nodes value type");
1761 if (bucket_count() != 0)
1763 __next_pointer __cache = __detach();
1764 #ifndef _LIBCPP_NO_EXCEPTIONS
1767 #endif // _LIBCPP_NO_EXCEPTIONS
1768 for (; __cache != nullptr && __first != __last; ++__first)
1770 __cache->__upcast()->__value_ = *__first;
1771 __next_pointer __next = __cache->__next_;
1772 __node_insert_multi(__cache->__upcast());
1775 #ifndef _LIBCPP_NO_EXCEPTIONS
1779 __deallocate_node(__cache);
1782 #endif // _LIBCPP_NO_EXCEPTIONS
1783 __deallocate_node(__cache);
1785 for (; __first != __last; ++__first)
1786 __insert_multi(_NodeTypes::__get_value(*__first));
1789 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1791 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
1792 __hash_table<_Tp, _Hash, _Equal, _Alloc>::begin() _NOEXCEPT
1794 #if _LIBCPP_DEBUG_LEVEL >= 2
1795 return iterator(__p1_.first().__next_, this);
1797 return iterator(__p1_.first().__next_);
1801 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1803 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
1804 __hash_table<_Tp, _Hash, _Equal, _Alloc>::end() _NOEXCEPT
1806 #if _LIBCPP_DEBUG_LEVEL >= 2
1807 return iterator(nullptr, this);
1809 return iterator(nullptr);
1813 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1815 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator
1816 __hash_table<_Tp, _Hash, _Equal, _Alloc>::begin() const _NOEXCEPT
1818 #if _LIBCPP_DEBUG_LEVEL >= 2
1819 return const_iterator(__p1_.first().__next_, this);
1821 return const_iterator(__p1_.first().__next_);
1825 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1827 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator
1828 __hash_table<_Tp, _Hash, _Equal, _Alloc>::end() const _NOEXCEPT
1830 #if _LIBCPP_DEBUG_LEVEL >= 2
1831 return const_iterator(nullptr, this);
1833 return const_iterator(nullptr);
1837 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1839 __hash_table<_Tp, _Hash, _Equal, _Alloc>::clear() _NOEXCEPT
1843 __deallocate_node(__p1_.first().__next_);
1844 __p1_.first().__next_ = nullptr;
1845 size_type __bc = bucket_count();
1846 for (size_type __i = 0; __i < __bc; ++__i)
1847 __bucket_list_[__i] = nullptr;
1852 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1853 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
1854 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique(__node_pointer __nd)
1856 __nd->__hash_ = hash_function()(__nd->__value_);
1857 size_type __bc = bucket_count();
1858 bool __inserted = false;
1859 __next_pointer __ndptr;
1863 __chash = __constrain_hash(__nd->__hash_, __bc);
1864 __ndptr = __bucket_list_[__chash];
1865 if (__ndptr != nullptr)
1867 for (__ndptr = __ndptr->__next_; __ndptr != nullptr &&
1868 __constrain_hash(__ndptr->__hash(), __bc) == __chash;
1869 __ndptr = __ndptr->__next_)
1871 if (key_eq()(__ndptr->__upcast()->__value_, __nd->__value_))
1877 if (size()+1 > __bc * max_load_factor() || __bc == 0)
1879 rehash(_VSTD::max<size_type>(2 * __bc + !__is_hash_power2(__bc),
1880 size_type(ceil(float(size() + 1) / max_load_factor()))));
1881 __bc = bucket_count();
1882 __chash = __constrain_hash(__nd->__hash_, __bc);
1884 // insert_after __bucket_list_[__chash], or __first_node if bucket is null
1885 __next_pointer __pn = __bucket_list_[__chash];
1886 if (__pn == nullptr)
1888 __pn =__p1_.first().__ptr();
1889 __nd->__next_ = __pn->__next_;
1890 __pn->__next_ = __nd->__ptr();
1891 // fix up __bucket_list_
1892 __bucket_list_[__chash] = __pn;
1893 if (__nd->__next_ != nullptr)
1894 __bucket_list_[__constrain_hash(__nd->__next_->__hash(), __bc)] = __nd->__ptr();
1898 __nd->__next_ = __pn->__next_;
1899 __pn->__next_ = __nd->__ptr();
1901 __ndptr = __nd->__ptr();
1907 #if _LIBCPP_DEBUG_LEVEL >= 2
1908 return pair<iterator, bool>(iterator(__ndptr, this), __inserted);
1910 return pair<iterator, bool>(iterator(__ndptr), __inserted);
1914 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1915 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
1916 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(__node_pointer __cp)
1918 __cp->__hash_ = hash_function()(__cp->__value_);
1919 size_type __bc = bucket_count();
1920 if (size()+1 > __bc * max_load_factor() || __bc == 0)
1922 rehash(_VSTD::max<size_type>(2 * __bc + !__is_hash_power2(__bc),
1923 size_type(ceil(float(size() + 1) / max_load_factor()))));
1924 __bc = bucket_count();
1926 size_t __chash = __constrain_hash(__cp->__hash_, __bc);
1927 __next_pointer __pn = __bucket_list_[__chash];
1928 if (__pn == nullptr)
1930 __pn =__p1_.first().__ptr();
1931 __cp->__next_ = __pn->__next_;
1932 __pn->__next_ = __cp->__ptr();
1933 // fix up __bucket_list_
1934 __bucket_list_[__chash] = __pn;
1935 if (__cp->__next_ != nullptr)
1936 __bucket_list_[__constrain_hash(__cp->__next_->__hash(), __bc)]
1941 for (bool __found = false; __pn->__next_ != nullptr &&
1942 __constrain_hash(__pn->__next_->__hash(), __bc) == __chash;
1943 __pn = __pn->__next_)
1945 // __found key_eq() action
1948 // false true set __found to true
1950 if (__found != (__pn->__next_->__hash() == __cp->__hash_ &&
1951 key_eq()(__pn->__next_->__upcast()->__value_, __cp->__value_)))
1959 __cp->__next_ = __pn->__next_;
1960 __pn->__next_ = __cp->__ptr();
1961 if (__cp->__next_ != nullptr)
1963 size_t __nhash = __constrain_hash(__cp->__next_->__hash(), __bc);
1964 if (__nhash != __chash)
1965 __bucket_list_[__nhash] = __cp->__ptr();
1969 #if _LIBCPP_DEBUG_LEVEL >= 2
1970 return iterator(__cp->__ptr(), this);
1972 return iterator(__cp->__ptr());
1976 template <class _Tp, class _Hash, class _Equal, class _Alloc>
1977 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
1978 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(
1979 const_iterator __p, __node_pointer __cp)
1981 #if _LIBCPP_DEBUG_LEVEL >= 2
1982 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1983 "unordered container::emplace_hint(const_iterator, args...) called with an iterator not"
1984 " referring to this unordered container");
1986 if (__p != end() && key_eq()(*__p, __cp->__value_))
1988 __next_pointer __np = __p.__node_;
1989 __cp->__hash_ = __np->__hash();
1990 size_type __bc = bucket_count();
1991 if (size()+1 > __bc * max_load_factor() || __bc == 0)
1993 rehash(_VSTD::max<size_type>(2 * __bc + !__is_hash_power2(__bc),
1994 size_type(ceil(float(size() + 1) / max_load_factor()))));
1995 __bc = bucket_count();
1997 size_t __chash = __constrain_hash(__cp->__hash_, __bc);
1998 __next_pointer __pp = __bucket_list_[__chash];
1999 while (__pp->__next_ != __np)
2000 __pp = __pp->__next_;
2001 __cp->__next_ = __np;
2002 __pp->__next_ = static_cast<__next_pointer>(__cp);
2004 #if _LIBCPP_DEBUG_LEVEL >= 2
2005 return iterator(static_cast<__next_pointer>(__cp), this);
2007 return iterator(static_cast<__next_pointer>(__cp));
2010 return __node_insert_multi(__cp);
2015 #ifndef _LIBCPP_CXX03_LANG
2016 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2017 template <class _Key, class ..._Args>
2018 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
2019 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args)
2021 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2022 template <class _Key, class _Args>
2023 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
2024 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_key_args(_Key const& __k, _Args& __args)
2028 size_t __hash = hash_function()(__k);
2029 size_type __bc = bucket_count();
2030 bool __inserted = false;
2031 __next_pointer __nd;
2035 __chash = __constrain_hash(__hash, __bc);
2036 __nd = __bucket_list_[__chash];
2037 if (__nd != nullptr)
2039 for (__nd = __nd->__next_; __nd != nullptr &&
2040 (__nd->__hash() == __hash || __constrain_hash(__nd->__hash(), __bc) == __chash);
2041 __nd = __nd->__next_)
2043 if (key_eq()(__nd->__upcast()->__value_, __k))
2049 #ifndef _LIBCPP_CXX03_LANG
2050 __node_holder __h = __construct_node_hash(__hash, _VSTD::forward<_Args>(__args)...);
2052 __node_holder __h = __construct_node_hash(__hash, __args);
2054 if (size()+1 > __bc * max_load_factor() || __bc == 0)
2056 rehash(_VSTD::max<size_type>(2 * __bc + !__is_hash_power2(__bc),
2057 size_type(ceil(float(size() + 1) / max_load_factor()))));
2058 __bc = bucket_count();
2059 __chash = __constrain_hash(__hash, __bc);
2061 // insert_after __bucket_list_[__chash], or __first_node if bucket is null
2062 __next_pointer __pn = __bucket_list_[__chash];
2063 if (__pn == nullptr)
2065 __pn = __p1_.first().__ptr();
2066 __h->__next_ = __pn->__next_;
2067 __pn->__next_ = __h.get()->__ptr();
2068 // fix up __bucket_list_
2069 __bucket_list_[__chash] = __pn;
2070 if (__h->__next_ != nullptr)
2071 __bucket_list_[__constrain_hash(__h->__next_->__hash(), __bc)]
2072 = __h.get()->__ptr();
2076 __h->__next_ = __pn->__next_;
2077 __pn->__next_ = static_cast<__next_pointer>(__h.get());
2079 __nd = static_cast<__next_pointer>(__h.release());
2085 #if _LIBCPP_DEBUG_LEVEL >= 2
2086 return pair<iterator, bool>(iterator(__nd, this), __inserted);
2088 return pair<iterator, bool>(iterator(__nd), __inserted);
2092 #ifndef _LIBCPP_CXX03_LANG
2094 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2095 template <class... _Args>
2096 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
2097 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_impl(_Args&&... __args)
2099 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2100 pair<iterator, bool> __r = __node_insert_unique(__h.get());
2106 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2107 template <class... _Args>
2108 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2109 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_multi(_Args&&... __args)
2111 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2112 iterator __r = __node_insert_multi(__h.get());
2117 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2118 template <class... _Args>
2119 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2120 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_hint_multi(
2121 const_iterator __p, _Args&&... __args)
2123 #if _LIBCPP_DEBUG_LEVEL >= 2
2124 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2125 "unordered container::emplace_hint(const_iterator, args...) called with an iterator not"
2126 " referring to this unordered container");
2128 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2129 iterator __r = __node_insert_multi(__p, __h.get());
2134 #else // _LIBCPP_CXX03_LANG
2136 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2137 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2138 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__insert_multi(const __container_value_type& __x)
2140 __node_holder __h = __construct_node(__x);
2141 iterator __r = __node_insert_multi(__h.get());
2146 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2147 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2148 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__insert_multi(const_iterator __p,
2149 const __container_value_type& __x)
2151 #if _LIBCPP_DEBUG_LEVEL >= 2
2152 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2153 "unordered container::insert(const_iterator, lvalue) called with an iterator not"
2154 " referring to this unordered container");
2156 __node_holder __h = __construct_node(__x);
2157 iterator __r = __node_insert_multi(__p, __h.get());
2162 #endif // _LIBCPP_CXX03_LANG
2164 #if _LIBCPP_STD_VER > 14
2165 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2166 template <class _NodeHandle, class _InsertReturnType>
2167 _LIBCPP_INLINE_VISIBILITY
2169 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_unique(
2173 return _InsertReturnType{end(), false, _NodeHandle()};
2174 pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_);
2175 if (__result.second)
2177 return _InsertReturnType{__result.first, __result.second, _VSTD::move(__nh)};
2180 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2181 template <class _NodeHandle>
2182 _LIBCPP_INLINE_VISIBILITY
2183 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2184 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_unique(
2185 const_iterator, _NodeHandle&& __nh)
2189 pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_);
2190 if (__result.second)
2192 return __result.first;
2195 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2196 template <class _NodeHandle>
2197 _LIBCPP_INLINE_VISIBILITY
2199 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_extract(
2200 key_type const& __key)
2202 iterator __i = find(__key);
2204 return _NodeHandle();
2205 return __node_handle_extract<_NodeHandle>(__i);
2208 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2209 template <class _NodeHandle>
2210 _LIBCPP_INLINE_VISIBILITY
2212 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_extract(
2215 allocator_type __alloc(__node_alloc());
2216 return _NodeHandle(remove(__p).release(), __alloc);
2219 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2220 template <class _NodeHandle>
2221 _LIBCPP_INLINE_VISIBILITY
2222 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2223 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_multi(
2228 iterator __result = __node_insert_multi(__nh.__ptr_);
2233 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2234 template <class _NodeHandle>
2235 _LIBCPP_INLINE_VISIBILITY
2236 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2237 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_multi(
2238 const_iterator __hint, _NodeHandle&& __nh)
2242 iterator __result = __node_insert_multi(__hint, __nh.__ptr_);
2247 #endif // _LIBCPP_STD_VER > 14
2249 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2251 __hash_table<_Tp, _Hash, _Equal, _Alloc>::rehash(size_type __n)
2255 else if (__n & (__n - 1))
2256 __n = __next_prime(__n);
2257 size_type __bc = bucket_count();
2260 else if (__n < __bc)
2262 __n = _VSTD::max<size_type>
2265 __is_hash_power2(__bc) ? __next_hash_pow2(size_t(ceil(float(size()) / max_load_factor()))) :
2266 __next_prime(size_t(ceil(float(size()) / max_load_factor())))
2273 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2275 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__rehash(size_type __nbc)
2277 #if _LIBCPP_DEBUG_LEVEL >= 2
2278 __get_db()->__invalidate_all(this);
2279 #endif // _LIBCPP_DEBUG_LEVEL >= 2
2280 __pointer_allocator& __npa = __bucket_list_.get_deleter().__alloc();
2281 __bucket_list_.reset(__nbc > 0 ?
2282 __pointer_alloc_traits::allocate(__npa, __nbc) : nullptr);
2283 __bucket_list_.get_deleter().size() = __nbc;
2286 for (size_type __i = 0; __i < __nbc; ++__i)
2287 __bucket_list_[__i] = nullptr;
2288 __next_pointer __pp = __p1_.first().__ptr();
2289 __next_pointer __cp = __pp->__next_;
2290 if (__cp != nullptr)
2292 size_type __chash = __constrain_hash(__cp->__hash(), __nbc);
2293 __bucket_list_[__chash] = __pp;
2294 size_type __phash = __chash;
2295 for (__pp = __cp, __cp = __cp->__next_; __cp != nullptr;
2296 __cp = __pp->__next_)
2298 __chash = __constrain_hash(__cp->__hash(), __nbc);
2299 if (__chash == __phash)
2303 if (__bucket_list_[__chash] == nullptr)
2305 __bucket_list_[__chash] = __pp;
2311 __next_pointer __np = __cp;
2312 for (; __np->__next_ != nullptr &&
2313 key_eq()(__cp->__upcast()->__value_,
2314 __np->__next_->__upcast()->__value_);
2315 __np = __np->__next_)
2317 __pp->__next_ = __np->__next_;
2318 __np->__next_ = __bucket_list_[__chash]->__next_;
2319 __bucket_list_[__chash]->__next_ = __cp;
2328 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2329 template <class _Key>
2330 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2331 __hash_table<_Tp, _Hash, _Equal, _Alloc>::find(const _Key& __k)
2333 size_t __hash = hash_function()(__k);
2334 size_type __bc = bucket_count();
2337 size_t __chash = __constrain_hash(__hash, __bc);
2338 __next_pointer __nd = __bucket_list_[__chash];
2339 if (__nd != nullptr)
2341 for (__nd = __nd->__next_; __nd != nullptr &&
2342 (__nd->__hash() == __hash
2343 || __constrain_hash(__nd->__hash(), __bc) == __chash);
2344 __nd = __nd->__next_)
2346 if ((__nd->__hash() == __hash)
2347 && key_eq()(__nd->__upcast()->__value_, __k))
2348 #if _LIBCPP_DEBUG_LEVEL >= 2
2349 return iterator(__nd, this);
2351 return iterator(__nd);
2359 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2360 template <class _Key>
2361 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator
2362 __hash_table<_Tp, _Hash, _Equal, _Alloc>::find(const _Key& __k) const
2364 size_t __hash = hash_function()(__k);
2365 size_type __bc = bucket_count();
2368 size_t __chash = __constrain_hash(__hash, __bc);
2369 __next_pointer __nd = __bucket_list_[__chash];
2370 if (__nd != nullptr)
2372 for (__nd = __nd->__next_; __nd != nullptr &&
2373 (__hash == __nd->__hash()
2374 || __constrain_hash(__nd->__hash(), __bc) == __chash);
2375 __nd = __nd->__next_)
2377 if ((__nd->__hash() == __hash)
2378 && key_eq()(__nd->__upcast()->__value_, __k))
2379 #if _LIBCPP_DEBUG_LEVEL >= 2
2380 return const_iterator(__nd, this);
2382 return const_iterator(__nd);
2391 #ifndef _LIBCPP_CXX03_LANG
2393 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2394 template <class ..._Args>
2395 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
2396 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node(_Args&& ...__args)
2398 static_assert(!__is_hash_value_type<_Args...>::value,
2399 "Construct cannot be called with a hash value type");
2400 __node_allocator& __na = __node_alloc();
2401 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2402 __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), _VSTD::forward<_Args>(__args)...);
2403 __h.get_deleter().__value_constructed = true;
2404 __h->__hash_ = hash_function()(__h->__value_);
2405 __h->__next_ = nullptr;
2409 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2410 template <class _First, class ..._Rest>
2411 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
2412 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node_hash(
2413 size_t __hash, _First&& __f, _Rest&& ...__rest)
2415 static_assert(!__is_hash_value_type<_First, _Rest...>::value,
2416 "Construct cannot be called with a hash value type");
2417 __node_allocator& __na = __node_alloc();
2418 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2419 __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_),
2420 _VSTD::forward<_First>(__f),
2421 _VSTD::forward<_Rest>(__rest)...);
2422 __h.get_deleter().__value_constructed = true;
2423 __h->__hash_ = __hash;
2424 __h->__next_ = nullptr;
2428 #else // _LIBCPP_CXX03_LANG
2430 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2431 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
2432 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node(const __container_value_type& __v)
2434 __node_allocator& __na = __node_alloc();
2435 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2436 __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), __v);
2437 __h.get_deleter().__value_constructed = true;
2438 __h->__hash_ = hash_function()(__h->__value_);
2439 __h->__next_ = nullptr;
2440 return _LIBCPP_EXPLICIT_MOVE(__h); // explicitly moved for C++03
2443 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2444 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
2445 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node_hash(size_t __hash,
2446 const __container_value_type& __v)
2448 __node_allocator& __na = __node_alloc();
2449 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2450 __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), __v);
2451 __h.get_deleter().__value_constructed = true;
2452 __h->__hash_ = __hash;
2453 __h->__next_ = nullptr;
2454 return _LIBCPP_EXPLICIT_MOVE(__h); // explicitly moved for C++03
2457 #endif // _LIBCPP_CXX03_LANG
2459 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2460 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2461 __hash_table<_Tp, _Hash, _Equal, _Alloc>::erase(const_iterator __p)
2463 __next_pointer __np = __p.__node_;
2464 #if _LIBCPP_DEBUG_LEVEL >= 2
2465 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2466 "unordered container erase(iterator) called with an iterator not"
2467 " referring to this container");
2468 _LIBCPP_ASSERT(__p != end(),
2469 "unordered container erase(iterator) called with a non-dereferenceable iterator");
2470 iterator __r(__np, this);
2479 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2480 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
2481 __hash_table<_Tp, _Hash, _Equal, _Alloc>::erase(const_iterator __first,
2482 const_iterator __last)
2484 #if _LIBCPP_DEBUG_LEVEL >= 2
2485 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__first) == this,
2486 "unodered container::erase(iterator, iterator) called with an iterator not"
2487 " referring to this unodered container");
2488 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__last) == this,
2489 "unodered container::erase(iterator, iterator) called with an iterator not"
2490 " referring to this unodered container");
2492 for (const_iterator __p = __first; __first != __last; __p = __first)
2497 __next_pointer __np = __last.__node_;
2498 #if _LIBCPP_DEBUG_LEVEL >= 2
2499 return iterator (__np, this);
2501 return iterator (__np);
2505 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2506 template <class _Key>
2507 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
2508 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__erase_unique(const _Key& __k)
2510 iterator __i = find(__k);
2517 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2518 template <class _Key>
2519 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
2520 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__erase_multi(const _Key& __k)
2523 iterator __i = find(__k);
2526 iterator __e = end();
2531 } while (__i != __e && key_eq()(*__i, __k));
2536 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2537 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
2538 __hash_table<_Tp, _Hash, _Equal, _Alloc>::remove(const_iterator __p) _NOEXCEPT
2541 __next_pointer __cn = __p.__node_;
2542 size_type __bc = bucket_count();
2543 size_t __chash = __constrain_hash(__cn->__hash(), __bc);
2544 // find previous node
2545 __next_pointer __pn = __bucket_list_[__chash];
2546 for (; __pn->__next_ != __cn; __pn = __pn->__next_)
2548 // Fix up __bucket_list_
2549 // if __pn is not in same bucket (before begin is not in same bucket) &&
2550 // if __cn->__next_ is not in same bucket (nullptr is not in same bucket)
2551 if (__pn == __p1_.first().__ptr()
2552 || __constrain_hash(__pn->__hash(), __bc) != __chash)
2554 if (__cn->__next_ == nullptr
2555 || __constrain_hash(__cn->__next_->__hash(), __bc) != __chash)
2556 __bucket_list_[__chash] = nullptr;
2558 // if __cn->__next_ is not in same bucket (nullptr is in same bucket)
2559 if (__cn->__next_ != nullptr)
2561 size_t __nhash = __constrain_hash(__cn->__next_->__hash(), __bc);
2562 if (__nhash != __chash)
2563 __bucket_list_[__nhash] = __pn;
2566 __pn->__next_ = __cn->__next_;
2567 __cn->__next_ = nullptr;
2569 #if _LIBCPP_DEBUG_LEVEL >= 2
2570 __c_node* __c = __get_db()->__find_c_and_lock(this);
2571 for (__i_node** __dp = __c->end_; __dp != __c->beg_; )
2574 iterator* __i = static_cast<iterator*>((*__dp)->__i_);
2575 if (__i->__node_ == __cn)
2577 (*__dp)->__c_ = nullptr;
2578 if (--__c->end_ != __dp)
2579 memmove(__dp, __dp+1, (__c->end_ - __dp)*sizeof(__i_node*));
2582 __get_db()->unlock();
2584 return __node_holder(__cn->__upcast(), _Dp(__node_alloc(), true));
2587 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2588 template <class _Key>
2590 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
2591 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__count_unique(const _Key& __k) const
2593 return static_cast<size_type>(find(__k) != end());
2596 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2597 template <class _Key>
2598 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
2599 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__count_multi(const _Key& __k) const
2602 const_iterator __i = find(__k);
2605 const_iterator __e = end();
2610 } while (__i != __e && key_eq()(*__i, __k));
2615 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2616 template <class _Key>
2617 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator,
2618 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator>
2619 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_unique(
2622 iterator __i = find(__k);
2626 return pair<iterator, iterator>(__i, __j);
2629 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2630 template <class _Key>
2631 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator,
2632 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator>
2633 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_unique(
2634 const _Key& __k) const
2636 const_iterator __i = find(__k);
2637 const_iterator __j = __i;
2640 return pair<const_iterator, const_iterator>(__i, __j);
2643 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2644 template <class _Key>
2645 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator,
2646 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator>
2647 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_multi(
2650 iterator __i = find(__k);
2654 iterator __e = end();
2658 } while (__j != __e && key_eq()(*__j, __k));
2660 return pair<iterator, iterator>(__i, __j);
2663 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2664 template <class _Key>
2665 pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator,
2666 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator>
2667 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_multi(
2668 const _Key& __k) const
2670 const_iterator __i = find(__k);
2671 const_iterator __j = __i;
2674 const_iterator __e = end();
2678 } while (__j != __e && key_eq()(*__j, __k));
2680 return pair<const_iterator, const_iterator>(__i, __j);
2683 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2685 __hash_table<_Tp, _Hash, _Equal, _Alloc>::swap(__hash_table& __u)
2686 #if _LIBCPP_STD_VER <= 11
2688 __is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value
2689 && (!allocator_traits<__pointer_allocator>::propagate_on_container_swap::value
2690 || __is_nothrow_swappable<__pointer_allocator>::value)
2691 && (!__node_traits::propagate_on_container_swap::value
2692 || __is_nothrow_swappable<__node_allocator>::value)
2695 _NOEXCEPT_DEBUG_(__is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value)
2698 _LIBCPP_ASSERT(__node_traits::propagate_on_container_swap::value ||
2699 this->__node_alloc() == __u.__node_alloc(),
2700 "list::swap: Either propagate_on_container_swap must be true"
2701 " or the allocators must compare equal");
2703 __node_pointer_pointer __npp = __bucket_list_.release();
2704 __bucket_list_.reset(__u.__bucket_list_.release());
2705 __u.__bucket_list_.reset(__npp);
2707 _VSTD::swap(__bucket_list_.get_deleter().size(), __u.__bucket_list_.get_deleter().size());
2708 __swap_allocator(__bucket_list_.get_deleter().__alloc(),
2709 __u.__bucket_list_.get_deleter().__alloc());
2710 __swap_allocator(__node_alloc(), __u.__node_alloc());
2711 _VSTD::swap(__p1_.first().__next_, __u.__p1_.first().__next_);
2712 __p2_.swap(__u.__p2_);
2713 __p3_.swap(__u.__p3_);
2715 __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
2716 __p1_.first().__ptr();
2718 __u.__bucket_list_[__constrain_hash(__u.__p1_.first().__next_->__hash(), __u.bucket_count())] =
2719 __u.__p1_.first().__ptr();
2720 #if _LIBCPP_DEBUG_LEVEL >= 2
2721 __get_db()->swap(this, &__u);
2725 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2726 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
2727 __hash_table<_Tp, _Hash, _Equal, _Alloc>::bucket_size(size_type __n) const
2729 _LIBCPP_ASSERT(__n < bucket_count(),
2730 "unordered container::bucket_size(n) called with n >= bucket_count()");
2731 __next_pointer __np = __bucket_list_[__n];
2732 size_type __bc = bucket_count();
2734 if (__np != nullptr)
2736 for (__np = __np->__next_; __np != nullptr &&
2737 __constrain_hash(__np->__hash(), __bc) == __n;
2738 __np = __np->__next_, ++__r)
2744 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2745 inline _LIBCPP_INLINE_VISIBILITY
2747 swap(__hash_table<_Tp, _Hash, _Equal, _Alloc>& __x,
2748 __hash_table<_Tp, _Hash, _Equal, _Alloc>& __y)
2749 _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
2754 #if _LIBCPP_DEBUG_LEVEL >= 2
2756 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2758 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__dereferenceable(const const_iterator* __i) const
2760 return __i->__node_ != nullptr;
2763 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2765 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__decrementable(const const_iterator*) const
2770 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2772 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__addable(const const_iterator*, ptrdiff_t) const
2777 template <class _Tp, class _Hash, class _Equal, class _Alloc>
2779 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__subscriptable(const const_iterator*, ptrdiff_t) const
2784 #endif // _LIBCPP_DEBUG_LEVEL >= 2
2786 _LIBCPP_END_NAMESPACE_STD
2790 #endif // _LIBCPP__HASH_TABLE