31#ifndef _HASHTABLE_POLICY_H
32#define _HASHTABLE_POLICY_H 1
42namespace std _GLIBCXX_VISIBILITY(default)
44_GLIBCXX_BEGIN_NAMESPACE_VERSION
47 template<
typename _Key,
typename _Value,
typename _Alloc,
48 typename _ExtractKey,
typename _Equal,
49 typename _Hash,
typename _RangeHash,
typename _Unused,
50 typename _RehashPolicy,
typename _Traits>
60 template<
typename _Key,
typename _Value,
typename _ExtractKey,
61 typename _Equal,
typename _Hash,
typename _RangeHash,
62 typename _Unused,
typename _Traits>
63 struct _Hashtable_base;
65#pragma GCC diagnostic push
66#pragma GCC diagnostic ignored "-Wc++17-extensions"
69 template<
typename _Iterator>
71 __distance_fw(_Iterator __first, _Iterator __last)
74 if constexpr (is_convertible<_Cat, forward_iterator_tag>::value)
77 return __first != __last ? 1 : 0;
79#pragma GCC diagnostic pop
83 template<
typename _Tp>
85 operator()(_Tp&& __x)
const noexcept
86 {
return std::forward<_Tp>(__x); }
91 template<
typename _Pair>
94 template<
typename _Tp,
typename _Up>
95 struct __1st_type<pair<_Tp, _Up>>
96 {
using type = _Tp; };
98 template<
typename _Tp,
typename _Up>
99 struct __1st_type<const pair<_Tp, _Up>>
100 {
using type =
const _Tp; };
102 template<
typename _Pair>
103 struct __1st_type<_Pair&>
104 {
using type =
typename __1st_type<_Pair>::type&; };
106 template<
typename _Tp>
107 typename __1st_type<_Tp>::type&&
108 operator()(_Tp&& __x)
const noexcept
109 {
return std::forward<_Tp>(__x).first; }
112 template<
typename _ExKey>
116 struct _NodeBuilder<_Select1st>
118 template<
typename _Kt,
typename _Arg,
typename _NodeGenerator>
120 _S_build(_Kt&& __k, _Arg&& __arg, _NodeGenerator& __node_gen)
121 ->
typename _NodeGenerator::__node_ptr
123 return __node_gen(std::forward<_Kt>(__k),
124 std::forward<_Arg>(__arg).second);
129 struct _NodeBuilder<_Identity>
131 template<
typename _Kt,
typename _Arg,
typename _NodeGenerator>
133 _S_build(_Kt&& __k, _Arg&&, _NodeGenerator& __node_gen)
134 ->
typename _NodeGenerator::__node_ptr
135 {
return __node_gen(std::forward<_Kt>(__k)); }
138 template<
typename _HashtableAlloc,
typename _NodePtr>
141 _HashtableAlloc& _M_h;
147 _M_h._M_deallocate_node_ptr(_M_ptr);
151 template<
typename _NodeAlloc>
152 struct _Hashtable_alloc;
156 template<
typename _NodeAlloc>
157 struct _ReuseOrAllocNode
160 using __node_alloc_type = _NodeAlloc;
161 using __hashtable_alloc = _Hashtable_alloc<__node_alloc_type>;
162 using __node_alloc_traits =
163 typename __hashtable_alloc::__node_alloc_traits;
166 using __node_ptr =
typename __hashtable_alloc::__node_ptr;
168 _ReuseOrAllocNode(__node_ptr __nodes, __hashtable_alloc& __h)
169 : _M_nodes(__nodes), _M_h(__h) { }
170 _ReuseOrAllocNode(
const _ReuseOrAllocNode&) =
delete;
173 { _M_h._M_deallocate_nodes(_M_nodes); }
175#pragma GCC diagnostic push
176#pragma GCC diagnostic ignored "-Wc++17-extensions"
177 template<
typename _Arg>
179 operator()(_Arg&& __arg)
182 return _M_h._M_allocate_node(std::forward<_Arg>(__arg));
184 using value_type =
typename _NodeAlloc::value_type::value_type;
186 __node_ptr __node = _M_nodes;
187 if constexpr (is_assignable<value_type&, _Arg>::value)
189 __node->_M_v() = std::forward<_Arg>(__arg);
190 _M_nodes = _M_nodes->_M_next();
191 __node->_M_nxt =
nullptr;
195 _M_nodes = _M_nodes->_M_next();
196 __node->_M_nxt =
nullptr;
197 auto& __a = _M_h._M_node_allocator();
198 __node_alloc_traits::destroy(__a, __node->_M_valptr());
199 _NodePtrGuard<__hashtable_alloc, __node_ptr>
200 __guard{ _M_h, __node };
201 __node_alloc_traits::construct(__a, __node->_M_valptr(),
202 std::forward<_Arg>(__arg));
203 __guard._M_ptr =
nullptr;
207#pragma GCC diagnostic pop
211 __hashtable_alloc& _M_h;
216 template<
typename _NodeAlloc>
220 using __hashtable_alloc = _Hashtable_alloc<_NodeAlloc>;
223 using __node_ptr =
typename __hashtable_alloc::__node_ptr;
225 _AllocNode(__hashtable_alloc& __h)
228 template<
typename... _Args>
230 operator()(_Args&&... __args)
const
231 {
return _M_h._M_allocate_node(std::forward<_Args>(__args)...); }
234 __hashtable_alloc& _M_h;
262 template<
bool _Cache_hash_code,
bool _Constant_iterators,
bool _Unique_keys>
263 struct _Hashtable_traits
265 using __hash_cached = __bool_constant<_Cache_hash_code>;
266 using __constant_iterators = __bool_constant<_Constant_iterators>;
267 using __unique_keys = __bool_constant<_Unique_keys>;
276 template<
typename _Hash>
277 struct _Hashtable_hash_traits
279 static constexpr std::size_t
280 __small_size_threshold() noexcept
292 struct _Hash_node_base
294 _Hash_node_base* _M_nxt;
296 _Hash_node_base() noexcept : _M_nxt() { }
298 _Hash_node_base(_Hash_node_base* __next) noexcept : _M_nxt(__next) { }
306 template<
typename _Value>
307 struct _Hash_node_value_base
309 typedef _Value value_type;
311 __gnu_cxx::__aligned_buffer<_Value> _M_storage;
313 [[__gnu__::__always_inline__]]
316 {
return _M_storage._M_ptr(); }
318 [[__gnu__::__always_inline__]]
320 _M_valptr() const noexcept
321 {
return _M_storage._M_ptr(); }
323 [[__gnu__::__always_inline__]]
326 {
return *_M_valptr(); }
328 [[__gnu__::__always_inline__]]
330 _M_v() const noexcept
331 {
return *_M_valptr(); }
337 template<
bool _Cache_hash_code>
338 struct _Hash_node_code_cache
345 struct _Hash_node_code_cache<true>
346 { std::size_t _M_hash_code; };
348 template<
typename _Value,
bool _Cache_hash_code>
349 struct _Hash_node_value
350 : _Hash_node_value_base<_Value>
351 , _Hash_node_code_cache<_Cache_hash_code>
357 template<
typename _Value,
bool _Cache_hash_code>
360 , _Hash_node_value<_Value, _Cache_hash_code>
363 _M_next() const noexcept
364 {
return static_cast<_Hash_node*
>(this->_M_nxt); }
368 template<
typename _Value,
bool _Cache_hash_code>
369 struct _Node_iterator_base
371 using __node_type = _Hash_node<_Value, _Cache_hash_code>;
375 _Node_iterator_base() : _M_cur(nullptr) { }
376 _Node_iterator_base(__node_type* __p) noexcept
381 { _M_cur = _M_cur->_M_next(); }
384 operator==(
const _Node_iterator_base& __x,
const _Node_iterator_base& __y)
386 {
return __x._M_cur == __y._M_cur; }
388#if __cpp_impl_three_way_comparison < 201907L
390 operator!=(
const _Node_iterator_base& __x,
const _Node_iterator_base& __y)
392 {
return __x._M_cur != __y._M_cur; }
397 template<
typename _Value,
bool __constant_iterators,
bool __cache>
398 struct _Node_iterator
399 :
public _Node_iterator_base<_Value, __cache>
402 using __base_type = _Node_iterator_base<_Value, __cache>;
403 using __node_type =
typename __base_type::__node_type;
406 using value_type = _Value;
407 using difference_type = std::ptrdiff_t;
410 using pointer = __conditional_t<__constant_iterators,
411 const value_type*, value_type*>;
413 using reference = __conditional_t<__constant_iterators,
414 const value_type&, value_type&>;
416 _Node_iterator() =
default;
419 _Node_iterator(__node_type* __p) noexcept
420 : __base_type(__p) { }
424 {
return this->_M_cur->_M_v(); }
427 operator->() const noexcept
428 {
return this->_M_cur->_M_valptr(); }
431 operator++() noexcept
438 operator++(
int)
noexcept
440 _Node_iterator __tmp(*
this);
445#if __cpp_impl_three_way_comparison >= 201907L
447 operator==(
const _Node_iterator&,
const _Node_iterator&) =
default;
450 operator==(
const _Node_iterator& __x,
const _Node_iterator& __y)
noexcept
452 const __base_type& __bx = __x;
453 const __base_type& __by = __y;
458 operator!=(
const _Node_iterator& __x,
const _Node_iterator& __y)
noexcept
459 {
return !(__x == __y); }
464 template<
typename _Value,
bool __constant_iterators,
bool __cache>
465 struct _Node_const_iterator
466 :
public _Node_iterator_base<_Value, __cache>
469 using __base_type = _Node_iterator_base<_Value, __cache>;
470 using __node_type =
typename __base_type::__node_type;
474 = _Node_iterator<_Value, __constant_iterators, __cache>;
477 typedef _Value value_type;
478 typedef std::ptrdiff_t difference_type;
481 typedef const value_type* pointer;
482 typedef const value_type& reference;
484 _Node_const_iterator() =
default;
487 _Node_const_iterator(__node_type* __p) noexcept
488 : __base_type(__p) { }
490 _Node_const_iterator(
const __iterator& __x) noexcept
491 : __base_type(__x._M_cur) { }
495 {
return this->_M_cur->_M_v(); }
498 operator->() const noexcept
499 {
return this->_M_cur->_M_valptr(); }
501 _Node_const_iterator&
502 operator++() noexcept
509 operator++(
int)
noexcept
511 _Node_const_iterator __tmp(*
this);
516#if __cpp_impl_three_way_comparison >= 201907L
518 operator==(
const _Node_const_iterator&,
519 const _Node_const_iterator&) =
default;
522 operator==(
const _Node_const_iterator& __x,
const __iterator& __y)
524 const __base_type& __bx = __x;
525 const __base_type& __by = __y;
530 operator==(
const _Node_const_iterator& __x,
531 const _Node_const_iterator& __y)
noexcept
533 const __base_type& __bx = __x;
534 const __base_type& __by = __y;
539 operator!=(
const _Node_const_iterator& __x,
540 const _Node_const_iterator& __y)
noexcept
541 {
return !(__x == __y); }
544 operator==(
const _Node_const_iterator& __x,
545 const __iterator& __y)
noexcept
547 const __base_type& __bx = __x;
548 const __base_type& __by = __y;
553 operator!=(
const _Node_const_iterator& __x,
554 const __iterator& __y)
noexcept
555 {
return !(__x == __y); }
558 operator==(
const __iterator& __x,
559 const _Node_const_iterator& __y)
noexcept
561 const __base_type& __bx = __x;
562 const __base_type& __by = __y;
567 operator!=(
const __iterator& __x,
568 const _Node_const_iterator& __y)
noexcept
569 {
return !(__x == __y); }
578 struct _Mod_range_hashing
580 typedef std::size_t first_argument_type;
581 typedef std::size_t second_argument_type;
582 typedef std::size_t result_type;
585 operator()(first_argument_type __num,
586 second_argument_type __den)
const noexcept
587 {
return __num % __den; }
595 struct _Default_ranged_hash { };
599 struct _Prime_rehash_policy
603 _Prime_rehash_policy(
float __z = 1.0) noexcept
604 : _M_max_load_factor(__z), _M_next_resize(0) { }
607 max_load_factor() const noexcept
608 {
return _M_max_load_factor; }
613 _M_next_bkt(std::size_t __n)
const;
617 _M_bkt_for_elements(std::size_t __n)
const
618 {
return __builtin_ceil(__n / (
double)_M_max_load_factor); }
626 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
627 std::size_t __n_ins)
const;
629 typedef std::size_t _State;
633 {
return _M_next_resize; }
637 { _M_next_resize = 0; }
640 _M_reset(_State __state)
641 { _M_next_resize = __state; }
643 static const std::size_t _S_growth_factor = 2;
645 float _M_max_load_factor;
648 mutable std::size_t _M_next_resize;
652 struct _Mask_range_hashing
654 typedef std::size_t first_argument_type;
655 typedef std::size_t second_argument_type;
656 typedef std::size_t result_type;
659 operator()(first_argument_type __num,
660 second_argument_type __den)
const noexcept
661 {
return __num & (__den - 1); }
666 __clp2(std::size_t __n)
noexcept
672 const unsigned __lz =
sizeof(size_t) >
sizeof(
long)
673 ? __builtin_clzll(__n - 1ull)
674 : __builtin_clzl(__n - 1ul);
676 return (
size_t(1) << (__int_traits<size_t>::__digits - __lz - 1)) << 1;
681 struct _Power2_rehash_policy
685 _Power2_rehash_policy(
float __z = 1.0) noexcept
686 : _M_max_load_factor(__z), _M_next_resize(0) { }
689 max_load_factor() const noexcept
690 {
return _M_max_load_factor; }
695 _M_next_bkt(std::size_t __n)
noexcept
703 const auto __max_width = std::min<size_t>(
sizeof(
size_t), 8);
704 const auto __max_bkt = size_t(1) << (__max_width * __CHAR_BIT__ - 1);
705 std::size_t __res = __clp2(__n);
715 if (__res == __max_bkt)
719 _M_next_resize = size_t(-1);
722 = __builtin_floor(__res * (
double)_M_max_load_factor);
729 _M_bkt_for_elements(std::size_t __n)
const noexcept
730 {
return __builtin_ceil(__n / (
double)_M_max_load_factor); }
737 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
738 std::size_t __n_ins)
noexcept
740 if (__n_elt + __n_ins > _M_next_resize)
746 = std::max<std::size_t>(__n_elt + __n_ins, _M_next_resize ? 0 : 11)
747 / (double)_M_max_load_factor;
748 if (__min_bkts >= __n_bkt)
750 _M_next_bkt(std::max<std::size_t>(__builtin_floor(__min_bkts) + 1,
751 __n_bkt * _S_growth_factor)) };
754 = __builtin_floor(__n_bkt * (
double)_M_max_load_factor);
761 typedef std::size_t _State;
764 _M_state() const noexcept
765 {
return _M_next_resize; }
769 { _M_next_resize = 0; }
772 _M_reset(_State __state)
noexcept
773 { _M_next_resize = __state; }
775 static const std::size_t _S_growth_factor = 2;
777 float _M_max_load_factor;
778 std::size_t _M_next_resize;
781 template<
typename _RehashPolicy>
782 struct _RehashStateGuard
784 _RehashPolicy* _M_guarded_obj;
785 typename _RehashPolicy::_State _M_prev_state;
787 _RehashStateGuard(_RehashPolicy& __policy)
789 , _M_prev_state(__policy._M_state())
791 _RehashStateGuard(
const _RehashStateGuard&) =
delete;
796 _M_guarded_obj->_M_reset(_M_prev_state);
818 template<
typename _Key,
typename _Value,
typename _Alloc,
819 typename _ExtractKey,
typename _Equal,
820 typename _Hash,
typename _RangeHash,
typename _Unused,
821 typename _RehashPolicy,
typename _Traits,
822 bool _Unique_keys = _Traits::__unique_keys::value>
823 struct _Map_base { };
826 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
827 typename _Hash,
typename _RangeHash,
typename _Unused,
828 typename _RehashPolicy,
typename _Traits>
829 struct _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
830 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false>
832 using mapped_type = _Val;
836 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
837 typename _Hash,
typename _RangeHash,
typename _Unused,
838 typename _RehashPolicy,
typename _Traits>
839 struct _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
840 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>
843 using __hashtable_base = _Hashtable_base<_Key, pair<const _Key, _Val>,
844 _Select1st, _Equal, _Hash,
848 using __hashtable = _Hashtable<_Key, pair<const _Key, _Val>, _Alloc,
849 _Select1st, _Equal, _Hash, _RangeHash,
850 _Unused, _RehashPolicy, _Traits>;
852 using __hash_code =
typename __hashtable_base::__hash_code;
855 using key_type =
typename __hashtable_base::key_type;
856 using mapped_type = _Val;
859 operator[](
const key_type& __k);
862 operator[](key_type&& __k);
867 at(
const key_type& __k)
869 auto __ite =
static_cast<__hashtable*
>(
this)->find(__k);
871 __throw_out_of_range(__N(
"unordered_map::at"));
872 return __ite->second;
876 at(
const key_type& __k)
const
878 auto __ite =
static_cast<const __hashtable*
>(
this)->find(__k);
880 __throw_out_of_range(__N(
"unordered_map::at"));
881 return __ite->second;
885 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
886 typename _Hash,
typename _RangeHash,
typename _Unused,
887 typename _RehashPolicy,
typename _Traits>
889 _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
890 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
true>::
891 operator[](
const key_type& __k)
894 __hashtable* __h =
static_cast<__hashtable*
>(
this);
895 __hash_code __code = __h->_M_hash_code(__k);
896 std::size_t __bkt = __h->_M_bucket_index(__code);
897 if (
auto __node = __h->_M_find_node(__bkt, __k, __code))
898 return __node->_M_v().second;
900 typename __hashtable::_Scoped_node __node {
907 = __h->_M_insert_unique_node(__bkt, __code, __node._M_node);
908 __node._M_node =
nullptr;
909 return __pos->second;
912 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
913 typename _Hash,
typename _RangeHash,
typename _Unused,
914 typename _RehashPolicy,
typename _Traits>
916 _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
917 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
true>::
918 operator[](key_type&& __k)
921 __hashtable* __h =
static_cast<__hashtable*
>(
this);
922 __hash_code __code = __h->_M_hash_code(__k);
923 std::size_t __bkt = __h->_M_bucket_index(__code);
924 if (
auto __node = __h->_M_find_node(__bkt, __k, __code))
925 return __node->_M_v().second;
927 typename __hashtable::_Scoped_node __node {
934 = __h->_M_insert_unique_node(__bkt, __code, __node._M_node);
935 __node._M_node =
nullptr;
936 return __pos->second;
940 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
941 typename _Hash,
typename _RangeHash,
typename _Unused,
942 typename _RehashPolicy,
typename _Traits,
bool __uniq>
943 struct _Map_base<const _Key, pair<const _Key, _Val>,
944 _Alloc, _Select1st, _Equal, _Hash,
945 _RangeHash, _Unused, _RehashPolicy, _Traits, __uniq>
946 : _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal, _Hash,
947 _RangeHash, _Unused, _RehashPolicy, _Traits, __uniq>
950 template<
typename _Policy>
951 using __has_load_factor =
typename _Policy::__has_load_factor;
959 template<
typename _Key,
typename _Value,
typename _Alloc,
960 typename _ExtractKey,
typename _Equal,
961 typename _Hash,
typename _RangeHash,
typename _Unused,
962 typename _RehashPolicy,
typename _Traits,
964 __detected_or_t<false_type, __has_load_factor, _RehashPolicy>>
968 template<
typename _Key,
typename _Value,
typename _Alloc,
969 typename _ExtractKey,
typename _Equal,
970 typename _Hash,
typename _RangeHash,
typename _Unused,
971 typename _RehashPolicy,
typename _Traits>
972 struct _Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
973 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
979 template<
typename _Key,
typename _Value,
typename _Alloc,
980 typename _ExtractKey,
typename _Equal,
981 typename _Hash,
typename _RangeHash,
typename _Unused,
982 typename _RehashPolicy,
typename _Traits>
983 struct _Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
984 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
988 using __hashtable = _Hashtable<_Key, _Value, _Alloc, _ExtractKey,
989 _Equal, _Hash, _RangeHash, _Unused,
990 _RehashPolicy, _Traits>;
994 max_load_factor() const noexcept
996 const __hashtable* __this =
static_cast<const __hashtable*
>(
this);
997 return __this->__rehash_policy().max_load_factor();
1001 max_load_factor(
float __z)
1003 __hashtable* __this =
static_cast<__hashtable*
>(
this);
1004 __this->__rehash_policy(_RehashPolicy(__z));
1008 reserve(std::size_t __n)
1010 __hashtable* __this =
static_cast<__hashtable*
>(
this);
1011 __this->rehash(__this->__rehash_policy()._M_bkt_for_elements(__n));
1021 template<
int _Nm,
typename _Tp,
1022 bool __use_ebo = !__is_final(_Tp) && __is_empty(_Tp)>
1023 struct _Hashtable_ebo_helper;
1026 template<
int _Nm,
typename _Tp>
1027 struct _Hashtable_ebo_helper<_Nm, _Tp, true>
1030 _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
1032 template<
typename _OtherTp>
1033 _Hashtable_ebo_helper(_OtherTp&& __tp)
1037 const _Tp& _M_cget()
const {
return static_cast<const _Tp&
>(*this); }
1038 _Tp& _M_get() {
return static_cast<_Tp&
>(*this); }
1042 template<
int _Nm,
typename _Tp>
1043 struct _Hashtable_ebo_helper<_Nm, _Tp, false>
1045 _Hashtable_ebo_helper() =
default;
1047 template<
typename _OtherTp>
1048 _Hashtable_ebo_helper(_OtherTp&& __tp)
1052 const _Tp& _M_cget()
const {
return _M_tp; }
1053 _Tp& _M_get() {
return _M_tp; }
1065 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1066 typename _Hash,
typename _RangeHash,
typename _Unused,
1067 bool __cache_hash_code>
1068 struct _Local_iterator_base;
1088 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1089 typename _Hash,
typename _RangeHash,
typename _Unused,
1090 bool __cache_hash_code>
1091 struct _Hash_code_base
1092 :
private _Hashtable_ebo_helper<1, _Hash>
1095 using __ebo_hash = _Hashtable_ebo_helper<1, _Hash>;
1098 friend struct _Local_iterator_base<_Key, _Value, _ExtractKey,
1099 _Hash, _RangeHash, _Unused, false>;
1102 typedef _Hash hasher;
1105 hash_function()
const
1106 {
return _M_hash(); }
1109 typedef std::size_t __hash_code;
1113 _Hash_code_base() =
default;
1115 _Hash_code_base(
const _Hash& __hash) : __ebo_hash(__hash) { }
1118 _M_hash_code(
const _Key& __k)
const
1120 static_assert(__is_invocable<const _Hash&, const _Key&>{},
1121 "hash function must be invocable with an argument of key type");
1122 return _M_hash()(__k);
1125 template<
typename _Kt>
1127 _M_hash_code_tr(
const _Kt& __k)
const
1129 static_assert(__is_invocable<const _Hash&, const _Kt&>{},
1130 "hash function must be invocable with an argument of key type");
1131 return _M_hash()(__k);
1135 _M_hash_code(
const _Hash_node_value<_Value, false>& __n)
const
1136 {
return _M_hash_code(_ExtractKey{}(__n._M_v())); }
1139 _M_hash_code(
const _Hash_node_value<_Value, true>& __n)
const
1140 {
return __n._M_hash_code; }
1143 _M_bucket_index(__hash_code __c, std::size_t __bkt_count)
const
1144 {
return _RangeHash{}(__c, __bkt_count); }
1147 _M_bucket_index(
const _Hash_node_value<_Value, false>& __n,
1148 std::size_t __bkt_count)
const
1149 noexcept(
noexcept(declval<const _Hash&>()(declval<const _Key&>())) )
1151 return _RangeHash{}(_M_hash_code(_ExtractKey{}(__n._M_v())),
1156 _M_bucket_index(
const _Hash_node_value<_Value, true>& __n,
1157 std::size_t __bkt_count)
const noexcept
1158 {
return _RangeHash{}(__n._M_hash_code, __bkt_count); }
1161 _M_store_code(_Hash_node_code_cache<false>&, __hash_code)
const
1165 _M_copy_code(_Hash_node_code_cache<false>&,
1166 const _Hash_node_code_cache<false>&)
const
1170 _M_store_code(_Hash_node_code_cache<true>& __n, __hash_code __c)
const
1171 { __n._M_hash_code = __c; }
1174 _M_copy_code(_Hash_node_code_cache<true>& __to,
1175 const _Hash_node_code_cache<true>& __from)
const
1176 { __to._M_hash_code = __from._M_hash_code; }
1179 _M_swap(_Hash_code_base& __x)
1180 { std::swap(__ebo_hash::_M_get(), __x.__ebo_hash::_M_get()); }
1183 _M_hash()
const {
return __ebo_hash::_M_cget(); }
1187 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1188 typename _Hash,
typename _RangeHash,
typename _Unused>
1189 struct _Local_iterator_base<_Key, _Value, _ExtractKey,
1190 _Hash, _RangeHash, _Unused, true>
1191 :
public _Node_iterator_base<_Value, true>
1194 using __base_node_iter = _Node_iterator_base<_Value, true>;
1195 using __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,
1196 _Hash, _RangeHash, _Unused,
true>;
1198 _Local_iterator_base() =
default;
1199 _Local_iterator_base(
const __hash_code_base&,
1200 _Hash_node<_Value, true>* __p,
1201 std::size_t __bkt, std::size_t __bkt_count)
1202 : __base_node_iter(__p), _M_bucket(__bkt), _M_bucket_count(__bkt_count)
1208 __base_node_iter::_M_incr();
1212 = _RangeHash{}(this->_M_cur->_M_hash_code, _M_bucket_count);
1213 if (__bkt != _M_bucket)
1214 this->_M_cur =
nullptr;
1218 std::size_t _M_bucket;
1219 std::size_t _M_bucket_count;
1223 _M_get_bucket()
const {
return _M_bucket; }
1230 template<typename _Tp, bool _IsEmpty = std::is_empty<_Tp>::value>
1231 struct _Hash_code_storage
1233 __gnu_cxx::__aligned_buffer<_Tp> _M_storage;
1236 _M_h() {
return _M_storage._M_ptr(); }
1239 _M_h()
const {
return _M_storage._M_ptr(); }
1243 template<
typename _Tp>
1244 struct _Hash_code_storage<_Tp, true>
1251 _M_h() {
return reinterpret_cast<_Tp*
>(
this); }
1254 _M_h()
const {
return reinterpret_cast<const _Tp*
>(
this); }
1257 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1258 typename _Hash,
typename _RangeHash,
typename _Unused>
1259 using __hash_code_for_local_iter
1260 = _Hash_code_storage<_Hash_code_base<_Key, _Value, _ExtractKey,
1261 _Hash, _RangeHash, _Unused,
false>>;
1264 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1265 typename _Hash,
typename _RangeHash,
typename _Unused>
1266 struct _Local_iterator_base<_Key, _Value, _ExtractKey,
1267 _Hash, _RangeHash, _Unused, false>
1268 : __hash_code_for_local_iter<_Key, _Value, _ExtractKey, _Hash, _RangeHash,
1270 , _Node_iterator_base<_Value, false>
1273 using __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,
1274 _Hash, _RangeHash, _Unused,
false>;
1275 using __node_iter_base = _Node_iterator_base<_Value, false>;
1277 _Local_iterator_base() : _M_bucket_count(-1) { }
1279 _Local_iterator_base(
const __hash_code_base& __base,
1280 _Hash_node<_Value, false>* __p,
1281 std::size_t __bkt, std::size_t __bkt_count)
1282 : __node_iter_base(__p), _M_bucket(__bkt), _M_bucket_count(__bkt_count)
1283 { _M_init(__base); }
1285 ~_Local_iterator_base()
1287 if (_M_bucket_count !=
size_t(-1))
1291 _Local_iterator_base(
const _Local_iterator_base& __iter)
1292 : __node_iter_base(__iter._M_cur), _M_bucket(__iter._M_bucket)
1293 , _M_bucket_count(__iter._M_bucket_count)
1295 if (_M_bucket_count !=
size_t(-1))
1296 _M_init(*__iter._M_h());
1299 _Local_iterator_base&
1300 operator=(
const _Local_iterator_base& __iter)
1302 if (_M_bucket_count != -1)
1304 this->_M_cur = __iter._M_cur;
1305 _M_bucket = __iter._M_bucket;
1306 _M_bucket_count = __iter._M_bucket_count;
1307 if (_M_bucket_count != -1)
1308 _M_init(*__iter._M_h());
1315 __node_iter_base::_M_incr();
1318 std::size_t __bkt = this->_M_h()->_M_bucket_index(*this->_M_cur,
1320 if (__bkt != _M_bucket)
1321 this->_M_cur =
nullptr;
1325 std::size_t _M_bucket;
1326 std::size_t _M_bucket_count;
1329 _M_init(
const __hash_code_base& __base)
1330 { ::new(this->_M_h()) __hash_code_base(__base); }
1333 _M_destroy() { this->_M_h()->~__hash_code_base(); }
1337 _M_get_bucket()
const {
return _M_bucket; }
1341 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1342 typename _Hash,
typename _RangeHash,
typename _Unused,
1343 bool __constant_iterators,
bool __cache>
1344 struct _Local_iterator
1345 :
public _Local_iterator_base<_Key, _Value, _ExtractKey,
1346 _Hash, _RangeHash, _Unused, __cache>
1349 using __base_type = _Local_iterator_base<_Key, _Value, _ExtractKey,
1350 _Hash, _RangeHash, _Unused, __cache>;
1351 using __hash_code_base =
typename __base_type::__hash_code_base;
1354 using value_type = _Value;
1355 using pointer = __conditional_t<__constant_iterators,
1356 const value_type*, value_type*>;
1357 using reference = __conditional_t<__constant_iterators,
1358 const value_type&, value_type&>;
1359 using difference_type = ptrdiff_t;
1360 using iterator_category = forward_iterator_tag;
1362 _Local_iterator() =
default;
1364 _Local_iterator(
const __hash_code_base& __base,
1365 _Hash_node<_Value, __cache>* __n,
1366 std::size_t __bkt, std::size_t __bkt_count)
1367 : __base_type(
__base, __n, __bkt, __bkt_count)
1372 {
return this->_M_cur->_M_v(); }
1376 {
return this->_M_cur->_M_valptr(); }
1388 _Local_iterator __tmp(*
this);
1395 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1396 typename _Hash,
typename _RangeHash,
typename _Unused,
1397 bool __constant_iterators,
bool __cache>
1398 struct _Local_const_iterator
1399 :
public _Local_iterator_base<_Key, _Value, _ExtractKey,
1400 _Hash, _RangeHash, _Unused, __cache>
1403 using __base_type = _Local_iterator_base<_Key, _Value, _ExtractKey,
1404 _Hash, _RangeHash, _Unused, __cache>;
1405 using __hash_code_base =
typename __base_type::__hash_code_base;
1408 typedef _Value value_type;
1409 typedef const value_type* pointer;
1410 typedef const value_type& reference;
1411 typedef std::ptrdiff_t difference_type;
1414 _Local_const_iterator() =
default;
1416 _Local_const_iterator(
const __hash_code_base& __base,
1417 _Hash_node<_Value, __cache>* __n,
1418 std::size_t __bkt, std::size_t __bkt_count)
1419 : __base_type(
__base, __n, __bkt, __bkt_count)
1422 _Local_const_iterator(
const _Local_iterator<_Key, _Value, _ExtractKey,
1423 _Hash, _RangeHash, _Unused,
1424 __constant_iterators,
1431 {
return this->_M_cur->_M_v(); }
1435 {
return this->_M_cur->_M_valptr(); }
1437 _Local_const_iterator&
1444 _Local_const_iterator
1447 _Local_const_iterator __tmp(*
this);
1463 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1464 typename _Equal,
typename _Hash,
typename _RangeHash,
1465 typename _Unused,
typename _Traits>
1466 struct _Hashtable_base
1467 :
public _Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash,
1468 _Unused, _Traits::__hash_cached::value>,
1469 private _Hashtable_ebo_helper<0, _Equal>
1472 typedef _Key key_type;
1473 typedef _Value value_type;
1474 typedef _Equal key_equal;
1475 typedef std::size_t size_type;
1476 typedef std::ptrdiff_t difference_type;
1478 using __traits_type = _Traits;
1479 using __hash_cached =
typename __traits_type::__hash_cached;
1481 using __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,
1482 _Hash, _RangeHash, _Unused,
1483 __hash_cached::value>;
1485 using __hash_code =
typename __hash_code_base::__hash_code;
1488 using _EqualEBO = _Hashtable_ebo_helper<0, _Equal>;
1491 _Hashtable_base() =
default;
1493 _Hashtable_base(
const _Hash& __hash,
const _Equal& __eq)
1494 : __hash_code_base(__hash), _EqualEBO(__eq)
1498 _M_key_equals(
const _Key& __k,
1499 const _Hash_node_value<_Value,
1500 __hash_cached::value>& __n)
const
1502 static_assert(__is_invocable<const _Equal&, const _Key&, const _Key&>{},
1503 "key equality predicate must be invocable with two arguments of "
1505 return _M_eq()(__k, _ExtractKey{}(__n._M_v()));
1508 template<
typename _Kt>
1510 _M_key_equals_tr(
const _Kt& __k,
1511 const _Hash_node_value<_Value,
1512 __hash_cached::value>& __n)
const
1515 __is_invocable<const _Equal&, const _Kt&, const _Key&>{},
1516 "key equality predicate must be invocable with the argument type "
1517 "and the key type");
1518 return _M_eq()(__k, _ExtractKey{}(__n._M_v()));
1521#pragma GCC diagnostic push
1522#pragma GCC diagnostic ignored "-Wc++17-extensions"
1524 _M_equals(
const _Key& __k, __hash_code __c,
1525 const _Hash_node_value<_Value, __hash_cached::value>& __n)
const
1527 if constexpr (__hash_cached::value)
1528 if (__c != __n._M_hash_code)
1531 return _M_key_equals(__k, __n);
1534 template<
typename _Kt>
1536 _M_equals_tr(
const _Kt& __k, __hash_code __c,
1537 const _Hash_node_value<_Value,
1538 __hash_cached::value>& __n)
const
1540 if constexpr (__hash_cached::value)
1541 if (__c != __n._M_hash_code)
1544 return _M_key_equals_tr(__k, __n);
1549 const _Hash_node_value<_Value, __hash_cached::value>& __lhn,
1550 const _Hash_node_value<_Value, __hash_cached::value>& __rhn)
const
1552 if constexpr (__hash_cached::value)
1553 if (__lhn._M_hash_code != __rhn._M_hash_code)
1556 return _M_key_equals(_ExtractKey{}(__lhn._M_v()), __rhn);
1558#pragma GCC diagnostic pop
1561 _M_swap(_Hashtable_base& __x)
1563 __hash_code_base::_M_swap(__x);
1564 std::swap(_EqualEBO::_M_get(), __x._EqualEBO::_M_get());
1568 _M_eq()
const {
return _EqualEBO::_M_cget(); }
1575 template<
typename _NodeAlloc>
1576 struct _Hashtable_alloc :
private _Hashtable_ebo_helper<0, _NodeAlloc>
1579 using __ebo_node_alloc = _Hashtable_ebo_helper<0, _NodeAlloc>;
1582 struct __get_value_type;
1583 template<
typename _Val,
bool _Cache_hash_code>
1584 struct __get_value_type<_Hash_node<_Val, _Cache_hash_code>>
1585 {
using type = _Val; };
1588 using __node_type =
typename _NodeAlloc::value_type;
1589 using __node_alloc_type = _NodeAlloc;
1593 using __value_alloc_traits =
typename __node_alloc_traits::template
1594 rebind_traits<typename __get_value_type<__node_type>::type>;
1596 using __node_ptr = __node_type*;
1597 using __node_base = _Hash_node_base;
1598 using __node_base_ptr = __node_base*;
1599 using __buckets_alloc_type =
1600 __alloc_rebind<__node_alloc_type, __node_base_ptr>;
1602 using __buckets_ptr = __node_base_ptr*;
1604 _Hashtable_alloc() =
default;
1605 _Hashtable_alloc(
const _Hashtable_alloc&) =
default;
1606 _Hashtable_alloc(_Hashtable_alloc&&) =
default;
1608 template<
typename _Alloc>
1609 _Hashtable_alloc(_Alloc&& __a)
1610 : __ebo_node_alloc(
std::
forward<_Alloc>(__a))
1615 {
return __ebo_node_alloc::_M_get(); }
1617 const __node_alloc_type&
1618 _M_node_allocator()
const
1619 {
return __ebo_node_alloc::_M_cget(); }
1622 template<
typename... _Args>
1624 _M_allocate_node(_Args&&... __args);
1628 _M_deallocate_node(__node_ptr __n);
1632 _M_deallocate_node_ptr(__node_ptr __n);
1637 _M_deallocate_nodes(__node_ptr __n);
1640 _M_allocate_buckets(std::size_t __bkt_count);
1643 _M_deallocate_buckets(__buckets_ptr, std::size_t __bkt_count);
1648 template<
typename _NodeAlloc>
1649 template<
typename... _Args>
1651 _Hashtable_alloc<_NodeAlloc>::_M_allocate_node(_Args&&... __args)
1654 auto& __alloc = _M_node_allocator();
1655 auto __nptr = __node_alloc_traits::allocate(__alloc, 1);
1656 __node_ptr __n = std::__to_address(__nptr);
1659 ::new ((
void*)__n) __node_type;
1660 __node_alloc_traits::construct(__alloc, __n->_M_valptr(),
1661 std::forward<_Args>(__args)...);
1666 __n->~__node_type();
1667 __node_alloc_traits::deallocate(__alloc, __nptr, 1);
1668 __throw_exception_again;
1672 template<
typename _NodeAlloc>
1674 _Hashtable_alloc<_NodeAlloc>::_M_deallocate_node(__node_ptr __n)
1676 __node_alloc_traits::destroy(_M_node_allocator(), __n->_M_valptr());
1677 _M_deallocate_node_ptr(__n);
1680 template<
typename _NodeAlloc>
1682 _Hashtable_alloc<_NodeAlloc>::_M_deallocate_node_ptr(__node_ptr __n)
1684 typedef typename __node_alloc_traits::pointer _Ptr;
1686 __n->~__node_type();
1687 __node_alloc_traits::deallocate(_M_node_allocator(), __ptr, 1);
1690 template<
typename _NodeAlloc>
1692 _Hashtable_alloc<_NodeAlloc>::_M_deallocate_nodes(__node_ptr __n)
1696 __node_ptr __tmp = __n;
1697 __n = __n->_M_next();
1698 _M_deallocate_node(__tmp);
1702 template<
typename _NodeAlloc>
1704 _Hashtable_alloc<_NodeAlloc>::_M_allocate_buckets(std::size_t __bkt_count)
1707 __buckets_alloc_type __alloc(_M_node_allocator());
1709 auto __ptr = __buckets_alloc_traits::allocate(__alloc, __bkt_count);
1710 __buckets_ptr __p = std::__to_address(__ptr);
1711 __builtin_memset(__p, 0, __bkt_count *
sizeof(__node_base_ptr));
1715 template<
typename _NodeAlloc>
1717 _Hashtable_alloc<_NodeAlloc>::
1718 _M_deallocate_buckets(__buckets_ptr __bkts,
1719 std::size_t __bkt_count)
1721 typedef typename __buckets_alloc_traits::pointer _Ptr;
1723 __buckets_alloc_type __alloc(_M_node_allocator());
1724 __buckets_alloc_traits::deallocate(__alloc, __ptr, __bkt_count);
1730_GLIBCXX_END_NAMESPACE_VERSION
constexpr complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x times y.
__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 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.
ISO C++ entities toplevel namespace is std.
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
__numeric_traits_integer< _Tp > __int_traits
Convenience alias for __numeric_traits<integer-type>.
constexpr _Iterator __base(_Iterator __it)
Primary class template, tuple.
Uniform interface to all allocator types.
Uniform interface to all pointer-like types.
Struct holding two objects of arbitrary type.
Forward iterators support a superset of input iterator operations.
Traits class for iterators.
Uniform interface to C++98 and C++11 allocators.