34#pragma GCC system_header
41#if __cplusplus > 201402L
45#pragma GCC diagnostic push
46#pragma GCC diagnostic ignored "-Wc++11-extensions"
48namespace std _GLIBCXX_VISIBILITY(default)
50_GLIBCXX_BEGIN_NAMESPACE_VERSION
53 template<
typename _Tp,
typename _Hash>
56 __is_fast_hash<_Hash>,
58 __is_nothrow_invocable<const _Hash&, const _Tp&>>>;
63 template<
typename _Equal,
typename _Hash,
typename _Allocator>
64 using _Hashtable_enable_default_ctor
65 = _Enable_default_constructor<__and_<is_default_constructible<_Equal>,
66 is_default_constructible<_Hash>,
67 is_default_constructible<_Allocator>>{},
68 __detail::_Hash_node_base>;
185 template<
typename _Key,
typename _Value,
typename _Alloc,
186 typename _ExtractKey,
typename _Equal,
187 typename _Hash,
typename _RangeHash,
typename _Unused,
188 typename _RehashPolicy,
typename _Traits>
190 :
public __detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal,
191 _Hash, _RangeHash, _Unused, _Traits>,
192 public __detail::_Map_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
193 _Hash, _RangeHash, _Unused,
194 _RehashPolicy, _Traits>,
195 public __detail::_Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
196 _Hash, _RangeHash, _Unused,
197 _RehashPolicy, _Traits>,
198 private __detail::_Hashtable_alloc<
199 __alloc_rebind<_Alloc,
200 __detail::_Hash_node<_Value,
201 _Traits::__hash_cached::value>>>,
202 private _Hashtable_enable_default_ctor<_Equal, _Hash, _Alloc>
204 static_assert(is_same<typename remove_cv<_Value>::type, _Value>::value,
205 "unordered container must have a non-const, non-volatile value_type");
206#if __cplusplus > 201703L || defined __STRICT_ANSI__
207 static_assert(is_same<typename _Alloc::value_type, _Value>{},
208 "unordered container must have the same value_type as its allocator");
210 static_assert(is_copy_constructible<_Hash>::value,
211 "hash function must be copy constructible");
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 __enable_default_ctor
233 = _Hashtable_enable_default_ctor<_Equal, _Hash, _Alloc>;
234 using __rehash_guard_t
235 = __detail::_RehashStateGuard<_RehashPolicy>;
238 typedef _Key key_type;
239 typedef _Value value_type;
240 typedef _Alloc allocator_type;
241 typedef _Equal key_equal;
245 typedef typename __value_alloc_traits::pointer pointer;
246 typedef typename __value_alloc_traits::const_pointer const_pointer;
247 typedef value_type& reference;
248 typedef const value_type& const_reference;
251 = __detail::_Node_iterator<_Value, __constant_iterators::value,
252 __hash_cached::value>;
255 = __detail::_Node_const_iterator<_Value, __constant_iterators::value,
256 __hash_cached::value>;
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 = __conditional_t<__unique_keys::value,
283 using __map_base = __detail::_Map_base<_Key, _Value, _Alloc, _ExtractKey,
284 _Equal, _Hash, _RangeHash, _Unused,
285 _RehashPolicy, _Traits>;
287 using __rehash_base = __detail::_Rehash_base<_Key, _Value, _Alloc,
289 _Hash, _RangeHash, _Unused,
290 _RehashPolicy, _Traits>;
292 using __node_builder_t = __detail::_NodeBuilder<_ExtractKey>;
298 _Scoped_node(__node_ptr __n, __hashtable_alloc* __h)
299 : _M_h(__h), _M_node(__n) { }
302 template<
typename... _Args>
303 _Scoped_node(__hashtable_alloc* __h, _Args&&... __args)
305 _M_node(__h->_M_allocate_node(
std::
forward<_Args>(__args)...))
309 ~_Scoped_node() {
if (_M_node) _M_h->_M_deallocate_node(_M_node); };
311 _Scoped_node(
const _Scoped_node&) =
delete;
312 _Scoped_node& operator=(
const _Scoped_node&) =
delete;
314 __hashtable_alloc* _M_h;
322 struct __hash_code_base_access : __hash_code_base
323 {
using __hash_code_base::_M_bucket_index; };
326 static_assert(is_nothrow_default_constructible<_RangeHash>::value,
327 "Functor used to map hash code to bucket index"
328 " must be nothrow default constructible");
329 static_assert(
noexcept(
331 "Functor used to map hash code to bucket index must be"
335 static_assert(is_nothrow_default_constructible<_ExtractKey>::value,
336 "_ExtractKey must be nothrow default constructible");
337 static_assert(
noexcept(
339 "_ExtractKey functor must be noexcept invocable");
341 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
342 typename _ExtractKeya,
typename _Equala,
343 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
344 typename _RehashPolicya,
typename _Traitsa,
346 friend struct __detail::_Map_base;
349 using size_type =
typename __hashtable_base::size_type;
350 using difference_type =
typename __hashtable_base::difference_type;
352#if __cplusplus > 201402L
353 using node_type = _Node_handle<_Key, _Value, __node_alloc_type>;
354 using insert_return_type = _Node_insert_return<iterator, node_type>;
358 __buckets_ptr _M_buckets = &_M_single_bucket;
359 size_type _M_bucket_count = 1;
360 __node_base _M_before_begin;
361 size_type _M_element_count = 0;
362 _RehashPolicy _M_rehash_policy;
370 __node_base_ptr _M_single_bucket =
nullptr;
375 if (
auto __begin = _M_begin())
376 _M_buckets[_M_bucket_index(*__begin)] = &_M_before_begin;
380 _M_update_bbegin(__node_ptr __n)
382 _M_before_begin._M_nxt = __n;
387 _M_uses_single_bucket(__buckets_ptr __bkts)
const
388 {
return __builtin_expect(__bkts == &_M_single_bucket,
false); }
391 _M_uses_single_bucket()
const
392 {
return _M_uses_single_bucket(_M_buckets); }
394 static constexpr size_t
395 __small_size_threshold() noexcept
398 __detail::_Hashtable_hash_traits<_Hash>::__small_size_threshold();
402 _M_base_alloc() {
return *
this; }
405 _M_allocate_buckets(size_type __bkt_count)
407 if (__builtin_expect(__bkt_count == 1,
false))
409 _M_single_bucket =
nullptr;
410 return &_M_single_bucket;
413 return __hashtable_alloc::_M_allocate_buckets(__bkt_count);
417 _M_deallocate_buckets(__buckets_ptr __bkts, size_type __bkt_count)
419 if (_M_uses_single_bucket(__bkts))
422 __hashtable_alloc::_M_deallocate_buckets(__bkts, __bkt_count);
426 _M_deallocate_buckets()
427 { _M_deallocate_buckets(_M_buckets, _M_bucket_count); }
432 _M_bucket_begin(size_type __bkt)
const
434 __node_base_ptr __n = _M_buckets[__bkt];
435 return __n ?
static_cast<__node_ptr
>(__n->_M_nxt) : nullptr;
440 {
return static_cast<__node_ptr
>(_M_before_begin._M_nxt); }
444 template<
typename _Ht>
446 _M_assign_elements(_Ht&&);
448 template<
typename _Ht>
450 _M_assign(_Ht&& __ht)
452 __detail::_AllocNode<__node_alloc_type> __alloc_node_gen(*
this);
456 template<
typename _Ht,
typename _NodeGenerator>
458 _M_assign(_Ht&&, _NodeGenerator&);
461 _M_move_assign(_Hashtable&&, true_type);
464 _M_move_assign(_Hashtable&&, false_type);
469 _Hashtable(const _Hash& __h, const _Equal& __eq,
470 const allocator_type& __a)
471 : __hashtable_base(__h, __eq),
472 __hashtable_alloc(__node_alloc_type(__a)),
473 __enable_default_ctor(_Enable_default_constructor_tag{})
476 template<
bool _No_realloc = true>
477 static constexpr bool
480#if __cplusplus <= 201402L
481 return __and_<__bool_constant<_No_realloc>,
482 is_nothrow_copy_constructible<_Hash>,
483 is_nothrow_copy_constructible<_Equal>>::value;
485 if constexpr (_No_realloc)
486 if constexpr (is_nothrow_copy_constructible<_Hash>())
487 return is_nothrow_copy_constructible<_Equal>();
492 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
494 noexcept(_S_nothrow_move());
496 _Hashtable(_Hashtable&&, __node_alloc_type&&,
499 template<
typename _InputIterator>
500 _Hashtable(_InputIterator __first, _InputIterator __last,
501 size_type __bkt_count_hint,
502 const _Hash&,
const _Equal&,
const allocator_type&,
505 template<
typename _InputIterator>
506 _Hashtable(_InputIterator __first, _InputIterator __last,
507 size_type __bkt_count_hint,
508 const _Hash&,
const _Equal&,
const allocator_type&,
513 _Hashtable() =
default;
515 _Hashtable(
const _Hashtable&);
517 _Hashtable(
const _Hashtable&,
const allocator_type&);
520 _Hashtable(size_type __bkt_count_hint,
521 const _Hash& __hf = _Hash(),
522 const key_equal& __eql = key_equal(),
523 const allocator_type& __a = allocator_type());
526 _Hashtable(_Hashtable&& __ht)
527 noexcept(_S_nothrow_move())
528 : _Hashtable(
std::
move(__ht),
std::
move(__ht._M_node_allocator()),
532 _Hashtable(_Hashtable&& __ht,
const allocator_type& __a)
533 noexcept(_S_nothrow_move<__node_alloc_traits::_S_always_equal()>())
534 : _Hashtable(
std::
move(__ht), __node_alloc_type(__a),
535 typename __node_alloc_traits::is_always_equal{})
539 _Hashtable(
const allocator_type& __a)
540 : __hashtable_alloc(__node_alloc_type(__a)),
541 __enable_default_ctor(_Enable_default_constructor_tag{})
544 template<
typename _InputIterator>
545 _Hashtable(_InputIterator __f, _InputIterator __l,
546 size_type __bkt_count_hint = 0,
547 const _Hash& __hf = _Hash(),
548 const key_equal& __eql = key_equal(),
549 const allocator_type& __a = allocator_type())
550 : _Hashtable(__f, __l, __bkt_count_hint, __hf, __eql, __a,
554 _Hashtable(initializer_list<value_type> __l,
555 size_type __bkt_count_hint = 0,
556 const _Hash& __hf = _Hash(),
557 const key_equal& __eql = key_equal(),
558 const allocator_type& __a = allocator_type())
559 : _Hashtable(__l.
begin(), __l.
end(), __bkt_count_hint,
560 __hf, __eql, __a, __unique_keys{})
564 operator=(
const _Hashtable& __ht);
567 operator=(_Hashtable&& __ht)
568 noexcept(__node_alloc_traits::_S_nothrow_move()
569 && is_nothrow_move_assignable<_Hash>::value
570 && is_nothrow_move_assignable<_Equal>::value)
572 constexpr bool __move_storage =
573 __node_alloc_traits::_S_propagate_on_move_assign()
574 || __node_alloc_traits::_S_always_equal();
575 _M_move_assign(
std::move(__ht), __bool_constant<__move_storage>());
579#pragma GCC diagnostic push
580#pragma GCC diagnostic ignored "-Wc++17-extensions"
582 operator=(initializer_list<value_type> __l)
584 using __reuse_or_alloc_node_gen_t =
585 __detail::_ReuseOrAllocNode<__node_alloc_type>;
587 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
588 _M_before_begin._M_nxt =
nullptr;
592 auto __l_bkt_count = _M_rehash_policy._M_bkt_for_elements(__l.size());
596 if (_M_bucket_count < __l_bkt_count)
597 rehash(__l_bkt_count);
601 for (
auto& __e : __l)
603 const key_type& __k = _ExtractKey{}(__e);
605 if constexpr (__unique_keys::value)
607 if (
auto __loc = _M_locate(__k))
611 __code = __loc._M_hash_code;
612 __bkt = __loc._M_bucket_index;
617 __code = this->_M_hash_code(__k);
618 __bkt = _M_bucket_index(__code);
621 _M_insert_unique_node(__bkt, __code, __roan(__e));
626#pragma GCC diagnostic pop
628 ~_Hashtable() noexcept;
632 noexcept(__and_<__is_nothrow_swappable<_Hash>,
633 __is_nothrow_swappable<_Equal>>::value);
638 {
return iterator(_M_begin()); }
641 begin() const noexcept
642 {
return const_iterator(_M_begin()); }
646 {
return iterator(
nullptr); }
650 {
return const_iterator(
nullptr); }
654 {
return const_iterator(_M_begin()); }
657 cend() const noexcept
658 {
return const_iterator(
nullptr); }
661 size() const noexcept
662 {
return _M_element_count; }
664 _GLIBCXX_NODISCARD
bool
665 empty() const noexcept
666 {
return size() == 0; }
669 get_allocator() const noexcept
670 {
return allocator_type(this->_M_node_allocator()); }
673 max_size() const noexcept
674 {
return __node_alloc_traits::max_size(this->_M_node_allocator()); }
679 {
return this->_M_eq(); }
685 bucket_count() const noexcept
686 {
return _M_bucket_count; }
689 max_bucket_count() const noexcept
690 {
return max_size(); }
693 bucket_size(size_type __bkt)
const
697 bucket(
const key_type& __k)
const
698 {
return _M_bucket_index(this->_M_hash_code(__k)); }
701 begin(size_type __bkt)
703 return local_iterator(*
this, _M_bucket_begin(__bkt),
704 __bkt, _M_bucket_count);
709 {
return local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
712 begin(size_type __bkt)
const
714 return const_local_iterator(*
this, _M_bucket_begin(__bkt),
715 __bkt, _M_bucket_count);
719 end(size_type __bkt)
const
720 {
return const_local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
724 cbegin(size_type __bkt)
const
726 return const_local_iterator(*
this, _M_bucket_begin(__bkt),
727 __bkt, _M_bucket_count);
731 cend(size_type __bkt)
const
732 {
return const_local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
735 load_factor() const noexcept
737 return static_cast<float>(
size()) /
static_cast<float>(bucket_count());
746 __rehash_policy()
const
747 {
return _M_rehash_policy; }
750 __rehash_policy(
const _RehashPolicy& __pol)
751 { _M_rehash_policy = __pol; }
755 find(
const key_type& __k);
758 find(
const key_type& __k)
const;
761 count(
const key_type& __k)
const;
764 equal_range(
const key_type& __k);
767 equal_range(
const key_type& __k)
const;
769#ifdef __glibcxx_generic_unordered_lookup
770 template<
typename _Kt,
771 typename = __has_is_transparent_t<_Hash, _Kt>,
772 typename = __has_is_transparent_t<_Equal, _Kt>>
774 _M_find_tr(
const _Kt& __k);
776 template<
typename _Kt,
777 typename = __has_is_transparent_t<_Hash, _Kt>,
778 typename = __has_is_transparent_t<_Equal, _Kt>>
780 _M_find_tr(
const _Kt& __k)
const;
782 template<
typename _Kt,
783 typename = __has_is_transparent_t<_Hash, _Kt>,
784 typename = __has_is_transparent_t<_Equal, _Kt>>
786 _M_count_tr(
const _Kt& __k)
const;
788 template<
typename _Kt,
789 typename = __has_is_transparent_t<_Hash, _Kt>,
790 typename = __has_is_transparent_t<_Equal, _Kt>>
791 pair<iterator, iterator>
792 _M_equal_range_tr(
const _Kt& __k);
794 template<
typename _Kt,
795 typename = __has_is_transparent_t<_Hash, _Kt>,
796 typename = __has_is_transparent_t<_Equal, _Kt>>
797 pair<const_iterator, const_iterator>
798 _M_equal_range_tr(
const _Kt& __k)
const;
804 _M_bucket_index(
const __node_value_type& __n)
const noexcept
805 {
return __hash_code_base::_M_bucket_index(__n, _M_bucket_count); }
808 _M_bucket_index(__hash_code __c)
const
809 {
return __hash_code_base::_M_bucket_index(__c, _M_bucket_count); }
815 _M_find_before_node(size_type,
const key_type&, __hash_code)
const;
817 template<
typename _Kt>
819 _M_find_before_node_tr(size_type,
const _Kt&, __hash_code)
const;
823 struct __location_type
826 explicit operator bool() const noexcept
827 {
return static_cast<bool>(_M_before); }
830 explicit operator iterator() const noexcept
831 {
return iterator(_M_node()); }
834 explicit operator const_iterator() const noexcept
835 {
return const_iterator(_M_node()); }
838 __node_ptr _M_node()
const
841 return static_cast<__node_ptr
>(_M_before->_M_nxt);
845 __node_base_ptr _M_before{};
846 __hash_code _M_hash_code{};
847 size_type _M_bucket_index = size_type(-1);
865 _M_locate(
const key_type& __k)
const;
868 _M_find_node(size_type __bkt,
const key_type& __key,
869 __hash_code __c)
const
871 if (__node_base_ptr __before_n = _M_find_before_node(__bkt, __key, __c))
872 return static_cast<__node_ptr
>(__before_n->_M_nxt);
876 template<
typename _Kt>
878 _M_find_node_tr(size_type __bkt,
const _Kt& __key,
879 __hash_code __c)
const
881 if (
auto __before_n = _M_find_before_node_tr(__bkt, __key, __c))
882 return static_cast<__node_ptr
>(__before_n->_M_nxt);
888 _M_insert_bucket_begin(size_type __bkt, __node_ptr __node)
890 if (_M_buckets[__bkt])
894 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt;
895 _M_buckets[__bkt]->_M_nxt = __node;
902 __node->_M_nxt = _M_before_begin._M_nxt;
903 _M_before_begin._M_nxt = __node;
908 _M_buckets[_M_bucket_index(*__node->_M_next())] = __node;
910 _M_buckets[__bkt] = &_M_before_begin;
916 _M_remove_bucket_begin(size_type __bkt, __node_ptr __next_n,
917 size_type __next_bkt)
920 _M_buckets[__bkt] =
nullptr;
921 else if (__next_bkt != __bkt)
923 _M_buckets[__next_bkt] = _M_buckets[__bkt];
924 _M_buckets[__bkt] =
nullptr;
930 _M_get_previous_node(size_type __bkt, __node_ptr __n);
932 pair<__node_ptr, __hash_code>
933 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const;
942 _M_insert_unique_node(size_type __bkt, __hash_code,
943 __node_ptr __n, size_type __n_elt = 1);
948 _M_insert_multi_node(__node_ptr __hint,
949 __hash_code __code, __node_ptr __n);
951 template<
typename... _Args>
953 _M_emplace_uniq(_Args&&... __args);
955#pragma GCC diagnostic push
956#pragma GCC diagnostic ignored "-Wc++14-extensions"
957 template<
typename _Arg,
typename _DArg = __remove_cvref_t<_Arg>,
958 typename = _ExtractKey>
959 static constexpr bool __is_key_type =
false;
961 template<
typename _Arg>
962 static constexpr bool
963 __is_key_type<_Arg, key_type, __detail::_Identity> =
true;
965 template<
typename _Arg,
typename _Arg1,
typename _Arg2>
966 static constexpr bool
967 __is_key_type<_Arg, pair<_Arg1, _Arg2>, __detail::_Select1st>
968 = is_same<__remove_cvref_t<_Arg1>, key_type>::value;
969#pragma GCC diagnostic pop
971 template<
typename... _Args>
973 _M_emplace_multi(const_iterator, _Args&&... __args);
976 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n);
978 template<
typename _InputIterator>
980 _M_insert_range_multi(_InputIterator __first, _InputIterator __last);
983#pragma GCC diagnostic push
984#pragma GCC diagnostic ignored "-Wc++17-extensions"
986 template<
typename... _Args>
988 emplace(_Args&&... __args)
990 if constexpr (__unique_keys::value)
996 template<
typename... _Args>
998 emplace_hint(const_iterator __hint, _Args&&... __args)
1000 if constexpr (__unique_keys::value)
1008 insert(
const value_type& __v)
1010 if constexpr (__unique_keys::value)
1011 return _M_emplace_uniq(__v);
1013 return _M_emplace_multi(
cend(), __v);
1017 insert(const_iterator __hint,
const value_type& __v)
1019 if constexpr (__unique_keys::value)
1020 return _M_emplace_uniq(__v).first;
1022 return _M_emplace_multi(__hint, __v);
1026 insert(value_type&& __v)
1028 if constexpr (__unique_keys::value)
1035 insert(const_iterator __hint, value_type&& __v)
1037 if constexpr (__unique_keys::value)
1038 return _M_emplace_uniq(
std::move(__v)).first;
1040 return _M_emplace_multi(__hint,
std::move(__v));
1043#ifdef __glibcxx_unordered_map_try_emplace
1044 template<
typename _KType,
typename... _Args>
1046 try_emplace(const_iterator, _KType&& __k, _Args&&... __args)
1050 if (
auto __loc = _M_locate(__k))
1051 return { iterator(__loc),
false };
1054 __code = __loc._M_hash_code;
1055 __bkt = __loc._M_bucket_index;
1058 _Scoped_node __node {
1064 auto __it = _M_insert_unique_node(__bkt, __code, __node._M_node);
1065 __node._M_node =
nullptr;
1066 return { __it,
true };
1071 insert(initializer_list<value_type> __l)
1072 { this->insert(__l.begin(), __l.end()); }
1074 template<
typename _InputIterator>
1076 insert(_InputIterator __first, _InputIterator __last)
1078 if constexpr (__unique_keys::value)
1079 for (; __first != __last; ++__first)
1080 _M_emplace_uniq(*__first);
1082 return _M_insert_range_multi(__first, __last);
1086 template<
typename _Pair,
1087 typename = _Require<__not_<is_same<_Key, _Value>>,
1088 is_constructible<value_type, _Pair&&>>>
1092 if constexpr (__unique_keys::value)
1099 template<
typename _Pair,
1100 typename = _Require<__not_<is_same<_Key, _Value>>,
1101 is_constructible<value_type, _Pair&&>>>
1103 insert(const_iterator __hint, _Pair&& __v)
1105 if constexpr (__unique_keys::value)
1110#pragma GCC diagnostic pop
1114 erase(const_iterator);
1119 erase(iterator __it)
1120 {
return erase(const_iterator(__it)); }
1123 erase(
const key_type& __k);
1126 erase(const_iterator, const_iterator);
1133 void rehash(size_type __bkt_count);
1138#if __glibcxx_node_extract
1141 _M_reinsert_node(node_type&& __nh)
1143 insert_return_type __ret;
1145 __ret.position =
end();
1148 __glibcxx_assert(get_allocator() == __nh.get_allocator());
1150 if (
auto __loc = _M_locate(__nh._M_key()))
1153 __ret.position = iterator(__loc);
1154 __ret.inserted =
false;
1158 auto __code = __loc._M_hash_code;
1159 auto __bkt = __loc._M_bucket_index;
1161 = _M_insert_unique_node(__bkt, __code, __nh._M_ptr);
1162 __ret.inserted =
true;
1171 _M_reinsert_node_multi(const_iterator __hint, node_type&& __nh)
1176 __glibcxx_assert(get_allocator() == __nh.get_allocator());
1178 const key_type& __k = __nh._M_key();
1179 auto __code = this->_M_hash_code(__k);
1181 = _M_insert_multi_node(__hint._M_cur, __code, __nh._M_ptr);
1188 _M_extract_node(
size_t __bkt, __node_base_ptr __prev_n)
1190 __node_ptr __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
1191 if (__prev_n == _M_buckets[__bkt])
1192 _M_remove_bucket_begin(__bkt, __n->_M_next(),
1193 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
1194 else if (__n->_M_nxt)
1196 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
1197 if (__next_bkt != __bkt)
1198 _M_buckets[__next_bkt] = __prev_n;
1201 __prev_n->_M_nxt = __n->_M_nxt;
1202 __n->_M_nxt =
nullptr;
1204 return { __n, this->_M_node_allocator() };
1211 template<
typename _H2>
1213 _M_src_hash_code(
const _H2&,
const key_type& __k,
1214 const __node_value_type& __src_n)
const
1216 if constexpr (std::is_same_v<_H2, _Hash>)
1217 if constexpr (std::is_empty_v<_Hash>)
1219 return this->_M_hash_code(__src_n);
1221 return this->_M_hash_code(__k);
1227 extract(const_iterator __pos)
1229 size_t __bkt = _M_bucket_index(*__pos._M_cur);
1230 return _M_extract_node(__bkt,
1231 _M_get_previous_node(__bkt, __pos._M_cur));
1236 extract(
const _Key& __k)
1239 __hash_code __code = this->_M_hash_code(__k);
1240 std::size_t __bkt = _M_bucket_index(__code);
1241 if (__node_base_ptr __prev_node = _M_find_before_node(__bkt, __k, __code))
1242 __nh = _M_extract_node(__bkt, __prev_node);
1248 _M_merge_unique(_Hashtable& __src)
1250 __glibcxx_assert(get_allocator() == __src.get_allocator());
1252 using _PTr = pointer_traits<__node_base_ptr>;
1254 auto __n_elt = __src.size();
1255 size_type __first = 1;
1258 auto __prev = _PTr::pointer_to(__src._M_before_begin);
1261 const auto __next = __prev->_M_nxt;
1262 const auto& __node =
static_cast<__node_type&
>(*__next);
1263 const key_type& __k = _ExtractKey{}(__node._M_v());
1264 const auto __loc = _M_locate(__k);
1271 auto __src_bkt = __src._M_bucket_index(__node);
1272 auto __nh = __src._M_extract_node(__src_bkt, __prev);
1273 _M_insert_unique_node(__loc._M_bucket_index, __loc._M_hash_code,
1274 __nh._M_ptr, __first * __n_elt + 1);
1281 template<
typename _Compatible_Hashtable>
1283 _M_merge_unique(_Compatible_Hashtable& __src)
1285 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1286 node_type>,
"Node types are compatible");
1287 __glibcxx_assert(get_allocator() == __src.get_allocator());
1289 auto __n_elt = __src.size();
1290 size_type __first = 1;
1293 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1297 const key_type& __k = _ExtractKey{}(*__pos);
1298 const auto __loc = _M_locate(__k);
1302 auto __nh = __src.extract(__pos);
1303 _M_insert_unique_node(__loc._M_bucket_index,
1304 __loc._M_hash_code, __nh._M_ptr,
1305 __first * __n_elt + 1);
1313 _M_merge_multi(_Hashtable& __src)
1315 __glibcxx_assert(get_allocator() == __src.get_allocator());
1317 if (__src.size() == 0) [[__unlikely__]]
1320 using _PTr = pointer_traits<__node_base_ptr>;
1322 __node_ptr __hint =
nullptr;
1323 this->reserve(
size() + __src.size());
1326 auto __prev = _PTr::pointer_to(__src._M_before_begin);
1329 const auto& __node =
static_cast<__node_type&
>(*__prev->_M_nxt);
1330 const key_type& __k = _ExtractKey{}(__node._M_v());
1332 auto __code = _M_src_hash_code(__src.hash_function(), __k, __node);
1334 size_type __src_bkt = __src._M_bucket_index(__node);
1335 auto __nh = __src._M_extract_node(__src_bkt, __prev);
1336 __hint = _M_insert_multi_node(__hint, __code, __nh._M_ptr)._M_cur;
1339 while (__prev->_M_nxt !=
nullptr);
1343 template<
typename _Compatible_Hashtable>
1345 _M_merge_multi(_Compatible_Hashtable& __src)
1347 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1348 node_type>,
"Node types are compatible");
1349 __glibcxx_assert(get_allocator() == __src.get_allocator());
1351 __node_ptr __hint =
nullptr;
1352 this->reserve(
size() + __src.size());
1355 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1358 const key_type& __k = _ExtractKey{}(*__pos);
1360 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1361 auto __nh = __src.extract(__pos);
1362 __hint = _M_insert_multi_node(__hint, __code, __nh._M_ptr)._M_cur;
1369 _M_equal(
const _Hashtable& __other)
const;
1373 void _M_rehash(size_type __bkt_count, true_type __uks);
1376 void _M_rehash(size_type __bkt_count, false_type __uks);
1380 template<
typename _Key,
typename _Value,
typename _Alloc,
1381 typename _ExtractKey,
typename _Equal,
1382 typename _Hash,
typename _RangeHash,
typename _Unused,
1383 typename _RehashPolicy,
typename _Traits>
1384 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1385 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1386 _Hashtable(size_type __bkt_count_hint,
1387 const _Hash& __h,
const _Equal& __eq,
const allocator_type& __a)
1388 : _Hashtable(__h, __eq, __a)
1390 auto __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count_hint);
1391 if (__bkt_count > _M_bucket_count)
1393 _M_buckets = _M_allocate_buckets(__bkt_count);
1394 _M_bucket_count = __bkt_count;
1398 template<
typename _Key,
typename _Value,
typename _Alloc,
1399 typename _ExtractKey,
typename _Equal,
1400 typename _Hash,
typename _RangeHash,
typename _Unused,
1401 typename _RehashPolicy,
typename _Traits>
1402 template<
typename _InputIterator>
1404 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1405 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1406 _Hashtable(_InputIterator __f, _InputIterator __l,
1407 size_type __bkt_count_hint,
1408 const _Hash& __h,
const _Equal& __eq,
1409 const allocator_type& __a, true_type )
1410 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1411 { this->insert(__f, __l); }
1413 template<
typename _Key,
typename _Value,
typename _Alloc,
1414 typename _ExtractKey,
typename _Equal,
1415 typename _Hash,
typename _RangeHash,
typename _Unused,
1416 typename _RehashPolicy,
typename _Traits>
1417 template<
typename _InputIterator>
1418 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1419 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1420 _Hashtable(_InputIterator __f, _InputIterator __l,
1421 size_type __bkt_count_hint,
1422 const _Hash& __h,
const _Equal& __eq,
1423 const allocator_type& __a, false_type __uks)
1424 : _Hashtable(__h, __eq, __a)
1426 auto __nb_elems = __detail::__distance_fw(__f, __l);
1428 _M_rehash_policy._M_next_bkt(
1429 std::max(_M_rehash_policy._M_bkt_for_elements(__nb_elems),
1432 if (__bkt_count > _M_bucket_count)
1434 _M_buckets = _M_allocate_buckets(__bkt_count);
1435 _M_bucket_count = __bkt_count;
1438 for (; __f != __l; ++__f)
1439 _M_emplace_multi(
cend(), *__f);
1442 template<
typename _Key,
typename _Value,
typename _Alloc,
1443 typename _ExtractKey,
typename _Equal,
1444 typename _Hash,
typename _RangeHash,
typename _Unused,
1445 typename _RehashPolicy,
typename _Traits>
1447 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1448 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1449 operator=(
const _Hashtable& __ht)
1455 if (__node_alloc_traits::_S_propagate_on_copy_assign())
1457 auto& __this_alloc = this->_M_node_allocator();
1458 auto& __that_alloc = __ht._M_node_allocator();
1459 if (!__node_alloc_traits::_S_always_equal()
1460 && __this_alloc != __that_alloc)
1463 this->_M_deallocate_nodes(_M_begin());
1464 _M_before_begin._M_nxt =
nullptr;
1465 _M_deallocate_buckets();
1466 _M_buckets =
nullptr;
1467 std::__alloc_on_copy(__this_alloc, __that_alloc);
1468 __hashtable_base::operator=(__ht);
1469 _M_bucket_count = __ht._M_bucket_count;
1470 _M_element_count = __ht._M_element_count;
1471 _M_rehash_policy = __ht._M_rehash_policy;
1475 ~_Guard() {
if (_M_ht) _M_ht->_M_reset(); }
1480 _Guard __guard{
this};
1482 __guard._M_ht =
nullptr;
1485 std::__alloc_on_copy(__this_alloc, __that_alloc);
1489 _M_assign_elements(__ht);
1493 template<
typename _Key,
typename _Value,
typename _Alloc,
1494 typename _ExtractKey,
typename _Equal,
1495 typename _Hash,
typename _RangeHash,
typename _Unused,
1496 typename _RehashPolicy,
typename _Traits>
1497 template<
typename _Ht>
1499 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1500 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1501 _M_assign_elements(_Ht&& __ht)
1503 using __reuse_or_alloc_node_gen_t =
1504 __detail::_ReuseOrAllocNode<__node_alloc_type>;
1506 __buckets_ptr __former_buckets =
nullptr;
1507 std::size_t __former_bucket_count = _M_bucket_count;
1508 __rehash_guard_t __rehash_guard(_M_rehash_policy);
1510 if (_M_bucket_count != __ht._M_bucket_count)
1512 __former_buckets = _M_buckets;
1513 _M_buckets = _M_allocate_buckets(__ht._M_bucket_count);
1514 _M_bucket_count = __ht._M_bucket_count;
1517 std::fill_n(_M_buckets, _M_bucket_count,
nullptr);
1522 _M_element_count = __ht._M_element_count;
1523 _M_rehash_policy = __ht._M_rehash_policy;
1524 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
1525 _M_before_begin._M_nxt =
nullptr;
1527 if (__former_buckets)
1528 _M_deallocate_buckets(__former_buckets, __former_bucket_count);
1529 __rehash_guard._M_guarded_obj =
nullptr;
1533 if (__former_buckets)
1536 _M_deallocate_buckets();
1537 _M_buckets = __former_buckets;
1538 _M_bucket_count = __former_bucket_count;
1540 std::fill_n(_M_buckets, _M_bucket_count,
nullptr);
1541 __throw_exception_again;
1545 template<
typename _Key,
typename _Value,
typename _Alloc,
1546 typename _ExtractKey,
typename _Equal,
1547 typename _Hash,
typename _RangeHash,
typename _Unused,
1548 typename _RehashPolicy,
typename _Traits>
1549 template<
typename _Ht,
typename _NodeGenerator>
1551 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1552 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1553 _M_assign(_Ht&& __ht, _NodeGenerator& __node_gen)
1562 if (_M_dealloc_buckets)
1563 _M_ht->_M_deallocate_buckets();
1566 _Hashtable* _M_ht =
nullptr;
1567 bool _M_dealloc_buckets =
false;
1573 _M_buckets = _M_allocate_buckets(_M_bucket_count);
1574 __guard._M_dealloc_buckets =
true;
1577 if (!__ht._M_before_begin._M_nxt)
1580 __guard._M_ht =
this;
1582 using _FromVal = __conditional_t<is_lvalue_reference<_Ht>::value,
1583 const value_type&, value_type&&>;
1587 __node_ptr __ht_n = __ht._M_begin();
1589 = __node_gen(
static_cast<_FromVal
>(__ht_n->_M_v()));
1590 this->_M_copy_code(*__this_n, *__ht_n);
1591 _M_update_bbegin(__this_n);
1594 __node_ptr __prev_n = __this_n;
1595 for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next())
1597 __this_n = __node_gen(
static_cast<_FromVal
>(__ht_n->_M_v()));
1598 __prev_n->_M_nxt = __this_n;
1599 this->_M_copy_code(*__this_n, *__ht_n);
1600 size_type __bkt = _M_bucket_index(*__this_n);
1601 if (!_M_buckets[__bkt])
1602 _M_buckets[__bkt] = __prev_n;
1603 __prev_n = __this_n;
1605 __guard._M_ht =
nullptr;
1608 template<
typename _Key,
typename _Value,
typename _Alloc,
1609 typename _ExtractKey,
typename _Equal,
1610 typename _Hash,
typename _RangeHash,
typename _Unused,
1611 typename _RehashPolicy,
typename _Traits>
1613 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1614 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1617 _M_rehash_policy._M_reset();
1618 _M_bucket_count = 1;
1619 _M_single_bucket =
nullptr;
1620 _M_buckets = &_M_single_bucket;
1621 _M_before_begin._M_nxt =
nullptr;
1622 _M_element_count = 0;
1625 template<
typename _Key,
typename _Value,
typename _Alloc,
1626 typename _ExtractKey,
typename _Equal,
1627 typename _Hash,
typename _RangeHash,
typename _Unused,
1628 typename _RehashPolicy,
typename _Traits>
1630 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1631 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1632 _M_move_assign(_Hashtable&& __ht, true_type)
1637 this->_M_deallocate_nodes(_M_begin());
1638 _M_deallocate_buckets();
1639 __hashtable_base::operator=(
std::move(__ht));
1640 _M_rehash_policy = __ht._M_rehash_policy;
1641 if (!__ht._M_uses_single_bucket())
1642 _M_buckets = __ht._M_buckets;
1645 _M_buckets = &_M_single_bucket;
1646 _M_single_bucket = __ht._M_single_bucket;
1649 _M_bucket_count = __ht._M_bucket_count;
1650 _M_before_begin._M_nxt = __ht._M_before_begin._M_nxt;
1651 _M_element_count = __ht._M_element_count;
1652 std::__alloc_on_move(this->_M_node_allocator(), __ht._M_node_allocator());
1659 template<
typename _Key,
typename _Value,
typename _Alloc,
1660 typename _ExtractKey,
typename _Equal,
1661 typename _Hash,
typename _RangeHash,
typename _Unused,
1662 typename _RehashPolicy,
typename _Traits>
1664 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1665 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1666 _M_move_assign(_Hashtable&& __ht, false_type)
1668 if (__ht._M_node_allocator() == this->_M_node_allocator())
1669 _M_move_assign(
std::move(__ht), true_type{});
1678 template<
typename _Key,
typename _Value,
typename _Alloc,
1679 typename _ExtractKey,
typename _Equal,
1680 typename _Hash,
typename _RangeHash,
typename _Unused,
1681 typename _RehashPolicy,
typename _Traits>
1683 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1684 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1685 _Hashtable(
const _Hashtable& __ht)
1686 : __hashtable_base(__ht),
1688 __rehash_base(__ht),
1690 __node_alloc_traits::_S_select_on_copy(__ht._M_node_allocator())),
1691 __enable_default_ctor(__ht),
1692 _M_buckets(nullptr),
1693 _M_bucket_count(__ht._M_bucket_count),
1694 _M_element_count(__ht._M_element_count),
1695 _M_rehash_policy(__ht._M_rehash_policy)
1700 template<
typename _Key,
typename _Value,
typename _Alloc,
1701 typename _ExtractKey,
typename _Equal,
1702 typename _Hash,
typename _RangeHash,
typename _Unused,
1703 typename _RehashPolicy,
typename _Traits>
1704 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1705 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1706 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1708 noexcept(_S_nothrow_move())
1709 : __hashtable_base(__ht),
1711 __rehash_base(__ht),
1712 __hashtable_alloc(
std::
move(__a)),
1713 __enable_default_ctor(__ht),
1714 _M_buckets(__ht._M_buckets),
1715 _M_bucket_count(__ht._M_bucket_count),
1716 _M_before_begin(__ht._M_before_begin._M_nxt),
1717 _M_element_count(__ht._M_element_count),
1718 _M_rehash_policy(__ht._M_rehash_policy)
1721 if (__ht._M_uses_single_bucket())
1723 _M_buckets = &_M_single_bucket;
1724 _M_single_bucket = __ht._M_single_bucket;
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 _Hashtable(
const _Hashtable& __ht,
const allocator_type& __a)
1741 : __hashtable_base(__ht),
1743 __rehash_base(__ht),
1744 __hashtable_alloc(__node_alloc_type(__a)),
1745 __enable_default_ctor(__ht),
1747 _M_bucket_count(__ht._M_bucket_count),
1748 _M_element_count(__ht._M_element_count),
1749 _M_rehash_policy(__ht._M_rehash_policy)
1754 template<
typename _Key,
typename _Value,
typename _Alloc,
1755 typename _ExtractKey,
typename _Equal,
1756 typename _Hash,
typename _RangeHash,
typename _Unused,
1757 typename _RehashPolicy,
typename _Traits>
1758 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1759 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1760 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1762 : __hashtable_base(__ht),
1764 __rehash_base(__ht),
1765 __hashtable_alloc(
std::
move(__a)),
1766 __enable_default_ctor(__ht),
1767 _M_buckets(nullptr),
1768 _M_bucket_count(__ht._M_bucket_count),
1769 _M_element_count(__ht._M_element_count),
1770 _M_rehash_policy(__ht._M_rehash_policy)
1772 if (__ht._M_node_allocator() == this->_M_node_allocator())
1774 if (__ht._M_uses_single_bucket())
1776 _M_buckets = &_M_single_bucket;
1777 _M_single_bucket = __ht._M_single_bucket;
1780 _M_buckets = __ht._M_buckets;
1784 _M_update_bbegin(__ht._M_begin());
1790 using _Fwd_Ht = __conditional_t<
1791 __move_if_noexcept_cond<value_type>::value,
1792 const _Hashtable&, _Hashtable&&>;
1798 template<
typename _Key,
typename _Value,
typename _Alloc,
1799 typename _ExtractKey,
typename _Equal,
1800 typename _Hash,
typename _RangeHash,
typename _Unused,
1801 typename _RehashPolicy,
typename _Traits>
1802 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1803 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1804 ~_Hashtable() noexcept
1811 static_assert(
noexcept(declval<const __hash_code_base_access&>()
1812 ._M_bucket_index(declval<const __node_value_type&>(),
1814 "Cache the hash code or qualify your functors involved"
1815 " in hash code and bucket index computation with noexcept");
1817 this->_M_deallocate_nodes(_M_begin());
1818 _M_deallocate_buckets();
1821 template<
typename _Key,
typename _Value,
typename _Alloc,
1822 typename _ExtractKey,
typename _Equal,
1823 typename _Hash,
typename _RangeHash,
typename _Unused,
1824 typename _RehashPolicy,
typename _Traits>
1826 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1827 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1828 swap(_Hashtable& __x)
1829 noexcept(__and_<__is_nothrow_swappable<_Hash>,
1830 __is_nothrow_swappable<_Equal>>::value)
1837 std::__alloc_on_swap(this->_M_node_allocator(), __x._M_node_allocator());
1838 std::swap(_M_rehash_policy, __x._M_rehash_policy);
1841 if (this->_M_uses_single_bucket())
1843 if (!__x._M_uses_single_bucket())
1845 _M_buckets = __x._M_buckets;
1846 __x._M_buckets = &__x._M_single_bucket;
1849 else if (__x._M_uses_single_bucket())
1851 __x._M_buckets = _M_buckets;
1852 _M_buckets = &_M_single_bucket;
1855 std::swap(_M_buckets, __x._M_buckets);
1857 std::swap(_M_bucket_count, __x._M_bucket_count);
1858 std::swap(_M_before_begin._M_nxt, __x._M_before_begin._M_nxt);
1859 std::swap(_M_element_count, __x._M_element_count);
1860 std::swap(_M_single_bucket, __x._M_single_bucket);
1865 __x._M_update_bbegin();
1868 template<
typename _Key,
typename _Value,
typename _Alloc,
1869 typename _ExtractKey,
typename _Equal,
1870 typename _Hash,
typename _RangeHash,
typename _Unused,
1871 typename _RehashPolicy,
typename _Traits>
1873 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1874 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1875 find(
const key_type& __k)
1877 {
return iterator(_M_locate(__k)); }
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 find(
const key_type& __k)
const
1888 {
return const_iterator(_M_locate(__k)); }
1890#if __cplusplus > 201703L
1891 template<
typename _Key,
typename _Value,
typename _Alloc,
1892 typename _ExtractKey,
typename _Equal,
1893 typename _Hash,
typename _RangeHash,
typename _Unused,
1894 typename _RehashPolicy,
typename _Traits>
1895 template<
typename _Kt,
typename,
typename>
1897 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1898 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1899 _M_find_tr(
const _Kt& __k)
1902 if (
size() <= __small_size_threshold())
1904 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1905 if (this->_M_key_equals_tr(__k, *__n))
1906 return iterator(__n);
1910 __hash_code __code = this->_M_hash_code_tr(__k);
1911 std::size_t __bkt = _M_bucket_index(__code);
1912 return iterator(_M_find_node_tr(__bkt, __k, __code));
1915 template<
typename _Key,
typename _Value,
typename _Alloc,
1916 typename _ExtractKey,
typename _Equal,
1917 typename _Hash,
typename _RangeHash,
typename _Unused,
1918 typename _RehashPolicy,
typename _Traits>
1919 template<
typename _Kt,
typename,
typename>
1921 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1922 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1923 _M_find_tr(
const _Kt& __k)
const
1926 if (
size() <= __small_size_threshold())
1928 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1929 if (this->_M_key_equals_tr(__k, *__n))
1930 return const_iterator(__n);
1934 __hash_code __code = this->_M_hash_code_tr(__k);
1935 std::size_t __bkt = _M_bucket_index(__code);
1936 return const_iterator(_M_find_node_tr(__bkt, __k, __code));
1940 template<
typename _Key,
typename _Value,
typename _Alloc,
1941 typename _ExtractKey,
typename _Equal,
1942 typename _Hash,
typename _RangeHash,
typename _Unused,
1943 typename _RehashPolicy,
typename _Traits>
1945 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1946 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1947 count(
const key_type& __k)
const
1950 auto __it = find(__k);
1954 if (__unique_keys::value)
1957 size_type __result = 1;
1958 for (
auto __ref = __it++;
1959 __it._M_cur && this->_M_node_equals(*__ref._M_cur, *__it._M_cur);
1966#if __cplusplus > 201703L
1967 template<
typename _Key,
typename _Value,
typename _Alloc,
1968 typename _ExtractKey,
typename _Equal,
1969 typename _Hash,
typename _RangeHash,
typename _Unused,
1970 typename _RehashPolicy,
typename _Traits>
1971 template<
typename _Kt,
typename,
typename>
1973 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1974 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1975 _M_count_tr(
const _Kt& __k)
const
1978 if (
size() <= __small_size_threshold())
1980 size_type __result = 0;
1981 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1983 if (this->_M_key_equals_tr(__k, *__n))
1996 __hash_code __code = this->_M_hash_code_tr(__k);
1997 std::size_t __bkt = _M_bucket_index(__code);
1998 auto __n = _M_find_node_tr(__bkt, __k, __code);
2003 size_type __result = 1;
2005 __it._M_cur && this->_M_equals_tr(__k, __code, *__it._M_cur);
2013 template<
typename _Key,
typename _Value,
typename _Alloc,
2014 typename _ExtractKey,
typename _Equal,
2015 typename _Hash,
typename _RangeHash,
typename _Unused,
2016 typename _RehashPolicy,
typename _Traits>
2018 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2019 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2020 equal_range(
const key_type& __k)
2021 -> pair<iterator, iterator>
2023 auto __ite = find(__k);
2025 return { __ite, __ite };
2027 auto __beg = __ite++;
2028 if (__unique_keys::value)
2029 return { __beg, __ite };
2031 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
2034 return { __beg, __ite };
2037 template<
typename _Key,
typename _Value,
typename _Alloc,
2038 typename _ExtractKey,
typename _Equal,
2039 typename _Hash,
typename _RangeHash,
typename _Unused,
2040 typename _RehashPolicy,
typename _Traits>
2042 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2043 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2044 equal_range(
const key_type& __k)
const
2045 -> pair<const_iterator, const_iterator>
2047 auto __ite = find(__k);
2049 return { __ite, __ite };
2051 auto __beg = __ite++;
2052 if (__unique_keys::value)
2053 return { __beg, __ite };
2055 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
2058 return { __beg, __ite };
2061#if __cplusplus > 201703L
2062 template<
typename _Key,
typename _Value,
typename _Alloc,
2063 typename _ExtractKey,
typename _Equal,
2064 typename _Hash,
typename _RangeHash,
typename _Unused,
2065 typename _RehashPolicy,
typename _Traits>
2066 template<
typename _Kt,
typename,
typename>
2068 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2069 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2070 _M_equal_range_tr(
const _Kt& __k)
2071 -> pair<iterator, iterator>
2073 if (
size() <= __small_size_threshold())
2075 __node_ptr __n, __beg =
nullptr;
2076 for (__n = _M_begin(); __n; __n = __n->_M_next())
2078 if (this->_M_key_equals_tr(__k, *__n))
2089 return { iterator(__beg), iterator(__n) };
2092 __hash_code __code = this->_M_hash_code_tr(__k);
2093 std::size_t __bkt = _M_bucket_index(__code);
2094 auto __n = _M_find_node_tr(__bkt, __k, __code);
2095 iterator __ite(__n);
2097 return { __ite, __ite };
2099 auto __beg = __ite++;
2100 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
2103 return { __beg, __ite };
2106 template<
typename _Key,
typename _Value,
typename _Alloc,
2107 typename _ExtractKey,
typename _Equal,
2108 typename _Hash,
typename _RangeHash,
typename _Unused,
2109 typename _RehashPolicy,
typename _Traits>
2110 template<
typename _Kt,
typename,
typename>
2112 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2113 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2114 _M_equal_range_tr(
const _Kt& __k)
const
2115 -> pair<const_iterator, const_iterator>
2117 if (
size() <= __small_size_threshold())
2119 __node_ptr __n, __beg =
nullptr;
2120 for (__n = _M_begin(); __n; __n = __n->_M_next())
2122 if (this->_M_key_equals_tr(__k, *__n))
2133 return { const_iterator(__beg), const_iterator(__n) };
2136 __hash_code __code = this->_M_hash_code_tr(__k);
2137 std::size_t __bkt = _M_bucket_index(__code);
2138 auto __n = _M_find_node_tr(__bkt, __k, __code);
2139 const_iterator __ite(__n);
2141 return { __ite, __ite };
2143 auto __beg = __ite++;
2144 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
2147 return { __beg, __ite };
2153 template<
typename _Key,
typename _Value,
typename _Alloc,
2154 typename _ExtractKey,
typename _Equal,
2155 typename _Hash,
typename _RangeHash,
typename _Unused,
2156 typename _RehashPolicy,
typename _Traits>
2158 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2159 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2160 _M_find_before_node(size_type __bkt,
const key_type& __k,
2161 __hash_code __code)
const
2164 __node_base_ptr __prev_p = _M_buckets[__bkt];
2168 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2169 __p = __p->_M_next())
2171 if (this->_M_equals(__k, __code, *__p))
2174 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
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>
2186 template<
typename _Kt>
2188 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2189 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2190 _M_find_before_node_tr(size_type __bkt,
const _Kt& __k,
2191 __hash_code __code)
const
2194 __node_base_ptr __prev_p = _M_buckets[__bkt];
2198 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2199 __p = __p->_M_next())
2201 if (this->_M_equals_tr(__k, __code, *__p))
2204 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2212 template<
typename _Key,
typename _Value,
typename _Alloc,
2213 typename _ExtractKey,
typename _Equal,
2214 typename _Hash,
typename _RangeHash,
typename _Unused,
2215 typename _RehashPolicy,
typename _Traits>
2217 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2218 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2219 _M_locate(
const key_type& __k)
const
2222 __location_type __loc;
2223 const auto __size =
size();
2225 if (__size <= __small_size_threshold())
2227 __loc._M_before = pointer_traits<__node_base_ptr>::
2228 pointer_to(
const_cast<__node_base&
>(_M_before_begin));
2229 while (__loc._M_before->_M_nxt)
2231 if (this->_M_key_equals(__k, *__loc._M_node()))
2233 __loc._M_before = __loc._M_before->_M_nxt;
2235 __loc._M_before =
nullptr;
2238 __loc._M_hash_code = this->_M_hash_code(__k);
2239 __loc._M_bucket_index = _M_bucket_index(__loc._M_hash_code);
2241 if (__size > __small_size_threshold())
2242 __loc._M_before = _M_find_before_node(__loc._M_bucket_index, __k,
2243 __loc._M_hash_code);
2248 template<
typename _Key,
typename _Value,
typename _Alloc,
2249 typename _ExtractKey,
typename _Equal,
2250 typename _Hash,
typename _RangeHash,
typename _Unused,
2251 typename _RehashPolicy,
typename _Traits>
2253 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2254 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2255 _M_get_previous_node(size_type __bkt, __node_ptr __n)
2258 __node_base_ptr __prev_n = _M_buckets[__bkt];
2259 while (__prev_n->_M_nxt != __n)
2260 __prev_n = __prev_n->_M_nxt;
2264#pragma GCC diagnostic push
2265#pragma GCC diagnostic ignored "-Wc++17-extensions"
2266 template<
typename _Key,
typename _Value,
typename _Alloc,
2267 typename _ExtractKey,
typename _Equal,
2268 typename _Hash,
typename _RangeHash,
typename _Unused,
2269 typename _RehashPolicy,
typename _Traits>
2270 template<
typename... _Args>
2272 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2273 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2274 _M_emplace_uniq(_Args&&... __args)
2275 -> pair<iterator, bool>
2277 const key_type* __kp =
nullptr;
2279 if constexpr (
sizeof...(_Args) == 1)
2281 if constexpr (__is_key_type<_Args...>)
2283 const auto& __key = _ExtractKey{}(__args...);
2287 else if constexpr (
sizeof...(_Args) == 2)
2289 if constexpr (__is_key_type<
pair<
const _Args&...>>)
2291 pair<
const _Args&...> __refs(__args...);
2292 const auto& __key = _ExtractKey{}(__refs);
2297 _Scoped_node __node { __node_ptr(),
this };
2298 __hash_code __code = 0;
2299 size_type __bkt = 0;
2301 if (__kp ==
nullptr)
2306 const key_type& __key = _ExtractKey{}(__node._M_node->_M_v());
2310 if (
auto __loc = _M_locate(*__kp))
2312 return { iterator(__loc),
false };
2315 __code = __loc._M_hash_code;
2316 __bkt = __loc._M_bucket_index;
2319 if (!__node._M_node)
2324 auto __pos = _M_insert_unique_node(__bkt, __code, __node._M_node);
2325 __node._M_node =
nullptr;
2326 return { __pos,
true };
2328#pragma GCC diagnostic pop
2330 template<
typename _Key,
typename _Value,
typename _Alloc,
2331 typename _ExtractKey,
typename _Equal,
2332 typename _Hash,
typename _RangeHash,
typename _Unused,
2333 typename _RehashPolicy,
typename _Traits>
2334 template<
typename... _Args>
2336 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2337 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2338 _M_emplace_multi(const_iterator __hint, _Args&&... __args)
2343 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v());
2345 auto __res = this->_M_compute_hash_code(__hint._M_cur, __k);
2347 = _M_insert_multi_node(__res.first, __res.second, __node._M_node);
2348 __node._M_node =
nullptr;
2352 template<
typename _Key,
typename _Value,
typename _Alloc,
2353 typename _ExtractKey,
typename _Equal,
2354 typename _Hash,
typename _RangeHash,
typename _Unused,
2355 typename _RehashPolicy,
typename _Traits>
2356 template<
typename _InputIterator>
2358 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2359 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2360 _M_insert_range_multi(_InputIterator __first, _InputIterator __last)
2364 size_type __n_elt = __detail::__distance_fw(__first, __last);
2368 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2369 __pair_type __do_rehash
2370 = _M_rehash_policy._M_need_rehash(_M_bucket_count,
2374 if (__do_rehash.first)
2375 _M_rehash(__do_rehash.second, false_type{});
2377 __rehash_guard._M_guarded_obj =
nullptr;
2378 for (; __first != __last; ++__first)
2379 _M_emplace_multi(
cend(), *__first);
2382 template<
typename _Key,
typename _Value,
typename _Alloc,
2383 typename _ExtractKey,
typename _Equal,
2384 typename _Hash,
typename _RangeHash,
typename _Unused,
2385 typename _RehashPolicy,
typename _Traits>
2387 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2388 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2389 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const
2390 -> pair<__node_ptr, __hash_code>
2392 if (
size() <= __small_size_threshold())
2396 for (
auto __it = __hint; __it; __it = __it->_M_next())
2397 if (this->_M_key_equals(__k, *__it))
2398 return { __it, this->_M_hash_code(*__it) };
2401 for (
auto __it = _M_begin(); __it != __hint; __it = __it->_M_next())
2402 if (this->_M_key_equals(__k, *__it))
2403 return { __it, this->_M_hash_code(*__it) };
2408 return { __hint, this->_M_hash_code(__k) };
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_insert_unique_node(size_type __bkt, __hash_code __code,
2419 __node_ptr __node, size_type __n_elt)
2422 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2424 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count,
2427 if (__do_rehash.
first)
2429 _M_rehash(__do_rehash.
second, true_type{});
2430 __bkt = _M_bucket_index(__code);
2433 __rehash_guard._M_guarded_obj =
nullptr;
2434 this->_M_store_code(*__node, __code);
2437 _M_insert_bucket_begin(__bkt, __node);
2439 return iterator(__node);
2442 template<
typename _Key,
typename _Value,
typename _Alloc,
2443 typename _ExtractKey,
typename _Equal,
2444 typename _Hash,
typename _RangeHash,
typename _Unused,
2445 typename _RehashPolicy,
typename _Traits>
2447 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2448 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2449 _M_insert_multi_node(__node_ptr __hint,
2450 __hash_code __code, __node_ptr __node)
2453 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2455 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1);
2457 if (__do_rehash.
first)
2458 _M_rehash(__do_rehash.
second, false_type{});
2460 __rehash_guard._M_guarded_obj =
nullptr;
2461 this->_M_store_code(*__node, __code);
2462 const key_type& __k = _ExtractKey{}(__node->_M_v());
2463 size_type __bkt = _M_bucket_index(__code);
2467 __node_base_ptr __prev
2468 = __builtin_expect(__hint !=
nullptr,
false)
2469 && this->_M_equals(__k, __code, *__hint)
2471 : _M_find_before_node(__bkt, __k, __code);
2476 __node->_M_nxt = __prev->_M_nxt;
2477 __prev->_M_nxt = __node;
2478 if (__builtin_expect(__prev == __hint,
false))
2482 && !this->_M_equals(__k, __code, *__node->_M_next()))
2484 size_type __next_bkt = _M_bucket_index(*__node->_M_next());
2485 if (__next_bkt != __bkt)
2486 _M_buckets[__next_bkt] = __node;
2493 _M_insert_bucket_begin(__bkt, __node);
2495 return iterator(__node);
2498 template<
typename _Key,
typename _Value,
typename _Alloc,
2499 typename _ExtractKey,
typename _Equal,
2500 typename _Hash,
typename _RangeHash,
typename _Unused,
2501 typename _RehashPolicy,
typename _Traits>
2503 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2504 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2505 erase(const_iterator __it)
2508 __node_ptr __n = __it._M_cur;
2509 std::size_t __bkt = _M_bucket_index(*__n);
2514 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2515 return _M_erase(__bkt, __prev_n, __n);
2518 template<
typename _Key,
typename _Value,
typename _Alloc,
2519 typename _ExtractKey,
typename _Equal,
2520 typename _Hash,
typename _RangeHash,
typename _Unused,
2521 typename _RehashPolicy,
typename _Traits>
2523 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2524 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2525 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n)
2528 if (__prev_n == _M_buckets[__bkt])
2529 _M_remove_bucket_begin(__bkt, __n->_M_next(),
2530 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
2531 else if (__n->_M_nxt)
2533 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
2534 if (__next_bkt != __bkt)
2535 _M_buckets[__next_bkt] = __prev_n;
2538 __prev_n->_M_nxt = __n->_M_nxt;
2539 iterator __result(__n->_M_next());
2540 this->_M_deallocate_node(__n);
2546#pragma GCC diagnostic push
2547#pragma GCC diagnostic ignored "-Wc++17-extensions"
2548 template<
typename _Key,
typename _Value,
typename _Alloc,
2549 typename _ExtractKey,
typename _Equal,
2550 typename _Hash,
typename _RangeHash,
typename _Unused,
2551 typename _RehashPolicy,
typename _Traits>
2553 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2554 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2555 erase(
const key_type& __k)
2558 auto __loc = _M_locate(__k);
2562 __node_base_ptr __prev_n = __loc._M_before;
2563 __node_ptr __n = __loc._M_node();
2564 auto __bkt = __loc._M_bucket_index;
2565 if (__bkt == size_type(-1))
2566 __bkt = _M_bucket_index(*__n);
2568 if constexpr (__unique_keys::value)
2570 _M_erase(__bkt, __prev_n, __n);
2581 __node_ptr __n_last = __n->_M_next();
2582 while (__n_last && this->_M_node_equals(*__n, *__n_last))
2583 __n_last = __n_last->_M_next();
2585 std::size_t __n_last_bkt
2586 = __n_last ? _M_bucket_index(*__n_last) : __bkt;
2589 size_type __result = 0;
2592 __node_ptr __p = __n->_M_next();
2593 this->_M_deallocate_node(__n);
2597 while (__n != __n_last);
2599 _M_element_count -= __result;
2600 if (__prev_n == _M_buckets[__bkt])
2601 _M_remove_bucket_begin(__bkt, __n_last, __n_last_bkt);
2602 else if (__n_last_bkt != __bkt)
2603 _M_buckets[__n_last_bkt] = __prev_n;
2604 __prev_n->_M_nxt = __n_last;
2608#pragma GCC diagnostic pop
2610 template<
typename _Key,
typename _Value,
typename _Alloc,
2611 typename _ExtractKey,
typename _Equal,
2612 typename _Hash,
typename _RangeHash,
typename _Unused,
2613 typename _RehashPolicy,
typename _Traits>
2615 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2616 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2617 erase(const_iterator __first, const_iterator __last)
2620 __node_ptr __n = __first._M_cur;
2621 __node_ptr __last_n = __last._M_cur;
2622 if (__n == __last_n)
2623 return iterator(__n);
2625 std::size_t __bkt = _M_bucket_index(*__n);
2627 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2628 bool __is_bucket_begin = __n == _M_bucket_begin(__bkt);
2629 std::size_t __n_bkt = __bkt;
2634 __node_ptr __tmp = __n;
2635 __n = __n->_M_next();
2636 this->_M_deallocate_node(__tmp);
2640 __n_bkt = _M_bucket_index(*__n);
2642 while (__n != __last_n && __n_bkt == __bkt);
2643 if (__is_bucket_begin)
2644 _M_remove_bucket_begin(__bkt, __n, __n_bkt);
2645 if (__n == __last_n)
2647 __is_bucket_begin =
true;
2651 if (__n && (__n_bkt != __bkt || __is_bucket_begin))
2652 _M_buckets[__n_bkt] = __prev_n;
2653 __prev_n->_M_nxt = __n;
2654 return iterator(__n);
2657 template<
typename _Key,
typename _Value,
typename _Alloc,
2658 typename _ExtractKey,
typename _Equal,
2659 typename _Hash,
typename _RangeHash,
typename _Unused,
2660 typename _RehashPolicy,
typename _Traits>
2662 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2663 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2666 this->_M_deallocate_nodes(_M_begin());
2667 std::fill_n(_M_buckets, _M_bucket_count,
nullptr);
2668 _M_element_count = 0;
2669 _M_before_begin._M_nxt =
nullptr;
2672 template<
typename _Key,
typename _Value,
typename _Alloc,
2673 typename _ExtractKey,
typename _Equal,
2674 typename _Hash,
typename _RangeHash,
typename _Unused,
2675 typename _RehashPolicy,
typename _Traits>
2677 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2678 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2679 rehash(size_type __bkt_count)
2681 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2683 =
std::max(_M_rehash_policy._M_bkt_for_elements(_M_element_count + 1),
2685 __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count);
2687 if (__bkt_count != _M_bucket_count)
2689 _M_rehash(__bkt_count, __unique_keys{});
2690 __rehash_guard._M_guarded_obj =
nullptr;
2695 template<
typename _Key,
typename _Value,
typename _Alloc,
2696 typename _ExtractKey,
typename _Equal,
2697 typename _Hash,
typename _RangeHash,
typename _Unused,
2698 typename _RehashPolicy,
typename _Traits>
2700 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2701 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2702 _M_rehash(size_type __bkt_count, true_type )
2704 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2705 __node_ptr __p = _M_begin();
2706 _M_before_begin._M_nxt =
nullptr;
2707 std::size_t __bbegin_bkt = 0;
2710 __node_ptr __next = __p->_M_next();
2712 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2713 if (!__new_buckets[__bkt])
2715 __p->_M_nxt = _M_before_begin._M_nxt;
2716 _M_before_begin._M_nxt = __p;
2717 __new_buckets[__bkt] = &_M_before_begin;
2719 __new_buckets[__bbegin_bkt] = __p;
2720 __bbegin_bkt = __bkt;
2724 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2725 __new_buckets[__bkt]->_M_nxt = __p;
2731 _M_deallocate_buckets();
2732 _M_bucket_count = __bkt_count;
2733 _M_buckets = __new_buckets;
2738 template<
typename _Key,
typename _Value,
typename _Alloc,
2739 typename _ExtractKey,
typename _Equal,
2740 typename _Hash,
typename _RangeHash,
typename _Unused,
2741 typename _RehashPolicy,
typename _Traits>
2743 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2744 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2745 _M_rehash(size_type __bkt_count, false_type )
2747 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2748 __node_ptr __p = _M_begin();
2749 _M_before_begin._M_nxt =
nullptr;
2750 std::size_t __bbegin_bkt = 0;
2751 std::size_t __prev_bkt = 0;
2752 __node_ptr __prev_p =
nullptr;
2753 bool __check_bucket =
false;
2757 __node_ptr __next = __p->_M_next();
2759 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2761 if (__prev_p && __prev_bkt == __bkt)
2766 __p->_M_nxt = __prev_p->_M_nxt;
2767 __prev_p->_M_nxt = __p;
2774 __check_bucket =
true;
2782 if (__prev_p->_M_nxt)
2784 std::size_t __next_bkt
2785 = __hash_code_base::_M_bucket_index(
2786 *__prev_p->_M_next(), __bkt_count);
2787 if (__next_bkt != __prev_bkt)
2788 __new_buckets[__next_bkt] = __prev_p;
2790 __check_bucket =
false;
2793 if (!__new_buckets[__bkt])
2795 __p->_M_nxt = _M_before_begin._M_nxt;
2796 _M_before_begin._M_nxt = __p;
2797 __new_buckets[__bkt] = &_M_before_begin;
2799 __new_buckets[__bbegin_bkt] = __p;
2800 __bbegin_bkt = __bkt;
2804 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2805 __new_buckets[__bkt]->_M_nxt = __p;
2813 if (__check_bucket && __prev_p->_M_nxt)
2815 std::size_t __next_bkt
2816 = __hash_code_base::_M_bucket_index(*__prev_p->_M_next(),
2818 if (__next_bkt != __prev_bkt)
2819 __new_buckets[__next_bkt] = __prev_p;
2822 _M_deallocate_buckets();
2823 _M_bucket_count = __bkt_count;
2824 _M_buckets = __new_buckets;
2827#pragma GCC diagnostic push
2828#pragma GCC diagnostic ignored "-Wc++17-extensions"
2833 template<
typename _Key,
typename _Value,
typename _Alloc,
2834 typename _ExtractKey,
typename _Equal,
2835 typename _Hash,
typename _RangeHash,
typename _Unused,
2836 typename _RehashPolicy,
typename _Traits>
2838 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2839 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2840 _M_equal(
const _Hashtable& __other)
const
2842 if (
size() != __other.size())
2845 if constexpr (__unique_keys::value)
2846 for (
auto __x_n = _M_begin(); __x_n; __x_n = __x_n->_M_next())
2848 std::size_t __ybkt = __other._M_bucket_index(*__x_n);
2849 auto __prev_n = __other._M_buckets[__ybkt];
2853 for (__node_ptr __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);;
2854 __n = __n->_M_next())
2856 if (__n->_M_v() == __x_n->_M_v())
2860 || __other._M_bucket_index(*__n->_M_next()) != __ybkt)
2865 for (
auto __x_n = _M_begin(); __x_n;)
2867 std::size_t __x_count = 1;
2868 auto __x_n_end = __x_n->_M_next();
2870 && key_eq()(_ExtractKey{}(__x_n->_M_v()),
2871 _ExtractKey{}(__x_n_end->_M_v()));
2872 __x_n_end = __x_n_end->_M_next())
2875 std::size_t __ybkt = __other._M_bucket_index(*__x_n);
2876 auto __y_prev_n = __other._M_buckets[__ybkt];
2880 __node_ptr __y_n =
static_cast<__node_ptr
>(__y_prev_n->_M_nxt);
2883 if (key_eq()(_ExtractKey{}(__y_n->_M_v()),
2884 _ExtractKey{}(__x_n->_M_v())))
2887 auto __y_ref_n = __y_n;
2888 for (__y_n = __y_n->_M_next(); __y_n; __y_n = __y_n->_M_next())
2889 if (!__other._M_node_equals(*__y_ref_n, *__y_n))
2892 if (!__y_n || __other._M_bucket_index(*__y_n) != __ybkt)
2896 auto __y_n_end = __y_n;
2897 for (; __y_n_end; __y_n_end = __y_n_end->_M_next())
2898 if (--__x_count == 0)
2904 const_iterator __itx(__x_n), __itx_end(__x_n_end);
2905 const_iterator __ity(__y_n);
2906 if (!std::is_permutation(__itx, __itx_end, __ity))
2914#pragma GCC diagnostic pop
2916#if __cplusplus > 201402L
2917 template<
typename,
typename,
typename>
class _Hash_merge_helper { };
2920#if __cpp_deduction_guides >= 201606
2922 template<
typename _Hash>
2923 using _RequireNotAllocatorOrIntegral
2924 = __enable_if_t<!__or_<is_integral<_Hash>, __is_allocator<_Hash>>::value>;
2928_GLIBCXX_END_NAMESPACE_VERSION
2931#pragma GCC diagnostic pop
pair(_T1, _T2) -> pair< _T1, _T2 >
Two pairs are equal iff their members are equal.
auto declval() noexcept -> decltype(__declval< _Tp >(0))
constexpr tuple< _Elements &&... > forward_as_tuple(_Elements &&... __args) noexcept
Create a tuple of lvalue or rvalue references to the arguments.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr piecewise_construct_t piecewise_construct
Tag for piecewise construction of std::pair objects.
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.