33#pragma GCC system_header
38#if __cplusplus > 201402L
42namespace std _GLIBCXX_VISIBILITY(default)
44_GLIBCXX_BEGIN_NAMESPACE_VERSION
47 template<
typename _Tp,
typename _Hash>
50 __is_fast_hash<_Hash>,
52 __is_nothrow_invocable<const _Hash&, const _Tp&>>>;
57 template<
typename _Equal,
typename _Hash,
typename _Allocator>
58 using _Hashtable_enable_default_ctor
59 = _Enable_default_constructor<__and_<is_default_constructible<_Equal>,
60 is_default_constructible<_Hash>,
61 is_default_constructible<_Allocator>>{},
62 __detail::_Hash_node_base>;
181 template<
typename _Key,
typename _Value,
typename _Alloc,
182 typename _ExtractKey,
typename _Equal,
183 typename _Hash,
typename _RangeHash,
typename _Unused,
184 typename _RehashPolicy,
typename _Traits>
186 :
public __detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal,
187 _Hash, _RangeHash, _Unused, _Traits>,
188 public __detail::_Map_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
189 _Hash, _RangeHash, _Unused,
190 _RehashPolicy, _Traits>,
191 public __detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal,
192 _Hash, _RangeHash, _Unused,
193 _RehashPolicy, _Traits>,
194 public __detail::_Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
195 _Hash, _RangeHash, _Unused,
196 _RehashPolicy, _Traits>,
197 public __detail::_Equality<_Key, _Value, _Alloc, _ExtractKey, _Equal,
198 _Hash, _RangeHash, _Unused,
199 _RehashPolicy, _Traits>,
200 private __detail::_Hashtable_alloc<
201 __alloc_rebind<_Alloc,
202 __detail::_Hash_node<_Value,
203 _Traits::__hash_cached::value>>>,
204 private _Hashtable_enable_default_ctor<_Equal, _Hash, _Alloc>
206 static_assert(is_same<typename remove_cv<_Value>::type, _Value>::value,
207 "unordered container must have a non-const, non-volatile value_type");
208#if __cplusplus > 201703L || defined __STRICT_ANSI__
209 static_assert(is_same<typename _Alloc::value_type, _Value>{},
210 "unordered container must have the same value_type as its allocator");
213 using __traits_type = _Traits;
214 using __hash_cached =
typename __traits_type::__hash_cached;
215 using __constant_iterators =
typename __traits_type::__constant_iterators;
216 using __node_type = __detail::_Hash_node<_Value, __hash_cached::value>;
217 using __node_alloc_type = __alloc_rebind<_Alloc, __node_type>;
219 using __hashtable_alloc = __detail::_Hashtable_alloc<__node_alloc_type>;
221 using __node_value_type =
222 __detail::_Hash_node_value<_Value, __hash_cached::value>;
223 using __node_ptr =
typename __hashtable_alloc::__node_ptr;
224 using __value_alloc_traits =
225 typename __hashtable_alloc::__value_alloc_traits;
226 using __node_alloc_traits =
227 typename __hashtable_alloc::__node_alloc_traits;
228 using __node_base =
typename __hashtable_alloc::__node_base;
229 using __node_base_ptr =
typename __hashtable_alloc::__node_base_ptr;
230 using __buckets_ptr =
typename __hashtable_alloc::__buckets_ptr;
232 using __insert_base = __detail::_Insert<_Key, _Value, _Alloc, _ExtractKey,
235 _RehashPolicy, _Traits>;
236 using __enable_default_ctor
237 = _Hashtable_enable_default_ctor<_Equal, _Hash, _Alloc>;
238 using __rehash_guard_t
239 = __detail::_RehashStateGuard<_RehashPolicy>;
242 typedef _Key key_type;
243 typedef _Value value_type;
244 typedef _Alloc allocator_type;
245 typedef _Equal key_equal;
249 typedef typename __value_alloc_traits::pointer pointer;
250 typedef typename __value_alloc_traits::const_pointer const_pointer;
251 typedef value_type& reference;
252 typedef const value_type& const_reference;
254 using iterator =
typename __insert_base::iterator;
256 using const_iterator =
typename __insert_base::const_iterator;
258 using local_iterator = __detail::_Local_iterator<key_type, _Value,
259 _ExtractKey, _Hash, _RangeHash, _Unused,
260 __constant_iterators::value,
261 __hash_cached::value>;
263 using const_local_iterator = __detail::_Local_const_iterator<
265 _ExtractKey, _Hash, _RangeHash, _Unused,
266 __constant_iterators::value, __hash_cached::value>;
269 using __rehash_type = _RehashPolicy;
271 using __unique_keys =
typename __traits_type::__unique_keys;
273 using __hashtable_base = __detail::
274 _Hashtable_base<_Key, _Value, _ExtractKey,
275 _Equal, _Hash, _RangeHash, _Unused, _Traits>;
277 using __hash_code_base =
typename __hashtable_base::__hash_code_base;
278 using __hash_code =
typename __hashtable_base::__hash_code;
279 using __ireturn_type =
typename __insert_base::__ireturn_type;
281 using __map_base = __detail::_Map_base<_Key, _Value, _Alloc, _ExtractKey,
282 _Equal, _Hash, _RangeHash, _Unused,
283 _RehashPolicy, _Traits>;
285 using __rehash_base = __detail::_Rehash_base<_Key, _Value, _Alloc,
287 _Hash, _RangeHash, _Unused,
288 _RehashPolicy, _Traits>;
290 using __eq_base = __detail::_Equality<_Key, _Value, _Alloc, _ExtractKey,
291 _Equal, _Hash, _RangeHash, _Unused,
292 _RehashPolicy, _Traits>;
294 using __reuse_or_alloc_node_gen_t =
295 __detail::_ReuseOrAllocNode<__node_alloc_type>;
296 using __alloc_node_gen_t =
297 __detail::_AllocNode<__node_alloc_type>;
298 using __node_builder_t =
299 __detail::_NodeBuilder<_ExtractKey>;
305 _Scoped_node(__node_ptr __n, __hashtable_alloc* __h)
306 : _M_h(__h), _M_node(__n) { }
309 template<
typename... _Args>
310 _Scoped_node(__hashtable_alloc* __h, _Args&&... __args)
312 _M_node(__h->_M_allocate_node(
std::
forward<_Args>(__args)...))
316 ~_Scoped_node() {
if (_M_node) _M_h->_M_deallocate_node(_M_node); };
318 _Scoped_node(
const _Scoped_node&) =
delete;
319 _Scoped_node& operator=(
const _Scoped_node&) =
delete;
321 __hashtable_alloc* _M_h;
325 template<
typename _Ht>
327 __conditional_t<std::is_lvalue_reference<_Ht>::value,
328 const value_type&, value_type&&>
329 __fwd_value_for(value_type& __val)
noexcept
336 struct __hash_code_base_access : __hash_code_base
337 {
using __hash_code_base::_M_bucket_index; };
340 static_assert(is_nothrow_default_constructible<_RangeHash>::value,
341 "Functor used to map hash code to bucket index"
342 " must be nothrow default constructible");
343 static_assert(
noexcept(
345 "Functor used to map hash code to bucket index must be"
349 static_assert(is_nothrow_default_constructible<_ExtractKey>::value,
350 "_ExtractKey must be nothrow default constructible");
351 static_assert(
noexcept(
353 "_ExtractKey functor must be noexcept invocable");
355 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
356 typename _ExtractKeya,
typename _Equala,
357 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
358 typename _RehashPolicya,
typename _Traitsa,
360 friend struct __detail::_Map_base;
362 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
363 typename _ExtractKeya,
typename _Equala,
364 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
365 typename _RehashPolicya,
typename _Traitsa>
366 friend struct __detail::_Insert_base;
368 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
369 typename _ExtractKeya,
typename _Equala,
370 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
371 typename _RehashPolicya,
typename _Traitsa,
372 bool _Constant_iteratorsa>
373 friend struct __detail::_Insert;
375 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
376 typename _ExtractKeya,
typename _Equala,
377 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
378 typename _RehashPolicya,
typename _Traitsa,
380 friend struct __detail::_Equality;
383 using size_type =
typename __hashtable_base::size_type;
384 using difference_type =
typename __hashtable_base::difference_type;
386#if __cplusplus > 201402L
387 using node_type = _Node_handle<_Key, _Value, __node_alloc_type>;
388 using insert_return_type = _Node_insert_return<iterator, node_type>;
392 __buckets_ptr _M_buckets = &_M_single_bucket;
393 size_type _M_bucket_count = 1;
394 __node_base _M_before_begin;
395 size_type _M_element_count = 0;
396 _RehashPolicy _M_rehash_policy;
404 __node_base_ptr _M_single_bucket =
nullptr;
409 if (
auto __begin = _M_begin())
410 _M_buckets[_M_bucket_index(*__begin)] = &_M_before_begin;
414 _M_update_bbegin(__node_ptr __n)
416 _M_before_begin._M_nxt = __n;
421 _M_uses_single_bucket(__buckets_ptr __bkts)
const
422 {
return __builtin_expect(__bkts == &_M_single_bucket,
false); }
425 _M_uses_single_bucket()
const
426 {
return _M_uses_single_bucket(_M_buckets); }
428 static constexpr size_t
429 __small_size_threshold() noexcept
432 __detail::_Hashtable_hash_traits<_Hash>::__small_size_threshold();
436 _M_base_alloc() {
return *
this; }
439 _M_allocate_buckets(size_type __bkt_count)
441 if (__builtin_expect(__bkt_count == 1,
false))
443 _M_single_bucket =
nullptr;
444 return &_M_single_bucket;
447 return __hashtable_alloc::_M_allocate_buckets(__bkt_count);
451 _M_deallocate_buckets(__buckets_ptr __bkts, size_type __bkt_count)
453 if (_M_uses_single_bucket(__bkts))
456 __hashtable_alloc::_M_deallocate_buckets(__bkts, __bkt_count);
460 _M_deallocate_buckets()
461 { _M_deallocate_buckets(_M_buckets, _M_bucket_count); }
466 _M_bucket_begin(size_type __bkt)
const
468 __node_base_ptr __n = _M_buckets[__bkt];
469 return __n ?
static_cast<__node_ptr
>(__n->_M_nxt) : nullptr;
474 {
return static_cast<__node_ptr
>(_M_before_begin._M_nxt); }
478 template<
typename _Ht>
480 _M_assign_elements(_Ht&&);
482 template<
typename _Ht,
typename _NodeGenerator>
484 _M_assign(_Ht&&,
const _NodeGenerator&);
487 _M_move_assign(_Hashtable&&, true_type);
490 _M_move_assign(_Hashtable&&, false_type);
495 _Hashtable(const _Hash& __h, const _Equal& __eq,
496 const allocator_type& __a)
497 : __hashtable_base(__h, __eq),
498 __hashtable_alloc(__node_alloc_type(__a)),
499 __enable_default_ctor(_Enable_default_constructor_tag{})
502 template<
bool _No_realloc = true>
503 static constexpr bool
506#if __cplusplus <= 201402L
507 return __and_<__bool_constant<_No_realloc>,
508 is_nothrow_copy_constructible<_Hash>,
509 is_nothrow_copy_constructible<_Equal>>::value;
511 if constexpr (_No_realloc)
512 if constexpr (is_nothrow_copy_constructible<_Hash>())
513 return is_nothrow_copy_constructible<_Equal>();
518 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
520 noexcept(_S_nothrow_move());
522 _Hashtable(_Hashtable&&, __node_alloc_type&&,
525 template<
typename _InputIterator>
526 _Hashtable(_InputIterator __first, _InputIterator __last,
527 size_type __bkt_count_hint,
528 const _Hash&,
const _Equal&,
const allocator_type&,
531 template<
typename _InputIterator>
532 _Hashtable(_InputIterator __first, _InputIterator __last,
533 size_type __bkt_count_hint,
534 const _Hash&,
const _Equal&,
const allocator_type&,
539 _Hashtable() =
default;
541 _Hashtable(
const _Hashtable&);
543 _Hashtable(
const _Hashtable&,
const allocator_type&);
546 _Hashtable(size_type __bkt_count_hint,
547 const _Hash& __hf = _Hash(),
548 const key_equal& __eql = key_equal(),
549 const allocator_type& __a = allocator_type());
552 _Hashtable(_Hashtable&& __ht)
553 noexcept(_S_nothrow_move())
554 : _Hashtable(
std::
move(__ht),
std::
move(__ht._M_node_allocator()),
558 _Hashtable(_Hashtable&& __ht,
const allocator_type& __a)
559 noexcept(_S_nothrow_move<__node_alloc_traits::_S_always_equal()>())
560 : _Hashtable(
std::
move(__ht), __node_alloc_type(__a),
561 typename __node_alloc_traits::is_always_equal{})
565 _Hashtable(
const allocator_type& __a)
566 : __hashtable_alloc(__node_alloc_type(__a)),
567 __enable_default_ctor(_Enable_default_constructor_tag{})
570 template<
typename _InputIterator>
571 _Hashtable(_InputIterator __f, _InputIterator __l,
572 size_type __bkt_count_hint = 0,
573 const _Hash& __hf = _Hash(),
574 const key_equal& __eql = key_equal(),
575 const allocator_type& __a = allocator_type())
576 : _Hashtable(__f, __l, __bkt_count_hint, __hf, __eql, __a,
580 _Hashtable(initializer_list<value_type> __l,
581 size_type __bkt_count_hint = 0,
582 const _Hash& __hf = _Hash(),
583 const key_equal& __eql = key_equal(),
584 const allocator_type& __a = allocator_type())
585 : _Hashtable(__l.
begin(), __l.
end(), __bkt_count_hint,
586 __hf, __eql, __a, __unique_keys{})
590 operator=(
const _Hashtable& __ht);
593 operator=(_Hashtable&& __ht)
594 noexcept(__node_alloc_traits::_S_nothrow_move()
595 && is_nothrow_move_assignable<_Hash>::value
596 && is_nothrow_move_assignable<_Equal>::value)
598 constexpr bool __move_storage =
599 __node_alloc_traits::_S_propagate_on_move_assign()
600 || __node_alloc_traits::_S_always_equal();
601 _M_move_assign(
std::move(__ht), __bool_constant<__move_storage>());
606 operator=(initializer_list<value_type> __l)
608 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
609 _M_before_begin._M_nxt =
nullptr;
613 auto __l_bkt_count = _M_rehash_policy._M_bkt_for_elements(__l.size());
616 if (_M_bucket_count < __l_bkt_count)
617 rehash(__l_bkt_count);
619 this->_M_insert_range(__l.begin(), __l.end(), __roan, __unique_keys{});
623 ~_Hashtable() noexcept;
627 noexcept(__and_<__is_nothrow_swappable<_Hash>,
628 __is_nothrow_swappable<_Equal>>::value);
633 {
return iterator(_M_begin()); }
636 begin() const noexcept
637 {
return const_iterator(_M_begin()); }
641 {
return iterator(
nullptr); }
645 {
return const_iterator(
nullptr); }
649 {
return const_iterator(_M_begin()); }
652 cend() const noexcept
653 {
return const_iterator(
nullptr); }
656 size() const noexcept
657 {
return _M_element_count; }
659 _GLIBCXX_NODISCARD
bool
660 empty() const noexcept
661 {
return size() == 0; }
664 get_allocator() const noexcept
665 {
return allocator_type(this->_M_node_allocator()); }
668 max_size() const noexcept
669 {
return __node_alloc_traits::max_size(this->_M_node_allocator()); }
674 {
return this->_M_eq(); }
680 bucket_count() const noexcept
681 {
return _M_bucket_count; }
684 max_bucket_count() const noexcept
685 {
return max_size(); }
688 bucket_size(size_type __bkt)
const
692 bucket(
const key_type& __k)
const
693 {
return _M_bucket_index(this->_M_hash_code(__k)); }
696 begin(size_type __bkt)
698 return local_iterator(*
this, _M_bucket_begin(__bkt),
699 __bkt, _M_bucket_count);
704 {
return local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
707 begin(size_type __bkt)
const
709 return const_local_iterator(*
this, _M_bucket_begin(__bkt),
710 __bkt, _M_bucket_count);
714 end(size_type __bkt)
const
715 {
return const_local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
719 cbegin(size_type __bkt)
const
721 return const_local_iterator(*
this, _M_bucket_begin(__bkt),
722 __bkt, _M_bucket_count);
726 cend(size_type __bkt)
const
727 {
return const_local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
730 load_factor() const noexcept
732 return static_cast<float>(
size()) /
static_cast<float>(bucket_count());
741 __rehash_policy()
const
742 {
return _M_rehash_policy; }
745 __rehash_policy(
const _RehashPolicy& __pol)
746 { _M_rehash_policy = __pol; }
750 find(
const key_type& __k);
753 find(
const key_type& __k)
const;
756 count(
const key_type& __k)
const;
759 equal_range(
const key_type& __k);
762 equal_range(
const key_type& __k)
const;
764#ifdef __glibcxx_generic_unordered_lookup
765 template<
typename _Kt,
766 typename = __has_is_transparent_t<_Hash, _Kt>,
767 typename = __has_is_transparent_t<_Equal, _Kt>>
769 _M_find_tr(
const _Kt& __k);
771 template<
typename _Kt,
772 typename = __has_is_transparent_t<_Hash, _Kt>,
773 typename = __has_is_transparent_t<_Equal, _Kt>>
775 _M_find_tr(
const _Kt& __k)
const;
777 template<
typename _Kt,
778 typename = __has_is_transparent_t<_Hash, _Kt>,
779 typename = __has_is_transparent_t<_Equal, _Kt>>
781 _M_count_tr(
const _Kt& __k)
const;
783 template<
typename _Kt,
784 typename = __has_is_transparent_t<_Hash, _Kt>,
785 typename = __has_is_transparent_t<_Equal, _Kt>>
786 pair<iterator, iterator>
787 _M_equal_range_tr(
const _Kt& __k);
789 template<
typename _Kt,
790 typename = __has_is_transparent_t<_Hash, _Kt>,
791 typename = __has_is_transparent_t<_Equal, _Kt>>
792 pair<const_iterator, const_iterator>
793 _M_equal_range_tr(
const _Kt& __k)
const;
799 _M_bucket_index(
const __node_value_type& __n)
const noexcept
800 {
return __hash_code_base::_M_bucket_index(__n, _M_bucket_count); }
803 _M_bucket_index(__hash_code __c)
const
804 {
return __hash_code_base::_M_bucket_index(__c, _M_bucket_count); }
807 _M_find_before_node(
const key_type&);
812 _M_find_before_node(size_type,
const key_type&, __hash_code)
const;
814 template<
typename _Kt>
816 _M_find_before_node_tr(size_type,
const _Kt&, __hash_code)
const;
819 _M_find_node(size_type __bkt,
const key_type& __key,
820 __hash_code __c)
const
822 __node_base_ptr __before_n = _M_find_before_node(__bkt, __key, __c);
824 return static_cast<__node_ptr
>(__before_n->_M_nxt);
828 template<
typename _Kt>
830 _M_find_node_tr(size_type __bkt,
const _Kt& __key,
831 __hash_code __c)
const
833 auto __before_n = _M_find_before_node_tr(__bkt, __key, __c);
835 return static_cast<__node_ptr
>(__before_n->_M_nxt);
841 _M_insert_bucket_begin(size_type __bkt, __node_ptr __node)
843 if (_M_buckets[__bkt])
847 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt;
848 _M_buckets[__bkt]->_M_nxt = __node;
855 __node->_M_nxt = _M_before_begin._M_nxt;
856 _M_before_begin._M_nxt = __node;
861 _M_buckets[_M_bucket_index(*__node->_M_next())] = __node;
863 _M_buckets[__bkt] = &_M_before_begin;
869 _M_remove_bucket_begin(size_type __bkt, __node_ptr __next_n,
870 size_type __next_bkt)
873 _M_buckets[__bkt] =
nullptr;
874 else if (__next_bkt != __bkt)
876 _M_buckets[__next_bkt] = _M_buckets[__bkt];
877 _M_buckets[__bkt] =
nullptr;
883 _M_get_previous_node(size_type __bkt, __node_ptr __n);
885 pair<__node_ptr, __hash_code>
886 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const;
895 _M_insert_unique_node(size_type __bkt, __hash_code,
896 __node_ptr __n, size_type __n_elt = 1);
901 _M_insert_multi_node(__node_ptr __hint,
902 __hash_code __code, __node_ptr __n);
904 template<
typename... _Args>
906 _M_emplace(true_type __uks, _Args&&... __args);
908 template<
typename... _Args>
910 _M_emplace(false_type __uks, _Args&&... __args)
914 template<
typename... _Args>
916 _M_emplace(const_iterator, true_type __uks, _Args&&... __args)
919 template<
typename... _Args>
921 _M_emplace(const_iterator, false_type __uks, _Args&&... __args);
923 template<
typename _Kt,
typename _Arg,
typename _NodeGenerator>
925 _M_insert_unique(_Kt&&, _Arg&&,
const _NodeGenerator&);
927 template<
typename _Arg,
typename _NodeGenerator>
929 _M_insert_unique_aux(_Arg&& __arg,
const _NodeGenerator& __node_gen)
932 constexpr bool __is_key_type
933 = is_same<__remove_cvref_t<_Kt>, key_type>::value;
934 using _Fwd_key = __conditional_t<__is_key_type, _Kt&&, key_type>;
935 return _M_insert_unique(
940 template<
typename _Arg,
typename _NodeGenerator>
942 _M_insert(_Arg&& __arg,
const _NodeGenerator& __node_gen,
945 using __detail::_Identity;
946 using _Vt = __conditional_t<is_same<_ExtractKey, _Identity>::value
947 || __is_pair<__remove_cvref_t<_Arg>>,
949 return _M_insert_unique_aux(
953 template<
typename _Arg,
typename _NodeGenerator>
955 _M_insert(_Arg&& __arg,
const _NodeGenerator& __node_gen,
963 template<
typename _Arg,
typename _NodeGenerator>
965 _M_insert(const_iterator, _Arg&& __arg,
966 const _NodeGenerator& __node_gen, true_type __uks)
973 template<
typename _Arg,
typename _NodeGenerator>
975 _M_insert(const_iterator, _Arg&&,
976 const _NodeGenerator&, false_type __uks);
979 _M_erase(true_type __uks,
const key_type&);
982 _M_erase(false_type __uks,
const key_type&);
985 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n);
989 template<
typename... _Args>
991 emplace(_Args&&... __args)
994 template<
typename... _Args>
996 emplace_hint(const_iterator __hint, _Args&&... __args)
998 return _M_emplace(__hint, __unique_keys{},
1006 erase(const_iterator);
1011 erase(iterator __it)
1012 {
return erase(const_iterator(__it)); }
1015 erase(
const key_type& __k)
1016 {
return _M_erase(__unique_keys{}, __k); }
1019 erase(const_iterator, const_iterator);
1026 void rehash(size_type __bkt_count);
1031#if __glibcxx_node_extract
1034 _M_reinsert_node(node_type&& __nh)
1036 insert_return_type __ret;
1038 __ret.position =
end();
1041 __glibcxx_assert(get_allocator() == __nh.get_allocator());
1043 __node_ptr __n =
nullptr;
1044 const key_type& __k = __nh._M_key();
1045 const size_type __size =
size();
1046 if (__size <= __small_size_threshold())
1048 for (__n = _M_begin(); __n; __n = __n->_M_next())
1049 if (this->_M_key_equals(__k, *__n))
1057 __code = this->_M_hash_code(__k);
1058 __bkt = _M_bucket_index(__code);
1059 if (__size > __small_size_threshold())
1060 __n = _M_find_node(__bkt, __k, __code);
1066 __ret.position = iterator(__n);
1067 __ret.inserted =
false;
1072 = _M_insert_unique_node(__bkt, __code, __nh._M_ptr);
1074 __ret.inserted =
true;
1082 _M_reinsert_node_multi(const_iterator __hint, node_type&& __nh)
1087 __glibcxx_assert(get_allocator() == __nh.get_allocator());
1089 const key_type& __k = __nh._M_key();
1090 auto __code = this->_M_hash_code(__k);
1092 = _M_insert_multi_node(__hint._M_cur, __code, __nh._M_ptr);
1099 _M_extract_node(
size_t __bkt, __node_base_ptr __prev_n)
1101 __node_ptr __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
1102 if (__prev_n == _M_buckets[__bkt])
1103 _M_remove_bucket_begin(__bkt, __n->_M_next(),
1104 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
1105 else if (__n->_M_nxt)
1107 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
1108 if (__next_bkt != __bkt)
1109 _M_buckets[__next_bkt] = __prev_n;
1112 __prev_n->_M_nxt = __n->_M_nxt;
1113 __n->_M_nxt =
nullptr;
1115 return { __n, this->_M_node_allocator() };
1120 template<
typename _H2>
1122 _M_src_hash_code(
const _H2&,
const key_type& __k,
1123 const __node_value_type& __src_n)
const
1125 if constexpr (std::is_same_v<_H2, _Hash>)
1126 if constexpr (std::is_empty_v<_Hash>)
1127 return this->_M_hash_code(__src_n);
1129 return this->_M_hash_code(__k);
1135 extract(const_iterator __pos)
1137 size_t __bkt = _M_bucket_index(*__pos._M_cur);
1138 return _M_extract_node(__bkt,
1139 _M_get_previous_node(__bkt, __pos._M_cur));
1144 extract(
const _Key& __k)
1147 __hash_code __code = this->_M_hash_code(__k);
1148 std::size_t __bkt = _M_bucket_index(__code);
1149 if (__node_base_ptr __prev_node = _M_find_before_node(__bkt, __k, __code))
1150 __nh = _M_extract_node(__bkt, __prev_node);
1155 template<
typename _Compatible_Hashtable>
1157 _M_merge_unique(_Compatible_Hashtable& __src)
1159 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1160 node_type>,
"Node types are compatible");
1161 __glibcxx_assert(get_allocator() == __src.get_allocator());
1163 auto __n_elt = __src.size();
1164 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1167 const size_type __size =
size();
1168 const key_type& __k = _ExtractKey{}(*__pos);
1169 if (__size <= __small_size_threshold())
1171 bool __found =
false;
1172 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1173 if (this->_M_key_equals(__k, *__n))
1188 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1189 size_type __bkt = _M_bucket_index(__code);
1190 if (__size <= __small_size_threshold()
1191 || _M_find_node(__bkt, __k, __code) ==
nullptr)
1193 auto __nh = __src.extract(__pos);
1194 _M_insert_unique_node(__bkt, __code, __nh._M_ptr, __n_elt);
1198 else if (__n_elt != 1)
1204 template<
typename _Compatible_Hashtable>
1206 _M_merge_multi(_Compatible_Hashtable& __src)
1208 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1209 node_type>,
"Node types are compatible");
1210 __glibcxx_assert(get_allocator() == __src.get_allocator());
1212 __node_ptr __hint =
nullptr;
1213 this->reserve(
size() + __src.size());
1214 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1217 const key_type& __k = _ExtractKey{}(*__pos);
1219 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1220 auto __nh = __src.extract(__pos);
1221 __hint = _M_insert_multi_node(__hint, __code, __nh._M_ptr)._M_cur;
1229 void _M_rehash(size_type __bkt_count, true_type __uks);
1232 void _M_rehash(size_type __bkt_count, false_type __uks);
1236 template<
typename _Key,
typename _Value,
typename _Alloc,
1237 typename _ExtractKey,
typename _Equal,
1238 typename _Hash,
typename _RangeHash,
typename _Unused,
1239 typename _RehashPolicy,
typename _Traits>
1240 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1241 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1242 _Hashtable(size_type __bkt_count_hint,
1243 const _Hash& __h,
const _Equal& __eq,
const allocator_type& __a)
1244 : _Hashtable(__h, __eq, __a)
1246 auto __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count_hint);
1247 if (__bkt_count > _M_bucket_count)
1249 _M_buckets = _M_allocate_buckets(__bkt_count);
1250 _M_bucket_count = __bkt_count;
1254 template<
typename _Key,
typename _Value,
typename _Alloc,
1255 typename _ExtractKey,
typename _Equal,
1256 typename _Hash,
typename _RangeHash,
typename _Unused,
1257 typename _RehashPolicy,
typename _Traits>
1258 template<
typename _InputIterator>
1259 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1260 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1261 _Hashtable(_InputIterator __f, _InputIterator __l,
1262 size_type __bkt_count_hint,
1263 const _Hash& __h,
const _Equal& __eq,
1264 const allocator_type& __a, true_type )
1265 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1266 { this->insert(__f, __l); }
1268 template<
typename _Key,
typename _Value,
typename _Alloc,
1269 typename _ExtractKey,
typename _Equal,
1270 typename _Hash,
typename _RangeHash,
typename _Unused,
1271 typename _RehashPolicy,
typename _Traits>
1272 template<
typename _InputIterator>
1273 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1274 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1275 _Hashtable(_InputIterator __f, _InputIterator __l,
1276 size_type __bkt_count_hint,
1277 const _Hash& __h,
const _Equal& __eq,
1278 const allocator_type& __a, false_type __uks)
1279 : _Hashtable(__h, __eq, __a)
1281 auto __nb_elems = __detail::__distance_fw(__f, __l);
1283 _M_rehash_policy._M_next_bkt(
1284 std::max(_M_rehash_policy._M_bkt_for_elements(__nb_elems),
1287 if (__bkt_count > _M_bucket_count)
1289 _M_buckets = _M_allocate_buckets(__bkt_count);
1290 _M_bucket_count = __bkt_count;
1293 __alloc_node_gen_t __node_gen(*
this);
1294 for (; __f != __l; ++__f)
1295 _M_insert(*__f, __node_gen, __uks);
1298 template<
typename _Key,
typename _Value,
typename _Alloc,
1299 typename _ExtractKey,
typename _Equal,
1300 typename _Hash,
typename _RangeHash,
typename _Unused,
1301 typename _RehashPolicy,
typename _Traits>
1303 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1304 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1305 operator=(
const _Hashtable& __ht)
1311 if (__node_alloc_traits::_S_propagate_on_copy_assign())
1313 auto& __this_alloc = this->_M_node_allocator();
1314 auto& __that_alloc = __ht._M_node_allocator();
1315 if (!__node_alloc_traits::_S_always_equal()
1316 && __this_alloc != __that_alloc)
1319 this->_M_deallocate_nodes(_M_begin());
1320 _M_before_begin._M_nxt =
nullptr;
1321 _M_deallocate_buckets();
1322 _M_buckets =
nullptr;
1323 std::__alloc_on_copy(__this_alloc, __that_alloc);
1324 __hashtable_base::operator=(__ht);
1325 _M_bucket_count = __ht._M_bucket_count;
1326 _M_element_count = __ht._M_element_count;
1327 _M_rehash_policy = __ht._M_rehash_policy;
1328 __alloc_node_gen_t __alloc_node_gen(*
this);
1331 _M_assign(__ht, __alloc_node_gen);
1338 __throw_exception_again;
1342 std::__alloc_on_copy(__this_alloc, __that_alloc);
1346 _M_assign_elements(__ht);
1350 template<
typename _Key,
typename _Value,
typename _Alloc,
1351 typename _ExtractKey,
typename _Equal,
1352 typename _Hash,
typename _RangeHash,
typename _Unused,
1353 typename _RehashPolicy,
typename _Traits>
1354 template<
typename _Ht>
1356 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1357 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1358 _M_assign_elements(_Ht&& __ht)
1360 __buckets_ptr __former_buckets =
nullptr;
1361 std::size_t __former_bucket_count = _M_bucket_count;
1362 __rehash_guard_t __rehash_guard(_M_rehash_policy);
1364 if (_M_bucket_count != __ht._M_bucket_count)
1366 __former_buckets = _M_buckets;
1367 _M_buckets = _M_allocate_buckets(__ht._M_bucket_count);
1368 _M_bucket_count = __ht._M_bucket_count;
1371 __builtin_memset(_M_buckets, 0,
1372 _M_bucket_count *
sizeof(__node_base_ptr));
1377 _M_element_count = __ht._M_element_count;
1378 _M_rehash_policy = __ht._M_rehash_policy;
1379 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
1380 _M_before_begin._M_nxt =
nullptr;
1382 if (__former_buckets)
1383 _M_deallocate_buckets(__former_buckets, __former_bucket_count);
1384 __rehash_guard._M_guarded_obj =
nullptr;
1388 if (__former_buckets)
1391 _M_deallocate_buckets();
1392 _M_buckets = __former_buckets;
1393 _M_bucket_count = __former_bucket_count;
1395 __builtin_memset(_M_buckets, 0,
1396 _M_bucket_count *
sizeof(__node_base_ptr));
1397 __throw_exception_again;
1401 template<
typename _Key,
typename _Value,
typename _Alloc,
1402 typename _ExtractKey,
typename _Equal,
1403 typename _Hash,
typename _RangeHash,
typename _Unused,
1404 typename _RehashPolicy,
typename _Traits>
1405 template<
typename _Ht,
typename _NodeGenerator>
1407 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1408 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1409 _M_assign(_Ht&& __ht,
const _NodeGenerator& __node_gen)
1411 __buckets_ptr __buckets =
nullptr;
1413 _M_buckets = __buckets = _M_allocate_buckets(_M_bucket_count);
1417 if (!__ht._M_before_begin._M_nxt)
1422 __node_ptr __ht_n = __ht._M_begin();
1424 = __node_gen(__fwd_value_for<_Ht>(__ht_n->_M_v()));
1425 this->_M_copy_code(*__this_n, *__ht_n);
1426 _M_update_bbegin(__this_n);
1429 __node_ptr __prev_n = __this_n;
1430 for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next())
1432 __this_n = __node_gen(__fwd_value_for<_Ht>(__ht_n->_M_v()));
1433 __prev_n->_M_nxt = __this_n;
1434 this->_M_copy_code(*__this_n, *__ht_n);
1435 size_type __bkt = _M_bucket_index(*__this_n);
1436 if (!_M_buckets[__bkt])
1437 _M_buckets[__bkt] = __prev_n;
1438 __prev_n = __this_n;
1445 _M_deallocate_buckets();
1446 __throw_exception_again;
1450 template<
typename _Key,
typename _Value,
typename _Alloc,
1451 typename _ExtractKey,
typename _Equal,
1452 typename _Hash,
typename _RangeHash,
typename _Unused,
1453 typename _RehashPolicy,
typename _Traits>
1455 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1456 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1459 _M_rehash_policy._M_reset();
1460 _M_bucket_count = 1;
1461 _M_single_bucket =
nullptr;
1462 _M_buckets = &_M_single_bucket;
1463 _M_before_begin._M_nxt =
nullptr;
1464 _M_element_count = 0;
1467 template<
typename _Key,
typename _Value,
typename _Alloc,
1468 typename _ExtractKey,
typename _Equal,
1469 typename _Hash,
typename _RangeHash,
typename _Unused,
1470 typename _RehashPolicy,
typename _Traits>
1472 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1473 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1474 _M_move_assign(_Hashtable&& __ht, true_type)
1479 this->_M_deallocate_nodes(_M_begin());
1480 _M_deallocate_buckets();
1481 __hashtable_base::operator=(
std::move(__ht));
1482 _M_rehash_policy = __ht._M_rehash_policy;
1483 if (!__ht._M_uses_single_bucket())
1484 _M_buckets = __ht._M_buckets;
1487 _M_buckets = &_M_single_bucket;
1488 _M_single_bucket = __ht._M_single_bucket;
1491 _M_bucket_count = __ht._M_bucket_count;
1492 _M_before_begin._M_nxt = __ht._M_before_begin._M_nxt;
1493 _M_element_count = __ht._M_element_count;
1494 std::__alloc_on_move(this->_M_node_allocator(), __ht._M_node_allocator());
1501 template<
typename _Key,
typename _Value,
typename _Alloc,
1502 typename _ExtractKey,
typename _Equal,
1503 typename _Hash,
typename _RangeHash,
typename _Unused,
1504 typename _RehashPolicy,
typename _Traits>
1506 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1507 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1508 _M_move_assign(_Hashtable&& __ht, false_type)
1510 if (__ht._M_node_allocator() == this->_M_node_allocator())
1511 _M_move_assign(
std::move(__ht), true_type{});
1520 template<
typename _Key,
typename _Value,
typename _Alloc,
1521 typename _ExtractKey,
typename _Equal,
1522 typename _Hash,
typename _RangeHash,
typename _Unused,
1523 typename _RehashPolicy,
typename _Traits>
1524 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1525 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1526 _Hashtable(
const _Hashtable& __ht)
1527 : __hashtable_base(__ht),
1529 __rehash_base(__ht),
1531 __node_alloc_traits::_S_select_on_copy(__ht._M_node_allocator())),
1532 __enable_default_ctor(__ht),
1533 _M_buckets(nullptr),
1534 _M_bucket_count(__ht._M_bucket_count),
1535 _M_element_count(__ht._M_element_count),
1536 _M_rehash_policy(__ht._M_rehash_policy)
1538 __alloc_node_gen_t __alloc_node_gen(*
this);
1539 _M_assign(__ht, __alloc_node_gen);
1542 template<
typename _Key,
typename _Value,
typename _Alloc,
1543 typename _ExtractKey,
typename _Equal,
1544 typename _Hash,
typename _RangeHash,
typename _Unused,
1545 typename _RehashPolicy,
typename _Traits>
1546 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1547 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1548 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1550 noexcept(_S_nothrow_move())
1551 : __hashtable_base(__ht),
1553 __rehash_base(__ht),
1554 __hashtable_alloc(
std::
move(__a)),
1555 __enable_default_ctor(__ht),
1556 _M_buckets(__ht._M_buckets),
1557 _M_bucket_count(__ht._M_bucket_count),
1558 _M_before_begin(__ht._M_before_begin._M_nxt),
1559 _M_element_count(__ht._M_element_count),
1560 _M_rehash_policy(__ht._M_rehash_policy)
1563 if (__ht._M_uses_single_bucket())
1565 _M_buckets = &_M_single_bucket;
1566 _M_single_bucket = __ht._M_single_bucket;
1575 template<
typename _Key,
typename _Value,
typename _Alloc,
1576 typename _ExtractKey,
typename _Equal,
1577 typename _Hash,
typename _RangeHash,
typename _Unused,
1578 typename _RehashPolicy,
typename _Traits>
1579 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1580 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1581 _Hashtable(
const _Hashtable& __ht,
const allocator_type& __a)
1582 : __hashtable_base(__ht),
1584 __rehash_base(__ht),
1585 __hashtable_alloc(__node_alloc_type(__a)),
1586 __enable_default_ctor(__ht),
1588 _M_bucket_count(__ht._M_bucket_count),
1589 _M_element_count(__ht._M_element_count),
1590 _M_rehash_policy(__ht._M_rehash_policy)
1592 __alloc_node_gen_t __alloc_node_gen(*
this);
1593 _M_assign(__ht, __alloc_node_gen);
1596 template<
typename _Key,
typename _Value,
typename _Alloc,
1597 typename _ExtractKey,
typename _Equal,
1598 typename _Hash,
typename _RangeHash,
typename _Unused,
1599 typename _RehashPolicy,
typename _Traits>
1600 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1601 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1602 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1604 : __hashtable_base(__ht),
1606 __rehash_base(__ht),
1607 __hashtable_alloc(
std::
move(__a)),
1608 __enable_default_ctor(__ht),
1609 _M_buckets(nullptr),
1610 _M_bucket_count(__ht._M_bucket_count),
1611 _M_element_count(__ht._M_element_count),
1612 _M_rehash_policy(__ht._M_rehash_policy)
1614 if (__ht._M_node_allocator() == this->_M_node_allocator())
1616 if (__ht._M_uses_single_bucket())
1618 _M_buckets = &_M_single_bucket;
1619 _M_single_bucket = __ht._M_single_bucket;
1622 _M_buckets = __ht._M_buckets;
1626 _M_update_bbegin(__ht._M_begin());
1632 __alloc_node_gen_t __alloc_gen(*
this);
1634 using _Fwd_Ht = __conditional_t<
1635 __move_if_noexcept_cond<value_type>::value,
1636 const _Hashtable&, _Hashtable&&>;
1642 template<
typename _Key,
typename _Value,
typename _Alloc,
1643 typename _ExtractKey,
typename _Equal,
1644 typename _Hash,
typename _RangeHash,
typename _Unused,
1645 typename _RehashPolicy,
typename _Traits>
1646 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1647 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1648 ~_Hashtable() noexcept
1653 static_assert(
noexcept(declval<const __hash_code_base_access&>()
1654 ._M_bucket_index(declval<const __node_value_type&>(),
1656 "Cache the hash code or qualify your functors involved"
1657 " in hash code and bucket index computation with noexcept");
1660 _M_deallocate_buckets();
1663 template<
typename _Key,
typename _Value,
typename _Alloc,
1664 typename _ExtractKey,
typename _Equal,
1665 typename _Hash,
typename _RangeHash,
typename _Unused,
1666 typename _RehashPolicy,
typename _Traits>
1668 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1669 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1670 swap(_Hashtable& __x)
1671 noexcept(__and_<__is_nothrow_swappable<_Hash>,
1672 __is_nothrow_swappable<_Equal>>::value)
1679 std::__alloc_on_swap(this->_M_node_allocator(), __x._M_node_allocator());
1680 std::swap(_M_rehash_policy, __x._M_rehash_policy);
1683 if (this->_M_uses_single_bucket())
1685 if (!__x._M_uses_single_bucket())
1687 _M_buckets = __x._M_buckets;
1688 __x._M_buckets = &__x._M_single_bucket;
1691 else if (__x._M_uses_single_bucket())
1693 __x._M_buckets = _M_buckets;
1694 _M_buckets = &_M_single_bucket;
1697 std::swap(_M_buckets, __x._M_buckets);
1699 std::swap(_M_bucket_count, __x._M_bucket_count);
1700 std::swap(_M_before_begin._M_nxt, __x._M_before_begin._M_nxt);
1701 std::swap(_M_element_count, __x._M_element_count);
1702 std::swap(_M_single_bucket, __x._M_single_bucket);
1707 __x._M_update_bbegin();
1710 template<
typename _Key,
typename _Value,
typename _Alloc,
1711 typename _ExtractKey,
typename _Equal,
1712 typename _Hash,
typename _RangeHash,
typename _Unused,
1713 typename _RehashPolicy,
typename _Traits>
1715 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1716 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1717 find(
const key_type& __k)
1720 if (
size() <= __small_size_threshold())
1722 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
1723 if (this->_M_key_equals(__k, *__it))
1724 return iterator(__it);
1728 __hash_code __code = this->_M_hash_code(__k);
1729 std::size_t __bkt = _M_bucket_index(__code);
1730 return iterator(_M_find_node(__bkt, __k, __code));
1733 template<
typename _Key,
typename _Value,
typename _Alloc,
1734 typename _ExtractKey,
typename _Equal,
1735 typename _Hash,
typename _RangeHash,
typename _Unused,
1736 typename _RehashPolicy,
typename _Traits>
1738 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1739 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1740 find(
const key_type& __k)
const
1743 if (
size() <= __small_size_threshold())
1745 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
1746 if (this->_M_key_equals(__k, *__it))
1747 return const_iterator(__it);
1751 __hash_code __code = this->_M_hash_code(__k);
1752 std::size_t __bkt = _M_bucket_index(__code);
1753 return const_iterator(_M_find_node(__bkt, __k, __code));
1756#if __cplusplus > 201703L
1757 template<
typename _Key,
typename _Value,
typename _Alloc,
1758 typename _ExtractKey,
typename _Equal,
1759 typename _Hash,
typename _RangeHash,
typename _Unused,
1760 typename _RehashPolicy,
typename _Traits>
1761 template<
typename _Kt,
typename,
typename>
1763 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1764 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1765 _M_find_tr(
const _Kt& __k)
1768 if (
size() <= __small_size_threshold())
1770 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1771 if (this->_M_key_equals_tr(__k, *__n))
1772 return iterator(__n);
1776 __hash_code __code = this->_M_hash_code_tr(__k);
1777 std::size_t __bkt = _M_bucket_index(__code);
1778 return iterator(_M_find_node_tr(__bkt, __k, __code));
1781 template<
typename _Key,
typename _Value,
typename _Alloc,
1782 typename _ExtractKey,
typename _Equal,
1783 typename _Hash,
typename _RangeHash,
typename _Unused,
1784 typename _RehashPolicy,
typename _Traits>
1785 template<
typename _Kt,
typename,
typename>
1787 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1788 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1789 _M_find_tr(
const _Kt& __k)
const
1792 if (
size() <= __small_size_threshold())
1794 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1795 if (this->_M_key_equals_tr(__k, *__n))
1796 return const_iterator(__n);
1800 __hash_code __code = this->_M_hash_code_tr(__k);
1801 std::size_t __bkt = _M_bucket_index(__code);
1802 return const_iterator(_M_find_node_tr(__bkt, __k, __code));
1806 template<
typename _Key,
typename _Value,
typename _Alloc,
1807 typename _ExtractKey,
typename _Equal,
1808 typename _Hash,
typename _RangeHash,
typename _Unused,
1809 typename _RehashPolicy,
typename _Traits>
1811 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1812 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1813 count(
const key_type& __k)
const
1816 auto __it = find(__k);
1820 if (__unique_keys::value)
1823 size_type __result = 1;
1824 for (
auto __ref = __it++;
1825 __it._M_cur && this->_M_node_equals(*__ref._M_cur, *__it._M_cur);
1832#if __cplusplus > 201703L
1833 template<
typename _Key,
typename _Value,
typename _Alloc,
1834 typename _ExtractKey,
typename _Equal,
1835 typename _Hash,
typename _RangeHash,
typename _Unused,
1836 typename _RehashPolicy,
typename _Traits>
1837 template<
typename _Kt,
typename,
typename>
1839 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1840 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1841 _M_count_tr(
const _Kt& __k)
const
1844 if (
size() <= __small_size_threshold())
1846 size_type __result = 0;
1847 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1849 if (this->_M_key_equals_tr(__k, *__n))
1862 __hash_code __code = this->_M_hash_code_tr(__k);
1863 std::size_t __bkt = _M_bucket_index(__code);
1864 auto __n = _M_find_node_tr(__bkt, __k, __code);
1869 size_type __result = 1;
1871 __it._M_cur && this->_M_equals_tr(__k, __code, *__it._M_cur);
1879 template<
typename _Key,
typename _Value,
typename _Alloc,
1880 typename _ExtractKey,
typename _Equal,
1881 typename _Hash,
typename _RangeHash,
typename _Unused,
1882 typename _RehashPolicy,
typename _Traits>
1884 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1885 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1886 equal_range(
const key_type& __k)
1887 -> pair<iterator, iterator>
1889 auto __ite = find(__k);
1891 return { __ite, __ite };
1893 auto __beg = __ite++;
1894 if (__unique_keys::value)
1895 return { __beg, __ite };
1897 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
1900 return { __beg, __ite };
1903 template<
typename _Key,
typename _Value,
typename _Alloc,
1904 typename _ExtractKey,
typename _Equal,
1905 typename _Hash,
typename _RangeHash,
typename _Unused,
1906 typename _RehashPolicy,
typename _Traits>
1908 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1909 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1910 equal_range(
const key_type& __k)
const
1911 -> pair<const_iterator, const_iterator>
1913 auto __ite = find(__k);
1915 return { __ite, __ite };
1917 auto __beg = __ite++;
1918 if (__unique_keys::value)
1919 return { __beg, __ite };
1921 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
1924 return { __beg, __ite };
1927#if __cplusplus > 201703L
1928 template<
typename _Key,
typename _Value,
typename _Alloc,
1929 typename _ExtractKey,
typename _Equal,
1930 typename _Hash,
typename _RangeHash,
typename _Unused,
1931 typename _RehashPolicy,
typename _Traits>
1932 template<
typename _Kt,
typename,
typename>
1934 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1935 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1936 _M_equal_range_tr(
const _Kt& __k)
1937 -> pair<iterator, iterator>
1939 if (
size() <= __small_size_threshold())
1941 __node_ptr __n, __beg =
nullptr;
1942 for (__n = _M_begin(); __n; __n = __n->_M_next())
1944 if (this->_M_key_equals_tr(__k, *__n))
1955 return { iterator(__beg), iterator(__n) };
1958 __hash_code __code = this->_M_hash_code_tr(__k);
1959 std::size_t __bkt = _M_bucket_index(__code);
1960 auto __n = _M_find_node_tr(__bkt, __k, __code);
1961 iterator __ite(__n);
1963 return { __ite, __ite };
1965 auto __beg = __ite++;
1966 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
1969 return { __beg, __ite };
1972 template<
typename _Key,
typename _Value,
typename _Alloc,
1973 typename _ExtractKey,
typename _Equal,
1974 typename _Hash,
typename _RangeHash,
typename _Unused,
1975 typename _RehashPolicy,
typename _Traits>
1976 template<
typename _Kt,
typename,
typename>
1978 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1979 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1980 _M_equal_range_tr(
const _Kt& __k)
const
1981 -> pair<const_iterator, const_iterator>
1983 if (
size() <= __small_size_threshold())
1985 __node_ptr __n, __beg =
nullptr;
1986 for (__n = _M_begin(); __n; __n = __n->_M_next())
1988 if (this->_M_key_equals_tr(__k, *__n))
1999 return { const_iterator(__beg), const_iterator(__n) };
2002 __hash_code __code = this->_M_hash_code_tr(__k);
2003 std::size_t __bkt = _M_bucket_index(__code);
2004 auto __n = _M_find_node_tr(__bkt, __k, __code);
2005 const_iterator __ite(__n);
2007 return { __ite, __ite };
2009 auto __beg = __ite++;
2010 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
2013 return { __beg, __ite };
2019 template<
typename _Key,
typename _Value,
typename _Alloc,
2020 typename _ExtractKey,
typename _Equal,
2021 typename _Hash,
typename _RangeHash,
typename _Unused,
2022 typename _RehashPolicy,
typename _Traits>
2024 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2025 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2026 _M_find_before_node(
const key_type& __k)
2029 __node_base_ptr __prev_p = &_M_before_begin;
2030 if (!__prev_p->_M_nxt)
2033 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);
2035 __p = __p->_M_next())
2037 if (this->_M_key_equals(__k, *__p))
2048 template<
typename _Key,
typename _Value,
typename _Alloc,
2049 typename _ExtractKey,
typename _Equal,
2050 typename _Hash,
typename _RangeHash,
typename _Unused,
2051 typename _RehashPolicy,
typename _Traits>
2053 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2054 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2055 _M_find_before_node(size_type __bkt,
const key_type& __k,
2056 __hash_code __code)
const
2059 __node_base_ptr __prev_p = _M_buckets[__bkt];
2063 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2064 __p = __p->_M_next())
2066 if (this->_M_equals(__k, __code, *__p))
2069 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2077 template<
typename _Key,
typename _Value,
typename _Alloc,
2078 typename _ExtractKey,
typename _Equal,
2079 typename _Hash,
typename _RangeHash,
typename _Unused,
2080 typename _RehashPolicy,
typename _Traits>
2081 template<
typename _Kt>
2083 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2084 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2085 _M_find_before_node_tr(size_type __bkt,
const _Kt& __k,
2086 __hash_code __code)
const
2089 __node_base_ptr __prev_p = _M_buckets[__bkt];
2093 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2094 __p = __p->_M_next())
2096 if (this->_M_equals_tr(__k, __code, *__p))
2099 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2107 template<
typename _Key,
typename _Value,
typename _Alloc,
2108 typename _ExtractKey,
typename _Equal,
2109 typename _Hash,
typename _RangeHash,
typename _Unused,
2110 typename _RehashPolicy,
typename _Traits>
2112 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2113 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2114 _M_get_previous_node(size_type __bkt, __node_ptr __n)
2117 __node_base_ptr __prev_n = _M_buckets[__bkt];
2118 while (__prev_n->_M_nxt != __n)
2119 __prev_n = __prev_n->_M_nxt;
2123 template<
typename _Key,
typename _Value,
typename _Alloc,
2124 typename _ExtractKey,
typename _Equal,
2125 typename _Hash,
typename _RangeHash,
typename _Unused,
2126 typename _RehashPolicy,
typename _Traits>
2127 template<
typename... _Args>
2129 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2130 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2131 _M_emplace(true_type , _Args&&... __args)
2132 -> pair<iterator, bool>
2136 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v());
2137 const size_type __size =
size();
2138 if (__size <= __small_size_threshold())
2140 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
2141 if (this->_M_key_equals(__k, *__it))
2143 return { iterator(__it),
false };
2146 __hash_code __code = this->_M_hash_code(__k);
2147 size_type __bkt = _M_bucket_index(__code);
2148 if (__size > __small_size_threshold())
2149 if (__node_ptr __p = _M_find_node(__bkt, __k, __code))
2151 return { iterator(__p),
false };
2154 auto __pos = _M_insert_unique_node(__bkt, __code, __node._M_node);
2155 __node._M_node =
nullptr;
2156 return { __pos,
true };
2159 template<
typename _Key,
typename _Value,
typename _Alloc,
2160 typename _ExtractKey,
typename _Equal,
2161 typename _Hash,
typename _RangeHash,
typename _Unused,
2162 typename _RehashPolicy,
typename _Traits>
2163 template<
typename... _Args>
2165 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2166 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2167 _M_emplace(const_iterator __hint, false_type ,
2173 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v());
2175 auto __res = this->_M_compute_hash_code(__hint._M_cur, __k);
2177 = _M_insert_multi_node(__res.first, __res.second, __node._M_node);
2178 __node._M_node =
nullptr;
2182 template<
typename _Key,
typename _Value,
typename _Alloc,
2183 typename _ExtractKey,
typename _Equal,
2184 typename _Hash,
typename _RangeHash,
typename _Unused,
2185 typename _RehashPolicy,
typename _Traits>
2187 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2188 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2189 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const
2190 -> pair<__node_ptr, __hash_code>
2192 if (
size() <= __small_size_threshold())
2196 for (
auto __it = __hint; __it; __it = __it->_M_next())
2197 if (this->_M_key_equals(__k, *__it))
2198 return { __it, this->_M_hash_code(*__it) };
2201 for (
auto __it = _M_begin(); __it != __hint; __it = __it->_M_next())
2202 if (this->_M_key_equals(__k, *__it))
2203 return { __it, this->_M_hash_code(*__it) };
2208 return { __hint, this->_M_hash_code(__k) };
2211 template<
typename _Key,
typename _Value,
typename _Alloc,
2212 typename _ExtractKey,
typename _Equal,
2213 typename _Hash,
typename _RangeHash,
typename _Unused,
2214 typename _RehashPolicy,
typename _Traits>
2216 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2217 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2218 _M_insert_unique_node(size_type __bkt, __hash_code __code,
2219 __node_ptr __node, size_type __n_elt)
2222 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2224 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count,
2227 if (__do_rehash.
first)
2229 _M_rehash(__do_rehash.
second, true_type{});
2230 __bkt = _M_bucket_index(__code);
2233 __rehash_guard._M_guarded_obj =
nullptr;
2234 this->_M_store_code(*__node, __code);
2237 _M_insert_bucket_begin(__bkt, __node);
2239 return iterator(__node);
2242 template<
typename _Key,
typename _Value,
typename _Alloc,
2243 typename _ExtractKey,
typename _Equal,
2244 typename _Hash,
typename _RangeHash,
typename _Unused,
2245 typename _RehashPolicy,
typename _Traits>
2247 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2248 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2249 _M_insert_multi_node(__node_ptr __hint,
2250 __hash_code __code, __node_ptr __node)
2253 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2255 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1);
2257 if (__do_rehash.
first)
2258 _M_rehash(__do_rehash.
second, false_type{});
2260 __rehash_guard._M_guarded_obj =
nullptr;
2261 this->_M_store_code(*__node, __code);
2262 const key_type& __k = _ExtractKey{}(__node->_M_v());
2263 size_type __bkt = _M_bucket_index(__code);
2267 __node_base_ptr __prev
2268 = __builtin_expect(__hint !=
nullptr,
false)
2269 && this->_M_equals(__k, __code, *__hint)
2271 : _M_find_before_node(__bkt, __k, __code);
2276 __node->_M_nxt = __prev->_M_nxt;
2277 __prev->_M_nxt = __node;
2278 if (__builtin_expect(__prev == __hint,
false))
2282 && !this->_M_equals(__k, __code, *__node->_M_next()))
2284 size_type __next_bkt = _M_bucket_index(*__node->_M_next());
2285 if (__next_bkt != __bkt)
2286 _M_buckets[__next_bkt] = __node;
2293 _M_insert_bucket_begin(__bkt, __node);
2295 return iterator(__node);
2299 template<
typename _Key,
typename _Value,
typename _Alloc,
2300 typename _ExtractKey,
typename _Equal,
2301 typename _Hash,
typename _RangeHash,
typename _Unused,
2302 typename _RehashPolicy,
typename _Traits>
2303 template<
typename _Kt,
typename _Arg,
typename _NodeGenerator>
2305 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2306 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2307 _M_insert_unique(_Kt&& __k, _Arg&& __v,
2308 const _NodeGenerator& __node_gen)
2309 -> pair<iterator, bool>
2311 const size_type __size =
size();
2312 if (__size <= __small_size_threshold())
2313 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
2314 if (this->_M_key_equals_tr(__k, *__it))
2315 return { iterator(__it),
false };
2317 __hash_code __code = this->_M_hash_code_tr(__k);
2318 size_type __bkt = _M_bucket_index(__code);
2320 if (__size > __small_size_threshold())
2321 if (__node_ptr __node = _M_find_node_tr(__bkt, __k, __code))
2322 return { iterator(__node),
false };
2324 _Scoped_node __node {
2331 = _M_insert_unique_node(__bkt, __code, __node._M_node);
2332 __node._M_node =
nullptr;
2333 return { __pos,
true };
2337 template<
typename _Key,
typename _Value,
typename _Alloc,
2338 typename _ExtractKey,
typename _Equal,
2339 typename _Hash,
typename _RangeHash,
typename _Unused,
2340 typename _RehashPolicy,
typename _Traits>
2341 template<
typename _Arg,
typename _NodeGenerator>
2343 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2344 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2345 _M_insert(const_iterator __hint, _Arg&& __v,
2346 const _NodeGenerator& __node_gen,
2354 auto __res = this->_M_compute_hash_code(
2355 __hint._M_cur, _ExtractKey{}(__node._M_node->_M_v()));
2358 = _M_insert_multi_node(__res.first, __res.second, __node._M_node);
2359 __node._M_node =
nullptr;
2363 template<
typename _Key,
typename _Value,
typename _Alloc,
2364 typename _ExtractKey,
typename _Equal,
2365 typename _Hash,
typename _RangeHash,
typename _Unused,
2366 typename _RehashPolicy,
typename _Traits>
2368 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2369 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2370 erase(const_iterator __it)
2373 __node_ptr __n = __it._M_cur;
2374 std::size_t __bkt = _M_bucket_index(*__n);
2379 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2380 return _M_erase(__bkt, __prev_n, __n);
2383 template<
typename _Key,
typename _Value,
typename _Alloc,
2384 typename _ExtractKey,
typename _Equal,
2385 typename _Hash,
typename _RangeHash,
typename _Unused,
2386 typename _RehashPolicy,
typename _Traits>
2388 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2389 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2390 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n)
2393 if (__prev_n == _M_buckets[__bkt])
2394 _M_remove_bucket_begin(__bkt, __n->_M_next(),
2395 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
2396 else if (__n->_M_nxt)
2398 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
2399 if (__next_bkt != __bkt)
2400 _M_buckets[__next_bkt] = __prev_n;
2403 __prev_n->_M_nxt = __n->_M_nxt;
2404 iterator __result(__n->_M_next());
2405 this->_M_deallocate_node(__n);
2411 template<
typename _Key,
typename _Value,
typename _Alloc,
2412 typename _ExtractKey,
typename _Equal,
2413 typename _Hash,
typename _RangeHash,
typename _Unused,
2414 typename _RehashPolicy,
typename _Traits>
2416 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2417 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2418 _M_erase(true_type ,
const key_type& __k)
2421 __node_base_ptr __prev_n;
2424 if (
size() <= __small_size_threshold())
2426 __prev_n = _M_find_before_node(__k);
2431 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2432 __bkt = _M_bucket_index(*__n);
2436 __hash_code __code = this->_M_hash_code(__k);
2437 __bkt = _M_bucket_index(__code);
2440 __prev_n = _M_find_before_node(__bkt, __k, __code);
2445 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2448 _M_erase(__bkt, __prev_n, __n);
2452 template<
typename _Key,
typename _Value,
typename _Alloc,
2453 typename _ExtractKey,
typename _Equal,
2454 typename _Hash,
typename _RangeHash,
typename _Unused,
2455 typename _RehashPolicy,
typename _Traits>
2457 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2458 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2459 _M_erase(false_type ,
const key_type& __k)
2463 __node_base_ptr __prev_n;
2465 if (
size() <= __small_size_threshold())
2467 __prev_n = _M_find_before_node(__k);
2472 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2473 __bkt = _M_bucket_index(*__n);
2477 __hash_code __code = this->_M_hash_code(__k);
2478 __bkt = _M_bucket_index(__code);
2481 __prev_n = _M_find_before_node(__bkt, __k, __code);
2485 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2494 __node_ptr __n_last = __n->_M_next();
2495 while (__n_last && this->_M_node_equals(*__n, *__n_last))
2496 __n_last = __n_last->_M_next();
2498 std::size_t __n_last_bkt = __n_last ? _M_bucket_index(*__n_last) : __bkt;
2501 size_type __result = 0;
2504 __node_ptr __p = __n->_M_next();
2505 this->_M_deallocate_node(__n);
2509 while (__n != __n_last);
2511 _M_element_count -= __result;
2512 if (__prev_n == _M_buckets[__bkt])
2513 _M_remove_bucket_begin(__bkt, __n_last, __n_last_bkt);
2514 else if (__n_last_bkt != __bkt)
2515 _M_buckets[__n_last_bkt] = __prev_n;
2516 __prev_n->_M_nxt = __n_last;
2520 template<
typename _Key,
typename _Value,
typename _Alloc,
2521 typename _ExtractKey,
typename _Equal,
2522 typename _Hash,
typename _RangeHash,
typename _Unused,
2523 typename _RehashPolicy,
typename _Traits>
2525 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2526 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2527 erase(const_iterator __first, const_iterator __last)
2530 __node_ptr __n = __first._M_cur;
2531 __node_ptr __last_n = __last._M_cur;
2532 if (__n == __last_n)
2533 return iterator(__n);
2535 std::size_t __bkt = _M_bucket_index(*__n);
2537 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2538 bool __is_bucket_begin = __n == _M_bucket_begin(__bkt);
2539 std::size_t __n_bkt = __bkt;
2544 __node_ptr __tmp = __n;
2545 __n = __n->_M_next();
2546 this->_M_deallocate_node(__tmp);
2550 __n_bkt = _M_bucket_index(*__n);
2552 while (__n != __last_n && __n_bkt == __bkt);
2553 if (__is_bucket_begin)
2554 _M_remove_bucket_begin(__bkt, __n, __n_bkt);
2555 if (__n == __last_n)
2557 __is_bucket_begin =
true;
2561 if (__n && (__n_bkt != __bkt || __is_bucket_begin))
2562 _M_buckets[__n_bkt] = __prev_n;
2563 __prev_n->_M_nxt = __n;
2564 return iterator(__n);
2567 template<
typename _Key,
typename _Value,
typename _Alloc,
2568 typename _ExtractKey,
typename _Equal,
2569 typename _Hash,
typename _RangeHash,
typename _Unused,
2570 typename _RehashPolicy,
typename _Traits>
2572 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2573 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2576 this->_M_deallocate_nodes(_M_begin());
2577 __builtin_memset(_M_buckets, 0,
2578 _M_bucket_count *
sizeof(__node_base_ptr));
2579 _M_element_count = 0;
2580 _M_before_begin._M_nxt =
nullptr;
2583 template<
typename _Key,
typename _Value,
typename _Alloc,
2584 typename _ExtractKey,
typename _Equal,
2585 typename _Hash,
typename _RangeHash,
typename _Unused,
2586 typename _RehashPolicy,
typename _Traits>
2588 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2589 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2590 rehash(size_type __bkt_count)
2592 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2594 =
std::max(_M_rehash_policy._M_bkt_for_elements(_M_element_count + 1),
2596 __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count);
2598 if (__bkt_count != _M_bucket_count)
2600 _M_rehash(__bkt_count, __unique_keys{});
2601 __rehash_guard._M_guarded_obj =
nullptr;
2606 template<
typename _Key,
typename _Value,
typename _Alloc,
2607 typename _ExtractKey,
typename _Equal,
2608 typename _Hash,
typename _RangeHash,
typename _Unused,
2609 typename _RehashPolicy,
typename _Traits>
2611 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2612 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2613 _M_rehash(size_type __bkt_count, true_type )
2615 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2616 __node_ptr __p = _M_begin();
2617 _M_before_begin._M_nxt =
nullptr;
2618 std::size_t __bbegin_bkt = 0;
2621 __node_ptr __next = __p->_M_next();
2623 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2624 if (!__new_buckets[__bkt])
2626 __p->_M_nxt = _M_before_begin._M_nxt;
2627 _M_before_begin._M_nxt = __p;
2628 __new_buckets[__bkt] = &_M_before_begin;
2630 __new_buckets[__bbegin_bkt] = __p;
2631 __bbegin_bkt = __bkt;
2635 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2636 __new_buckets[__bkt]->_M_nxt = __p;
2642 _M_deallocate_buckets();
2643 _M_bucket_count = __bkt_count;
2644 _M_buckets = __new_buckets;
2649 template<
typename _Key,
typename _Value,
typename _Alloc,
2650 typename _ExtractKey,
typename _Equal,
2651 typename _Hash,
typename _RangeHash,
typename _Unused,
2652 typename _RehashPolicy,
typename _Traits>
2654 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2655 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2656 _M_rehash(size_type __bkt_count, false_type )
2658 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2659 __node_ptr __p = _M_begin();
2660 _M_before_begin._M_nxt =
nullptr;
2661 std::size_t __bbegin_bkt = 0;
2662 std::size_t __prev_bkt = 0;
2663 __node_ptr __prev_p =
nullptr;
2664 bool __check_bucket =
false;
2668 __node_ptr __next = __p->_M_next();
2670 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2672 if (__prev_p && __prev_bkt == __bkt)
2677 __p->_M_nxt = __prev_p->_M_nxt;
2678 __prev_p->_M_nxt = __p;
2685 __check_bucket =
true;
2693 if (__prev_p->_M_nxt)
2695 std::size_t __next_bkt
2696 = __hash_code_base::_M_bucket_index(
2697 *__prev_p->_M_next(), __bkt_count);
2698 if (__next_bkt != __prev_bkt)
2699 __new_buckets[__next_bkt] = __prev_p;
2701 __check_bucket =
false;
2704 if (!__new_buckets[__bkt])
2706 __p->_M_nxt = _M_before_begin._M_nxt;
2707 _M_before_begin._M_nxt = __p;
2708 __new_buckets[__bkt] = &_M_before_begin;
2710 __new_buckets[__bbegin_bkt] = __p;
2711 __bbegin_bkt = __bkt;
2715 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2716 __new_buckets[__bkt]->_M_nxt = __p;
2724 if (__check_bucket && __prev_p->_M_nxt)
2726 std::size_t __next_bkt
2727 = __hash_code_base::_M_bucket_index(*__prev_p->_M_next(),
2729 if (__next_bkt != __prev_bkt)
2730 __new_buckets[__next_bkt] = __prev_p;
2733 _M_deallocate_buckets();
2734 _M_bucket_count = __bkt_count;
2735 _M_buckets = __new_buckets;
2738#if __cplusplus > 201402L
2739 template<
typename,
typename,
typename>
class _Hash_merge_helper { };
2742#if __cpp_deduction_guides >= 201606
2744 template<
typename _Hash>
2745 using _RequireNotAllocatorOrIntegral
2746 = __enable_if_t<!__or_<is_integral<_Hash>, __is_allocator<_Hash>>::value>;
2750_GLIBCXX_END_NAMESPACE_VERSION
auto declval() noexcept -> decltype(__declval< _Tp >(0))
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
constexpr const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
ISO C++ entities toplevel namespace is std.
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
constexpr auto cend(const _Container &__cont) noexcept(noexcept(std::end(__cont))) -> decltype(std::end(__cont))
Return an iterator pointing to one past the last element of the const container.
constexpr auto empty(const _Container &__cont) noexcept(noexcept(__cont.empty())) -> decltype(__cont.empty())
Return whether a container is empty.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
constexpr auto cbegin(const _Container &__cont) noexcept(noexcept(std::begin(__cont))) -> decltype(std::begin(__cont))
Return an iterator pointing to the first element of the const container.
Struct holding two objects of arbitrary type.
_T1 first
The first member.
_T2 second
The second member.