31 #ifndef _HASHTABLE_POLICY_H
32 #define _HASHTABLE_POLICY_H 1
38 namespace std _GLIBCXX_VISIBILITY(default)
40 _GLIBCXX_BEGIN_NAMESPACE_VERSION
43 template<
typename _Key,
typename _Value,
typename _Alloc,
44 typename _ExtractKey,
typename _Equal,
45 typename _Hash,
typename _RangeHash,
typename _Unused,
46 typename _RehashPolicy,
typename _Traits>
56 template<
typename _Key,
typename _Value,
typename _ExtractKey,
57 typename _Equal,
typename _Hash,
typename _RangeHash,
58 typename _Unused,
typename _Traits>
59 struct _Hashtable_base;
63 template<
typename _Iterator>
65 __distance_fw(_Iterator __first, _Iterator __last,
67 {
return __first != __last ? 1 : 0; }
69 template<
typename _Iterator>
71 __distance_fw(_Iterator __first, _Iterator __last,
75 template<
typename _Iterator>
77 __distance_fw(_Iterator __first, _Iterator __last)
78 {
return __distance_fw(__first, __last,
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,
const _NodeGenerator& __node_gen)
121 ->
typename _NodeGenerator::__node_type*
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&&,
const _NodeGenerator& __node_gen)
134 ->
typename _NodeGenerator::__node_type*
135 {
return __node_gen(std::forward<_Kt>(__k)); }
138 template<
typename _NodeAlloc>
139 struct _Hashtable_alloc;
143 template<
typename _NodeAlloc>
144 struct _ReuseOrAllocNode
147 using __node_alloc_type = _NodeAlloc;
148 using __hashtable_alloc = _Hashtable_alloc<__node_alloc_type>;
149 using __node_alloc_traits =
150 typename __hashtable_alloc::__node_alloc_traits;
153 using __node_type =
typename __hashtable_alloc::__node_type;
155 _ReuseOrAllocNode(__node_type* __nodes, __hashtable_alloc& __h)
156 : _M_nodes(__nodes), _M_h(__h) { }
157 _ReuseOrAllocNode(
const _ReuseOrAllocNode&) =
delete;
160 { _M_h._M_deallocate_nodes(_M_nodes); }
162 template<
typename... _Args>
164 operator()(_Args&&... __args)
const
168 __node_type* __node = _M_nodes;
169 _M_nodes = _M_nodes->_M_next();
170 __node->_M_nxt =
nullptr;
171 auto& __a = _M_h._M_node_allocator();
172 __node_alloc_traits::destroy(__a, __node->_M_valptr());
175 __node_alloc_traits::construct(__a, __node->_M_valptr(),
176 std::forward<_Args>(__args)...);
180 _M_h._M_deallocate_node_ptr(__node);
181 __throw_exception_again;
185 return _M_h._M_allocate_node(std::forward<_Args>(__args)...);
189 mutable __node_type* _M_nodes;
190 __hashtable_alloc& _M_h;
195 template<
typename _NodeAlloc>
199 using __hashtable_alloc = _Hashtable_alloc<_NodeAlloc>;
202 using __node_type =
typename __hashtable_alloc::__node_type;
204 _AllocNode(__hashtable_alloc& __h)
207 template<
typename... _Args>
209 operator()(_Args&&... __args)
const
210 {
return _M_h._M_allocate_node(std::forward<_Args>(__args)...); }
213 __hashtable_alloc& _M_h;
241 template<
bool _Cache_hash_code,
bool _Constant_iterators,
bool _Unique_keys>
242 struct _Hashtable_traits
244 using __hash_cached = __bool_constant<_Cache_hash_code>;
245 using __constant_iterators = __bool_constant<_Constant_iterators>;
246 using __unique_keys = __bool_constant<_Unique_keys>;
255 template<
typename _Hash>
256 struct _Hashtable_hash_traits
258 static constexpr std::size_t
259 __small_size_threshold() noexcept
260 {
return std::__is_fast_hash<_Hash>::value ? 0 : 20; }
271 struct _Hash_node_base
273 _Hash_node_base* _M_nxt;
275 _Hash_node_base() noexcept : _M_nxt() { }
277 _Hash_node_base(_Hash_node_base* __next) noexcept : _M_nxt(__next) { }
285 template<
typename _Value>
286 struct _Hash_node_value_base
288 typedef _Value value_type;
290 __gnu_cxx::__aligned_buffer<_Value> _M_storage;
294 {
return _M_storage._M_ptr(); }
297 _M_valptr() const noexcept
298 {
return _M_storage._M_ptr(); }
302 {
return *_M_valptr(); }
305 _M_v() const noexcept
306 {
return *_M_valptr(); }
312 template<
bool _Cache_hash_code>
313 struct _Hash_node_code_cache
320 struct _Hash_node_code_cache<true>
321 { std::size_t _M_hash_code; };
323 template<
typename _Value,
bool _Cache_hash_code>
324 struct _Hash_node_value
325 : _Hash_node_value_base<_Value>
326 , _Hash_node_code_cache<_Cache_hash_code>
332 template<
typename _Value,
bool _Cache_hash_code>
335 , _Hash_node_value<_Value, _Cache_hash_code>
338 _M_next() const noexcept
339 {
return static_cast<_Hash_node*
>(this->_M_nxt); }
343 template<
typename _Value,
bool _Cache_hash_code>
344 struct _Node_iterator_base
346 using __node_type = _Hash_node<_Value, _Cache_hash_code>;
350 _Node_iterator_base() : _M_cur(nullptr) { }
351 _Node_iterator_base(__node_type* __p) noexcept
356 { _M_cur = _M_cur->_M_next(); }
359 operator==(
const _Node_iterator_base& __x,
const _Node_iterator_base& __y)
361 {
return __x._M_cur == __y._M_cur; }
363 #if __cpp_impl_three_way_comparison < 201907L
365 operator!=(
const _Node_iterator_base& __x,
const _Node_iterator_base& __y)
367 {
return __x._M_cur != __y._M_cur; }
372 template<
typename _Value,
bool __constant_iterators,
bool __cache>
373 struct _Node_iterator
374 :
public _Node_iterator_base<_Value, __cache>
377 using __base_type = _Node_iterator_base<_Value, __cache>;
378 using __node_type =
typename __base_type::__node_type;
381 using value_type = _Value;
382 using difference_type = std::ptrdiff_t;
385 using pointer = __conditional_t<__constant_iterators,
386 const value_type*, value_type*>;
388 using reference = __conditional_t<__constant_iterators,
389 const value_type&, value_type&>;
391 _Node_iterator() =
default;
394 _Node_iterator(__node_type* __p) noexcept
395 : __base_type(__p) { }
399 {
return this->_M_cur->_M_v(); }
402 operator->() const noexcept
403 {
return this->_M_cur->_M_valptr(); }
406 operator++() noexcept
413 operator++(
int) noexcept
415 _Node_iterator __tmp(*
this);
422 template<
typename _Value,
bool __constant_iterators,
bool __cache>
423 struct _Node_const_iterator
424 :
public _Node_iterator_base<_Value, __cache>
427 using __base_type = _Node_iterator_base<_Value, __cache>;
428 using __node_type =
typename __base_type::__node_type;
431 typedef _Value value_type;
432 typedef std::ptrdiff_t difference_type;
435 typedef const value_type* pointer;
436 typedef const value_type& reference;
438 _Node_const_iterator() =
default;
441 _Node_const_iterator(__node_type* __p) noexcept
442 : __base_type(__p) { }
444 _Node_const_iterator(
const _Node_iterator<_Value, __constant_iterators,
445 __cache>& __x) noexcept
446 : __base_type(__x._M_cur) { }
450 {
return this->_M_cur->_M_v(); }
453 operator->() const noexcept
454 {
return this->_M_cur->_M_valptr(); }
456 _Node_const_iterator&
457 operator++() noexcept
464 operator++(
int) noexcept
466 _Node_const_iterator __tmp(*
this);
477 struct _Mod_range_hashing
479 typedef std::size_t first_argument_type;
480 typedef std::size_t second_argument_type;
481 typedef std::size_t result_type;
484 operator()(first_argument_type __num,
485 second_argument_type __den)
const noexcept
486 {
return __num % __den; }
494 struct _Default_ranged_hash { };
498 struct _Prime_rehash_policy
502 _Prime_rehash_policy(
float __z = 1.0) noexcept
503 : _M_max_load_factor(__z), _M_next_resize(0) { }
506 max_load_factor() const noexcept
507 {
return _M_max_load_factor; }
511 _M_next_bkt(std::size_t __n)
const;
515 _M_bkt_for_elements(std::size_t __n)
const
516 {
return __builtin_ceil(__n / (
double)_M_max_load_factor); }
523 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
524 std::size_t __n_ins)
const;
526 typedef std::size_t _State;
530 {
return _M_next_resize; }
534 { _M_next_resize = 0; }
537 _M_reset(_State __state)
538 { _M_next_resize = __state; }
540 static const std::size_t _S_growth_factor = 2;
542 float _M_max_load_factor;
543 mutable std::size_t _M_next_resize;
547 struct _Mask_range_hashing
549 typedef std::size_t first_argument_type;
550 typedef std::size_t second_argument_type;
551 typedef std::size_t result_type;
554 operator()(first_argument_type __num,
555 second_argument_type __den)
const noexcept
556 {
return __num & (__den - 1); }
561 __clp2(std::size_t __n) noexcept
567 const unsigned __lz =
sizeof(size_t) >
sizeof(
long)
568 ? __builtin_clzll(__n - 1ull)
569 : __builtin_clzl(__n - 1ul);
571 return (
size_t(1) << (__int_traits<size_t>::__digits - __lz - 1)) << 1;
576 struct _Power2_rehash_policy
580 _Power2_rehash_policy(
float __z = 1.0) noexcept
581 : _M_max_load_factor(__z), _M_next_resize(0) { }
584 max_load_factor() const noexcept
585 {
return _M_max_load_factor; }
590 _M_next_bkt(std::size_t __n) noexcept
598 const auto __max_width = std::min<size_t>(
sizeof(
size_t), 8);
599 const auto __max_bkt = size_t(1) << (__max_width * __CHAR_BIT__ - 1);
600 std::size_t __res = __clp2(__n);
610 if (__res == __max_bkt)
614 _M_next_resize = size_t(-1);
617 = __builtin_floor(__res * (
double)_M_max_load_factor);
624 _M_bkt_for_elements(std::size_t __n)
const noexcept
625 {
return __builtin_ceil(__n / (
double)_M_max_load_factor); }
632 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
633 std::size_t __n_ins) noexcept
635 if (__n_elt + __n_ins > _M_next_resize)
641 = std::max<std::size_t>(__n_elt + __n_ins, _M_next_resize ? 0 : 11)
642 / (double)_M_max_load_factor;
643 if (__min_bkts >= __n_bkt)
645 _M_next_bkt(std::max<std::size_t>(__builtin_floor(__min_bkts) + 1,
646 __n_bkt * _S_growth_factor)) };
649 = __builtin_floor(__n_bkt * (
double)_M_max_load_factor);
656 typedef std::size_t _State;
659 _M_state() const noexcept
660 {
return _M_next_resize; }
664 { _M_next_resize = 0; }
667 _M_reset(_State __state) noexcept
668 { _M_next_resize = __state; }
670 static const std::size_t _S_growth_factor = 2;
672 float _M_max_load_factor;
673 std::size_t _M_next_resize;
694 template<
typename _Key,
typename _Value,
typename _Alloc,
695 typename _ExtractKey,
typename _Equal,
696 typename _Hash,
typename _RangeHash,
typename _Unused,
697 typename _RehashPolicy,
typename _Traits,
698 bool _Unique_keys = _Traits::__unique_keys::value>
699 struct _Map_base { };
702 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
703 typename _Hash,
typename _RangeHash,
typename _Unused,
704 typename _RehashPolicy,
typename _Traits>
705 struct _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
706 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false>
708 using mapped_type = _Val;
712 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
713 typename _Hash,
typename _RangeHash,
typename _Unused,
714 typename _RehashPolicy,
typename _Traits>
715 struct _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
716 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>
719 using __hashtable_base = _Hashtable_base<_Key, pair<const _Key, _Val>,
720 _Select1st, _Equal, _Hash,
724 using __hashtable = _Hashtable<_Key, pair<const _Key, _Val>, _Alloc,
725 _Select1st, _Equal, _Hash, _RangeHash,
726 _Unused, _RehashPolicy, _Traits>;
728 using __hash_code =
typename __hashtable_base::__hash_code;
731 using key_type =
typename __hashtable_base::key_type;
732 using mapped_type = _Val;
735 operator[](
const key_type& __k);
738 operator[](key_type&& __k);
743 at(
const key_type& __k)
745 auto __ite =
static_cast<__hashtable*
>(
this)->find(__k);
747 __throw_out_of_range(__N(
"unordered_map::at"));
748 return __ite->second;
752 at(
const key_type& __k)
const
754 auto __ite =
static_cast<const __hashtable*
>(
this)->find(__k);
756 __throw_out_of_range(__N(
"unordered_map::at"));
757 return __ite->second;
761 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
762 typename _Hash,
typename _RangeHash,
typename _Unused,
763 typename _RehashPolicy,
typename _Traits>
765 _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
766 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
true>::
767 operator[](
const key_type& __k)
770 __hashtable* __h =
static_cast<__hashtable*
>(
this);
771 __hash_code __code = __h->_M_hash_code(__k);
772 std::size_t __bkt = __h->_M_bucket_index(__code);
773 if (
auto __node = __h->_M_find_node(__bkt, __k, __code))
774 return __node->_M_v().second;
776 typename __hashtable::_Scoped_node __node {
783 = __h->_M_insert_unique_node(__bkt, __code, __node._M_node);
784 __node._M_node =
nullptr;
785 return __pos->second;
788 template<
typename _Key,
typename _Val,
typename _Alloc,
typename _Equal,
789 typename _Hash,
typename _RangeHash,
typename _Unused,
790 typename _RehashPolicy,
typename _Traits>
792 _Map_base<_Key, pair<const _Key, _Val>, _Alloc, _Select1st, _Equal,
793 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
true>::
794 operator[](key_type&& __k)
797 __hashtable* __h =
static_cast<__hashtable*
>(
this);
798 __hash_code __code = __h->_M_hash_code(__k);
799 std::size_t __bkt = __h->_M_bucket_index(__code);
800 if (
auto __node = __h->_M_find_node(__bkt, __k, __code))
801 return __node->_M_v().second;
803 typename __hashtable::_Scoped_node __node {
810 = __h->_M_insert_unique_node(__bkt, __code, __node._M_node);
811 __node._M_node =
nullptr;
812 return __pos->second;
820 template<
typename _Key,
typename _Value,
typename _Alloc,
821 typename _ExtractKey,
typename _Equal,
822 typename _Hash,
typename _RangeHash,
typename _Unused,
823 typename _RehashPolicy,
typename _Traits>
827 using __hashtable_base = _Hashtable_base<_Key, _Value, _ExtractKey,
828 _Equal, _Hash, _RangeHash,
831 using __hashtable = _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
833 _Unused, _RehashPolicy, _Traits>;
835 using __hash_cached =
typename _Traits::__hash_cached;
836 using __constant_iterators =
typename _Traits::__constant_iterators;
838 using __hashtable_alloc = _Hashtable_alloc<
839 __alloc_rebind<_Alloc, _Hash_node<_Value,
840 __hash_cached::value>>>;
842 using value_type =
typename __hashtable_base::value_type;
843 using size_type =
typename __hashtable_base::size_type;
845 using __unique_keys =
typename _Traits::__unique_keys;
846 using __node_alloc_type =
typename __hashtable_alloc::__node_alloc_type;
847 using __node_gen_type = _AllocNode<__node_alloc_type>;
850 _M_conjure_hashtable()
851 {
return *(
static_cast<__hashtable*
>(
this)); }
853 template<
typename _InputIterator,
typename _NodeGetter>
855 _M_insert_range(_InputIterator __first, _InputIterator __last,
858 template<
typename _InputIterator,
typename _NodeGetter>
860 _M_insert_range(_InputIterator __first, _InputIterator __last,
864 using iterator = _Node_iterator<_Value, __constant_iterators::value,
865 __hash_cached::value>;
867 using const_iterator = _Node_const_iterator<_Value,
868 __constant_iterators::value,
869 __hash_cached::value>;
871 using __ireturn_type = __conditional_t<__unique_keys::value,
876 insert(
const value_type& __v)
878 __hashtable& __h = _M_conjure_hashtable();
879 __node_gen_type __node_gen(__h);
880 return __h._M_insert(__v, __node_gen, __unique_keys{});
884 insert(const_iterator __hint,
const value_type& __v)
886 __hashtable& __h = _M_conjure_hashtable();
887 __node_gen_type __node_gen(__h);
888 return __h._M_insert(__hint, __v, __node_gen, __unique_keys{});
891 template<
typename _KType,
typename... _Args>
893 try_emplace(const_iterator, _KType&& __k, _Args&&... __args)
895 __hashtable& __h = _M_conjure_hashtable();
896 auto __code = __h._M_hash_code(__k);
897 std::size_t __bkt = __h._M_bucket_index(__code);
898 if (
auto __node = __h._M_find_node(__bkt, __k, __code))
899 return { iterator(__node),
false };
901 typename __hashtable::_Scoped_node __node {
908 = __h._M_insert_unique_node(__bkt, __code, __node._M_node);
909 __node._M_node =
nullptr;
910 return { __it,
true };
914 insert(initializer_list<value_type> __l)
915 { this->insert(__l.begin(), __l.end()); }
917 template<
typename _InputIterator>
919 insert(_InputIterator __first, _InputIterator __last)
921 __hashtable& __h = _M_conjure_hashtable();
922 __node_gen_type __node_gen(__h);
923 return _M_insert_range(__first, __last, __node_gen, __unique_keys{});
927 template<
typename _Key,
typename _Value,
typename _Alloc,
928 typename _ExtractKey,
typename _Equal,
929 typename _Hash,
typename _RangeHash,
typename _Unused,
930 typename _RehashPolicy,
typename _Traits>
931 template<
typename _InputIterator,
typename _NodeGetter>
933 _Insert_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
934 _Hash, _RangeHash, _Unused,
935 _RehashPolicy, _Traits>::
936 _M_insert_range(_InputIterator __first, _InputIterator __last,
937 const _NodeGetter& __node_gen,
true_type __uks)
939 __hashtable& __h = _M_conjure_hashtable();
940 for (; __first != __last; ++__first)
941 __h._M_insert(*__first, __node_gen, __uks);
944 template<
typename _Key,
typename _Value,
typename _Alloc,
945 typename _ExtractKey,
typename _Equal,
946 typename _Hash,
typename _RangeHash,
typename _Unused,
947 typename _RehashPolicy,
typename _Traits>
948 template<
typename _InputIterator,
typename _NodeGetter>
950 _Insert_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
951 _Hash, _RangeHash, _Unused,
952 _RehashPolicy, _Traits>::
953 _M_insert_range(_InputIterator __first, _InputIterator __last,
954 const _NodeGetter& __node_gen,
false_type __uks)
956 using __rehash_type =
typename __hashtable::__rehash_type;
957 using __rehash_state =
typename __hashtable::__rehash_state;
960 size_type __n_elt = __detail::__distance_fw(__first, __last);
964 __hashtable& __h = _M_conjure_hashtable();
965 __rehash_type& __rehash = __h._M_rehash_policy;
966 const __rehash_state& __saved_state = __rehash._M_state();
967 pair_type __do_rehash = __rehash._M_need_rehash(__h._M_bucket_count,
968 __h._M_element_count,
971 if (__do_rehash.first)
972 __h._M_rehash(__do_rehash.second, __saved_state);
974 for (; __first != __last; ++__first)
975 __h._M_insert(*__first, __node_gen, __uks);
984 template<
typename _Key,
typename _Value,
typename _Alloc,
985 typename _ExtractKey,
typename _Equal,
986 typename _Hash,
typename _RangeHash,
typename _Unused,
987 typename _RehashPolicy,
typename _Traits,
988 bool _Constant_iterators = _Traits::__constant_iterators::value>
992 template<
typename _Key,
typename _Value,
typename _Alloc,
993 typename _ExtractKey,
typename _Equal,
994 typename _Hash,
typename _RangeHash,
typename _Unused,
995 typename _RehashPolicy,
typename _Traits>
996 struct _Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal,
997 _Hash, _RangeHash, _Unused,
998 _RehashPolicy, _Traits, true>
999 :
public _Insert_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1000 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>
1002 using __base_type = _Insert_base<_Key, _Value, _Alloc, _ExtractKey,
1003 _Equal, _Hash, _RangeHash, _Unused,
1004 _RehashPolicy, _Traits>;
1006 using value_type =
typename __base_type::value_type;
1007 using iterator =
typename __base_type::iterator;
1008 using const_iterator =
typename __base_type::const_iterator;
1009 using __ireturn_type =
typename __base_type::__ireturn_type;
1011 using __unique_keys =
typename __base_type::__unique_keys;
1012 using __hashtable =
typename __base_type::__hashtable;
1013 using __node_gen_type =
typename __base_type::__node_gen_type;
1015 using __base_type::insert;
1018 insert(value_type&& __v)
1020 __hashtable& __h = this->_M_conjure_hashtable();
1021 __node_gen_type __node_gen(__h);
1022 return __h._M_insert(
std::move(__v), __node_gen, __unique_keys{});
1026 insert(const_iterator __hint, value_type&& __v)
1028 __hashtable& __h = this->_M_conjure_hashtable();
1029 __node_gen_type __node_gen(__h);
1030 return __h._M_insert(__hint,
std::move(__v), __node_gen,
1036 template<
typename _Key,
typename _Value,
typename _Alloc,
1037 typename _ExtractKey,
typename _Equal,
1038 typename _Hash,
typename _RangeHash,
typename _Unused,
1039 typename _RehashPolicy,
typename _Traits>
1040 struct _Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1041 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false>
1042 :
public _Insert_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1043 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>
1045 using __base_type = _Insert_base<_Key, _Value, _Alloc, _ExtractKey,
1046 _Equal, _Hash, _RangeHash, _Unused,
1047 _RehashPolicy, _Traits>;
1048 using value_type =
typename __base_type::value_type;
1049 using iterator =
typename __base_type::iterator;
1050 using const_iterator =
typename __base_type::const_iterator;
1052 using __unique_keys =
typename __base_type::__unique_keys;
1053 using __hashtable =
typename __base_type::__hashtable;
1054 using __ireturn_type =
typename __base_type::__ireturn_type;
1056 using __base_type::insert;
1058 template<
typename _Pair>
1061 template<
typename _Pair>
1064 template<
typename _Pair>
1065 using _IFconsp =
typename _IFcons<_Pair>::type;
1067 template<
typename _Pair,
typename = _IFconsp<_Pair>>
1071 __hashtable& __h = this->_M_conjure_hashtable();
1072 return __h._M_emplace(__unique_keys{}, std::forward<_Pair>(__v));
1075 template<
typename _Pair,
typename = _IFconsp<_Pair>>
1077 insert(const_iterator __hint, _Pair&& __v)
1079 __hashtable& __h = this->_M_conjure_hashtable();
1080 return __h._M_emplace(__hint, __unique_keys{},
1081 std::forward<_Pair>(__v));
1085 template<
typename _Policy>
1086 using __has_load_factor =
typename _Policy::__has_load_factor;
1094 template<
typename _Key,
typename _Value,
typename _Alloc,
1095 typename _ExtractKey,
typename _Equal,
1096 typename _Hash,
typename _RangeHash,
typename _Unused,
1097 typename _RehashPolicy,
typename _Traits,
1099 __detected_or_t<false_type, __has_load_factor, _RehashPolicy>>
1100 struct _Rehash_base;
1103 template<
typename _Key,
typename _Value,
typename _Alloc,
1104 typename _ExtractKey,
typename _Equal,
1105 typename _Hash,
typename _RangeHash,
typename _Unused,
1106 typename _RehashPolicy,
typename _Traits>
1107 struct _Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1108 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
1114 template<
typename _Key,
typename _Value,
typename _Alloc,
1115 typename _ExtractKey,
typename _Equal,
1116 typename _Hash,
typename _RangeHash,
typename _Unused,
1117 typename _RehashPolicy,
typename _Traits>
1118 struct _Rehash_base<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1119 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
1123 using __hashtable = _Hashtable<_Key, _Value, _Alloc, _ExtractKey,
1124 _Equal, _Hash, _RangeHash, _Unused,
1125 _RehashPolicy, _Traits>;
1129 max_load_factor() const noexcept
1131 const __hashtable* __this =
static_cast<const __hashtable*
>(
this);
1132 return __this->__rehash_policy().max_load_factor();
1136 max_load_factor(
float __z)
1138 __hashtable* __this =
static_cast<__hashtable*
>(
this);
1139 __this->__rehash_policy(_RehashPolicy(__z));
1143 reserve(std::size_t __n)
1145 __hashtable* __this =
static_cast<__hashtable*
>(
this);
1146 __this->rehash(__this->__rehash_policy()._M_bkt_for_elements(__n));
1156 template<
int _Nm,
typename _Tp,
1157 bool __use_ebo = !__is_final(_Tp) && __is_empty(_Tp)>
1158 struct _Hashtable_ebo_helper;
1161 template<
int _Nm,
typename _Tp>
1162 struct _Hashtable_ebo_helper<_Nm, _Tp, true>
1165 _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
1167 template<
typename _OtherTp>
1168 _Hashtable_ebo_helper(_OtherTp&& __tp)
1172 const _Tp& _M_cget()
const {
return static_cast<const _Tp&
>(*this); }
1173 _Tp& _M_get() {
return static_cast<_Tp&
>(*this); }
1177 template<
int _Nm,
typename _Tp>
1178 struct _Hashtable_ebo_helper<_Nm, _Tp, false>
1180 _Hashtable_ebo_helper() =
default;
1182 template<
typename _OtherTp>
1183 _Hashtable_ebo_helper(_OtherTp&& __tp)
1187 const _Tp& _M_cget()
const {
return _M_tp; }
1188 _Tp& _M_get() {
return _M_tp; }
1200 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1201 typename _Hash,
typename _RangeHash,
typename _Unused,
1202 bool __cache_hash_code>
1203 struct _Local_iterator_base;
1223 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1224 typename _Hash,
typename _RangeHash,
typename _Unused,
1225 bool __cache_hash_code>
1226 struct _Hash_code_base
1227 :
private _Hashtable_ebo_helper<1, _Hash>
1230 using __ebo_hash = _Hashtable_ebo_helper<1, _Hash>;
1233 friend struct _Local_iterator_base<_Key, _Value, _ExtractKey,
1234 _Hash, _RangeHash, _Unused, false>;
1237 typedef _Hash hasher;
1240 hash_function()
const
1241 {
return _M_hash(); }
1244 typedef std::size_t __hash_code;
1248 _Hash_code_base() =
default;
1250 _Hash_code_base(
const _Hash& __hash) : __ebo_hash(__hash) { }
1253 _M_hash_code(
const _Key& __k)
const
1255 static_assert(__is_invocable<const _Hash&, const _Key&>{},
1256 "hash function must be invocable with an argument of key type");
1257 return _M_hash()(__k);
1260 template<
typename _Kt>
1262 _M_hash_code_tr(
const _Kt& __k)
const
1264 static_assert(__is_invocable<const _Hash&, const _Kt&>{},
1265 "hash function must be invocable with an argument of key type");
1266 return _M_hash()(__k);
1270 _M_hash_code(
const _Hash&,
1271 const _Hash_node_value<_Value, true>& __n)
const
1272 {
return __n._M_hash_code; }
1276 template<
typename _H2>
1278 _M_hash_code(
const _H2&,
1279 const _Hash_node_value<_Value, __cache_hash_code>& __n)
const
1280 {
return _M_hash_code(_ExtractKey{}(__n._M_v())); }
1283 _M_hash_code(
const _Hash_node_value<_Value, false>& __n)
const
1284 {
return _M_hash_code(_ExtractKey{}(__n._M_v())); }
1287 _M_hash_code(
const _Hash_node_value<_Value, true>& __n)
const
1288 {
return __n._M_hash_code; }
1291 _M_bucket_index(__hash_code __c, std::size_t __bkt_count)
const
1292 {
return _RangeHash{}(__c, __bkt_count); }
1295 _M_bucket_index(
const _Hash_node_value<_Value, false>& __n,
1296 std::size_t __bkt_count)
const
1297 noexcept( noexcept(declval<const _Hash&>()(declval<const _Key&>()))
1298 && noexcept(declval<const _RangeHash&>()((__hash_code)0,
1301 return _RangeHash{}(_M_hash_code(_ExtractKey{}(__n._M_v())),
1306 _M_bucket_index(
const _Hash_node_value<_Value, true>& __n,
1307 std::size_t __bkt_count)
const
1308 noexcept( noexcept(declval<const _RangeHash&>()((__hash_code)0,
1310 {
return _RangeHash{}(__n._M_hash_code, __bkt_count); }
1313 _M_store_code(_Hash_node_code_cache<false>&, __hash_code)
const
1317 _M_copy_code(_Hash_node_code_cache<false>&,
1318 const _Hash_node_code_cache<false>&)
const
1322 _M_store_code(_Hash_node_code_cache<true>& __n, __hash_code __c)
const
1323 { __n._M_hash_code = __c; }
1326 _M_copy_code(_Hash_node_code_cache<true>& __to,
1327 const _Hash_node_code_cache<true>& __from)
const
1328 { __to._M_hash_code = __from._M_hash_code; }
1331 _M_swap(_Hash_code_base& __x)
1332 {
std::swap(__ebo_hash::_M_get(), __x.__ebo_hash::_M_get()); }
1335 _M_hash()
const {
return __ebo_hash::_M_cget(); }
1339 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1340 typename _Hash,
typename _RangeHash,
typename _Unused>
1341 struct _Local_iterator_base<_Key, _Value, _ExtractKey,
1342 _Hash, _RangeHash, _Unused, true>
1343 :
public _Node_iterator_base<_Value, true>
1346 using __base_node_iter = _Node_iterator_base<_Value, true>;
1347 using __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,
1348 _Hash, _RangeHash, _Unused,
true>;
1350 _Local_iterator_base() =
default;
1351 _Local_iterator_base(
const __hash_code_base&,
1352 _Hash_node<_Value, true>* __p,
1353 std::size_t __bkt, std::size_t __bkt_count)
1354 : __base_node_iter(__p), _M_bucket(__bkt), _M_bucket_count(__bkt_count)
1360 __base_node_iter::_M_incr();
1364 = _RangeHash{}(this->_M_cur->_M_hash_code, _M_bucket_count);
1365 if (__bkt != _M_bucket)
1366 this->_M_cur =
nullptr;
1370 std::size_t _M_bucket;
1371 std::size_t _M_bucket_count;
1375 _M_get_bucket()
const {
return _M_bucket; }
1382 template<typename _Tp, bool _IsEmpty = std::is_empty<_Tp>::value>
1383 struct _Hash_code_storage
1385 __gnu_cxx::__aligned_buffer<_Tp> _M_storage;
1388 _M_h() {
return _M_storage._M_ptr(); }
1391 _M_h()
const {
return _M_storage._M_ptr(); }
1395 template<
typename _Tp>
1396 struct _Hash_code_storage<_Tp, true>
1403 _M_h() {
return reinterpret_cast<_Tp*
>(
this); }
1406 _M_h()
const {
return reinterpret_cast<const _Tp*
>(
this); }
1409 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1410 typename _Hash,
typename _RangeHash,
typename _Unused>
1411 using __hash_code_for_local_iter
1412 = _Hash_code_storage<_Hash_code_base<_Key, _Value, _ExtractKey,
1413 _Hash, _RangeHash, _Unused,
false>>;
1416 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1417 typename _Hash,
typename _RangeHash,
typename _Unused>
1418 struct _Local_iterator_base<_Key, _Value, _ExtractKey,
1419 _Hash, _RangeHash, _Unused, false>
1420 : __hash_code_for_local_iter<_Key, _Value, _ExtractKey, _Hash, _RangeHash,
1422 , _Node_iterator_base<_Value, false>
1425 using __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,
1426 _Hash, _RangeHash, _Unused,
false>;
1427 using __node_iter_base = _Node_iterator_base<_Value, false>;
1429 _Local_iterator_base() : _M_bucket_count(-1) { }
1431 _Local_iterator_base(
const __hash_code_base&
__base,
1432 _Hash_node<_Value, false>* __p,
1433 std::size_t __bkt, std::size_t __bkt_count)
1434 : __node_iter_base(__p), _M_bucket(__bkt), _M_bucket_count(__bkt_count)
1437 ~_Local_iterator_base()
1439 if (_M_bucket_count !=
size_t(-1))
1443 _Local_iterator_base(
const _Local_iterator_base& __iter)
1444 : __node_iter_base(__iter._M_cur), _M_bucket(__iter._M_bucket)
1445 , _M_bucket_count(__iter._M_bucket_count)
1447 if (_M_bucket_count !=
size_t(-1))
1448 _M_init(*__iter._M_h());
1451 _Local_iterator_base&
1452 operator=(
const _Local_iterator_base& __iter)
1454 if (_M_bucket_count != -1)
1456 this->_M_cur = __iter._M_cur;
1457 _M_bucket = __iter._M_bucket;
1458 _M_bucket_count = __iter._M_bucket_count;
1459 if (_M_bucket_count != -1)
1460 _M_init(*__iter._M_h());
1467 __node_iter_base::_M_incr();
1470 std::size_t __bkt = this->_M_h()->_M_bucket_index(*this->_M_cur,
1472 if (__bkt != _M_bucket)
1473 this->_M_cur =
nullptr;
1477 std::size_t _M_bucket;
1478 std::size_t _M_bucket_count;
1481 _M_init(
const __hash_code_base&
__base)
1482 { ::new(this->_M_h()) __hash_code_base(
__base); }
1485 _M_destroy() { this->_M_h()->~__hash_code_base(); }
1489 _M_get_bucket()
const {
return _M_bucket; }
1493 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1494 typename _Hash,
typename _RangeHash,
typename _Unused,
1495 bool __constant_iterators,
bool __cache>
1496 struct _Local_iterator
1497 :
public _Local_iterator_base<_Key, _Value, _ExtractKey,
1498 _Hash, _RangeHash, _Unused, __cache>
1501 using __base_type = _Local_iterator_base<_Key, _Value, _ExtractKey,
1502 _Hash, _RangeHash, _Unused, __cache>;
1503 using __hash_code_base =
typename __base_type::__hash_code_base;
1506 using value_type = _Value;
1507 using pointer = __conditional_t<__constant_iterators,
1508 const value_type*, value_type*>;
1509 using reference = __conditional_t<__constant_iterators,
1510 const value_type&, value_type&>;
1511 using difference_type = ptrdiff_t;
1512 using iterator_category = forward_iterator_tag;
1514 _Local_iterator() =
default;
1516 _Local_iterator(
const __hash_code_base&
__base,
1517 _Hash_node<_Value, __cache>* __n,
1518 std::size_t __bkt, std::size_t __bkt_count)
1519 : __base_type(
__base, __n, __bkt, __bkt_count)
1524 {
return this->_M_cur->_M_v(); }
1528 {
return this->_M_cur->_M_valptr(); }
1540 _Local_iterator __tmp(*
this);
1547 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1548 typename _Hash,
typename _RangeHash,
typename _Unused,
1549 bool __constant_iterators,
bool __cache>
1550 struct _Local_const_iterator
1551 :
public _Local_iterator_base<_Key, _Value, _ExtractKey,
1552 _Hash, _RangeHash, _Unused, __cache>
1555 using __base_type = _Local_iterator_base<_Key, _Value, _ExtractKey,
1556 _Hash, _RangeHash, _Unused, __cache>;
1557 using __hash_code_base =
typename __base_type::__hash_code_base;
1560 typedef _Value value_type;
1561 typedef const value_type* pointer;
1562 typedef const value_type& reference;
1563 typedef std::ptrdiff_t difference_type;
1566 _Local_const_iterator() =
default;
1568 _Local_const_iterator(
const __hash_code_base&
__base,
1569 _Hash_node<_Value, __cache>* __n,
1570 std::size_t __bkt, std::size_t __bkt_count)
1571 : __base_type(
__base, __n, __bkt, __bkt_count)
1574 _Local_const_iterator(
const _Local_iterator<_Key, _Value, _ExtractKey,
1575 _Hash, _RangeHash, _Unused,
1576 __constant_iterators,
1583 {
return this->_M_cur->_M_v(); }
1587 {
return this->_M_cur->_M_valptr(); }
1589 _Local_const_iterator&
1596 _Local_const_iterator
1599 _Local_const_iterator __tmp(*
this);
1615 template<
typename _Key,
typename _Value,
typename _ExtractKey,
1616 typename _Equal,
typename _Hash,
typename _RangeHash,
1617 typename _Unused,
typename _Traits>
1618 struct _Hashtable_base
1619 :
public _Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash,
1620 _Unused, _Traits::__hash_cached::value>,
1621 private _Hashtable_ebo_helper<0, _Equal>
1624 typedef _Key key_type;
1625 typedef _Value value_type;
1626 typedef _Equal key_equal;
1627 typedef std::size_t size_type;
1628 typedef std::ptrdiff_t difference_type;
1630 using __traits_type = _Traits;
1631 using __hash_cached =
typename __traits_type::__hash_cached;
1633 using __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,
1634 _Hash, _RangeHash, _Unused,
1635 __hash_cached::value>;
1637 using __hash_code =
typename __hash_code_base::__hash_code;
1640 using _EqualEBO = _Hashtable_ebo_helper<0, _Equal>;
1643 _S_equals(__hash_code,
const _Hash_node_code_cache<false>&)
1647 _S_node_equals(
const _Hash_node_code_cache<false>&,
1648 const _Hash_node_code_cache<false>&)
1652 _S_equals(__hash_code __c,
const _Hash_node_code_cache<true>& __n)
1653 {
return __c == __n._M_hash_code; }
1656 _S_node_equals(
const _Hash_node_code_cache<true>& __lhn,
1657 const _Hash_node_code_cache<true>& __rhn)
1658 {
return __lhn._M_hash_code == __rhn._M_hash_code; }
1661 _Hashtable_base() =
default;
1663 _Hashtable_base(
const _Hash& __hash,
const _Equal& __eq)
1664 : __hash_code_base(__hash), _EqualEBO(__eq)
1668 _M_key_equals(
const _Key& __k,
1669 const _Hash_node_value<_Value,
1670 __hash_cached::value>& __n)
const
1672 static_assert(__is_invocable<const _Equal&, const _Key&, const _Key&>{},
1673 "key equality predicate must be invocable with two arguments of "
1675 return _M_eq()(__k, _ExtractKey{}(__n._M_v()));
1678 template<
typename _Kt>
1680 _M_key_equals_tr(
const _Kt& __k,
1681 const _Hash_node_value<_Value,
1682 __hash_cached::value>& __n)
const
1685 __is_invocable<const _Equal&, const _Kt&, const _Key&>{},
1686 "key equality predicate must be invocable with two arguments of "
1688 return _M_eq()(__k, _ExtractKey{}(__n._M_v()));
1692 _M_equals(
const _Key& __k, __hash_code __c,
1693 const _Hash_node_value<_Value, __hash_cached::value>& __n)
const
1694 {
return _S_equals(__c, __n) && _M_key_equals(__k, __n); }
1696 template<
typename _Kt>
1698 _M_equals_tr(
const _Kt& __k, __hash_code __c,
1699 const _Hash_node_value<_Value,
1700 __hash_cached::value>& __n)
const
1701 {
return _S_equals(__c, __n) && _M_key_equals_tr(__k, __n); }
1705 const _Hash_node_value<_Value, __hash_cached::value>& __lhn,
1706 const _Hash_node_value<_Value, __hash_cached::value>& __rhn)
const
1708 return _S_node_equals(__lhn, __rhn)
1709 && _M_key_equals(_ExtractKey{}(__lhn._M_v()), __rhn);
1713 _M_swap(_Hashtable_base& __x)
1715 __hash_code_base::_M_swap(__x);
1716 std::swap(_EqualEBO::_M_get(), __x._EqualEBO::_M_get());
1720 _M_eq()
const {
return _EqualEBO::_M_cget(); }
1731 template<
typename _Key,
typename _Value,
typename _Alloc,
1732 typename _ExtractKey,
typename _Equal,
1733 typename _Hash,
typename _RangeHash,
typename _Unused,
1734 typename _RehashPolicy,
typename _Traits,
1735 bool _Unique_keys = _Traits::__unique_keys::value>
1739 template<
typename _Key,
typename _Value,
typename _Alloc,
1740 typename _ExtractKey,
typename _Equal,
1741 typename _Hash,
typename _RangeHash,
typename _Unused,
1742 typename _RehashPolicy,
typename _Traits>
1743 struct _Equality<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1744 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>
1746 using __hashtable = _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1747 _Hash, _RangeHash, _Unused,
1748 _RehashPolicy, _Traits>;
1751 _M_equal(
const __hashtable&)
const;
1754 template<
typename _Key,
typename _Value,
typename _Alloc,
1755 typename _ExtractKey,
typename _Equal,
1756 typename _Hash,
typename _RangeHash,
typename _Unused,
1757 typename _RehashPolicy,
typename _Traits>
1759 _Equality<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1760 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
true>::
1761 _M_equal(
const __hashtable& __other)
const
1763 using __node_type =
typename __hashtable::__node_type;
1764 const __hashtable* __this =
static_cast<const __hashtable*
>(
this);
1765 if (__this->size() != __other.size())
1768 for (
auto __itx = __this->begin(); __itx != __this->end(); ++__itx)
1770 std::size_t __ybkt = __other._M_bucket_index(*__itx._M_cur);
1771 auto __prev_n = __other._M_buckets[__ybkt];
1775 for (__node_type* __n =
static_cast<__node_type*
>(__prev_n->_M_nxt);;
1776 __n = __n->_M_next())
1778 if (__n->_M_v() == *__itx)
1782 || __other._M_bucket_index(*__n->_M_next()) != __ybkt)
1791 template<
typename _Key,
typename _Value,
typename _Alloc,
1792 typename _ExtractKey,
typename _Equal,
1793 typename _Hash,
typename _RangeHash,
typename _Unused,
1794 typename _RehashPolicy,
typename _Traits>
1795 struct _Equality<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1796 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false>
1798 using __hashtable = _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1799 _Hash, _RangeHash, _Unused,
1800 _RehashPolicy, _Traits>;
1803 _M_equal(
const __hashtable&)
const;
1806 template<
typename _Key,
typename _Value,
typename _Alloc,
1807 typename _ExtractKey,
typename _Equal,
1808 typename _Hash,
typename _RangeHash,
typename _Unused,
1809 typename _RehashPolicy,
typename _Traits>
1811 _Equality<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1812 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits,
false>::
1813 _M_equal(
const __hashtable& __other)
const
1815 using __node_type =
typename __hashtable::__node_type;
1816 const __hashtable* __this =
static_cast<const __hashtable*
>(
this);
1817 if (__this->size() != __other.size())
1820 for (
auto __itx = __this->begin(); __itx != __this->end();)
1822 std::size_t __x_count = 1;
1823 auto __itx_end = __itx;
1824 for (++__itx_end; __itx_end != __this->end()
1825 && __this->key_eq()(_ExtractKey{}(*__itx),
1826 _ExtractKey{}(*__itx_end));
1830 std::size_t __ybkt = __other._M_bucket_index(*__itx._M_cur);
1831 auto __y_prev_n = __other._M_buckets[__ybkt];
1835 __node_type* __y_n =
static_cast<__node_type*
>(__y_prev_n->_M_nxt);
1838 if (__this->key_eq()(_ExtractKey{}(__y_n->_M_v()),
1839 _ExtractKey{}(*__itx)))
1842 auto __y_ref_n = __y_n;
1843 for (__y_n = __y_n->_M_next(); __y_n; __y_n = __y_n->_M_next())
1844 if (!__other._M_node_equals(*__y_ref_n, *__y_n))
1847 if (!__y_n || __other._M_bucket_index(*__y_n) != __ybkt)
1851 typename __hashtable::const_iterator __ity(__y_n);
1852 for (
auto __ity_end = __ity; __ity_end != __other.end(); ++__ity_end)
1853 if (--__x_count == 0)
1859 if (!std::is_permutation(__itx, __itx_end, __ity))
1871 template<
typename _NodeAlloc>
1872 struct _Hashtable_alloc :
private _Hashtable_ebo_helper<0, _NodeAlloc>
1875 using __ebo_node_alloc = _Hashtable_ebo_helper<0, _NodeAlloc>;
1878 struct __get_value_type;
1879 template<
typename _Val,
bool _Cache_hash_code>
1880 struct __get_value_type<_Hash_node<_Val, _Cache_hash_code>>
1881 {
using type = _Val; };
1884 using __node_type =
typename _NodeAlloc::value_type;
1885 using __node_alloc_type = _NodeAlloc;
1889 using __value_alloc_traits =
typename __node_alloc_traits::template
1890 rebind_traits<typename __get_value_type<__node_type>::type>;
1892 using __node_ptr = __node_type*;
1893 using __node_base = _Hash_node_base;
1894 using __node_base_ptr = __node_base*;
1895 using __buckets_alloc_type =
1896 __alloc_rebind<__node_alloc_type, __node_base_ptr>;
1898 using __buckets_ptr = __node_base_ptr*;
1900 _Hashtable_alloc() =
default;
1901 _Hashtable_alloc(
const _Hashtable_alloc&) =
default;
1902 _Hashtable_alloc(_Hashtable_alloc&&) =
default;
1904 template<
typename _Alloc>
1905 _Hashtable_alloc(_Alloc&& __a)
1906 : __ebo_node_alloc(
std::
forward<_Alloc>(__a))
1911 {
return __ebo_node_alloc::_M_get(); }
1913 const __node_alloc_type&
1914 _M_node_allocator()
const
1915 {
return __ebo_node_alloc::_M_cget(); }
1918 template<
typename... _Args>
1920 _M_allocate_node(_Args&&... __args);
1924 _M_deallocate_node(__node_ptr __n);
1928 _M_deallocate_node_ptr(__node_ptr __n);
1933 _M_deallocate_nodes(__node_ptr __n);
1936 _M_allocate_buckets(std::size_t __bkt_count);
1939 _M_deallocate_buckets(__buckets_ptr, std::size_t __bkt_count);
1944 template<
typename _NodeAlloc>
1945 template<
typename... _Args>
1947 _Hashtable_alloc<_NodeAlloc>::_M_allocate_node(_Args&&... __args)
1950 auto __nptr = __node_alloc_traits::allocate(_M_node_allocator(), 1);
1951 __node_ptr __n = std::__to_address(__nptr);
1954 ::new ((
void*)__n) __node_type;
1955 __node_alloc_traits::construct(_M_node_allocator(),
1957 std::forward<_Args>(__args)...);
1962 __node_alloc_traits::deallocate(_M_node_allocator(), __nptr, 1);
1963 __throw_exception_again;
1967 template<
typename _NodeAlloc>
1969 _Hashtable_alloc<_NodeAlloc>::_M_deallocate_node(__node_ptr __n)
1971 __node_alloc_traits::destroy(_M_node_allocator(), __n->_M_valptr());
1972 _M_deallocate_node_ptr(__n);
1975 template<
typename _NodeAlloc>
1977 _Hashtable_alloc<_NodeAlloc>::_M_deallocate_node_ptr(__node_ptr __n)
1979 typedef typename __node_alloc_traits::pointer _Ptr;
1981 __n->~__node_type();
1982 __node_alloc_traits::deallocate(_M_node_allocator(), __ptr, 1);
1985 template<
typename _NodeAlloc>
1987 _Hashtable_alloc<_NodeAlloc>::_M_deallocate_nodes(__node_ptr __n)
1991 __node_ptr __tmp = __n;
1992 __n = __n->_M_next();
1993 _M_deallocate_node(__tmp);
1997 template<
typename _NodeAlloc>
1999 _Hashtable_alloc<_NodeAlloc>::_M_allocate_buckets(std::size_t __bkt_count)
2002 __buckets_alloc_type __alloc(_M_node_allocator());
2004 auto __ptr = __buckets_alloc_traits::allocate(__alloc, __bkt_count);
2005 __buckets_ptr __p = std::__to_address(__ptr);
2006 __builtin_memset(__p, 0, __bkt_count *
sizeof(__node_base_ptr));
2010 template<
typename _NodeAlloc>
2012 _Hashtable_alloc<_NodeAlloc>::
2013 _M_deallocate_buckets(__buckets_ptr __bkts,
2014 std::size_t __bkt_count)
2016 typedef typename __buckets_alloc_traits::pointer _Ptr;
2018 __buckets_alloc_type __alloc(_M_node_allocator());
2019 __buckets_alloc_traits::deallocate(__alloc, __ptr, __bkt_count);
2025 _GLIBCXX_END_NAMESPACE_VERSION
constexpr complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x times y.
integral_constant< bool, true > true_type
The type used as a compile-time boolean with true value.
integral_constant< bool, false > false_type
The type used as a compile-time boolean with false value.
constexpr piecewise_construct_t piecewise_construct
Tag for piecewise construction of std::pair objects.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr tuple< _Elements &&... > forward_as_tuple(_Elements &&... __args) noexcept
std::forward_as_tuple
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
void swap(any &__x, any &__y) noexcept
Exchange the states of two any objects.
constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)
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.
Define a member typedef type only if a boolean constant is true.
Uniform interface to all allocator types.
Traits class for iterators.
Uniform interface to all pointer-like types.
Struct holding two objects of arbitrary type.
Forward iterators support a superset of input iterator operations.
Uniform interface to C++98 and C++11 allocators.