33#pragma GCC system_header
38#if __cplusplus > 201402L
42namespace std _GLIBCXX_VISIBILITY(default)
44_GLIBCXX_BEGIN_NAMESPACE_VERSION
47 template<
typename _Tp,
typename _Hash>
50 __is_fast_hash<_Hash>,
52 __is_nothrow_invocable<const _Hash&, const _Tp&>>>;
57 template<
typename _Equal,
typename _Hash,
typename _Allocator>
58 using _Hashtable_enable_default_ctor
59 = _Enable_default_constructor<__and_<is_default_constructible<_Equal>,
60 is_default_constructible<_Hash>,
61 is_default_constructible<_Allocator>>{},
62 __detail::_Hash_node_base>;
181 template<
typename _Key,
typename _Value,
typename _Alloc,
182 typename _ExtractKey,
typename _Equal,
183 typename _Hash,
typename _RangeHash,
typename _Unused,
184 typename _RehashPolicy,
typename _Traits>
186 :
public __detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal,
187 _Hash, _RangeHash, _Unused, _Traits>,
188 public __detail::_Map_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
189 _Hash, _RangeHash, _Unused,
190 _RehashPolicy, _Traits>,
191 public __detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal,
192 _Hash, _RangeHash, _Unused,
193 _RehashPolicy, _Traits>,
194 public __detail::_Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
195 _Hash, _RangeHash, _Unused,
196 _RehashPolicy, _Traits>,
197 public __detail::_Equality<_Key, _Value, _Alloc, _ExtractKey, _Equal,
198 _Hash, _RangeHash, _Unused,
199 _RehashPolicy, _Traits>,
200 private __detail::_Hashtable_alloc<
201 __alloc_rebind<_Alloc,
202 __detail::_Hash_node<_Value,
203 _Traits::__hash_cached::value>>>,
204 private _Hashtable_enable_default_ctor<_Equal, _Hash, _Alloc>
206 static_assert(is_same<typename remove_cv<_Value>::type, _Value>::value,
207 "unordered container must have a non-const, non-volatile value_type");
208#if __cplusplus > 201703L || defined __STRICT_ANSI__
209 static_assert(is_same<typename _Alloc::value_type, _Value>{},
210 "unordered container must have the same value_type as its allocator");
213 using __traits_type = _Traits;
214 using __hash_cached =
typename __traits_type::__hash_cached;
215 using __constant_iterators =
typename __traits_type::__constant_iterators;
216 using __node_type = __detail::_Hash_node<_Value, __hash_cached::value>;
217 using __node_alloc_type = __alloc_rebind<_Alloc, __node_type>;
219 using __hashtable_alloc = __detail::_Hashtable_alloc<__node_alloc_type>;
221 using __node_value_type =
222 __detail::_Hash_node_value<_Value, __hash_cached::value>;
223 using __node_ptr =
typename __hashtable_alloc::__node_ptr;
224 using __value_alloc_traits =
225 typename __hashtable_alloc::__value_alloc_traits;
226 using __node_alloc_traits =
227 typename __hashtable_alloc::__node_alloc_traits;
228 using __node_base =
typename __hashtable_alloc::__node_base;
229 using __node_base_ptr =
typename __hashtable_alloc::__node_base_ptr;
230 using __buckets_ptr =
typename __hashtable_alloc::__buckets_ptr;
232 using __insert_base = __detail::_Insert<_Key, _Value, _Alloc, _ExtractKey,
235 _RehashPolicy, _Traits>;
236 using __enable_default_ctor
237 = _Hashtable_enable_default_ctor<_Equal, _Hash, _Alloc>;
238 using __rehash_guard_t
239 = __detail::_RehashStateGuard<_RehashPolicy>;
242 typedef _Key key_type;
243 typedef _Value value_type;
244 typedef _Alloc allocator_type;
245 typedef _Equal key_equal;
249 typedef typename __value_alloc_traits::pointer pointer;
250 typedef typename __value_alloc_traits::const_pointer const_pointer;
251 typedef value_type& reference;
252 typedef const value_type& const_reference;
254 using iterator =
typename __insert_base::iterator;
256 using const_iterator =
typename __insert_base::const_iterator;
258 using local_iterator = __detail::_Local_iterator<key_type, _Value,
259 _ExtractKey, _Hash, _RangeHash, _Unused,
260 __constant_iterators::value,
261 __hash_cached::value>;
263 using const_local_iterator = __detail::_Local_const_iterator<
265 _ExtractKey, _Hash, _RangeHash, _Unused,
266 __constant_iterators::value, __hash_cached::value>;
269 using __rehash_type = _RehashPolicy;
271 using __unique_keys =
typename __traits_type::__unique_keys;
273 using __hashtable_base = __detail::
274 _Hashtable_base<_Key, _Value, _ExtractKey,
275 _Equal, _Hash, _RangeHash, _Unused, _Traits>;
277 using __hash_code_base =
typename __hashtable_base::__hash_code_base;
278 using __hash_code =
typename __hashtable_base::__hash_code;
279 using __ireturn_type =
typename __insert_base::__ireturn_type;
281 using __map_base = __detail::_Map_base<_Key, _Value, _Alloc, _ExtractKey,
282 _Equal, _Hash, _RangeHash, _Unused,
283 _RehashPolicy, _Traits>;
285 using __rehash_base = __detail::_Rehash_base<_Key, _Value, _Alloc,
287 _Hash, _RangeHash, _Unused,
288 _RehashPolicy, _Traits>;
290 using __eq_base = __detail::_Equality<_Key, _Value, _Alloc, _ExtractKey,
291 _Equal, _Hash, _RangeHash, _Unused,
292 _RehashPolicy, _Traits>;
294 using __reuse_or_alloc_node_gen_t =
295 __detail::_ReuseOrAllocNode<__node_alloc_type>;
296 using __alloc_node_gen_t =
297 __detail::_AllocNode<__node_alloc_type>;
298 using __node_builder_t =
299 __detail::_NodeBuilder<_ExtractKey>;
305 _Scoped_node(__node_ptr __n, __hashtable_alloc* __h)
306 : _M_h(__h), _M_node(__n) { }
309 template<
typename... _Args>
310 _Scoped_node(__hashtable_alloc* __h, _Args&&... __args)
312 _M_node(__h->_M_allocate_node(
std::
forward<_Args>(__args)...))
316 ~_Scoped_node() {
if (_M_node) _M_h->_M_deallocate_node(_M_node); };
318 _Scoped_node(
const _Scoped_node&) =
delete;
319 _Scoped_node& operator=(
const _Scoped_node&) =
delete;
321 __hashtable_alloc* _M_h;
325 template<
typename _Ht>
327 __conditional_t<std::is_lvalue_reference<_Ht>::value,
328 const value_type&, value_type&&>
329 __fwd_value_for(value_type& __val)
noexcept
336 struct __hash_code_base_access : __hash_code_base
337 {
using __hash_code_base::_M_bucket_index; };
340 static_assert(is_nothrow_default_constructible<_RangeHash>::value,
341 "Functor used to map hash code to bucket index"
342 " must be nothrow default constructible");
343 static_assert(
noexcept(
344 std::declval<const _RangeHash&>()((std::size_t)0, (std::size_t)0)),
345 "Functor used to map hash code to bucket index must be"
349 static_assert(is_nothrow_default_constructible<_ExtractKey>::value,
350 "_ExtractKey must be nothrow default constructible");
351 static_assert(
noexcept(
352 std::declval<const _ExtractKey&>()(std::declval<_Value>())),
353 "_ExtractKey functor must be noexcept invocable");
355 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
356 typename _ExtractKeya,
typename _Equala,
357 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
358 typename _RehashPolicya,
typename _Traitsa,
360 friend struct __detail::_Map_base;
362 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
363 typename _ExtractKeya,
typename _Equala,
364 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
365 typename _RehashPolicya,
typename _Traitsa>
366 friend struct __detail::_Insert_base;
368 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
369 typename _ExtractKeya,
typename _Equala,
370 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
371 typename _RehashPolicya,
typename _Traitsa,
372 bool _Constant_iteratorsa>
373 friend struct __detail::_Insert;
375 template<
typename _Keya,
typename _Valuea,
typename _Alloca,
376 typename _ExtractKeya,
typename _Equala,
377 typename _Hasha,
typename _RangeHasha,
typename _Unuseda,
378 typename _RehashPolicya,
typename _Traitsa,
380 friend struct __detail::_Equality;
383 using size_type =
typename __hashtable_base::size_type;
384 using difference_type =
typename __hashtable_base::difference_type;
386#if __cplusplus > 201402L
387 using node_type = _Node_handle<_Key, _Value, __node_alloc_type>;
388 using insert_return_type = _Node_insert_return<iterator, node_type>;
392 __buckets_ptr _M_buckets = &_M_single_bucket;
393 size_type _M_bucket_count = 1;
394 __node_base _M_before_begin;
395 size_type _M_element_count = 0;
396 _RehashPolicy _M_rehash_policy;
404 __node_base_ptr _M_single_bucket =
nullptr;
409 if (
auto __begin = _M_begin())
410 _M_buckets[_M_bucket_index(*__begin)] = &_M_before_begin;
414 _M_update_bbegin(__node_ptr __n)
416 _M_before_begin._M_nxt = __n;
421 _M_uses_single_bucket(__buckets_ptr __bkts)
const
422 {
return __builtin_expect(__bkts == &_M_single_bucket,
false); }
425 _M_uses_single_bucket()
const
426 {
return _M_uses_single_bucket(_M_buckets); }
428 static constexpr size_t
429 __small_size_threshold() noexcept
432 __detail::_Hashtable_hash_traits<_Hash>::__small_size_threshold();
436 _M_base_alloc() {
return *
this; }
439 _M_allocate_buckets(size_type __bkt_count)
441 if (__builtin_expect(__bkt_count == 1,
false))
443 _M_single_bucket =
nullptr;
444 return &_M_single_bucket;
447 return __hashtable_alloc::_M_allocate_buckets(__bkt_count);
451 _M_deallocate_buckets(__buckets_ptr __bkts, size_type __bkt_count)
453 if (_M_uses_single_bucket(__bkts))
456 __hashtable_alloc::_M_deallocate_buckets(__bkts, __bkt_count);
460 _M_deallocate_buckets()
461 { _M_deallocate_buckets(_M_buckets, _M_bucket_count); }
466 _M_bucket_begin(size_type __bkt)
const
468 __node_base_ptr __n = _M_buckets[__bkt];
469 return __n ?
static_cast<__node_ptr
>(__n->_M_nxt) :
nullptr;
474 {
return static_cast<__node_ptr
>(_M_before_begin._M_nxt); }
478 template<
typename _Ht>
480 _M_assign_elements(_Ht&&);
482 template<
typename _Ht,
typename _NodeGenerator>
484 _M_assign(_Ht&&,
const _NodeGenerator&);
495 _Hashtable(const _Hash& __h, const _Equal& __eq,
496 const allocator_type& __a)
497 : __hashtable_base(__h, __eq),
498 __hashtable_alloc(__node_alloc_type(__a)),
499 __enable_default_ctor(_Enable_default_constructor_tag{})
502 template<
bool _No_realloc = true>
503 static constexpr bool
506#if __cplusplus <= 201402L
507 return __and_<__bool_constant<_No_realloc>,
508 is_nothrow_copy_constructible<_Hash>,
509 is_nothrow_copy_constructible<_Equal>>::value;
511 if constexpr (_No_realloc)
512 if constexpr (is_nothrow_copy_constructible<_Hash>())
513 return is_nothrow_copy_constructible<_Equal>();
518 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
520 noexcept(_S_nothrow_move());
522 _Hashtable(_Hashtable&&, __node_alloc_type&&,
525 template<
typename _InputIterator>
526 _Hashtable(_InputIterator __first, _InputIterator __last,
527 size_type __bkt_count_hint,
528 const _Hash&,
const _Equal&,
const allocator_type&,
531 template<
typename _InputIterator>
532 _Hashtable(_InputIterator __first, _InputIterator __last,
533 size_type __bkt_count_hint,
534 const _Hash&,
const _Equal&,
const allocator_type&,
539 _Hashtable() =
default;
541 _Hashtable(
const _Hashtable&);
543 _Hashtable(
const _Hashtable&,
const allocator_type&);
546 _Hashtable(size_type __bkt_count_hint,
547 const _Hash& __hf = _Hash(),
548 const key_equal& __eql = key_equal(),
549 const allocator_type& __a = allocator_type());
552 _Hashtable(_Hashtable&& __ht)
553 noexcept(_S_nothrow_move())
558 _Hashtable(_Hashtable&& __ht,
const allocator_type& __a)
559 noexcept(_S_nothrow_move<__node_alloc_traits::_S_always_equal()>())
560 : _Hashtable(
std::move(__ht), __node_alloc_type(__a),
561 typename __node_alloc_traits::is_always_equal{})
565 _Hashtable(
const allocator_type& __a)
566 : __hashtable_alloc(__node_alloc_type(__a)),
567 __enable_default_ctor(_Enable_default_constructor_tag{})
570 template<
typename _InputIterator>
571 _Hashtable(_InputIterator __f, _InputIterator __l,
572 size_type __bkt_count_hint = 0,
573 const _Hash& __hf = _Hash(),
574 const key_equal& __eql = key_equal(),
575 const allocator_type& __a = allocator_type())
576 : _Hashtable(__f, __l, __bkt_count_hint, __hf, __eql, __a,
580 _Hashtable(initializer_list<value_type> __l,
581 size_type __bkt_count_hint = 0,
582 const _Hash& __hf = _Hash(),
583 const key_equal& __eql = key_equal(),
584 const allocator_type& __a = allocator_type())
585 : _Hashtable(__l.
begin(), __l.
end(), __bkt_count_hint,
586 __hf, __eql, __a, __unique_keys{})
590 operator=(
const _Hashtable& __ht);
593 operator=(_Hashtable&& __ht)
594 noexcept(__node_alloc_traits::_S_nothrow_move()
595 && is_nothrow_move_assignable<_Hash>::value
596 && is_nothrow_move_assignable<_Equal>::value)
598 constexpr bool __move_storage =
599 __node_alloc_traits::_S_propagate_on_move_assign()
600 || __node_alloc_traits::_S_always_equal();
601 _M_move_assign(
std::move(__ht), __bool_constant<__move_storage>());
606 operator=(initializer_list<value_type> __l)
608 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
609 _M_before_begin._M_nxt =
nullptr;
613 auto __l_bkt_count = _M_rehash_policy._M_bkt_for_elements(__l.size());
616 if (_M_bucket_count < __l_bkt_count)
617 rehash(__l_bkt_count);
619 this->_M_insert_range(__l.begin(), __l.end(), __roan, __unique_keys{});
623 ~_Hashtable() noexcept;
627 noexcept(__and_<__is_nothrow_swappable<_Hash>,
628 __is_nothrow_swappable<_Equal>>::value);
633 {
return iterator(_M_begin()); }
636 begin() const noexcept
637 {
return const_iterator(_M_begin()); }
641 {
return iterator(
nullptr); }
645 {
return const_iterator(
nullptr); }
649 {
return const_iterator(_M_begin()); }
652 cend() const noexcept
653 {
return const_iterator(
nullptr); }
656 size() const noexcept
657 {
return _M_element_count; }
659 _GLIBCXX_NODISCARD
bool
660 empty() const noexcept
661 {
return size() == 0; }
664 get_allocator() const noexcept
665 {
return allocator_type(this->_M_node_allocator()); }
668 max_size() const noexcept
669 {
return __node_alloc_traits::max_size(this->_M_node_allocator()); }
674 {
return this->_M_eq(); }
680 bucket_count() const noexcept
681 {
return _M_bucket_count; }
684 max_bucket_count() const noexcept
685 {
return max_size(); }
688 bucket_size(size_type __bkt)
const
692 bucket(
const key_type& __k)
const
693 {
return _M_bucket_index(this->_M_hash_code(__k)); }
696 begin(size_type __bkt)
698 return local_iterator(*
this, _M_bucket_begin(__bkt),
699 __bkt, _M_bucket_count);
704 {
return local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
707 begin(size_type __bkt)
const
709 return const_local_iterator(*
this, _M_bucket_begin(__bkt),
710 __bkt, _M_bucket_count);
714 end(size_type __bkt)
const
715 {
return const_local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
719 cbegin(size_type __bkt)
const
721 return const_local_iterator(*
this, _M_bucket_begin(__bkt),
722 __bkt, _M_bucket_count);
726 cend(size_type __bkt)
const
727 {
return const_local_iterator(*
this,
nullptr, __bkt, _M_bucket_count); }
730 load_factor() const noexcept
732 return static_cast<float>(
size()) /
static_cast<float>(bucket_count());
741 __rehash_policy()
const
742 {
return _M_rehash_policy; }
745 __rehash_policy(
const _RehashPolicy& __pol)
746 { _M_rehash_policy = __pol; }
750 find(
const key_type& __k);
753 find(
const key_type& __k)
const;
756 count(
const key_type& __k)
const;
759 equal_range(
const key_type& __k);
762 equal_range(
const key_type& __k)
const;
764#ifdef __glibcxx_generic_unordered_lookup
765 template<
typename _Kt,
766 typename = __has_is_transparent_t<_Hash, _Kt>,
767 typename = __has_is_transparent_t<_Equal, _Kt>>
769 _M_find_tr(
const _Kt& __k);
771 template<
typename _Kt,
772 typename = __has_is_transparent_t<_Hash, _Kt>,
773 typename = __has_is_transparent_t<_Equal, _Kt>>
775 _M_find_tr(
const _Kt& __k)
const;
777 template<
typename _Kt,
778 typename = __has_is_transparent_t<_Hash, _Kt>,
779 typename = __has_is_transparent_t<_Equal, _Kt>>
781 _M_count_tr(
const _Kt& __k)
const;
783 template<
typename _Kt,
784 typename = __has_is_transparent_t<_Hash, _Kt>,
785 typename = __has_is_transparent_t<_Equal, _Kt>>
786 pair<iterator, iterator>
787 _M_equal_range_tr(
const _Kt& __k);
789 template<
typename _Kt,
790 typename = __has_is_transparent_t<_Hash, _Kt>,
791 typename = __has_is_transparent_t<_Equal, _Kt>>
792 pair<const_iterator, const_iterator>
793 _M_equal_range_tr(
const _Kt& __k)
const;
799 _M_bucket_index(
const __node_value_type& __n)
const noexcept
800 {
return __hash_code_base::_M_bucket_index(__n, _M_bucket_count); }
803 _M_bucket_index(__hash_code __c)
const
804 {
return __hash_code_base::_M_bucket_index(__c, _M_bucket_count); }
807 _M_find_before_node(
const key_type&);
812 _M_find_before_node(size_type,
const key_type&, __hash_code)
const;
814 template<
typename _Kt>
816 _M_find_before_node_tr(size_type,
const _Kt&, __hash_code)
const;
819 _M_find_node(size_type __bkt,
const key_type& __key,
820 __hash_code __c)
const
822 __node_base_ptr __before_n = _M_find_before_node(__bkt, __key, __c);
824 return static_cast<__node_ptr
>(__before_n->_M_nxt);
828 template<
typename _Kt>
830 _M_find_node_tr(size_type __bkt,
const _Kt& __key,
831 __hash_code __c)
const
833 auto __before_n = _M_find_before_node_tr(__bkt, __key, __c);
835 return static_cast<__node_ptr
>(__before_n->_M_nxt);
841 _M_insert_bucket_begin(size_type __bkt, __node_ptr __node)
843 if (_M_buckets[__bkt])
847 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt;
848 _M_buckets[__bkt]->_M_nxt = __node;
855 __node->_M_nxt = _M_before_begin._M_nxt;
856 _M_before_begin._M_nxt = __node;
861 _M_buckets[_M_bucket_index(*__node->_M_next())] = __node;
863 _M_buckets[__bkt] = &_M_before_begin;
869 _M_remove_bucket_begin(size_type __bkt, __node_ptr __next_n,
870 size_type __next_bkt)
872 if (!__next_n || __next_bkt != __bkt)
877 _M_buckets[__next_bkt] = _M_buckets[__bkt];
880 if (&_M_before_begin == _M_buckets[__bkt])
881 _M_before_begin._M_nxt = __next_n;
882 _M_buckets[__bkt] =
nullptr;
888 _M_get_previous_node(size_type __bkt, __node_ptr __n);
890 pair<__node_ptr, __hash_code>
891 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const;
897 _M_insert_unique_node(size_type __bkt, __hash_code,
898 __node_ptr __n, size_type __n_elt = 1);
903 _M_insert_multi_node(__node_ptr __hint,
904 __hash_code __code, __node_ptr __n);
906 template<
typename... _Args>
908 _M_emplace(
true_type __uks, _Args&&... __args);
910 template<
typename... _Args>
912 _M_emplace(
false_type __uks, _Args&&... __args)
913 {
return _M_emplace(
cend(), __uks, std::forward<_Args>(__args)...); }
916 template<
typename... _Args>
918 _M_emplace(const_iterator,
true_type __uks, _Args&&... __args)
919 {
return _M_emplace(__uks, std::forward<_Args>(__args)...).first; }
921 template<
typename... _Args>
923 _M_emplace(const_iterator,
false_type __uks, _Args&&... __args);
925 template<
typename _Kt,
typename _Arg,
typename _NodeGenerator>
927 _M_insert_unique(_Kt&&, _Arg&&,
const _NodeGenerator&);
929 template<
typename _Kt>
930 static __conditional_t<
931 __and_<__is_nothrow_invocable<_Hash&, const key_type&>,
932 __not_<__is_nothrow_invocable<_Hash&, _Kt>>>::value,
934 _S_forward_key(_Kt&& __k)
935 {
return std::forward<_Kt>(__k); }
937 static const key_type&
938 _S_forward_key(
const key_type& __k)
942 _S_forward_key(key_type&& __k)
945 template<
typename _Arg,
typename _NodeGenerator>
947 _M_insert_unique_aux(_Arg&& __arg,
const _NodeGenerator& __node_gen)
949 return _M_insert_unique(
950 _S_forward_key(_ExtractKey{}(std::forward<_Arg>(__arg))),
951 std::forward<_Arg>(__arg), __node_gen);
954 template<
typename _Arg,
typename _NodeGenerator>
956 _M_insert(_Arg&& __arg,
const _NodeGenerator& __node_gen,
960 = __detail::_ConvertToValueType<_ExtractKey, value_type>;
961 return _M_insert_unique_aux(
962 __to_value{}(std::forward<_Arg>(__arg)), __node_gen);
965 template<
typename _Arg,
typename _NodeGenerator>
967 _M_insert(_Arg&& __arg,
const _NodeGenerator& __node_gen,
971 = __detail::_ConvertToValueType<_ExtractKey, value_type>;
972 return _M_insert(
cend(),
973 __to_value{}(std::forward<_Arg>(__arg)), __node_gen, __uks);
977 template<
typename _Arg,
typename _NodeGenerator>
979 _M_insert(const_iterator, _Arg&& __arg,
980 const _NodeGenerator& __node_gen,
true_type __uks)
983 _M_insert(std::forward<_Arg>(__arg), __node_gen, __uks).first;
987 template<
typename _Arg,
typename _NodeGenerator>
989 _M_insert(const_iterator, _Arg&&,
993 _M_erase(
true_type __uks,
const key_type&);
999 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n);
1003 template<
typename... _Args>
1005 emplace(_Args&&... __args)
1006 {
return _M_emplace(__unique_keys{}, std::forward<_Args>(__args)...); }
1008 template<
typename... _Args>
1010 emplace_hint(const_iterator __hint, _Args&&... __args)
1012 return _M_emplace(__hint, __unique_keys{},
1013 std::forward<_Args>(__args)...);
1020 erase(const_iterator);
1024 erase(iterator __it)
1025 {
return erase(const_iterator(__it)); }
1028 erase(
const key_type& __k)
1029 {
return _M_erase(__unique_keys{}, __k); }
1032 erase(const_iterator, const_iterator);
1039 void rehash(size_type __bkt_count);
1044#if __cplusplus > 201402L
1047 _M_reinsert_node(node_type&& __nh)
1049 insert_return_type __ret;
1051 __ret.position =
end();
1054 __glibcxx_assert(get_allocator() == __nh.get_allocator());
1056 __node_ptr __n =
nullptr;
1057 const key_type& __k = __nh._M_key();
1058 const size_type __size =
size();
1059 if (__size <= __small_size_threshold())
1061 for (__n = _M_begin(); __n; __n = __n->_M_next())
1062 if (this->_M_key_equals(__k, *__n))
1070 __code = this->_M_hash_code(__k);
1071 __bkt = _M_bucket_index(__code);
1072 if (__size > __small_size_threshold())
1073 __n = _M_find_node(__bkt, __k, __code);
1079 __ret.position = iterator(__n);
1080 __ret.inserted =
false;
1085 = _M_insert_unique_node(__bkt, __code, __nh._M_ptr);
1086 __nh._M_ptr =
nullptr;
1087 __ret.inserted =
true;
1095 _M_reinsert_node_multi(const_iterator __hint, node_type&& __nh)
1100 __glibcxx_assert(get_allocator() == __nh.get_allocator());
1102 const key_type& __k = __nh._M_key();
1103 auto __code = this->_M_hash_code(__k);
1105 = _M_insert_multi_node(__hint._M_cur, __code, __nh._M_ptr);
1106 __nh._M_ptr =
nullptr;
1112 _M_extract_node(
size_t __bkt, __node_base_ptr __prev_n)
1114 __node_ptr __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
1115 if (__prev_n == _M_buckets[__bkt])
1116 _M_remove_bucket_begin(__bkt, __n->_M_next(),
1117 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
1118 else if (__n->_M_nxt)
1120 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
1121 if (__next_bkt != __bkt)
1122 _M_buckets[__next_bkt] = __prev_n;
1125 __prev_n->_M_nxt = __n->_M_nxt;
1126 __n->_M_nxt =
nullptr;
1128 return { __n, this->_M_node_allocator() };
1133 template<
typename _H2>
1135 _M_src_hash_code(
const _H2&,
const key_type& __k,
1136 const __node_value_type& __src_n)
const
1138 if constexpr (std::is_same_v<_H2, _Hash>)
1139 if constexpr (std::is_empty_v<_Hash>)
1140 return this->_M_hash_code(__src_n);
1142 return this->_M_hash_code(__k);
1148 extract(const_iterator __pos)
1150 size_t __bkt = _M_bucket_index(*__pos._M_cur);
1151 return _M_extract_node(__bkt,
1152 _M_get_previous_node(__bkt, __pos._M_cur));
1157 extract(
const _Key& __k)
1160 __hash_code __code = this->_M_hash_code(__k);
1161 std::size_t __bkt = _M_bucket_index(__code);
1162 if (__node_base_ptr __prev_node = _M_find_before_node(__bkt, __k, __code))
1163 __nh = _M_extract_node(__bkt, __prev_node);
1168 template<
typename _Compatible_Hashtable>
1170 _M_merge_unique(_Compatible_Hashtable& __src)
1172 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1173 node_type>,
"Node types are compatible");
1174 __glibcxx_assert(get_allocator() == __src.get_allocator());
1176 auto __n_elt = __src.size();
1177 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1180 const size_type __size =
size();
1181 const key_type& __k = _ExtractKey{}(*__pos);
1182 if (__size <= __small_size_threshold())
1184 bool __found =
false;
1185 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1186 if (this->_M_key_equals(__k, *__n))
1201 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1202 size_type __bkt = _M_bucket_index(__code);
1203 if (__size <= __small_size_threshold()
1204 || _M_find_node(__bkt, __k, __code) ==
nullptr)
1206 auto __nh = __src.extract(__pos);
1207 _M_insert_unique_node(__bkt, __code, __nh._M_ptr, __n_elt);
1208 __nh._M_ptr =
nullptr;
1211 else if (__n_elt != 1)
1217 template<
typename _Compatible_Hashtable>
1219 _M_merge_multi(_Compatible_Hashtable& __src)
1221 static_assert(is_same_v<
typename _Compatible_Hashtable::node_type,
1222 node_type>,
"Node types are compatible");
1223 __glibcxx_assert(get_allocator() == __src.get_allocator());
1225 __node_ptr __hint =
nullptr;
1226 this->reserve(
size() + __src.size());
1227 for (
auto __i = __src.cbegin(), __end = __src.cend(); __i != __end;)
1230 const key_type& __k = _ExtractKey{}(*__pos);
1232 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1233 auto __nh = __src.extract(__pos);
1234 __hint = _M_insert_multi_node(__hint, __code, __nh._M_ptr)._M_cur;
1235 __nh._M_ptr =
nullptr;
1242 void _M_rehash(size_type __bkt_count,
true_type __uks);
1245 void _M_rehash(size_type __bkt_count,
false_type __uks);
1249 template<
typename _Key,
typename _Value,
typename _Alloc,
1250 typename _ExtractKey,
typename _Equal,
1251 typename _Hash,
typename _RangeHash,
typename _Unused,
1252 typename _RehashPolicy,
typename _Traits>
1253 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1254 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1255 _Hashtable(size_type __bkt_count_hint,
1256 const _Hash& __h,
const _Equal& __eq,
const allocator_type& __a)
1257 : _Hashtable(__h, __eq, __a)
1259 auto __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count_hint);
1260 if (__bkt_count > _M_bucket_count)
1262 _M_buckets = _M_allocate_buckets(__bkt_count);
1263 _M_bucket_count = __bkt_count;
1267 template<
typename _Key,
typename _Value,
typename _Alloc,
1268 typename _ExtractKey,
typename _Equal,
1269 typename _Hash,
typename _RangeHash,
typename _Unused,
1270 typename _RehashPolicy,
typename _Traits>
1271 template<
typename _InputIterator>
1272 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1273 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1274 _Hashtable(_InputIterator __f, _InputIterator __l,
1275 size_type __bkt_count_hint,
1276 const _Hash& __h,
const _Equal& __eq,
1278 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1279 { this->insert(__f, __l); }
1281 template<
typename _Key,
typename _Value,
typename _Alloc,
1282 typename _ExtractKey,
typename _Equal,
1283 typename _Hash,
typename _RangeHash,
typename _Unused,
1284 typename _RehashPolicy,
typename _Traits>
1285 template<
typename _InputIterator>
1286 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1287 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1288 _Hashtable(_InputIterator __f, _InputIterator __l,
1289 size_type __bkt_count_hint,
1290 const _Hash& __h,
const _Equal& __eq,
1292 : _Hashtable(__h, __eq, __a)
1294 auto __nb_elems = __detail::__distance_fw(__f, __l);
1296 _M_rehash_policy._M_next_bkt(
1297 std::max(_M_rehash_policy._M_bkt_for_elements(__nb_elems),
1300 if (__bkt_count > _M_bucket_count)
1302 _M_buckets = _M_allocate_buckets(__bkt_count);
1303 _M_bucket_count = __bkt_count;
1306 __alloc_node_gen_t __node_gen(*
this);
1307 for (; __f != __l; ++__f)
1308 _M_insert(*__f, __node_gen, __uks);
1311 template<
typename _Key,
typename _Value,
typename _Alloc,
1312 typename _ExtractKey,
typename _Equal,
1313 typename _Hash,
typename _RangeHash,
typename _Unused,
1314 typename _RehashPolicy,
typename _Traits>
1316 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1317 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1318 operator=(
const _Hashtable& __ht)
1324 if (__node_alloc_traits::_S_propagate_on_copy_assign())
1326 auto& __this_alloc = this->_M_node_allocator();
1327 auto& __that_alloc = __ht._M_node_allocator();
1328 if (!__node_alloc_traits::_S_always_equal()
1329 && __this_alloc != __that_alloc)
1332 this->_M_deallocate_nodes(_M_begin());
1333 _M_before_begin._M_nxt =
nullptr;
1334 _M_deallocate_buckets();
1335 _M_buckets =
nullptr;
1336 std::__alloc_on_copy(__this_alloc, __that_alloc);
1337 __hashtable_base::operator=(__ht);
1338 _M_bucket_count = __ht._M_bucket_count;
1339 _M_element_count = __ht._M_element_count;
1340 _M_rehash_policy = __ht._M_rehash_policy;
1341 __alloc_node_gen_t __alloc_node_gen(*
this);
1344 _M_assign(__ht, __alloc_node_gen);
1351 __throw_exception_again;
1355 std::__alloc_on_copy(__this_alloc, __that_alloc);
1359 _M_assign_elements(__ht);
1363 template<
typename _Key,
typename _Value,
typename _Alloc,
1364 typename _ExtractKey,
typename _Equal,
1365 typename _Hash,
typename _RangeHash,
typename _Unused,
1366 typename _RehashPolicy,
typename _Traits>
1367 template<
typename _Ht>
1369 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1370 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1371 _M_assign_elements(_Ht&& __ht)
1373 __buckets_ptr __former_buckets =
nullptr;
1374 std::size_t __former_bucket_count = _M_bucket_count;
1375 __rehash_guard_t __rehash_guard(_M_rehash_policy);
1377 if (_M_bucket_count != __ht._M_bucket_count)
1379 __former_buckets = _M_buckets;
1380 _M_buckets = _M_allocate_buckets(__ht._M_bucket_count);
1381 _M_bucket_count = __ht._M_bucket_count;
1384 __builtin_memset(_M_buckets, 0,
1385 _M_bucket_count *
sizeof(__node_base_ptr));
1389 __hashtable_base::operator=(std::forward<_Ht>(__ht));
1390 _M_element_count = __ht._M_element_count;
1391 _M_rehash_policy = __ht._M_rehash_policy;
1392 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *
this);
1393 _M_before_begin._M_nxt =
nullptr;
1394 _M_assign(std::forward<_Ht>(__ht), __roan);
1395 if (__former_buckets)
1396 _M_deallocate_buckets(__former_buckets, __former_bucket_count);
1397 __rehash_guard._M_guarded_obj =
nullptr;
1401 if (__former_buckets)
1404 _M_deallocate_buckets();
1405 _M_buckets = __former_buckets;
1406 _M_bucket_count = __former_bucket_count;
1408 __builtin_memset(_M_buckets, 0,
1409 _M_bucket_count *
sizeof(__node_base_ptr));
1410 __throw_exception_again;
1414 template<
typename _Key,
typename _Value,
typename _Alloc,
1415 typename _ExtractKey,
typename _Equal,
1416 typename _Hash,
typename _RangeHash,
typename _Unused,
1417 typename _RehashPolicy,
typename _Traits>
1418 template<
typename _Ht,
typename _NodeGenerator>
1420 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1421 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1422 _M_assign(_Ht&& __ht,
const _NodeGenerator& __node_gen)
1424 __buckets_ptr __buckets =
nullptr;
1426 _M_buckets = __buckets = _M_allocate_buckets(_M_bucket_count);
1430 if (!__ht._M_before_begin._M_nxt)
1435 __node_ptr __ht_n = __ht._M_begin();
1437 = __node_gen(__fwd_value_for<_Ht>(__ht_n->_M_v()));
1438 this->_M_copy_code(*__this_n, *__ht_n);
1439 _M_update_bbegin(__this_n);
1442 __node_ptr __prev_n = __this_n;
1443 for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next())
1445 __this_n = __node_gen(__fwd_value_for<_Ht>(__ht_n->_M_v()));
1446 __prev_n->_M_nxt = __this_n;
1447 this->_M_copy_code(*__this_n, *__ht_n);
1448 size_type __bkt = _M_bucket_index(*__this_n);
1449 if (!_M_buckets[__bkt])
1450 _M_buckets[__bkt] = __prev_n;
1451 __prev_n = __this_n;
1458 _M_deallocate_buckets();
1459 __throw_exception_again;
1463 template<
typename _Key,
typename _Value,
typename _Alloc,
1464 typename _ExtractKey,
typename _Equal,
1465 typename _Hash,
typename _RangeHash,
typename _Unused,
1466 typename _RehashPolicy,
typename _Traits>
1468 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1469 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1472 _M_rehash_policy._M_reset();
1473 _M_bucket_count = 1;
1474 _M_single_bucket =
nullptr;
1475 _M_buckets = &_M_single_bucket;
1476 _M_before_begin._M_nxt =
nullptr;
1477 _M_element_count = 0;
1480 template<
typename _Key,
typename _Value,
typename _Alloc,
1481 typename _ExtractKey,
typename _Equal,
1482 typename _Hash,
typename _RangeHash,
typename _Unused,
1483 typename _RehashPolicy,
typename _Traits>
1485 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1486 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1487 _M_move_assign(_Hashtable&& __ht,
true_type)
1492 this->_M_deallocate_nodes(_M_begin());
1493 _M_deallocate_buckets();
1494 __hashtable_base::operator=(
std::move(__ht));
1495 _M_rehash_policy = __ht._M_rehash_policy;
1496 if (!__ht._M_uses_single_bucket())
1497 _M_buckets = __ht._M_buckets;
1500 _M_buckets = &_M_single_bucket;
1501 _M_single_bucket = __ht._M_single_bucket;
1504 _M_bucket_count = __ht._M_bucket_count;
1505 _M_before_begin._M_nxt = __ht._M_before_begin._M_nxt;
1506 _M_element_count = __ht._M_element_count;
1507 std::__alloc_on_move(this->_M_node_allocator(), __ht._M_node_allocator());
1514 template<
typename _Key,
typename _Value,
typename _Alloc,
1515 typename _ExtractKey,
typename _Equal,
1516 typename _Hash,
typename _RangeHash,
typename _Unused,
1517 typename _RehashPolicy,
typename _Traits>
1519 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1520 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1521 _M_move_assign(_Hashtable&& __ht,
false_type)
1523 if (__ht._M_node_allocator() == this->_M_node_allocator())
1533 template<
typename _Key,
typename _Value,
typename _Alloc,
1534 typename _ExtractKey,
typename _Equal,
1535 typename _Hash,
typename _RangeHash,
typename _Unused,
1536 typename _RehashPolicy,
typename _Traits>
1537 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1538 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1539 _Hashtable(
const _Hashtable& __ht)
1540 : __hashtable_base(__ht),
1542 __rehash_base(__ht),
1544 __node_alloc_traits::_S_select_on_copy(__ht._M_node_allocator())),
1545 __enable_default_ctor(__ht),
1546 _M_buckets(nullptr),
1547 _M_bucket_count(__ht._M_bucket_count),
1548 _M_element_count(__ht._M_element_count),
1549 _M_rehash_policy(__ht._M_rehash_policy)
1551 __alloc_node_gen_t __alloc_node_gen(*
this);
1552 _M_assign(__ht, __alloc_node_gen);
1555 template<
typename _Key,
typename _Value,
typename _Alloc,
1556 typename _ExtractKey,
typename _Equal,
1557 typename _Hash,
typename _RangeHash,
typename _Unused,
1558 typename _RehashPolicy,
typename _Traits>
1559 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1560 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1561 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1563 noexcept(_S_nothrow_move())
1564 : __hashtable_base(__ht),
1566 __rehash_base(__ht),
1568 __enable_default_ctor(__ht),
1569 _M_buckets(__ht._M_buckets),
1570 _M_bucket_count(__ht._M_bucket_count),
1571 _M_before_begin(__ht._M_before_begin._M_nxt),
1572 _M_element_count(__ht._M_element_count),
1573 _M_rehash_policy(__ht._M_rehash_policy)
1576 if (__ht._M_uses_single_bucket())
1578 _M_buckets = &_M_single_bucket;
1579 _M_single_bucket = __ht._M_single_bucket;
1588 template<
typename _Key,
typename _Value,
typename _Alloc,
1589 typename _ExtractKey,
typename _Equal,
1590 typename _Hash,
typename _RangeHash,
typename _Unused,
1591 typename _RehashPolicy,
typename _Traits>
1592 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1593 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1594 _Hashtable(
const _Hashtable& __ht,
const allocator_type& __a)
1595 : __hashtable_base(__ht),
1597 __rehash_base(__ht),
1598 __hashtable_alloc(__node_alloc_type(__a)),
1599 __enable_default_ctor(__ht),
1601 _M_bucket_count(__ht._M_bucket_count),
1602 _M_element_count(__ht._M_element_count),
1603 _M_rehash_policy(__ht._M_rehash_policy)
1605 __alloc_node_gen_t __alloc_node_gen(*
this);
1606 _M_assign(__ht, __alloc_node_gen);
1609 template<
typename _Key,
typename _Value,
typename _Alloc,
1610 typename _ExtractKey,
typename _Equal,
1611 typename _Hash,
typename _RangeHash,
typename _Unused,
1612 typename _RehashPolicy,
typename _Traits>
1613 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1614 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1615 _Hashtable(_Hashtable&& __ht, __node_alloc_type&& __a,
1617 : __hashtable_base(__ht),
1619 __rehash_base(__ht),
1620 __hashtable_alloc(
std::
move(__a)),
1621 __enable_default_ctor(__ht),
1622 _M_buckets(nullptr),
1623 _M_bucket_count(__ht._M_bucket_count),
1624 _M_element_count(__ht._M_element_count),
1625 _M_rehash_policy(__ht._M_rehash_policy)
1627 if (__ht._M_node_allocator() == this->_M_node_allocator())
1629 if (__ht._M_uses_single_bucket())
1631 _M_buckets = &_M_single_bucket;
1632 _M_single_bucket = __ht._M_single_bucket;
1635 _M_buckets = __ht._M_buckets;
1639 _M_update_bbegin(__ht._M_begin());
1645 __alloc_node_gen_t __alloc_gen(*
this);
1647 using _Fwd_Ht = __conditional_t<
1648 __move_if_noexcept_cond<value_type>::value,
1649 const _Hashtable&, _Hashtable&&>;
1650 _M_assign(std::forward<_Fwd_Ht>(__ht), __alloc_gen);
1655 template<
typename _Key,
typename _Value,
typename _Alloc,
1656 typename _ExtractKey,
typename _Equal,
1657 typename _Hash,
typename _RangeHash,
typename _Unused,
1658 typename _RehashPolicy,
typename _Traits>
1659 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1660 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1661 ~_Hashtable() noexcept
1666 static_assert(
noexcept(declval<const __hash_code_base_access&>()
1667 ._M_bucket_index(declval<const __node_value_type&>(),
1669 "Cache the hash code or qualify your functors involved"
1670 " in hash code and bucket index computation with noexcept");
1673 _M_deallocate_buckets();
1676 template<
typename _Key,
typename _Value,
typename _Alloc,
1677 typename _ExtractKey,
typename _Equal,
1678 typename _Hash,
typename _RangeHash,
typename _Unused,
1679 typename _RehashPolicy,
typename _Traits>
1681 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1682 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>
::
1683 swap(_Hashtable& __x)
1684 noexcept(__and_<__is_nothrow_swappable<_Hash>,
1685 __is_nothrow_swappable<_Equal>>::value)
1692 std::__alloc_on_swap(this->_M_node_allocator(), __x._M_node_allocator());
1693 std::swap(_M_rehash_policy, __x._M_rehash_policy);
1696 if (this->_M_uses_single_bucket())
1698 if (!__x._M_uses_single_bucket())
1700 _M_buckets = __x._M_buckets;
1701 __x._M_buckets = &__x._M_single_bucket;
1704 else if (__x._M_uses_single_bucket())
1706 __x._M_buckets = _M_buckets;
1707 _M_buckets = &_M_single_bucket;
1710 std::swap(_M_buckets, __x._M_buckets);
1712 std::swap(_M_bucket_count, __x._M_bucket_count);
1713 std::swap(_M_before_begin._M_nxt, __x._M_before_begin._M_nxt);
1714 std::swap(_M_element_count, __x._M_element_count);
1715 std::swap(_M_single_bucket, __x._M_single_bucket);
1720 __x._M_update_bbegin();
1723 template<
typename _Key,
typename _Value,
typename _Alloc,
1724 typename _ExtractKey,
typename _Equal,
1725 typename _Hash,
typename _RangeHash,
typename _Unused,
1726 typename _RehashPolicy,
typename _Traits>
1728 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1729 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1730 find(
const key_type& __k)
1733 if (
size() <= __small_size_threshold())
1735 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
1736 if (this->_M_key_equals(__k, *__it))
1737 return iterator(__it);
1741 __hash_code __code = this->_M_hash_code(__k);
1742 std::size_t __bkt = _M_bucket_index(__code);
1743 return iterator(_M_find_node(__bkt, __k, __code));
1746 template<
typename _Key,
typename _Value,
typename _Alloc,
1747 typename _ExtractKey,
typename _Equal,
1748 typename _Hash,
typename _RangeHash,
typename _Unused,
1749 typename _RehashPolicy,
typename _Traits>
1751 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1752 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1753 find(
const key_type& __k)
const
1756 if (
size() <= __small_size_threshold())
1758 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
1759 if (this->_M_key_equals(__k, *__it))
1760 return const_iterator(__it);
1764 __hash_code __code = this->_M_hash_code(__k);
1765 std::size_t __bkt = _M_bucket_index(__code);
1766 return const_iterator(_M_find_node(__bkt, __k, __code));
1769#if __cplusplus > 201703L
1770 template<
typename _Key,
typename _Value,
typename _Alloc,
1771 typename _ExtractKey,
typename _Equal,
1772 typename _Hash,
typename _RangeHash,
typename _Unused,
1773 typename _RehashPolicy,
typename _Traits>
1774 template<
typename _Kt,
typename,
typename>
1776 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1777 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1778 _M_find_tr(
const _Kt& __k)
1781 if (
size() <= __small_size_threshold())
1783 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1784 if (this->_M_key_equals_tr(__k, *__n))
1785 return iterator(__n);
1789 __hash_code __code = this->_M_hash_code_tr(__k);
1790 std::size_t __bkt = _M_bucket_index(__code);
1791 return iterator(_M_find_node_tr(__bkt, __k, __code));
1794 template<
typename _Key,
typename _Value,
typename _Alloc,
1795 typename _ExtractKey,
typename _Equal,
1796 typename _Hash,
typename _RangeHash,
typename _Unused,
1797 typename _RehashPolicy,
typename _Traits>
1798 template<
typename _Kt,
typename,
typename>
1800 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1801 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1802 _M_find_tr(
const _Kt& __k)
const
1805 if (
size() <= __small_size_threshold())
1807 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1808 if (this->_M_key_equals_tr(__k, *__n))
1809 return const_iterator(__n);
1813 __hash_code __code = this->_M_hash_code_tr(__k);
1814 std::size_t __bkt = _M_bucket_index(__code);
1815 return const_iterator(_M_find_node_tr(__bkt, __k, __code));
1819 template<
typename _Key,
typename _Value,
typename _Alloc,
1820 typename _ExtractKey,
typename _Equal,
1821 typename _Hash,
typename _RangeHash,
typename _Unused,
1822 typename _RehashPolicy,
typename _Traits>
1824 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1825 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1826 count(
const key_type& __k)
const
1829 auto __it = find(__k);
1833 if (__unique_keys::value)
1836 size_type __result = 1;
1837 for (
auto __ref = __it++;
1838 __it._M_cur && this->_M_node_equals(*__ref._M_cur, *__it._M_cur);
1845#if __cplusplus > 201703L
1846 template<
typename _Key,
typename _Value,
typename _Alloc,
1847 typename _ExtractKey,
typename _Equal,
1848 typename _Hash,
typename _RangeHash,
typename _Unused,
1849 typename _RehashPolicy,
typename _Traits>
1850 template<
typename _Kt,
typename,
typename>
1852 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1853 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1854 _M_count_tr(
const _Kt& __k)
const
1857 if (
size() <= __small_size_threshold())
1859 size_type __result = 0;
1860 for (
auto __n = _M_begin(); __n; __n = __n->_M_next())
1862 if (this->_M_key_equals_tr(__k, *__n))
1875 __hash_code __code = this->_M_hash_code_tr(__k);
1876 std::size_t __bkt = _M_bucket_index(__code);
1877 auto __n = _M_find_node_tr(__bkt, __k, __code);
1882 size_type __result = 1;
1884 __it._M_cur && this->_M_equals_tr(__k, __code, *__it._M_cur);
1892 template<
typename _Key,
typename _Value,
typename _Alloc,
1893 typename _ExtractKey,
typename _Equal,
1894 typename _Hash,
typename _RangeHash,
typename _Unused,
1895 typename _RehashPolicy,
typename _Traits>
1897 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1898 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1899 equal_range(
const key_type& __k)
1900 -> pair<iterator, iterator>
1902 auto __ite = find(__k);
1904 return { __ite, __ite };
1906 auto __beg = __ite++;
1907 if (__unique_keys::value)
1908 return { __beg, __ite };
1910 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
1913 return { __beg, __ite };
1916 template<
typename _Key,
typename _Value,
typename _Alloc,
1917 typename _ExtractKey,
typename _Equal,
1918 typename _Hash,
typename _RangeHash,
typename _Unused,
1919 typename _RehashPolicy,
typename _Traits>
1921 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1922 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1923 equal_range(
const key_type& __k)
const
1924 -> pair<const_iterator, const_iterator>
1926 auto __ite = find(__k);
1928 return { __ite, __ite };
1930 auto __beg = __ite++;
1931 if (__unique_keys::value)
1932 return { __beg, __ite };
1934 while (__ite._M_cur && this->_M_node_equals(*__beg._M_cur, *__ite._M_cur))
1937 return { __beg, __ite };
1940#if __cplusplus > 201703L
1941 template<
typename _Key,
typename _Value,
typename _Alloc,
1942 typename _ExtractKey,
typename _Equal,
1943 typename _Hash,
typename _RangeHash,
typename _Unused,
1944 typename _RehashPolicy,
typename _Traits>
1945 template<
typename _Kt,
typename,
typename>
1947 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1948 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1949 _M_equal_range_tr(
const _Kt& __k)
1950 -> pair<iterator, iterator>
1952 if (
size() <= __small_size_threshold())
1954 __node_ptr __n, __beg =
nullptr;
1955 for (__n = _M_begin(); __n; __n = __n->_M_next())
1957 if (this->_M_key_equals_tr(__k, *__n))
1968 return { iterator(__beg), iterator(__n) };
1971 __hash_code __code = this->_M_hash_code_tr(__k);
1972 std::size_t __bkt = _M_bucket_index(__code);
1973 auto __n = _M_find_node_tr(__bkt, __k, __code);
1974 iterator __ite(__n);
1976 return { __ite, __ite };
1978 auto __beg = __ite++;
1979 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
1982 return { __beg, __ite };
1985 template<
typename _Key,
typename _Value,
typename _Alloc,
1986 typename _ExtractKey,
typename _Equal,
1987 typename _Hash,
typename _RangeHash,
typename _Unused,
1988 typename _RehashPolicy,
typename _Traits>
1989 template<
typename _Kt,
typename,
typename>
1991 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1992 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1993 _M_equal_range_tr(
const _Kt& __k)
const
1994 -> pair<const_iterator, const_iterator>
1996 if (
size() <= __small_size_threshold())
1998 __node_ptr __n, __beg =
nullptr;
1999 for (__n = _M_begin(); __n; __n = __n->_M_next())
2001 if (this->_M_key_equals_tr(__k, *__n))
2012 return { const_iterator(__beg), const_iterator(__n) };
2015 __hash_code __code = this->_M_hash_code_tr(__k);
2016 std::size_t __bkt = _M_bucket_index(__code);
2017 auto __n = _M_find_node_tr(__bkt, __k, __code);
2018 const_iterator __ite(__n);
2020 return { __ite, __ite };
2022 auto __beg = __ite++;
2023 while (__ite._M_cur && this->_M_equals_tr(__k, __code, *__ite._M_cur))
2026 return { __beg, __ite };
2032 template<
typename _Key,
typename _Value,
typename _Alloc,
2033 typename _ExtractKey,
typename _Equal,
2034 typename _Hash,
typename _RangeHash,
typename _Unused,
2035 typename _RehashPolicy,
typename _Traits>
2037 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2038 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2039 _M_find_before_node(
const key_type& __k)
2042 __node_base_ptr __prev_p = &_M_before_begin;
2043 if (!__prev_p->_M_nxt)
2046 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);
2048 __p = __p->_M_next())
2050 if (this->_M_key_equals(__k, *__p))
2061 template<
typename _Key,
typename _Value,
typename _Alloc,
2062 typename _ExtractKey,
typename _Equal,
2063 typename _Hash,
typename _RangeHash,
typename _Unused,
2064 typename _RehashPolicy,
typename _Traits>
2066 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2067 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2068 _M_find_before_node(size_type __bkt,
const key_type& __k,
2069 __hash_code __code)
const
2072 __node_base_ptr __prev_p = _M_buckets[__bkt];
2076 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2077 __p = __p->_M_next())
2079 if (this->_M_equals(__k, __code, *__p))
2082 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2090 template<
typename _Key,
typename _Value,
typename _Alloc,
2091 typename _ExtractKey,
typename _Equal,
2092 typename _Hash,
typename _RangeHash,
typename _Unused,
2093 typename _RehashPolicy,
typename _Traits>
2094 template<
typename _Kt>
2096 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2097 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2098 _M_find_before_node_tr(size_type __bkt,
const _Kt& __k,
2099 __hash_code __code)
const
2102 __node_base_ptr __prev_p = _M_buckets[__bkt];
2106 for (__node_ptr __p =
static_cast<__node_ptr
>(__prev_p->_M_nxt);;
2107 __p = __p->_M_next())
2109 if (this->_M_equals_tr(__k, __code, *__p))
2112 if (!__p->_M_nxt || _M_bucket_index(*__p->_M_next()) != __bkt)
2120 template<
typename _Key,
typename _Value,
typename _Alloc,
2121 typename _ExtractKey,
typename _Equal,
2122 typename _Hash,
typename _RangeHash,
typename _Unused,
2123 typename _RehashPolicy,
typename _Traits>
2125 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2126 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2127 _M_get_previous_node(size_type __bkt, __node_ptr __n)
2130 __node_base_ptr __prev_n = _M_buckets[__bkt];
2131 while (__prev_n->_M_nxt != __n)
2132 __prev_n = __prev_n->_M_nxt;
2136 template<
typename _Key,
typename _Value,
typename _Alloc,
2137 typename _ExtractKey,
typename _Equal,
2138 typename _Hash,
typename _RangeHash,
typename _Unused,
2139 typename _RehashPolicy,
typename _Traits>
2140 template<
typename... _Args>
2142 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2143 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2144 _M_emplace(
true_type , _Args&&... __args)
2145 -> pair<iterator, bool>
2148 _Scoped_node __node {
this, std::forward<_Args>(__args)... };
2149 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v());
2150 const size_type __size =
size();
2151 if (__size <= __small_size_threshold())
2153 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
2154 if (this->_M_key_equals(__k, *__it))
2156 return { iterator(__it),
false };
2159 __hash_code __code = this->_M_hash_code(__k);
2160 size_type __bkt = _M_bucket_index(__code);
2161 if (__size > __small_size_threshold())
2162 if (__node_ptr __p = _M_find_node(__bkt, __k, __code))
2164 return { iterator(__p),
false };
2167 auto __pos = _M_insert_unique_node(__bkt, __code, __node._M_node);
2168 __node._M_node =
nullptr;
2169 return { __pos,
true };
2172 template<
typename _Key,
typename _Value,
typename _Alloc,
2173 typename _ExtractKey,
typename _Equal,
2174 typename _Hash,
typename _RangeHash,
typename _Unused,
2175 typename _RehashPolicy,
typename _Traits>
2176 template<
typename... _Args>
2178 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2179 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2180 _M_emplace(const_iterator __hint,
false_type ,
2185 _Scoped_node __node {
this, std::forward<_Args>(__args)... };
2186 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v());
2188 auto __res = this->_M_compute_hash_code(__hint._M_cur, __k);
2190 = _M_insert_multi_node(__res.first, __res.second, __node._M_node);
2191 __node._M_node =
nullptr;
2195 template<
typename _Key,
typename _Value,
typename _Alloc,
2196 typename _ExtractKey,
typename _Equal,
2197 typename _Hash,
typename _RangeHash,
typename _Unused,
2198 typename _RehashPolicy,
typename _Traits>
2200 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2201 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2202 _M_compute_hash_code(__node_ptr __hint,
const key_type& __k)
const
2203 -> pair<__node_ptr, __hash_code>
2205 if (
size() <= __small_size_threshold())
2209 for (
auto __it = __hint; __it; __it = __it->_M_next())
2210 if (this->_M_key_equals(__k, *__it))
2211 return { __it, this->_M_hash_code(*__it) };
2214 for (
auto __it = _M_begin(); __it != __hint; __it = __it->_M_next())
2215 if (this->_M_key_equals(__k, *__it))
2216 return { __it, this->_M_hash_code(*__it) };
2221 return { __hint, this->_M_hash_code(__k) };
2224 template<
typename _Key,
typename _Value,
typename _Alloc,
2225 typename _ExtractKey,
typename _Equal,
2226 typename _Hash,
typename _RangeHash,
typename _Unused,
2227 typename _RehashPolicy,
typename _Traits>
2229 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2230 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2231 _M_insert_unique_node(size_type __bkt, __hash_code __code,
2232 __node_ptr __node, size_type __n_elt)
2235 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2237 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count,
2240 if (__do_rehash.
first)
2243 __bkt = _M_bucket_index(__code);
2246 __rehash_guard._M_guarded_obj =
nullptr;
2247 this->_M_store_code(*__node, __code);
2250 _M_insert_bucket_begin(__bkt, __node);
2252 return iterator(__node);
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>
2260 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2261 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2262 _M_insert_multi_node(__node_ptr __hint,
2263 __hash_code __code, __node_ptr __node)
2266 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2268 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1);
2270 if (__do_rehash.
first)
2273 __rehash_guard._M_guarded_obj =
nullptr;
2274 this->_M_store_code(*__node, __code);
2275 const key_type& __k = _ExtractKey{}(__node->_M_v());
2276 size_type __bkt = _M_bucket_index(__code);
2280 __node_base_ptr __prev
2281 = __builtin_expect(__hint !=
nullptr,
false)
2282 && this->_M_equals(__k, __code, *__hint)
2284 : _M_find_before_node(__bkt, __k, __code);
2289 __node->_M_nxt = __prev->_M_nxt;
2290 __prev->_M_nxt = __node;
2291 if (__builtin_expect(__prev == __hint,
false))
2295 && !this->_M_equals(__k, __code, *__node->_M_next()))
2297 size_type __next_bkt = _M_bucket_index(*__node->_M_next());
2298 if (__next_bkt != __bkt)
2299 _M_buckets[__next_bkt] = __node;
2306 _M_insert_bucket_begin(__bkt, __node);
2308 return iterator(__node);
2312 template<
typename _Key,
typename _Value,
typename _Alloc,
2313 typename _ExtractKey,
typename _Equal,
2314 typename _Hash,
typename _RangeHash,
typename _Unused,
2315 typename _RehashPolicy,
typename _Traits>
2316 template<
typename _Kt,
typename _Arg,
typename _NodeGenerator>
2318 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2319 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2320 _M_insert_unique(_Kt&& __k, _Arg&& __v,
2321 const _NodeGenerator& __node_gen)
2322 -> pair<iterator, bool>
2324 const size_type __size =
size();
2325 if (__size <= __small_size_threshold())
2326 for (
auto __it = _M_begin(); __it; __it = __it->_M_next())
2327 if (this->_M_key_equals_tr(__k, *__it))
2328 return { iterator(__it),
false };
2330 __hash_code __code = this->_M_hash_code_tr(__k);
2331 size_type __bkt = _M_bucket_index(__code);
2333 if (__size > __small_size_threshold())
2334 if (__node_ptr __node = _M_find_node_tr(__bkt, __k, __code))
2335 return { iterator(__node),
false };
2337 _Scoped_node __node {
2338 __node_builder_t::_S_build(std::forward<_Kt>(__k),
2339 std::forward<_Arg>(__v),
2344 = _M_insert_unique_node(__bkt, __code, __node._M_node);
2345 __node._M_node =
nullptr;
2346 return { __pos,
true };
2350 template<
typename _Key,
typename _Value,
typename _Alloc,
2351 typename _ExtractKey,
typename _Equal,
2352 typename _Hash,
typename _RangeHash,
typename _Unused,
2353 typename _RehashPolicy,
typename _Traits>
2354 template<
typename _Arg,
typename _NodeGenerator>
2356 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2357 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2358 _M_insert(const_iterator __hint, _Arg&& __v,
2359 const _NodeGenerator& __node_gen,
2364 _Scoped_node __node{ __node_gen(std::forward<_Arg>(__v)),
this };
2367 auto __res = this->_M_compute_hash_code(
2368 __hint._M_cur, _ExtractKey{}(__node._M_node->_M_v()));
2371 = _M_insert_multi_node(__res.first, __res.second, __node._M_node);
2372 __node._M_node =
nullptr;
2376 template<
typename _Key,
typename _Value,
typename _Alloc,
2377 typename _ExtractKey,
typename _Equal,
2378 typename _Hash,
typename _RangeHash,
typename _Unused,
2379 typename _RehashPolicy,
typename _Traits>
2381 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2382 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2383 erase(const_iterator __it)
2386 __node_ptr __n = __it._M_cur;
2387 std::size_t __bkt = _M_bucket_index(*__n);
2392 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2393 return _M_erase(__bkt, __prev_n, __n);
2396 template<
typename _Key,
typename _Value,
typename _Alloc,
2397 typename _ExtractKey,
typename _Equal,
2398 typename _Hash,
typename _RangeHash,
typename _Unused,
2399 typename _RehashPolicy,
typename _Traits>
2401 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2402 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2403 _M_erase(size_type __bkt, __node_base_ptr __prev_n, __node_ptr __n)
2406 if (__prev_n == _M_buckets[__bkt])
2407 _M_remove_bucket_begin(__bkt, __n->_M_next(),
2408 __n->_M_nxt ? _M_bucket_index(*__n->_M_next()) : 0);
2409 else if (__n->_M_nxt)
2411 size_type __next_bkt = _M_bucket_index(*__n->_M_next());
2412 if (__next_bkt != __bkt)
2413 _M_buckets[__next_bkt] = __prev_n;
2416 __prev_n->_M_nxt = __n->_M_nxt;
2417 iterator __result(__n->_M_next());
2418 this->_M_deallocate_node(__n);
2424 template<
typename _Key,
typename _Value,
typename _Alloc,
2425 typename _ExtractKey,
typename _Equal,
2426 typename _Hash,
typename _RangeHash,
typename _Unused,
2427 typename _RehashPolicy,
typename _Traits>
2429 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2430 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2431 _M_erase(
true_type ,
const key_type& __k)
2434 __node_base_ptr __prev_n;
2437 if (
size() <= __small_size_threshold())
2439 __prev_n = _M_find_before_node(__k);
2444 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2445 __bkt = _M_bucket_index(*__n);
2449 __hash_code __code = this->_M_hash_code(__k);
2450 __bkt = _M_bucket_index(__code);
2453 __prev_n = _M_find_before_node(__bkt, __k, __code);
2458 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2461 _M_erase(__bkt, __prev_n, __n);
2465 template<
typename _Key,
typename _Value,
typename _Alloc,
2466 typename _ExtractKey,
typename _Equal,
2467 typename _Hash,
typename _RangeHash,
typename _Unused,
2468 typename _RehashPolicy,
typename _Traits>
2470 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2471 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2476 __node_base_ptr __prev_n;
2478 if (
size() <= __small_size_threshold())
2480 __prev_n = _M_find_before_node(__k);
2485 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2486 __bkt = _M_bucket_index(*__n);
2490 __hash_code __code = this->_M_hash_code(__k);
2491 __bkt = _M_bucket_index(__code);
2494 __prev_n = _M_find_before_node(__bkt, __k, __code);
2498 __n =
static_cast<__node_ptr
>(__prev_n->_M_nxt);
2507 __node_ptr __n_last = __n->_M_next();
2508 while (__n_last && this->_M_node_equals(*__n, *__n_last))
2509 __n_last = __n_last->_M_next();
2511 std::size_t __n_last_bkt = __n_last ? _M_bucket_index(*__n_last) : __bkt;
2514 size_type __result = 0;
2517 __node_ptr __p = __n->_M_next();
2518 this->_M_deallocate_node(__n);
2522 while (__n != __n_last);
2524 _M_element_count -= __result;
2525 if (__prev_n == _M_buckets[__bkt])
2526 _M_remove_bucket_begin(__bkt, __n_last, __n_last_bkt);
2527 else if (__n_last_bkt != __bkt)
2528 _M_buckets[__n_last_bkt] = __prev_n;
2529 __prev_n->_M_nxt = __n_last;
2533 template<
typename _Key,
typename _Value,
typename _Alloc,
2534 typename _ExtractKey,
typename _Equal,
2535 typename _Hash,
typename _RangeHash,
typename _Unused,
2536 typename _RehashPolicy,
typename _Traits>
2538 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2539 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2540 erase(const_iterator __first, const_iterator __last)
2543 __node_ptr __n = __first._M_cur;
2544 __node_ptr __last_n = __last._M_cur;
2545 if (__n == __last_n)
2546 return iterator(__n);
2548 std::size_t __bkt = _M_bucket_index(*__n);
2550 __node_base_ptr __prev_n = _M_get_previous_node(__bkt, __n);
2551 bool __is_bucket_begin = __n == _M_bucket_begin(__bkt);
2552 std::size_t __n_bkt = __bkt;
2557 __node_ptr __tmp = __n;
2558 __n = __n->_M_next();
2559 this->_M_deallocate_node(__tmp);
2563 __n_bkt = _M_bucket_index(*__n);
2565 while (__n != __last_n && __n_bkt == __bkt);
2566 if (__is_bucket_begin)
2567 _M_remove_bucket_begin(__bkt, __n, __n_bkt);
2568 if (__n == __last_n)
2570 __is_bucket_begin =
true;
2574 if (__n && (__n_bkt != __bkt || __is_bucket_begin))
2575 _M_buckets[__n_bkt] = __prev_n;
2576 __prev_n->_M_nxt = __n;
2577 return iterator(__n);
2580 template<
typename _Key,
typename _Value,
typename _Alloc,
2581 typename _ExtractKey,
typename _Equal,
2582 typename _Hash,
typename _RangeHash,
typename _Unused,
2583 typename _RehashPolicy,
typename _Traits>
2585 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2586 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2589 this->_M_deallocate_nodes(_M_begin());
2590 __builtin_memset(_M_buckets, 0,
2591 _M_bucket_count *
sizeof(__node_base_ptr));
2592 _M_element_count = 0;
2593 _M_before_begin._M_nxt =
nullptr;
2596 template<
typename _Key,
typename _Value,
typename _Alloc,
2597 typename _ExtractKey,
typename _Equal,
2598 typename _Hash,
typename _RangeHash,
typename _Unused,
2599 typename _RehashPolicy,
typename _Traits>
2601 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2602 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2603 rehash(size_type __bkt_count)
2605 __rehash_guard_t __rehash_guard(_M_rehash_policy);
2607 =
std::max(_M_rehash_policy._M_bkt_for_elements(_M_element_count + 1),
2609 __bkt_count = _M_rehash_policy._M_next_bkt(__bkt_count);
2611 if (__bkt_count != _M_bucket_count)
2613 _M_rehash(__bkt_count, __unique_keys{});
2614 __rehash_guard._M_guarded_obj =
nullptr;
2619 template<
typename _Key,
typename _Value,
typename _Alloc,
2620 typename _ExtractKey,
typename _Equal,
2621 typename _Hash,
typename _RangeHash,
typename _Unused,
2622 typename _RehashPolicy,
typename _Traits>
2624 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2625 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2626 _M_rehash(size_type __bkt_count,
true_type )
2628 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2629 __node_ptr __p = _M_begin();
2630 _M_before_begin._M_nxt =
nullptr;
2631 std::size_t __bbegin_bkt = 0;
2634 __node_ptr __next = __p->_M_next();
2636 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2637 if (!__new_buckets[__bkt])
2639 __p->_M_nxt = _M_before_begin._M_nxt;
2640 _M_before_begin._M_nxt = __p;
2641 __new_buckets[__bkt] = &_M_before_begin;
2643 __new_buckets[__bbegin_bkt] = __p;
2644 __bbegin_bkt = __bkt;
2648 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2649 __new_buckets[__bkt]->_M_nxt = __p;
2655 _M_deallocate_buckets();
2656 _M_bucket_count = __bkt_count;
2657 _M_buckets = __new_buckets;
2662 template<
typename _Key,
typename _Value,
typename _Alloc,
2663 typename _ExtractKey,
typename _Equal,
2664 typename _Hash,
typename _RangeHash,
typename _Unused,
2665 typename _RehashPolicy,
typename _Traits>
2667 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
2668 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
2669 _M_rehash(size_type __bkt_count,
false_type )
2671 __buckets_ptr __new_buckets = _M_allocate_buckets(__bkt_count);
2672 __node_ptr __p = _M_begin();
2673 _M_before_begin._M_nxt =
nullptr;
2674 std::size_t __bbegin_bkt = 0;
2675 std::size_t __prev_bkt = 0;
2676 __node_ptr __prev_p =
nullptr;
2677 bool __check_bucket =
false;
2681 __node_ptr __next = __p->_M_next();
2683 = __hash_code_base::_M_bucket_index(*__p, __bkt_count);
2685 if (__prev_p && __prev_bkt == __bkt)
2690 __p->_M_nxt = __prev_p->_M_nxt;
2691 __prev_p->_M_nxt = __p;
2698 __check_bucket =
true;
2706 if (__prev_p->_M_nxt)
2708 std::size_t __next_bkt
2709 = __hash_code_base::_M_bucket_index(
2710 *__prev_p->_M_next(), __bkt_count);
2711 if (__next_bkt != __prev_bkt)
2712 __new_buckets[__next_bkt] = __prev_p;
2714 __check_bucket =
false;
2717 if (!__new_buckets[__bkt])
2719 __p->_M_nxt = _M_before_begin._M_nxt;
2720 _M_before_begin._M_nxt = __p;
2721 __new_buckets[__bkt] = &_M_before_begin;
2723 __new_buckets[__bbegin_bkt] = __p;
2724 __bbegin_bkt = __bkt;
2728 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
2729 __new_buckets[__bkt]->_M_nxt = __p;
2737 if (__check_bucket && __prev_p->_M_nxt)
2739 std::size_t __next_bkt
2740 = __hash_code_base::_M_bucket_index(*__prev_p->_M_next(),
2742 if (__next_bkt != __prev_bkt)
2743 __new_buckets[__next_bkt] = __prev_p;
2746 _M_deallocate_buckets();
2747 _M_bucket_count = __bkt_count;
2748 _M_buckets = __new_buckets;
2751#if __cplusplus > 201402L
2752 template<
typename,
typename,
typename>
class _Hash_merge_helper { };
2755#if __cpp_deduction_guides >= 201606
2757 template<
typename _Hash>
2758 using _RequireNotAllocatorOrIntegral
2759 = __enable_if_t<!__or_<is_integral<_Hash>, __is_allocator<_Hash>>::value>;
2763_GLIBCXX_END_NAMESPACE_VERSION
__bool_constant< true > true_type
The type used as a compile-time boolean with true value.
__bool_constant< false > false_type
The type used as a compile-time boolean with false value.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
constexpr const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
void swap(basic_regex< _Ch_type, _Rx_traits > &__lhs, basic_regex< _Ch_type, _Rx_traits > &__rhs) noexcept
Swaps the contents of two regular expression objects.
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.
constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to one past the last element of the initializer_list.
Struct holding two objects of arbitrary type.
_T1 first
The first member.
_T2 second
The second member.