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(
330 std::declval<const _RangeHash&>()((std::size_t)0, (std::size_t)0)),
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(
338 std::declval<const _ExtractKey&>()(std::declval<_Value>())),
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);
453 _M_assign(std::forward<_Ht>(__ht), __alloc_node_gen);
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)
991 return _M_emplace_uniq(std::forward<_Args>(__args)...);
993 return _M_emplace_multi(
cend(), std::forward<_Args>(__args)...);
996 template<
typename... _Args>
998 emplace_hint(const_iterator __hint, _Args&&... __args)
1000 if constexpr (__unique_keys::value)
1001 return _M_emplace_uniq(std::forward<_Args>(__args)...).first;
1003 return _M_emplace_multi(__hint, std::forward<_Args>(__args)...);
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)
1093 return _M_emplace_uniq(std::forward<_Pair>(__v));
1095 return _M_emplace_multi(
cend(), std::forward<_Pair>(__v));
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)
1106 return _M_emplace_uniq(std::forward<_Pair>(__v));
1108 return _M_emplace_multi(__hint, std::forward<_Pair>(__v));
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() };
1209 template<
typename _H2>
1211 _M_src_hash_code(
const _H2&,
const key_type& __k,
1212 const __node_value_type& __src_n)
const
1214 if constexpr (std::is_same_v<_H2, _Hash>)
1215 if constexpr (std::is_empty_v<_Hash>)
1216 return this->_M_hash_code(__src_n);
1218 return this->_M_hash_code(__k);
1224 extract(const_iterator __pos)
1226 size_t __bkt = _M_bucket_index(*__pos._M_cur);
1227 return _M_extract_node(__bkt,
1228 _M_get_previous_node(__bkt, __pos._M_cur));
1233 extract(
const _Key& __k)
1236 __hash_code __code = this->_M_hash_code(__k);
1237 std::size_t __bkt = _M_bucket_index(__code);
1238 if (__node_base_ptr __prev_node = _M_find_before_node(__bkt, __k, __code))
1239 __nh = _M_extract_node(__bkt, __prev_node);
1245 _M_merge_unique(_Hashtable& __src)
1247 __glibcxx_assert(get_allocator() == __src.get_allocator());
1249 auto __n_elt = __src.size();
1250 size_type __first = 1;
1252 auto __p =
static_cast<__node_ptr
>(&__src._M_before_begin);
1255 const auto __prev = __p;
1256 __p = __p->_M_next();
1257 const auto& __node = *__p;
1258 const key_type& __k = _ExtractKey{}(__node._M_v());
1259 auto __loc = _M_locate(__k);
1264 = __src._M_bucket_index(__src.hash_function()(__k));
1265 auto __nh = __src._M_extract_node(__src_bkt, __prev);
1266 _M_insert_unique_node(__loc._M_bucket_index, __loc._M_hash_code,
1267 __nh._M_ptr, __first * __n_elt + 1);
1275 template<
typename _Compatible_Hashtable>
1277 _M_merge_unique(_Compatible_Hashtable& __src)
1279 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1280 node_type>,
"Node types are compatible");
1281 __glibcxx_assert(get_allocator() == __src.get_allocator());
1283 auto __n_elt = __src.size();
1284 size_type __first = 1;
1287 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1291 const key_type& __k = _ExtractKey{}(*__pos);
1292 const auto __loc = _M_locate(__k);
1296 auto __nh = __src.extract(__pos);
1297 _M_insert_unique_node(__loc._M_bucket_index,
1298 __loc._M_hash_code, __nh._M_ptr,
1299 __first * __n_elt + 1);
1307 _M_merge_multi(_Hashtable& __src)
1309 __glibcxx_assert(get_allocator() == __src.get_allocator());
1311 if (__src.size() == 0) [[__unlikely__]]
1314 __node_ptr __hint =
nullptr;
1315 this->reserve(
size() + __src.size());
1317 auto __prev =
static_cast<__node_ptr
>(&__src._M_before_begin);
1320 const auto& __node = *__prev->_M_next();
1321 const key_type& __k = _ExtractKey{}(__node._M_v());
1322 __hash_code __code = this->_M_hash_code(__k);
1323 size_type __src_bkt = __src._M_bucket_index(__node);
1324 auto __nh = __src._M_extract_node(__src_bkt, __prev);
1325 __hint = _M_insert_multi_node(__hint, __code, __nh._M_ptr)._M_cur;
1328 while (__prev->_M_nxt !=
nullptr);
1332 template<
typename _Compatible_Hashtable>
1334 _M_merge_multi(_Compatible_Hashtable& __src)
1336 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1337 node_type>,
"Node types are compatible");
1338 __glibcxx_assert(get_allocator() == __src.get_allocator());
1340 __node_ptr __hint =
nullptr;
1341 this->reserve(
size() + __src.size());
1344 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1347 const key_type& __k = _ExtractKey{}(*__pos);
1349 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1350 auto __nh = __src.extract(__pos);
1351 __hint = _M_insert_multi_node(__hint, __code, __nh._M_ptr)._M_cur;
1358 _M_equal(
const _Hashtable& __other)
const;
1362 void _M_rehash(size_type __bkt_count, true_type __uks);
1365 void _M_rehash(size_type __bkt_count, false_type __uks);
1369 template<
typename _Key,
typename _Value,
typename _Alloc,
1370 typename _ExtractKey,
typename _Equal,
1371 typename _Hash,
typename _RangeHash,
typename _Unused,
1372 typename _RehashPolicy,
typename _Traits>
1373 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1374 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1375 _Hashtable(size_type __bkt_count_hint,
1376 const _Hash& __h,
const _Equal& __eq,
const allocator_type& __a)
1377 : _Hashtable(__h, __eq, __a)
1379 auto __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count_hint);
1380 if (__bkt_count > _M_bucket_count)
1382 _M_buckets = _M_allocate_buckets(__bkt_count);
1383 _M_bucket_count = __bkt_count;
1387 template<
typename _Key,
typename _Value,
typename _Alloc,
1388 typename _ExtractKey,
typename _Equal,
1389 typename _Hash,
typename _RangeHash,
typename _Unused,
1390 typename _RehashPolicy,
typename _Traits>
1391 template<
typename _InputIterator>
1393 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1394 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1395 _Hashtable(_InputIterator __f, _InputIterator __l,
1396 size_type __bkt_count_hint,
1397 const _Hash& __h,
const _Equal& __eq,
1398 const allocator_type& __a, true_type )
1399 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1400 { this->insert(__f, __l); }
1402 template<
typename _Key,
typename _Value,
typename _Alloc,
1403 typename _ExtractKey,
typename _Equal,
1404 typename _Hash,
typename _RangeHash,
typename _Unused,
1405 typename _RehashPolicy,
typename _Traits>
1406 template<
typename _InputIterator>
1407 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1408 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1409 _Hashtable(_InputIterator __f, _InputIterator __l,
1410 size_type __bkt_count_hint,
1411 const _Hash& __h,
const _Equal& __eq,
1412 const allocator_type& __a, false_type __uks)
1413 : _Hashtable(__h, __eq, __a)
1415 auto __nb_elems = __detail::__distance_fw(__f, __l);
1417 _M_rehash_policy._M_next_bkt(
1418 std::max(_M_rehash_policy._M_bkt_for_elements(__nb_elems),
1421 if (__bkt_count > _M_bucket_count)
1423 _M_buckets = _M_allocate_buckets(__bkt_count);
1424 _M_bucket_count = __bkt_count;
1427 for (; __f != __l; ++__f)
1428 _M_emplace_multi(
cend(), *__f);
1431 template<
typename _Key,
typename _Value,
typename _Alloc,
1432 typename _ExtractKey,
typename _Equal,
1433 typename _Hash,
typename _RangeHash,
typename _Unused,
1434 typename _RehashPolicy,
typename _Traits>
1436 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1437 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1438 operator=(
const _Hashtable& __ht)
1444 if (__node_alloc_traits::_S_propagate_on_copy_assign())
1446 auto& __this_alloc = this->_M_node_allocator();
1447 auto& __that_alloc = __ht._M_node_allocator();
1448 if (!__node_alloc_traits::_S_always_equal()
1449 && __this_alloc != __that_alloc)
1452 this->_M_deallocate_nodes(_M_begin());
1453 _M_before_begin._M_nxt =
nullptr;
1454 _M_deallocate_buckets();
1455 _M_buckets =
nullptr;
1456 std::__alloc_on_copy(__this_alloc, __that_alloc);
1457 __hashtable_base::operator=(__ht);
1458 _M_bucket_count = __ht._M_bucket_count;
1459 _M_element_count = __ht._M_element_count;
1460 _M_rehash_policy = __ht._M_rehash_policy;
1464 ~_Guard() {
if (_M_ht) _M_ht->_M_reset(); }
1469 _Guard __guard{
this};
1471 __guard._M_ht =
nullptr;
1474 std::__alloc_on_copy(__this_alloc, __that_alloc);
1478 _M_assign_elements(__ht);
1482 template<
typename _Key,
typename _Value,
typename _Alloc,
1483 typename _ExtractKey,
typename _Equal,
1484 typename _Hash,
typename _RangeHash,
typename _Unused,
1485 typename _RehashPolicy,
typename _Traits>
1486 template<
typename _Ht>
1488 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1489 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1490 _M_assign_elements(_Ht&& __ht)
1492 using __reuse_or_alloc_node_gen_t =
1493 __detail::_ReuseOrAllocNode<__node_alloc_type>;
1495 __buckets_ptr __former_buckets =
nullptr;
1496 std::size_t __former_bucket_count = _M_bucket_count;
1497 __rehash_guard_t __rehash_guard(_M_rehash_policy);
1499 if (_M_bucket_count != __ht._M_bucket_count)
1501 __former_buckets = _M_buckets;
1502 _M_buckets = _M_allocate_buckets(__ht._M_bucket_count);
1503 _M_bucket_count = __ht._M_bucket_count;
1506 std::fill_n(_M_buckets, _M_bucket_count,
nullptr);
1510 __hashtable_base::operator=(std::forward<_Ht>(__ht));
1511 _M_element_count = __ht._M_element_count;
1512 _M_rehash_policy = __ht._M_rehash_policy;
1513 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
1514 _M_before_begin._M_nxt =
nullptr;
1515 _M_assign(std::forward<_Ht>(__ht), __roan);
1516 if (__former_buckets)
1517 _M_deallocate_buckets(__former_buckets, __former_bucket_count);
1518 __rehash_guard._M_guarded_obj =
nullptr;
1522 if (__former_buckets)
1525 _M_deallocate_buckets();
1526 _M_buckets = __former_buckets;
1527 _M_bucket_count = __former_bucket_count;
1529 std::fill_n(_M_buckets, _M_bucket_count,
nullptr);
1530 __throw_exception_again;
1534 template<
typename _Key,
typename _Value,
typename _Alloc,
1535 typename _ExtractKey,
typename _Equal,
1536 typename _Hash,
typename _RangeHash,
typename _Unused,
1537 typename _RehashPolicy,
typename _Traits>
1538 template<
typename _Ht,
typename _NodeGenerator>
1540 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1541 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1542 _M_assign(_Ht&& __ht, _NodeGenerator& __node_gen)
1551 if (_M_dealloc_buckets)
1552 _M_ht->_M_deallocate_buckets();
1555 _Hashtable* _M_ht =
nullptr;
1556 bool _M_dealloc_buckets =
false;
1562 _M_buckets = _M_allocate_buckets(_M_bucket_count);
1563 __guard._M_dealloc_buckets =
true;
1566 if (!__ht._M_before_begin._M_nxt)
1569 __guard._M_ht =
this;
1571 using _FromVal = __conditional_t<is_lvalue_reference<_Ht>::value,
1572 const value_type&, value_type&&>;
1576 __node_ptr __ht_n = __ht._M_begin();
1578 = __node_gen(
static_cast<_FromVal
>(__ht_n->_M_v()));
1579 this->_M_copy_code(*__this_n, *__ht_n);
1580 _M_update_bbegin(__this_n);
1583 __node_ptr __prev_n = __this_n;
1584 for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next())
1586 __this_n = __node_gen(
static_cast<_FromVal
>(__ht_n->_M_v()));
1587 __prev_n->_M_nxt = __this_n;
1588 this->_M_copy_code(*__this_n, *__ht_n);
1589 size_type __bkt = _M_bucket_index(*__this_n);
1590 if (!_M_buckets[__bkt])
1591 _M_buckets[__bkt] = __prev_n;
1592 __prev_n = __this_n;
1594 __guard._M_ht =
nullptr;
1597 template<
typename _Key,
typename _Value,
typename _Alloc,
1598 typename _ExtractKey,
typename _Equal,
1599 typename _Hash,
typename _RangeHash,
typename _Unused,
1600 typename _RehashPolicy,
typename _Traits>
1602 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1603 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1606 _M_rehash_policy._M_reset();
1607 _M_bucket_count = 1;
1608 _M_single_bucket =
nullptr;
1609 _M_buckets = &_M_single_bucket;
1610 _M_before_begin._M_nxt =
nullptr;
1611 _M_element_count = 0;
1614 template<
typename _Key,
typename _Value,
typename _Alloc,
1615 typename _ExtractKey,
typename _Equal,
1616 typename _Hash,
typename _RangeHash,
typename _Unused,
1617 typename _RehashPolicy,
typename _Traits>
1619 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1620 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1621 _M_move_assign(_Hashtable&& __ht, true_type)
1626 this->_M_deallocate_nodes(_M_begin());
1627 _M_deallocate_buckets();
1628 __hashtable_base::operator=(
std::move(__ht));
1629 _M_rehash_policy = __ht._M_rehash_policy;
1630 if (!__ht._M_uses_single_bucket())
1631 _M_buckets = __ht._M_buckets;
1634 _M_buckets = &_M_single_bucket;
1635 _M_single_bucket = __ht._M_single_bucket;
1638 _M_bucket_count = __ht._M_bucket_count;
1639 _M_before_begin._M_nxt = __ht._M_before_begin._M_nxt;
1640 _M_element_count = __ht._M_element_count;
1641 std::__alloc_on_move(this->_M_node_allocator(), __ht._M_node_allocator());
1648 template<
typename _Key,
typename _Value,
typename _Alloc,
1649 typename _ExtractKey,
typename _Equal,
1650 typename _Hash,
typename _RangeHash,
typename _Unused,
1651 typename _RehashPolicy,
typename _Traits>
1653 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1654 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1655 _M_move_assign(_Hashtable&& __ht, false_type)
1657 if (__ht._M_node_allocator() == this->_M_node_allocator())
1658 _M_move_assign(
std::move(__ht), true_type{});
1667 template<
typename _Key,
typename _Value,
typename _Alloc,
1668 typename _ExtractKey,
typename _Equal,
1669 typename _Hash,
typename _RangeHash,
typename _Unused,
1670 typename _RehashPolicy,
typename _Traits>
1672 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1673 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1674 _Hashtable(
const _Hashtable& __ht)
1675 : __hashtable_base(__ht),
1677 __rehash_base(__ht),
1679 __node_alloc_traits::_S_select_on_copy(__ht._M_node_allocator())),
1680 __enable_default_ctor(__ht),
1681 _M_buckets(nullptr),
1682 _M_bucket_count(__ht._M_bucket_count),
1683 _M_element_count(__ht._M_element_count),
1684 _M_rehash_policy(__ht._M_rehash_policy)
1689 template<
typename _Key,
typename _Value,
typename _Alloc,
1690 typename _ExtractKey,
typename _Equal,
1691 typename _Hash,
typename _RangeHash,
typename _Unused,
1692 typename _RehashPolicy,
typename _Traits>
1693 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1694 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1695 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1697 noexcept(_S_nothrow_move())
1698 : __hashtable_base(__ht),
1700 __rehash_base(__ht),
1701 __hashtable_alloc(
std::
move(__a)),
1702 __enable_default_ctor(__ht),
1703 _M_buckets(__ht._M_buckets),
1704 _M_bucket_count(__ht._M_bucket_count),
1705 _M_before_begin(__ht._M_before_begin._M_nxt),
1706 _M_element_count(__ht._M_element_count),
1707 _M_rehash_policy(__ht._M_rehash_policy)
1710 if (__ht._M_uses_single_bucket())
1712 _M_buckets = &_M_single_bucket;
1713 _M_single_bucket = __ht._M_single_bucket;
1722 template<
typename _Key,
typename _Value,
typename _Alloc,
1723 typename _ExtractKey,
typename _Equal,
1724 typename _Hash,
typename _RangeHash,
typename _Unused,
1725 typename _RehashPolicy,
typename _Traits>
1727 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1728 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1729 _Hashtable(
const _Hashtable& __ht,
const allocator_type& __a)
1730 : __hashtable_base(__ht),
1732 __rehash_base(__ht),
1733 __hashtable_alloc(__node_alloc_type(__a)),
1734 __enable_default_ctor(__ht),
1736 _M_bucket_count(__ht._M_bucket_count),
1737 _M_element_count(__ht._M_element_count),
1738 _M_rehash_policy(__ht._M_rehash_policy)
1743 template<
typename _Key,
typename _Value,
typename _Alloc,
1744 typename _ExtractKey,
typename _Equal,
1745 typename _Hash,
typename _RangeHash,
typename _Unused,
1746 typename _RehashPolicy,
typename _Traits>
1747 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1748 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1749 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1751 : __hashtable_base(__ht),
1753 __rehash_base(__ht),
1754 __hashtable_alloc(
std::
move(__a)),
1755 __enable_default_ctor(__ht),
1756 _M_buckets(nullptr),
1757 _M_bucket_count(__ht._M_bucket_count),
1758 _M_element_count(__ht._M_element_count),
1759 _M_rehash_policy(__ht._M_rehash_policy)
1761 if (__ht._M_node_allocator() == this->_M_node_allocator())
1763 if (__ht._M_uses_single_bucket())
1765 _M_buckets = &_M_single_bucket;
1766 _M_single_bucket = __ht._M_single_bucket;
1769 _M_buckets = __ht._M_buckets;
1773 _M_update_bbegin(__ht._M_begin());
1779 using _Fwd_Ht = __conditional_t<
1780 __move_if_noexcept_cond<value_type>::value,
1781 const _Hashtable&, _Hashtable&&>;
1782 _M_assign(std::forward<_Fwd_Ht>(__ht));
1787 template<
typename _Key,
typename _Value,
typename _Alloc,
1788 typename _ExtractKey,
typename _Equal,
1789 typename _Hash,
typename _RangeHash,
typename _Unused,
1790 typename _RehashPolicy,
typename _Traits>
1791 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1792 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1793 ~_Hashtable() noexcept
1800 static_assert(
noexcept(declval<const __hash_code_base_access&>()
1801 ._M_bucket_index(declval<const __node_value_type&>(),
1803 "Cache the hash code or qualify your functors involved"
1804 " in hash code and bucket index computation with noexcept");
1806 this->_M_deallocate_nodes(_M_begin());
1807 _M_deallocate_buckets();
1810 template<
typename _Key,
typename _Value,
typename _Alloc,
1811 typename _ExtractKey,
typename _Equal,
1812 typename _Hash,
typename _RangeHash,
typename _Unused,
1813 typename _RehashPolicy,
typename _Traits>
1815 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1816 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1817 swap(_Hashtable& __x)
1818 noexcept(__and_<__is_nothrow_swappable<_Hash>,
1819 __is_nothrow_swappable<_Equal>>::value)
1826 std::__alloc_on_swap(this->_M_node_allocator(), __x._M_node_allocator());
1827 std::swap(_M_rehash_policy, __x._M_rehash_policy);
1830 if (this->_M_uses_single_bucket())
1832 if (!__x._M_uses_single_bucket())
1834 _M_buckets = __x._M_buckets;
1835 __x._M_buckets = &__x._M_single_bucket;
1838 else if (__x._M_uses_single_bucket())
1840 __x._M_buckets = _M_buckets;
1841 _M_buckets = &_M_single_bucket;
1844 std::swap(_M_buckets, __x._M_buckets);
1846 std::swap(_M_bucket_count, __x._M_bucket_count);
1847 std::swap(_M_before_begin._M_nxt, __x._M_before_begin._M_nxt);
1848 std::swap(_M_element_count, __x._M_element_count);
1849 std::swap(_M_single_bucket, __x._M_single_bucket);
1854 __x._M_update_bbegin();
1857 template<
typename _Key,
typename _Value,
typename _Alloc,
1858 typename _ExtractKey,
typename _Equal,
1859 typename _Hash,
typename _RangeHash,
typename _Unused,
1860 typename _RehashPolicy,
typename _Traits>
1862 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1863 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1864 find(
const key_type& __k)
1866 {
return iterator(_M_locate(__k)); }
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)
const
1877 {
return const_iterator(_M_locate(__k)); }
1879#if __cplusplus > 201703L
1880 template<
typename _Key,
typename _Value,
typename _Alloc,
1881 typename _ExtractKey,
typename _Equal,
1882 typename _Hash,
typename _RangeHash,
typename _Unused,
1883 typename _RehashPolicy,
typename _Traits>
1884 template<
typename _Kt,
typename,
typename>
1886 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1887 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1888 _M_find_tr(
const _Kt& __k)
1891 if (
size() <= __small_size_threshold())
1893 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1894 if (this->_M_key_equals_tr(__k, *__n))
1895 return iterator(__n);
1899 __hash_code __code = this->_M_hash_code_tr(__k);
1900 std::size_t __bkt = _M_bucket_index(__code);
1901 return iterator(_M_find_node_tr(__bkt, __k, __code));
1904 template<
typename _Key,
typename _Value,
typename _Alloc,
1905 typename _ExtractKey,
typename _Equal,
1906 typename _Hash,
typename _RangeHash,
typename _Unused,
1907 typename _RehashPolicy,
typename _Traits>
1908 template<
typename _Kt,
typename,
typename>
1910 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1911 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1912 _M_find_tr(
const _Kt& __k)
const
1915 if (
size() <= __small_size_threshold())
1917 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1918 if (this->_M_key_equals_tr(__k, *__n))
1919 return const_iterator(__n);
1923 __hash_code __code = this->_M_hash_code_tr(__k);
1924 std::size_t __bkt = _M_bucket_index(__code);
1925 return const_iterator(_M_find_node_tr(__bkt, __k, __code));
1929 template<
typename _Key,
typename _Value,
typename _Alloc,
1930 typename _ExtractKey,
typename _Equal,
1931 typename _Hash,
typename _RangeHash,
typename _Unused,
1932 typename _RehashPolicy,
typename _Traits>
1934 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1935 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1936 count(
const key_type& __k)
const
1939 auto __it = find(__k);
1943 if (__unique_keys::value)
1946 size_type __result = 1;
1947 for (
auto __ref = __it++;
1948 __it._M_cur && this->_M_node_equals(*__ref._M_cur, *__it._M_cur);
1955#if __cplusplus > 201703L
1956 template<
typename _Key,
typename _Value,
typename _Alloc,
1957 typename _ExtractKey,
typename _Equal,
1958 typename _Hash,
typename _RangeHash,
typename _Unused,
1959 typename _RehashPolicy,
typename _Traits>
1960 template<
typename _Kt,
typename,
typename>
1962 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1963 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1964 _M_count_tr(
const _Kt& __k)
const
1967 if (
size() <= __small_size_threshold())
1969 size_type __result = 0;
1970 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1972 if (this->_M_key_equals_tr(__k, *__n))
1985 __hash_code __code = this->_M_hash_code_tr(__k);
1986 std::size_t __bkt = _M_bucket_index(__code);
1987 auto __n = _M_find_node_tr(__bkt, __k, __code);
1992 size_type __result = 1;
1994 __it._M_cur && this->_M_equals_tr(__k, __code, *__it._M_cur);
2002 template<
typename _Key,
typename _Value,
typename _Alloc,
2003 typename _ExtractKey,
typename _Equal,
2004 typename _Hash,
typename _RangeHash,
typename _Unused,
2005 typename _RehashPolicy,
typename _Traits>
2007 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2008 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2009 equal_range(
const key_type& __k)
2010 -> pair<iterator, iterator>
2012 auto __ite = find(__k);
2014 return { __ite, __ite };
2016 auto __beg = __ite++;
2017 if (__unique_keys::value)
2018 return { __beg, __ite };
2020 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
2023 return { __beg, __ite };
2026 template<
typename _Key,
typename _Value,
typename _Alloc,
2027 typename _ExtractKey,
typename _Equal,
2028 typename _Hash,
typename _RangeHash,
typename _Unused,
2029 typename _RehashPolicy,
typename _Traits>
2031 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2032 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2033 equal_range(
const key_type& __k)
const
2034 -> pair<const_iterator, const_iterator>
2036 auto __ite = find(__k);
2038 return { __ite, __ite };
2040 auto __beg = __ite++;
2041 if (__unique_keys::value)
2042 return { __beg, __ite };
2044 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
2047 return { __beg, __ite };
2050#if __cplusplus > 201703L
2051 template<
typename _Key,
typename _Value,
typename _Alloc,
2052 typename _ExtractKey,
typename _Equal,
2053 typename _Hash,
typename _RangeHash,
typename _Unused,
2054 typename _RehashPolicy,
typename _Traits>
2055 template<
typename _Kt,
typename,
typename>
2057 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2058 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2059 _M_equal_range_tr(
const _Kt& __k)
2060 -> pair<iterator, iterator>
2062 if (
size() <= __small_size_threshold())
2064 __node_ptr __n, __beg =
nullptr;
2065 for (__n = _M_begin(); __n; __n = __n->_M_next())
2067 if (this->_M_key_equals_tr(__k, *__n))
2078 return { iterator(__beg), iterator(__n) };
2081 __hash_code __code = this->_M_hash_code_tr(__k);
2082 std::size_t __bkt = _M_bucket_index(__code);
2083 auto __n = _M_find_node_tr(__bkt, __k, __code);
2084 iterator __ite(__n);
2086 return { __ite, __ite };
2088 auto __beg = __ite++;
2089 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
2092 return { __beg, __ite };
2095 template<
typename _Key,
typename _Value,
typename _Alloc,
2096 typename _ExtractKey,
typename _Equal,
2097 typename _Hash,
typename _RangeHash,
typename _Unused,
2098 typename _RehashPolicy,
typename _Traits>
2099 template<
typename _Kt,
typename,
typename>
2101 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2102 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2103 _M_equal_range_tr(
const _Kt& __k)
const
2104 -> pair<const_iterator, const_iterator>
2106 if (
size() <= __small_size_threshold())
2108 __node_ptr __n, __beg =
nullptr;
2109 for (__n = _M_begin(); __n; __n = __n->_M_next())
2111 if (this->_M_key_equals_tr(__k, *__n))
2122 return { const_iterator(__beg), const_iterator(__n) };
2125 __hash_code __code = this->_M_hash_code_tr(__k);
2126 std::size_t __bkt = _M_bucket_index(__code);
2127 auto __n = _M_find_node_tr(__bkt, __k, __code);
2128 const_iterator __ite(__n);
2130 return { __ite, __ite };
2132 auto __beg = __ite++;
2133 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
2136 return { __beg, __ite };
2142 template<
typename _Key,
typename _Value,
typename _Alloc,
2143 typename _ExtractKey,
typename _Equal,
2144 typename _Hash,
typename _RangeHash,
typename _Unused,
2145 typename _RehashPolicy,
typename _Traits>
2147 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2148 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2149 _M_find_before_node(size_type __bkt,
const key_type& __k,
2150 __hash_code __code)
const
2153 __node_base_ptr __prev_p = _M_buckets[__bkt];
2157 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2158 __p = __p->_M_next())
2160 if (this->_M_equals(__k, __code, *__p))
2163 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2171 template<
typename _Key,
typename _Value,
typename _Alloc,
2172 typename _ExtractKey,
typename _Equal,
2173 typename _Hash,
typename _RangeHash,
typename _Unused,
2174 typename _RehashPolicy,
typename _Traits>
2175 template<
typename _Kt>
2177 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2178 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2179 _M_find_before_node_tr(size_type __bkt,
const _Kt& __k,
2180 __hash_code __code)
const
2183 __node_base_ptr __prev_p = _M_buckets[__bkt];
2187 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2188 __p = __p->_M_next())
2190 if (this->_M_equals_tr(__k, __code, *__p))
2193 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2201 template<
typename _Key,
typename _Value,
typename _Alloc,
2202 typename _ExtractKey,
typename _Equal,
2203 typename _Hash,
typename _RangeHash,
typename _Unused,
2204 typename _RehashPolicy,
typename _Traits>
2206 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2207 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2208 _M_locate(
const key_type& __k)
const
2211 __location_type __loc;
2212 const auto __size =
size();
2214 if (__size <= __small_size_threshold())
2216 __loc._M_before = pointer_traits<__node_base_ptr>::
2217 pointer_to(
const_cast<__node_base&
>(_M_before_begin));
2218 while (__loc._M_before->_M_nxt)
2220 if (this->_M_key_equals(__k, *__loc._M_node()))
2222 __loc._M_before = __loc._M_before->_M_nxt;
2224 __loc._M_before =
nullptr;
2227 __loc._M_hash_code = this->_M_hash_code(__k);
2228 __loc._M_bucket_index = _M_bucket_index(__loc._M_hash_code);
2230 if (__size > __small_size_threshold())
2231 __loc._M_before = _M_find_before_node(__loc._M_bucket_index, __k,
2232 __loc._M_hash_code);
2237 template<
typename _Key,
typename _Value,
typename _Alloc,
2238 typename _ExtractKey,
typename _Equal,
2239 typename _Hash,
typename _RangeHash,
typename _Unused,
2240 typename _RehashPolicy,
typename _Traits>
2242 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2243 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2244 _M_get_previous_node(size_type __bkt, __node_ptr __n)
2247 __node_base_ptr __prev_n = _M_buckets[__bkt];
2248 while (__prev_n->_M_nxt != __n)
2249 __prev_n = __prev_n->_M_nxt;
2253#pragma GCC diagnostic push
2254#pragma GCC diagnostic ignored "-Wc++17-extensions"
2255 template<
typename _Key,
typename _Value,
typename _Alloc,
2256 typename _ExtractKey,
typename _Equal,
2257 typename _Hash,
typename _RangeHash,
typename _Unused,
2258 typename _RehashPolicy,
typename _Traits>
2259 template<
typename... _Args>
2261 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2262 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2263 _M_emplace_uniq(_Args&&... __args)
2264 -> pair<iterator, bool>
2266 const key_type* __kp =
nullptr;
2268 if constexpr (
sizeof...(_Args) == 1)
2270 if constexpr (__is_key_type<_Args...>)
2272 const auto& __key = _ExtractKey{}(__args...);
2276 else if constexpr (
sizeof...(_Args) == 2)
2278 pair<
const _Args&...> __refs(__args...);
2279 if constexpr (__is_key_type<pair<_Args...>>)
2281 const auto& __key = _ExtractKey{}(__refs);
2286 _Scoped_node __node { __node_ptr(),
this };
2287 __hash_code __code = 0;
2288 size_type __bkt = 0;
2290 if (__kp ==
nullptr)
2294 = this->_M_allocate_node(std::forward<_Args>(__args)...);
2295 const key_type& __key = _ExtractKey{}(__node._M_node->_M_v());
2299 if (
auto __loc = _M_locate(*__kp))
2301 return { iterator(__loc),
false };
2304 __code = __loc._M_hash_code;
2305 __bkt = __loc._M_bucket_index;
2308 if (!__node._M_node)
2310 = this->_M_allocate_node(std::forward<_Args>(__args)...);
2313 auto __pos = _M_insert_unique_node(__bkt, __code, __node._M_node);
2314 __node._M_node =
nullptr;
2315 return { __pos,
true };
2317#pragma GCC diagnostic pop
2319 template<
typename _Key,
typename _Value,
typename _Alloc,
2320 typename _ExtractKey,
typename _Equal,
2321 typename _Hash,
typename _RangeHash,
typename _Unused,
2322 typename _RehashPolicy,
typename _Traits>
2323 template<
typename... _Args>
2325 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2326 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2327 _M_emplace_multi(const_iterator __hint, _Args&&... __args)
2331 _Scoped_node __node {
this, std::forward<_Args>(__args)... };
2332 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v());
2334 auto __res = this->_M_compute_hash_code(__hint._M_cur, __k);
2336 = _M_insert_multi_node(__res.first, __res.second, __node._M_node);
2337 __node._M_node =
nullptr;
2341 template<
typename _Key,
typename _Value,
typename _Alloc,
2342 typename _ExtractKey,
typename _Equal,
2343 typename _Hash,
typename _RangeHash,
typename _Unused,
2344 typename _RehashPolicy,
typename _Traits>
2345 template<
typename _InputIterator>
2347 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2348 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2349 _M_insert_range_multi(_InputIterator __first, _InputIterator __last)
2353 size_type __n_elt = __detail::__distance_fw(__first, __last);
2357 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2358 __pair_type __do_rehash
2359 = _M_rehash_policy._M_need_rehash(_M_bucket_count,
2363 if (__do_rehash.first)
2364 _M_rehash(__do_rehash.second, false_type{});
2366 __rehash_guard._M_guarded_obj =
nullptr;
2367 for (; __first != __last; ++__first)
2368 _M_emplace_multi(
cend(), *__first);
2371 template<
typename _Key,
typename _Value,
typename _Alloc,
2372 typename _ExtractKey,
typename _Equal,
2373 typename _Hash,
typename _RangeHash,
typename _Unused,
2374 typename _RehashPolicy,
typename _Traits>
2376 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2377 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2378 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const
2379 -> pair<__node_ptr, __hash_code>
2381 if (
size() <= __small_size_threshold())
2385 for (
auto __it = __hint; __it; __it = __it->_M_next())
2386 if (this->_M_key_equals(__k, *__it))
2387 return { __it, this->_M_hash_code(*__it) };
2390 for (
auto __it = _M_begin(); __it != __hint; __it = __it->_M_next())
2391 if (this->_M_key_equals(__k, *__it))
2392 return { __it, this->_M_hash_code(*__it) };
2397 return { __hint, this->_M_hash_code(__k) };
2400 template<
typename _Key,
typename _Value,
typename _Alloc,
2401 typename _ExtractKey,
typename _Equal,
2402 typename _Hash,
typename _RangeHash,
typename _Unused,
2403 typename _RehashPolicy,
typename _Traits>
2405 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2406 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2407 _M_insert_unique_node(size_type __bkt, __hash_code __code,
2408 __node_ptr __node, size_type __n_elt)
2411 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2413 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count,
2416 if (__do_rehash.
first)
2418 _M_rehash(__do_rehash.
second, true_type{});
2419 __bkt = _M_bucket_index(__code);
2422 __rehash_guard._M_guarded_obj =
nullptr;
2423 this->_M_store_code(*__node, __code);
2426 _M_insert_bucket_begin(__bkt, __node);
2428 return iterator(__node);
2431 template<
typename _Key,
typename _Value,
typename _Alloc,
2432 typename _ExtractKey,
typename _Equal,
2433 typename _Hash,
typename _RangeHash,
typename _Unused,
2434 typename _RehashPolicy,
typename _Traits>
2436 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2437 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2438 _M_insert_multi_node(__node_ptr __hint,
2439 __hash_code __code, __node_ptr __node)
2442 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2444 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1);
2446 if (__do_rehash.
first)
2447 _M_rehash(__do_rehash.
second, false_type{});
2449 __rehash_guard._M_guarded_obj =
nullptr;
2450 this->_M_store_code(*__node, __code);
2451 const key_type& __k = _ExtractKey{}(__node->_M_v());
2452 size_type __bkt = _M_bucket_index(__code);
2456 __node_base_ptr __prev
2457 = __builtin_expect(__hint !=
nullptr,
false)
2458 && this->_M_equals(__k, __code, *__hint)
2460 : _M_find_before_node(__bkt, __k, __code);
2465 __node->_M_nxt = __prev->_M_nxt;
2466 __prev->_M_nxt = __node;
2467 if (__builtin_expect(__prev == __hint,
false))
2471 && !this->_M_equals(__k, __code, *__node->_M_next()))
2473 size_type __next_bkt = _M_bucket_index(*__node->_M_next());
2474 if (__next_bkt != __bkt)
2475 _M_buckets[__next_bkt] = __node;
2482 _M_insert_bucket_begin(__bkt, __node);
2484 return iterator(__node);
2487 template<
typename _Key,
typename _Value,
typename _Alloc,
2488 typename _ExtractKey,
typename _Equal,
2489 typename _Hash,
typename _RangeHash,
typename _Unused,
2490 typename _RehashPolicy,
typename _Traits>
2492 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2493 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2494 erase(const_iterator __it)
2497 __node_ptr __n = __it._M_cur;
2498 std::size_t __bkt = _M_bucket_index(*__n);
2503 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2504 return _M_erase(__bkt, __prev_n, __n);
2507 template<
typename _Key,
typename _Value,
typename _Alloc,
2508 typename _ExtractKey,
typename _Equal,
2509 typename _Hash,
typename _RangeHash,
typename _Unused,
2510 typename _RehashPolicy,
typename _Traits>
2512 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2513 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2514 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n)
2517 if (__prev_n == _M_buckets[__bkt])
2518 _M_remove_bucket_begin(__bkt, __n->_M_next(),
2519 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
2520 else if (__n->_M_nxt)
2522 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
2523 if (__next_bkt != __bkt)
2524 _M_buckets[__next_bkt] = __prev_n;
2527 __prev_n->_M_nxt = __n->_M_nxt;
2528 iterator __result(__n->_M_next());
2529 this->_M_deallocate_node(__n);
2535#pragma GCC diagnostic push
2536#pragma GCC diagnostic ignored "-Wc++17-extensions"
2537 template<
typename _Key,
typename _Value,
typename _Alloc,
2538 typename _ExtractKey,
typename _Equal,
2539 typename _Hash,
typename _RangeHash,
typename _Unused,
2540 typename _RehashPolicy,
typename _Traits>
2542 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2543 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2544 erase(
const key_type& __k)
2547 auto __loc = _M_locate(__k);
2551 __node_base_ptr __prev_n = __loc._M_before;
2552 __node_ptr __n = __loc._M_node();
2553 auto __bkt = __loc._M_bucket_index;
2554 if (__bkt == size_type(-1))
2555 __bkt = _M_bucket_index(*__n);
2557 if constexpr (__unique_keys::value)
2559 _M_erase(__bkt, __prev_n, __n);
2570 __node_ptr __n_last = __n->_M_next();
2571 while (__n_last && this->_M_node_equals(*__n, *__n_last))
2572 __n_last = __n_last->_M_next();
2574 std::size_t __n_last_bkt
2575 = __n_last ? _M_bucket_index(*__n_last) : __bkt;
2578 size_type __result = 0;
2581 __node_ptr __p = __n->_M_next();
2582 this->_M_deallocate_node(__n);
2586 while (__n != __n_last);
2588 _M_element_count -= __result;
2589 if (__prev_n == _M_buckets[__bkt])
2590 _M_remove_bucket_begin(__bkt, __n_last, __n_last_bkt);
2591 else if (__n_last_bkt != __bkt)
2592 _M_buckets[__n_last_bkt] = __prev_n;
2593 __prev_n->_M_nxt = __n_last;
2597#pragma GCC diagnostic pop
2599 template<
typename _Key,
typename _Value,
typename _Alloc,
2600 typename _ExtractKey,
typename _Equal,
2601 typename _Hash,
typename _RangeHash,
typename _Unused,
2602 typename _RehashPolicy,
typename _Traits>
2604 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2605 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2606 erase(const_iterator __first, const_iterator __last)
2609 __node_ptr __n = __first._M_cur;
2610 __node_ptr __last_n = __last._M_cur;
2611 if (__n == __last_n)
2612 return iterator(__n);
2614 std::size_t __bkt = _M_bucket_index(*__n);
2616 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2617 bool __is_bucket_begin = __n == _M_bucket_begin(__bkt);
2618 std::size_t __n_bkt = __bkt;
2623 __node_ptr __tmp = __n;
2624 __n = __n->_M_next();
2625 this->_M_deallocate_node(__tmp);
2629 __n_bkt = _M_bucket_index(*__n);
2631 while (__n != __last_n && __n_bkt == __bkt);
2632 if (__is_bucket_begin)
2633 _M_remove_bucket_begin(__bkt, __n, __n_bkt);
2634 if (__n == __last_n)
2636 __is_bucket_begin =
true;
2640 if (__n && (__n_bkt != __bkt || __is_bucket_begin))
2641 _M_buckets[__n_bkt] = __prev_n;
2642 __prev_n->_M_nxt = __n;
2643 return iterator(__n);
2646 template<
typename _Key,
typename _Value,
typename _Alloc,
2647 typename _ExtractKey,
typename _Equal,
2648 typename _Hash,
typename _RangeHash,
typename _Unused,
2649 typename _RehashPolicy,
typename _Traits>
2651 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2652 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2655 this->_M_deallocate_nodes(_M_begin());
2656 std::fill_n(_M_buckets, _M_bucket_count,
nullptr);
2657 _M_element_count = 0;
2658 _M_before_begin._M_nxt =
nullptr;
2661 template<
typename _Key,
typename _Value,
typename _Alloc,
2662 typename _ExtractKey,
typename _Equal,
2663 typename _Hash,
typename _RangeHash,
typename _Unused,
2664 typename _RehashPolicy,
typename _Traits>
2666 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2667 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2668 rehash(size_type __bkt_count)
2670 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2672 =
std::max(_M_rehash_policy._M_bkt_for_elements(_M_element_count + 1),
2674 __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count);
2676 if (__bkt_count != _M_bucket_count)
2678 _M_rehash(__bkt_count, __unique_keys{});
2679 __rehash_guard._M_guarded_obj =
nullptr;
2684 template<
typename _Key,
typename _Value,
typename _Alloc,
2685 typename _ExtractKey,
typename _Equal,
2686 typename _Hash,
typename _RangeHash,
typename _Unused,
2687 typename _RehashPolicy,
typename _Traits>
2689 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2690 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2691 _M_rehash(size_type __bkt_count, true_type )
2693 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2694 __node_ptr __p = _M_begin();
2695 _M_before_begin._M_nxt =
nullptr;
2696 std::size_t __bbegin_bkt = 0;
2699 __node_ptr __next = __p->_M_next();
2701 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2702 if (!__new_buckets[__bkt])
2704 __p->_M_nxt = _M_before_begin._M_nxt;
2705 _M_before_begin._M_nxt = __p;
2706 __new_buckets[__bkt] = &_M_before_begin;
2708 __new_buckets[__bbegin_bkt] = __p;
2709 __bbegin_bkt = __bkt;
2713 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2714 __new_buckets[__bkt]->_M_nxt = __p;
2720 _M_deallocate_buckets();
2721 _M_bucket_count = __bkt_count;
2722 _M_buckets = __new_buckets;
2727 template<
typename _Key,
typename _Value,
typename _Alloc,
2728 typename _ExtractKey,
typename _Equal,
2729 typename _Hash,
typename _RangeHash,
typename _Unused,
2730 typename _RehashPolicy,
typename _Traits>
2732 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2733 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2734 _M_rehash(size_type __bkt_count, false_type )
2736 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2737 __node_ptr __p = _M_begin();
2738 _M_before_begin._M_nxt =
nullptr;
2739 std::size_t __bbegin_bkt = 0;
2740 std::size_t __prev_bkt = 0;
2741 __node_ptr __prev_p =
nullptr;
2742 bool __check_bucket =
false;
2746 __node_ptr __next = __p->_M_next();
2748 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2750 if (__prev_p && __prev_bkt == __bkt)
2755 __p->_M_nxt = __prev_p->_M_nxt;
2756 __prev_p->_M_nxt = __p;
2763 __check_bucket =
true;
2771 if (__prev_p->_M_nxt)
2773 std::size_t __next_bkt
2774 = __hash_code_base::_M_bucket_index(
2775 *__prev_p->_M_next(), __bkt_count);
2776 if (__next_bkt != __prev_bkt)
2777 __new_buckets[__next_bkt] = __prev_p;
2779 __check_bucket =
false;
2782 if (!__new_buckets[__bkt])
2784 __p->_M_nxt = _M_before_begin._M_nxt;
2785 _M_before_begin._M_nxt = __p;
2786 __new_buckets[__bkt] = &_M_before_begin;
2788 __new_buckets[__bbegin_bkt] = __p;
2789 __bbegin_bkt = __bkt;
2793 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2794 __new_buckets[__bkt]->_M_nxt = __p;
2802 if (__check_bucket && __prev_p->_M_nxt)
2804 std::size_t __next_bkt
2805 = __hash_code_base::_M_bucket_index(*__prev_p->_M_next(),
2807 if (__next_bkt != __prev_bkt)
2808 __new_buckets[__next_bkt] = __prev_p;
2811 _M_deallocate_buckets();
2812 _M_bucket_count = __bkt_count;
2813 _M_buckets = __new_buckets;
2816#pragma GCC diagnostic push
2817#pragma GCC diagnostic ignored "-Wc++17-extensions"
2822 template<
typename _Key,
typename _Value,
typename _Alloc,
2823 typename _ExtractKey,
typename _Equal,
2824 typename _Hash,
typename _RangeHash,
typename _Unused,
2825 typename _RehashPolicy,
typename _Traits>
2827 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2828 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2829 _M_equal(
const _Hashtable& __other)
const
2831 if (
size() != __other.size())
2834 if constexpr (__unique_keys::value)
2835 for (
auto __x_n = _M_begin(); __x_n; __x_n = __x_n->_M_next())
2837 std::size_t __ybkt = __other._M_bucket_index(*__x_n);
2838 auto __prev_n = __other._M_buckets[__ybkt];
2842 for (__node_ptr __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);;
2843 __n = __n->_M_next())
2845 if (__n->_M_v() == __x_n->_M_v())
2849 || __other._M_bucket_index(*__n->_M_next()) != __ybkt)
2854 for (
auto __x_n = _M_begin(); __x_n;)
2856 std::size_t __x_count = 1;
2857 auto __x_n_end = __x_n->_M_next();
2859 && key_eq()(_ExtractKey{}(__x_n->_M_v()),
2860 _ExtractKey{}(__x_n_end->_M_v()));
2861 __x_n_end = __x_n_end->_M_next())
2864 std::size_t __ybkt = __other._M_bucket_index(*__x_n);
2865 auto __y_prev_n = __other._M_buckets[__ybkt];
2869 __node_ptr __y_n =
static_cast<__node_ptr
>(__y_prev_n->_M_nxt);
2872 if (key_eq()(_ExtractKey{}(__y_n->_M_v()),
2873 _ExtractKey{}(__x_n->_M_v())))
2876 auto __y_ref_n = __y_n;
2877 for (__y_n = __y_n->_M_next(); __y_n; __y_n = __y_n->_M_next())
2878 if (!__other._M_node_equals(*__y_ref_n, *__y_n))
2881 if (!__y_n || __other._M_bucket_index(*__y_n) != __ybkt)
2885 auto __y_n_end = __y_n;
2886 for (; __y_n_end; __y_n_end = __y_n_end->_M_next())
2887 if (--__x_count == 0)
2893 const_iterator __itx(__x_n), __itx_end(__x_n_end);
2894 const_iterator __ity(__y_n);
2895 if (!std::is_permutation(__itx, __itx_end, __ity))
2903#pragma GCC diagnostic pop
2905#if __cplusplus > 201402L
2906 template<
typename,
typename,
typename>
class _Hash_merge_helper { };
2909#if __cpp_deduction_guides >= 201606
2911 template<
typename _Hash>
2912 using _RequireNotAllocatorOrIntegral
2913 = __enable_if_t<!__or_<is_integral<_Hash>, __is_allocator<_Hash>>::value>;
2917_GLIBCXX_END_NAMESPACE_VERSION
2920#pragma GCC diagnostic pop
__bool_constant< true > true_type
The type used as a compile-time boolean with true value.
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.