1// -*- C++ -*- 2//===----------------------------------------------------------------------===// 3// 4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5// See https://llvm.org/LICENSE.txt for license information. 6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7// 8//===----------------------------------------------------------------------===// 9 10#ifndef _LIBCPP___HASH_TABLE 11#define _LIBCPP___HASH_TABLE 12 13#include <__algorithm/max.h> 14#include <__algorithm/min.h> 15#include <__assert> 16#include <__bit/countl.h> 17#include <__config> 18#include <__functional/hash.h> 19#include <__functional/invoke.h> 20#include <__iterator/iterator_traits.h> 21#include <__memory/addressof.h> 22#include <__memory/allocator_traits.h> 23#include <__memory/compressed_pair.h> 24#include <__memory/construct_at.h> 25#include <__memory/pointer_traits.h> 26#include <__memory/swap_allocator.h> 27#include <__memory/unique_ptr.h> 28#include <__type_traits/can_extract_key.h> 29#include <__type_traits/conditional.h> 30#include <__type_traits/is_const.h> 31#include <__type_traits/is_constructible.h> 32#include <__type_traits/is_nothrow_assignable.h> 33#include <__type_traits/is_nothrow_constructible.h> 34#include <__type_traits/is_pointer.h> 35#include <__type_traits/is_reference.h> 36#include <__type_traits/is_swappable.h> 37#include <__type_traits/remove_const.h> 38#include <__type_traits/remove_cvref.h> 39#include <__utility/forward.h> 40#include <__utility/move.h> 41#include <__utility/pair.h> 42#include <__utility/swap.h> 43#include <cmath> 44#include <cstring> 45#include <initializer_list> 46#include <new> // __launder 47 48#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 49# pragma GCC system_header 50#endif 51 52_LIBCPP_PUSH_MACROS 53#include <__undef_macros> 54 55_LIBCPP_BEGIN_NAMESPACE_STD 56 57template <class _Key, class _Tp> 58struct __hash_value_type; 59 60template <class _Tp> 61struct __is_hash_value_type_imp : false_type {}; 62 63template <class _Key, class _Value> 64struct __is_hash_value_type_imp<__hash_value_type<_Key, _Value> > : true_type {}; 65 66template <class... _Args> 67struct __is_hash_value_type : false_type {}; 68 69template <class _One> 70struct __is_hash_value_type<_One> : __is_hash_value_type_imp<__remove_cvref_t<_One> > {}; 71 72_LIBCPP_EXPORTED_FROM_ABI size_t __next_prime(size_t __n); 73 74template <class _NodePtr> 75struct __hash_node_base { 76 typedef typename pointer_traits<_NodePtr>::element_type __node_type; 77 typedef __hash_node_base __first_node; 78 typedef __rebind_pointer_t<_NodePtr, __first_node> __node_base_pointer; 79 typedef _NodePtr __node_pointer; 80 81#if defined(_LIBCPP_ABI_FIX_UNORDERED_NODE_POINTER_UB) 82 typedef __node_base_pointer __next_pointer; 83#else 84 typedef __conditional_t<is_pointer<__node_pointer>::value, __node_base_pointer, __node_pointer> __next_pointer; 85#endif 86 87 __next_pointer __next_; 88 89 _LIBCPP_HIDE_FROM_ABI __next_pointer __ptr() _NOEXCEPT { 90 return static_cast<__next_pointer>(pointer_traits<__node_base_pointer>::pointer_to(*this)); 91 } 92 93 _LIBCPP_HIDE_FROM_ABI __node_pointer __upcast() _NOEXCEPT { 94 return static_cast<__node_pointer>(pointer_traits<__node_base_pointer>::pointer_to(*this)); 95 } 96 97 _LIBCPP_HIDE_FROM_ABI size_t __hash() const _NOEXCEPT { return static_cast<__node_type const&>(*this).__hash_; } 98 99 _LIBCPP_HIDE_FROM_ABI __hash_node_base() _NOEXCEPT : __next_(nullptr) {} 100 _LIBCPP_HIDE_FROM_ABI explicit __hash_node_base(__next_pointer __next) _NOEXCEPT : __next_(__next) {} 101}; 102 103template <class _Tp, class _VoidPtr> 104struct __hash_node : public __hash_node_base< __rebind_pointer_t<_VoidPtr, __hash_node<_Tp, _VoidPtr> > > { 105 typedef _Tp __node_value_type; 106 using _Base = __hash_node_base<__rebind_pointer_t<_VoidPtr, __hash_node<_Tp, _VoidPtr> > >; 107 using __next_pointer = typename _Base::__next_pointer; 108 109 size_t __hash_; 110 111 // We allow starting the lifetime of nodes without initializing the value held by the node, 112 // since that is handled by the hash table itself in order to be allocator-aware. 113#ifndef _LIBCPP_CXX03_LANG 114 115private: 116 union { 117 _Tp __value_; 118 }; 119 120public: 121 _LIBCPP_HIDE_FROM_ABI _Tp& __get_value() { return __value_; } 122#else 123 124private: 125 _ALIGNAS_TYPE(_Tp) char __buffer_[sizeof(_Tp)]; 126 127public: 128 _LIBCPP_HIDE_FROM_ABI _Tp& __get_value() { return *std::__launder(reinterpret_cast<_Tp*>(&__buffer_)); } 129#endif 130 131 _LIBCPP_HIDE_FROM_ABI explicit __hash_node(__next_pointer __next, size_t __hash) : _Base(__next), __hash_(__hash) {} 132 _LIBCPP_HIDE_FROM_ABI ~__hash_node() {} 133}; 134 135inline _LIBCPP_HIDE_FROM_ABI bool __is_hash_power2(size_t __bc) { return __bc > 2 && !(__bc & (__bc - 1)); } 136 137inline _LIBCPP_HIDE_FROM_ABI size_t __constrain_hash(size_t __h, size_t __bc) { 138 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) : (__h < __bc ? __h : __h % __bc); 139} 140 141inline _LIBCPP_HIDE_FROM_ABI size_t __next_hash_pow2(size_t __n) { 142 return __n < 2 ? __n : (size_t(1) << (numeric_limits<size_t>::digits - __libcpp_clz(__n - 1))); 143} 144 145template <class _Tp, class _Hash, class _Equal, class _Alloc> 146class __hash_table; 147 148template <class _NodePtr> 149class _LIBCPP_TEMPLATE_VIS __hash_iterator; 150template <class _ConstNodePtr> 151class _LIBCPP_TEMPLATE_VIS __hash_const_iterator; 152template <class _NodePtr> 153class _LIBCPP_TEMPLATE_VIS __hash_local_iterator; 154template <class _ConstNodePtr> 155class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator; 156template <class _HashIterator> 157class _LIBCPP_TEMPLATE_VIS __hash_map_iterator; 158template <class _HashIterator> 159class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator; 160 161template <class _Tp> 162struct __hash_key_value_types { 163 static_assert(!is_reference<_Tp>::value && !is_const<_Tp>::value, ""); 164 typedef _Tp key_type; 165 typedef _Tp __node_value_type; 166 typedef _Tp __container_value_type; 167 static const bool __is_map = false; 168 169 _LIBCPP_HIDE_FROM_ABI static key_type const& __get_key(_Tp const& __v) { return __v; } 170 _LIBCPP_HIDE_FROM_ABI static __container_value_type const& __get_value(__node_value_type const& __v) { return __v; } 171 _LIBCPP_HIDE_FROM_ABI static __container_value_type* __get_ptr(__node_value_type& __n) { return std::addressof(__n); } 172 _LIBCPP_HIDE_FROM_ABI static __container_value_type&& __move(__node_value_type& __v) { return std::move(__v); } 173}; 174 175template <class _Key, class _Tp> 176struct __hash_key_value_types<__hash_value_type<_Key, _Tp> > { 177 typedef _Key key_type; 178 typedef _Tp mapped_type; 179 typedef __hash_value_type<_Key, _Tp> __node_value_type; 180 typedef pair<const _Key, _Tp> __container_value_type; 181 typedef __container_value_type __map_value_type; 182 static const bool __is_map = true; 183 184 _LIBCPP_HIDE_FROM_ABI static key_type const& __get_key(__container_value_type const& __v) { return __v.first; } 185 186 template <class _Up, __enable_if_t<__is_same_uncvref<_Up, __node_value_type>::value, int> = 0> 187 _LIBCPP_HIDE_FROM_ABI static __container_value_type const& __get_value(_Up& __t) { 188 return __t.__get_value(); 189 } 190 191 template <class _Up, __enable_if_t<__is_same_uncvref<_Up, __container_value_type>::value, int> = 0> 192 _LIBCPP_HIDE_FROM_ABI static __container_value_type const& __get_value(_Up& __t) { 193 return __t; 194 } 195 196 _LIBCPP_HIDE_FROM_ABI static __container_value_type* __get_ptr(__node_value_type& __n) { 197 return std::addressof(__n.__get_value()); 198 } 199 _LIBCPP_HIDE_FROM_ABI static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) { return __v.__move(); } 200}; 201 202template <class _Tp, class _AllocPtr, class _KVTypes = __hash_key_value_types<_Tp>, bool = _KVTypes::__is_map> 203struct __hash_map_pointer_types {}; 204 205template <class _Tp, class _AllocPtr, class _KVTypes> 206struct __hash_map_pointer_types<_Tp, _AllocPtr, _KVTypes, true> { 207 typedef typename _KVTypes::__map_value_type _Mv; 208 typedef __rebind_pointer_t<_AllocPtr, _Mv> __map_value_type_pointer; 209 typedef __rebind_pointer_t<_AllocPtr, const _Mv> __const_map_value_type_pointer; 210}; 211 212template <class _NodePtr, class _NodeT = typename pointer_traits<_NodePtr>::element_type> 213struct __hash_node_types; 214 215template <class _NodePtr, class _Tp, class _VoidPtr> 216struct __hash_node_types<_NodePtr, __hash_node<_Tp, _VoidPtr> > 217 : public __hash_key_value_types<_Tp>, 218 __hash_map_pointer_types<_Tp, _VoidPtr> 219 220{ 221 typedef __hash_key_value_types<_Tp> __base; 222 223public: 224 typedef ptrdiff_t difference_type; 225 typedef size_t size_type; 226 227 typedef __rebind_pointer_t<_NodePtr, void> __void_pointer; 228 229 typedef typename pointer_traits<_NodePtr>::element_type __node_type; 230 typedef _NodePtr __node_pointer; 231 232 typedef __hash_node_base<__node_pointer> __node_base_type; 233 typedef __rebind_pointer_t<_NodePtr, __node_base_type> __node_base_pointer; 234 235 typedef typename __node_base_type::__next_pointer __next_pointer; 236 237 typedef _Tp __node_value_type; 238 typedef __rebind_pointer_t<_VoidPtr, __node_value_type> __node_value_type_pointer; 239 typedef __rebind_pointer_t<_VoidPtr, const __node_value_type> __const_node_value_type_pointer; 240 241private: 242 static_assert(!is_const<__node_type>::value, "_NodePtr should never be a pointer to const"); 243 static_assert((is_same<typename pointer_traits<_VoidPtr>::element_type, void>::value), 244 "_VoidPtr does not point to unqualified void type"); 245 static_assert((is_same<__rebind_pointer_t<_VoidPtr, __node_type>, _NodePtr>::value), 246 "_VoidPtr does not rebind to _NodePtr."); 247}; 248 249template <class _HashIterator> 250struct __hash_node_types_from_iterator; 251template <class _NodePtr> 252struct __hash_node_types_from_iterator<__hash_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {}; 253template <class _NodePtr> 254struct __hash_node_types_from_iterator<__hash_const_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {}; 255template <class _NodePtr> 256struct __hash_node_types_from_iterator<__hash_local_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {}; 257template <class _NodePtr> 258struct __hash_node_types_from_iterator<__hash_const_local_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {}; 259 260template <class _NodeValueTp, class _VoidPtr> 261struct __make_hash_node_types { 262 typedef __hash_node<_NodeValueTp, _VoidPtr> _NodeTp; 263 typedef __rebind_pointer_t<_VoidPtr, _NodeTp> _NodePtr; 264 typedef __hash_node_types<_NodePtr> type; 265}; 266 267template <class _NodePtr> 268class _LIBCPP_TEMPLATE_VIS __hash_iterator { 269 typedef __hash_node_types<_NodePtr> _NodeTypes; 270 typedef _NodePtr __node_pointer; 271 typedef typename _NodeTypes::__next_pointer __next_pointer; 272 273 __next_pointer __node_; 274 275public: 276 typedef forward_iterator_tag iterator_category; 277 typedef typename _NodeTypes::__node_value_type value_type; 278 typedef typename _NodeTypes::difference_type difference_type; 279 typedef value_type& reference; 280 typedef typename _NodeTypes::__node_value_type_pointer pointer; 281 282 _LIBCPP_HIDE_FROM_ABI __hash_iterator() _NOEXCEPT : __node_(nullptr) {} 283 284 _LIBCPP_HIDE_FROM_ABI reference operator*() const { 285 _LIBCPP_ASSERT_NON_NULL( 286 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container iterator"); 287 return __node_->__upcast()->__get_value(); 288 } 289 290 _LIBCPP_HIDE_FROM_ABI pointer operator->() const { 291 _LIBCPP_ASSERT_NON_NULL( 292 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container iterator"); 293 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__get_value()); 294 } 295 296 _LIBCPP_HIDE_FROM_ABI __hash_iterator& operator++() { 297 _LIBCPP_ASSERT_NON_NULL( 298 __node_ != nullptr, "Attempted to increment a non-incrementable unordered container iterator"); 299 __node_ = __node_->__next_; 300 return *this; 301 } 302 303 _LIBCPP_HIDE_FROM_ABI __hash_iterator operator++(int) { 304 __hash_iterator __t(*this); 305 ++(*this); 306 return __t; 307 } 308 309 friend _LIBCPP_HIDE_FROM_ABI bool operator==(const __hash_iterator& __x, const __hash_iterator& __y) { 310 return __x.__node_ == __y.__node_; 311 } 312 friend _LIBCPP_HIDE_FROM_ABI bool operator!=(const __hash_iterator& __x, const __hash_iterator& __y) { 313 return !(__x == __y); 314 } 315 316private: 317 _LIBCPP_HIDE_FROM_ABI explicit __hash_iterator(__next_pointer __node) _NOEXCEPT : __node_(__node) {} 318 319 template <class, class, class, class> 320 friend class __hash_table; 321 template <class> 322 friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator; 323 template <class> 324 friend class _LIBCPP_TEMPLATE_VIS __hash_map_iterator; 325 template <class, class, class, class, class> 326 friend class _LIBCPP_TEMPLATE_VIS unordered_map; 327 template <class, class, class, class, class> 328 friend class _LIBCPP_TEMPLATE_VIS unordered_multimap; 329}; 330 331template <class _NodePtr> 332class _LIBCPP_TEMPLATE_VIS __hash_const_iterator { 333 static_assert(!is_const<typename pointer_traits<_NodePtr>::element_type>::value, ""); 334 typedef __hash_node_types<_NodePtr> _NodeTypes; 335 typedef _NodePtr __node_pointer; 336 typedef typename _NodeTypes::__next_pointer __next_pointer; 337 338 __next_pointer __node_; 339 340public: 341 typedef __hash_iterator<_NodePtr> __non_const_iterator; 342 343 typedef forward_iterator_tag iterator_category; 344 typedef typename _NodeTypes::__node_value_type value_type; 345 typedef typename _NodeTypes::difference_type difference_type; 346 typedef const value_type& reference; 347 typedef typename _NodeTypes::__const_node_value_type_pointer pointer; 348 349 _LIBCPP_HIDE_FROM_ABI __hash_const_iterator() _NOEXCEPT : __node_(nullptr) {} 350 351 _LIBCPP_HIDE_FROM_ABI __hash_const_iterator(const __non_const_iterator& __x) _NOEXCEPT : __node_(__x.__node_) {} 352 353 _LIBCPP_HIDE_FROM_ABI reference operator*() const { 354 _LIBCPP_ASSERT_NON_NULL( 355 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container const_iterator"); 356 return __node_->__upcast()->__get_value(); 357 } 358 _LIBCPP_HIDE_FROM_ABI pointer operator->() const { 359 _LIBCPP_ASSERT_NON_NULL( 360 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container const_iterator"); 361 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__get_value()); 362 } 363 364 _LIBCPP_HIDE_FROM_ABI __hash_const_iterator& operator++() { 365 _LIBCPP_ASSERT_NON_NULL( 366 __node_ != nullptr, "Attempted to increment a non-incrementable unordered container const_iterator"); 367 __node_ = __node_->__next_; 368 return *this; 369 } 370 371 _LIBCPP_HIDE_FROM_ABI __hash_const_iterator operator++(int) { 372 __hash_const_iterator __t(*this); 373 ++(*this); 374 return __t; 375 } 376 377 friend _LIBCPP_HIDE_FROM_ABI bool operator==(const __hash_const_iterator& __x, const __hash_const_iterator& __y) { 378 return __x.__node_ == __y.__node_; 379 } 380 friend _LIBCPP_HIDE_FROM_ABI bool operator!=(const __hash_const_iterator& __x, const __hash_const_iterator& __y) { 381 return !(__x == __y); 382 } 383 384private: 385 _LIBCPP_HIDE_FROM_ABI explicit __hash_const_iterator(__next_pointer __node) _NOEXCEPT : __node_(__node) {} 386 387 template <class, class, class, class> 388 friend class __hash_table; 389 template <class> 390 friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator; 391 template <class, class, class, class, class> 392 friend class _LIBCPP_TEMPLATE_VIS unordered_map; 393 template <class, class, class, class, class> 394 friend class _LIBCPP_TEMPLATE_VIS unordered_multimap; 395}; 396 397template <class _NodePtr> 398class _LIBCPP_TEMPLATE_VIS __hash_local_iterator { 399 typedef __hash_node_types<_NodePtr> _NodeTypes; 400 typedef _NodePtr __node_pointer; 401 typedef typename _NodeTypes::__next_pointer __next_pointer; 402 403 __next_pointer __node_; 404 size_t __bucket_; 405 size_t __bucket_count_; 406 407public: 408 typedef forward_iterator_tag iterator_category; 409 typedef typename _NodeTypes::__node_value_type value_type; 410 typedef typename _NodeTypes::difference_type difference_type; 411 typedef value_type& reference; 412 typedef typename _NodeTypes::__node_value_type_pointer pointer; 413 414 _LIBCPP_HIDE_FROM_ABI __hash_local_iterator() _NOEXCEPT : __node_(nullptr) {} 415 416 _LIBCPP_HIDE_FROM_ABI reference operator*() const { 417 _LIBCPP_ASSERT_NON_NULL( 418 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container local_iterator"); 419 return __node_->__upcast()->__get_value(); 420 } 421 422 _LIBCPP_HIDE_FROM_ABI pointer operator->() const { 423 _LIBCPP_ASSERT_NON_NULL( 424 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container local_iterator"); 425 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__get_value()); 426 } 427 428 _LIBCPP_HIDE_FROM_ABI __hash_local_iterator& operator++() { 429 _LIBCPP_ASSERT_NON_NULL( 430 __node_ != nullptr, "Attempted to increment a non-incrementable unordered container local_iterator"); 431 __node_ = __node_->__next_; 432 if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_) 433 __node_ = nullptr; 434 return *this; 435 } 436 437 _LIBCPP_HIDE_FROM_ABI __hash_local_iterator operator++(int) { 438 __hash_local_iterator __t(*this); 439 ++(*this); 440 return __t; 441 } 442 443 friend _LIBCPP_HIDE_FROM_ABI bool operator==(const __hash_local_iterator& __x, const __hash_local_iterator& __y) { 444 return __x.__node_ == __y.__node_; 445 } 446 friend _LIBCPP_HIDE_FROM_ABI bool operator!=(const __hash_local_iterator& __x, const __hash_local_iterator& __y) { 447 return !(__x == __y); 448 } 449 450private: 451 _LIBCPP_HIDE_FROM_ABI explicit __hash_local_iterator( 452 __next_pointer __node, size_t __bucket, size_t __bucket_count) _NOEXCEPT 453 : __node_(__node), 454 __bucket_(__bucket), 455 __bucket_count_(__bucket_count) { 456 if (__node_ != nullptr) 457 __node_ = __node_->__next_; 458 } 459 460 template <class, class, class, class> 461 friend class __hash_table; 462 template <class> 463 friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator; 464 template <class> 465 friend class _LIBCPP_TEMPLATE_VIS __hash_map_iterator; 466}; 467 468template <class _ConstNodePtr> 469class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator { 470 typedef __hash_node_types<_ConstNodePtr> _NodeTypes; 471 typedef _ConstNodePtr __node_pointer; 472 typedef typename _NodeTypes::__next_pointer __next_pointer; 473 474 __next_pointer __node_; 475 size_t __bucket_; 476 size_t __bucket_count_; 477 478 typedef pointer_traits<__node_pointer> __pointer_traits; 479 typedef typename __pointer_traits::element_type __node; 480 typedef __remove_const_t<__node> __non_const_node; 481 typedef __rebind_pointer_t<__node_pointer, __non_const_node> __non_const_node_pointer; 482 483public: 484 typedef __hash_local_iterator<__non_const_node_pointer> __non_const_iterator; 485 486 typedef forward_iterator_tag iterator_category; 487 typedef typename _NodeTypes::__node_value_type value_type; 488 typedef typename _NodeTypes::difference_type difference_type; 489 typedef const value_type& reference; 490 typedef typename _NodeTypes::__const_node_value_type_pointer pointer; 491 492 _LIBCPP_HIDE_FROM_ABI __hash_const_local_iterator() _NOEXCEPT : __node_(nullptr) {} 493 494 _LIBCPP_HIDE_FROM_ABI __hash_const_local_iterator(const __non_const_iterator& __x) _NOEXCEPT 495 : __node_(__x.__node_), 496 __bucket_(__x.__bucket_), 497 __bucket_count_(__x.__bucket_count_) {} 498 499 _LIBCPP_HIDE_FROM_ABI reference operator*() const { 500 _LIBCPP_ASSERT_NON_NULL( 501 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container const_local_iterator"); 502 return __node_->__upcast()->__get_value(); 503 } 504 505 _LIBCPP_HIDE_FROM_ABI pointer operator->() const { 506 _LIBCPP_ASSERT_NON_NULL( 507 __node_ != nullptr, "Attempted to dereference a non-dereferenceable unordered container const_local_iterator"); 508 return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__get_value()); 509 } 510 511 _LIBCPP_HIDE_FROM_ABI __hash_const_local_iterator& operator++() { 512 _LIBCPP_ASSERT_NON_NULL( 513 __node_ != nullptr, "Attempted to increment a non-incrementable unordered container const_local_iterator"); 514 __node_ = __node_->__next_; 515 if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_) 516 __node_ = nullptr; 517 return *this; 518 } 519 520 _LIBCPP_HIDE_FROM_ABI __hash_const_local_iterator operator++(int) { 521 __hash_const_local_iterator __t(*this); 522 ++(*this); 523 return __t; 524 } 525 526 friend _LIBCPP_HIDE_FROM_ABI bool 527 operator==(const __hash_const_local_iterator& __x, const __hash_const_local_iterator& __y) { 528 return __x.__node_ == __y.__node_; 529 } 530 friend _LIBCPP_HIDE_FROM_ABI bool 531 operator!=(const __hash_const_local_iterator& __x, const __hash_const_local_iterator& __y) { 532 return !(__x == __y); 533 } 534 535private: 536 _LIBCPP_HIDE_FROM_ABI explicit __hash_const_local_iterator( 537 __next_pointer __node_ptr, size_t __bucket, size_t __bucket_count) _NOEXCEPT 538 : __node_(__node_ptr), 539 __bucket_(__bucket), 540 __bucket_count_(__bucket_count) { 541 if (__node_ != nullptr) 542 __node_ = __node_->__next_; 543 } 544 545 template <class, class, class, class> 546 friend class __hash_table; 547 template <class> 548 friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator; 549}; 550 551template <class _Alloc> 552class __bucket_list_deallocator { 553 typedef _Alloc allocator_type; 554 typedef allocator_traits<allocator_type> __alloc_traits; 555 typedef typename __alloc_traits::size_type size_type; 556 557 __compressed_pair<size_type, allocator_type> __data_; 558 559public: 560 typedef typename __alloc_traits::pointer pointer; 561 562 _LIBCPP_HIDE_FROM_ABI __bucket_list_deallocator() _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value) 563 : __data_(0, __default_init_tag()) {} 564 565 _LIBCPP_HIDE_FROM_ABI __bucket_list_deallocator(const allocator_type& __a, size_type __size) 566 _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value) 567 : __data_(__size, __a) {} 568 569 _LIBCPP_HIDE_FROM_ABI __bucket_list_deallocator(__bucket_list_deallocator&& __x) 570 _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value) 571 : __data_(std::move(__x.__data_)) { 572 __x.size() = 0; 573 } 574 575 _LIBCPP_HIDE_FROM_ABI size_type& size() _NOEXCEPT { return __data_.first(); } 576 _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __data_.first(); } 577 578 _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT { return __data_.second(); } 579 _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT { return __data_.second(); } 580 581 _LIBCPP_HIDE_FROM_ABI void operator()(pointer __p) _NOEXCEPT { __alloc_traits::deallocate(__alloc(), __p, size()); } 582}; 583 584template <class _Alloc> 585class __hash_map_node_destructor; 586 587template <class _Alloc> 588class __hash_node_destructor { 589 typedef _Alloc allocator_type; 590 typedef allocator_traits<allocator_type> __alloc_traits; 591 592public: 593 typedef typename __alloc_traits::pointer pointer; 594 595private: 596 typedef __hash_node_types<pointer> _NodeTypes; 597 598 allocator_type& __na_; 599 600public: 601 bool __value_constructed; 602 603 _LIBCPP_HIDE_FROM_ABI __hash_node_destructor(__hash_node_destructor const&) = default; 604 _LIBCPP_HIDE_FROM_ABI __hash_node_destructor& operator=(const __hash_node_destructor&) = delete; 605 606 _LIBCPP_HIDE_FROM_ABI explicit __hash_node_destructor(allocator_type& __na, bool __constructed = false) _NOEXCEPT 607 : __na_(__na), 608 __value_constructed(__constructed) {} 609 610 _LIBCPP_HIDE_FROM_ABI void operator()(pointer __p) _NOEXCEPT { 611 if (__value_constructed) { 612 __alloc_traits::destroy(__na_, _NodeTypes::__get_ptr(__p->__get_value())); 613 std::__destroy_at(std::addressof(*__p)); 614 } 615 if (__p) 616 __alloc_traits::deallocate(__na_, __p, 1); 617 } 618 619 template <class> 620 friend class __hash_map_node_destructor; 621}; 622 623#if _LIBCPP_STD_VER >= 17 624template <class _NodeType, class _Alloc> 625struct __generic_container_node_destructor; 626 627template <class _Tp, class _VoidPtr, class _Alloc> 628struct __generic_container_node_destructor<__hash_node<_Tp, _VoidPtr>, _Alloc> : __hash_node_destructor<_Alloc> { 629 using __hash_node_destructor<_Alloc>::__hash_node_destructor; 630}; 631#endif 632 633template <class _Key, class _Hash, class _Equal> 634struct __enforce_unordered_container_requirements { 635#ifndef _LIBCPP_CXX03_LANG 636 static_assert(__check_hash_requirements<_Key, _Hash>::value, 637 "the specified hash does not meet the Hash requirements"); 638 static_assert(is_copy_constructible<_Equal>::value, "the specified comparator is required to be copy constructible"); 639#endif 640 typedef int type; 641}; 642 643template <class _Key, class _Hash, class _Equal> 644#ifndef _LIBCPP_CXX03_LANG 645_LIBCPP_DIAGNOSE_WARNING(!__invokable<_Equal const&, _Key const&, _Key const&>::value, 646 "the specified comparator type does not provide a viable const call operator") 647_LIBCPP_DIAGNOSE_WARNING(!__invokable<_Hash const&, _Key const&>::value, 648 "the specified hash functor does not provide a viable const call operator") 649#endif 650 typename __enforce_unordered_container_requirements<_Key, _Hash, _Equal>::type 651 __diagnose_unordered_container_requirements(int); 652 653// This dummy overload is used so that the compiler won't emit a spurious 654// "no matching function for call to __diagnose_unordered_xxx" diagnostic 655// when the overload above causes a hard error. 656template <class _Key, class _Hash, class _Equal> 657int __diagnose_unordered_container_requirements(void*); 658 659template <class _Tp, class _Hash, class _Equal, class _Alloc> 660class __hash_table { 661public: 662 typedef _Tp value_type; 663 typedef _Hash hasher; 664 typedef _Equal key_equal; 665 typedef _Alloc allocator_type; 666 667private: 668 typedef allocator_traits<allocator_type> __alloc_traits; 669 typedef typename __make_hash_node_types<value_type, typename __alloc_traits::void_pointer>::type _NodeTypes; 670 671public: 672 typedef typename _NodeTypes::__node_value_type __node_value_type; 673 typedef typename _NodeTypes::__container_value_type __container_value_type; 674 typedef typename _NodeTypes::key_type key_type; 675 typedef value_type& reference; 676 typedef const value_type& const_reference; 677 typedef typename __alloc_traits::pointer pointer; 678 typedef typename __alloc_traits::const_pointer const_pointer; 679#ifndef _LIBCPP_ABI_FIX_UNORDERED_CONTAINER_SIZE_TYPE 680 typedef typename __alloc_traits::size_type size_type; 681#else 682 typedef typename _NodeTypes::size_type size_type; 683#endif 684 typedef typename _NodeTypes::difference_type difference_type; 685 686public: 687 // Create __node 688 689 typedef typename _NodeTypes::__node_type __node; 690 typedef __rebind_alloc<__alloc_traits, __node> __node_allocator; 691 typedef allocator_traits<__node_allocator> __node_traits; 692 typedef typename _NodeTypes::__void_pointer __void_pointer; 693 typedef typename _NodeTypes::__node_pointer __node_pointer; 694 typedef typename _NodeTypes::__node_pointer __node_const_pointer; 695 typedef typename _NodeTypes::__node_base_type __first_node; 696 typedef typename _NodeTypes::__node_base_pointer __node_base_pointer; 697 typedef typename _NodeTypes::__next_pointer __next_pointer; 698 699private: 700 // check for sane allocator pointer rebinding semantics. Rebinding the 701 // allocator for a new pointer type should be exactly the same as rebinding 702 // the pointer using 'pointer_traits'. 703 static_assert((is_same<__node_pointer, typename __node_traits::pointer>::value), 704 "Allocator does not rebind pointers in a sane manner."); 705 typedef __rebind_alloc<__node_traits, __first_node> __node_base_allocator; 706 typedef allocator_traits<__node_base_allocator> __node_base_traits; 707 static_assert((is_same<__node_base_pointer, typename __node_base_traits::pointer>::value), 708 "Allocator does not rebind pointers in a sane manner."); 709 710private: 711 typedef __rebind_alloc<__node_traits, __next_pointer> __pointer_allocator; 712 typedef __bucket_list_deallocator<__pointer_allocator> __bucket_list_deleter; 713 typedef unique_ptr<__next_pointer[], __bucket_list_deleter> __bucket_list; 714 typedef allocator_traits<__pointer_allocator> __pointer_alloc_traits; 715 typedef typename __bucket_list_deleter::pointer __node_pointer_pointer; 716 717 // --- Member data begin --- 718 __bucket_list __bucket_list_; 719 __compressed_pair<__first_node, __node_allocator> __p1_; 720 __compressed_pair<size_type, hasher> __p2_; 721 __compressed_pair<float, key_equal> __p3_; 722 // --- Member data end --- 723 724 _LIBCPP_HIDE_FROM_ABI size_type& size() _NOEXCEPT { return __p2_.first(); } 725 726public: 727 _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __p2_.first(); } 728 729 _LIBCPP_HIDE_FROM_ABI hasher& hash_function() _NOEXCEPT { return __p2_.second(); } 730 _LIBCPP_HIDE_FROM_ABI const hasher& hash_function() const _NOEXCEPT { return __p2_.second(); } 731 732 _LIBCPP_HIDE_FROM_ABI float& max_load_factor() _NOEXCEPT { return __p3_.first(); } 733 _LIBCPP_HIDE_FROM_ABI float max_load_factor() const _NOEXCEPT { return __p3_.first(); } 734 735 _LIBCPP_HIDE_FROM_ABI key_equal& key_eq() _NOEXCEPT { return __p3_.second(); } 736 _LIBCPP_HIDE_FROM_ABI const key_equal& key_eq() const _NOEXCEPT { return __p3_.second(); } 737 738 _LIBCPP_HIDE_FROM_ABI __node_allocator& __node_alloc() _NOEXCEPT { return __p1_.second(); } 739 _LIBCPP_HIDE_FROM_ABI const __node_allocator& __node_alloc() const _NOEXCEPT { return __p1_.second(); } 740 741public: 742 typedef __hash_iterator<__node_pointer> iterator; 743 typedef __hash_const_iterator<__node_pointer> const_iterator; 744 typedef __hash_local_iterator<__node_pointer> local_iterator; 745 typedef __hash_const_local_iterator<__node_pointer> const_local_iterator; 746 747 _LIBCPP_HIDE_FROM_ABI __hash_table() _NOEXCEPT_( 748 is_nothrow_default_constructible<__bucket_list>::value&& is_nothrow_default_constructible<__first_node>::value&& 749 is_nothrow_default_constructible<__node_allocator>::value&& is_nothrow_default_constructible<hasher>::value&& 750 is_nothrow_default_constructible<key_equal>::value); 751 _LIBCPP_HIDE_FROM_ABI __hash_table(const hasher& __hf, const key_equal& __eql); 752 _LIBCPP_HIDE_FROM_ABI __hash_table(const hasher& __hf, const key_equal& __eql, const allocator_type& __a); 753 _LIBCPP_HIDE_FROM_ABI explicit __hash_table(const allocator_type& __a); 754 _LIBCPP_HIDE_FROM_ABI __hash_table(const __hash_table& __u); 755 _LIBCPP_HIDE_FROM_ABI __hash_table(const __hash_table& __u, const allocator_type& __a); 756 _LIBCPP_HIDE_FROM_ABI __hash_table(__hash_table&& __u) _NOEXCEPT_( 757 is_nothrow_move_constructible<__bucket_list>::value&& is_nothrow_move_constructible<__first_node>::value&& 758 is_nothrow_move_constructible<__node_allocator>::value&& is_nothrow_move_constructible<hasher>::value&& 759 is_nothrow_move_constructible<key_equal>::value); 760 _LIBCPP_HIDE_FROM_ABI __hash_table(__hash_table&& __u, const allocator_type& __a); 761 _LIBCPP_HIDE_FROM_ABI ~__hash_table(); 762 763 _LIBCPP_HIDE_FROM_ABI __hash_table& operator=(const __hash_table& __u); 764 _LIBCPP_HIDE_FROM_ABI __hash_table& operator=(__hash_table&& __u) 765 _NOEXCEPT_(__node_traits::propagate_on_container_move_assignment::value&& 766 is_nothrow_move_assignable<__node_allocator>::value&& is_nothrow_move_assignable<hasher>::value&& 767 is_nothrow_move_assignable<key_equal>::value); 768 template <class _InputIterator> 769 _LIBCPP_HIDE_FROM_ABI void __assign_unique(_InputIterator __first, _InputIterator __last); 770 template <class _InputIterator> 771 _LIBCPP_HIDE_FROM_ABI void __assign_multi(_InputIterator __first, _InputIterator __last); 772 773 _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT { 774 return std::min<size_type>(__node_traits::max_size(__node_alloc()), numeric_limits<difference_type >::max()); 775 } 776 777private: 778 _LIBCPP_HIDE_FROM_ABI __next_pointer __node_insert_multi_prepare(size_t __cp_hash, value_type& __cp_val); 779 _LIBCPP_HIDE_FROM_ABI void __node_insert_multi_perform(__node_pointer __cp, __next_pointer __pn) _NOEXCEPT; 780 781 _LIBCPP_HIDE_FROM_ABI __next_pointer __node_insert_unique_prepare(size_t __nd_hash, value_type& __nd_val); 782 _LIBCPP_HIDE_FROM_ABI void __node_insert_unique_perform(__node_pointer __ptr) _NOEXCEPT; 783 784public: 785 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __node_insert_unique(__node_pointer __nd); 786 _LIBCPP_HIDE_FROM_ABI iterator __node_insert_multi(__node_pointer __nd); 787 _LIBCPP_HIDE_FROM_ABI iterator __node_insert_multi(const_iterator __p, __node_pointer __nd); 788 789 template <class _Key, class... _Args> 790 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique_key_args(_Key const& __k, _Args&&... __args); 791 792 template <class... _Args> 793 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique_impl(_Args&&... __args); 794 795 template <class _Pp> 796 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique(_Pp&& __x) { 797 return __emplace_unique_extract_key(std::forward<_Pp>(__x), __can_extract_key<_Pp, key_type>()); 798 } 799 800 template <class _First, 801 class _Second, 802 __enable_if_t<__can_extract_map_key<_First, key_type, __container_value_type>::value, int> = 0> 803 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique(_First&& __f, _Second&& __s) { 804 return __emplace_unique_key_args(__f, std::forward<_First>(__f), std::forward<_Second>(__s)); 805 } 806 807 template <class... _Args> 808 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique(_Args&&... __args) { 809 return __emplace_unique_impl(std::forward<_Args>(__args)...); 810 } 811 812 template <class _Pp> 813 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique_extract_key(_Pp&& __x, __extract_key_fail_tag) { 814 return __emplace_unique_impl(std::forward<_Pp>(__x)); 815 } 816 template <class _Pp> 817 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique_extract_key(_Pp&& __x, __extract_key_self_tag) { 818 return __emplace_unique_key_args(__x, std::forward<_Pp>(__x)); 819 } 820 template <class _Pp> 821 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique_extract_key(_Pp&& __x, __extract_key_first_tag) { 822 return __emplace_unique_key_args(__x.first, std::forward<_Pp>(__x)); 823 } 824 825 template <class... _Args> 826 _LIBCPP_HIDE_FROM_ABI iterator __emplace_multi(_Args&&... __args); 827 template <class... _Args> 828 _LIBCPP_HIDE_FROM_ABI iterator __emplace_hint_multi(const_iterator __p, _Args&&... __args); 829 830 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __insert_unique(__container_value_type&& __x) { 831 return __emplace_unique_key_args(_NodeTypes::__get_key(__x), std::move(__x)); 832 } 833 834 template <class _Pp, __enable_if_t<!__is_same_uncvref<_Pp, __container_value_type>::value, int> = 0> 835 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __insert_unique(_Pp&& __x) { 836 return __emplace_unique(std::forward<_Pp>(__x)); 837 } 838 839 template <class _Pp> 840 _LIBCPP_HIDE_FROM_ABI iterator __insert_multi(_Pp&& __x) { 841 return __emplace_multi(std::forward<_Pp>(__x)); 842 } 843 844 template <class _Pp> 845 _LIBCPP_HIDE_FROM_ABI iterator __insert_multi(const_iterator __p, _Pp&& __x) { 846 return __emplace_hint_multi(__p, std::forward<_Pp>(__x)); 847 } 848 849 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __insert_unique(const __container_value_type& __x) { 850 return __emplace_unique_key_args(_NodeTypes::__get_key(__x), __x); 851 } 852 853#if _LIBCPP_STD_VER >= 17 854 template <class _NodeHandle, class _InsertReturnType> 855 _LIBCPP_HIDE_FROM_ABI _InsertReturnType __node_handle_insert_unique(_NodeHandle&& __nh); 856 template <class _NodeHandle> 857 _LIBCPP_HIDE_FROM_ABI iterator __node_handle_insert_unique(const_iterator __hint, _NodeHandle&& __nh); 858 template <class _Table> 859 _LIBCPP_HIDE_FROM_ABI void __node_handle_merge_unique(_Table& __source); 860 861 template <class _NodeHandle> 862 _LIBCPP_HIDE_FROM_ABI iterator __node_handle_insert_multi(_NodeHandle&& __nh); 863 template <class _NodeHandle> 864 _LIBCPP_HIDE_FROM_ABI iterator __node_handle_insert_multi(const_iterator __hint, _NodeHandle&& __nh); 865 template <class _Table> 866 _LIBCPP_HIDE_FROM_ABI void __node_handle_merge_multi(_Table& __source); 867 868 template <class _NodeHandle> 869 _LIBCPP_HIDE_FROM_ABI _NodeHandle __node_handle_extract(key_type const& __key); 870 template <class _NodeHandle> 871 _LIBCPP_HIDE_FROM_ABI _NodeHandle __node_handle_extract(const_iterator __it); 872#endif 873 874 _LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT; 875 _LIBCPP_HIDE_FROM_ABI void __rehash_unique(size_type __n) { __rehash<true>(__n); } 876 _LIBCPP_HIDE_FROM_ABI void __rehash_multi(size_type __n) { __rehash<false>(__n); } 877 _LIBCPP_HIDE_FROM_ABI void __reserve_unique(size_type __n) { 878 __rehash_unique(static_cast<size_type>(std::ceil(__n / max_load_factor()))); 879 } 880 _LIBCPP_HIDE_FROM_ABI void __reserve_multi(size_type __n) { 881 __rehash_multi(static_cast<size_type>(std::ceil(__n / max_load_factor()))); 882 } 883 884 _LIBCPP_HIDE_FROM_ABI size_type bucket_count() const _NOEXCEPT { return __bucket_list_.get_deleter().size(); } 885 886 _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT; 887 _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT; 888 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT; 889 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT; 890 891 template <class _Key> 892 _LIBCPP_HIDE_FROM_ABI size_type bucket(const _Key& __k) const { 893 _LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN( 894 bucket_count() > 0, "unordered container::bucket(key) called when bucket_count() == 0"); 895 return std::__constrain_hash(hash_function()(__k), bucket_count()); 896 } 897 898 template <class _Key> 899 _LIBCPP_HIDE_FROM_ABI iterator find(const _Key& __x); 900 template <class _Key> 901 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _Key& __x) const; 902 903 typedef __hash_node_destructor<__node_allocator> _Dp; 904 typedef unique_ptr<__node, _Dp> __node_holder; 905 906 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p); 907 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last); 908 template <class _Key> 909 _LIBCPP_HIDE_FROM_ABI size_type __erase_unique(const _Key& __k); 910 template <class _Key> 911 _LIBCPP_HIDE_FROM_ABI size_type __erase_multi(const _Key& __k); 912 _LIBCPP_HIDE_FROM_ABI __node_holder remove(const_iterator __p) _NOEXCEPT; 913 914 template <class _Key> 915 _LIBCPP_HIDE_FROM_ABI size_type __count_unique(const _Key& __k) const; 916 template <class _Key> 917 _LIBCPP_HIDE_FROM_ABI size_type __count_multi(const _Key& __k) const; 918 919 template <class _Key> 920 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> __equal_range_unique(const _Key& __k); 921 template <class _Key> 922 _LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> __equal_range_unique(const _Key& __k) const; 923 924 template <class _Key> 925 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> __equal_range_multi(const _Key& __k); 926 template <class _Key> 927 _LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> __equal_range_multi(const _Key& __k) const; 928 929 _LIBCPP_HIDE_FROM_ABI void swap(__hash_table& __u) 930#if _LIBCPP_STD_VER <= 11 931 _NOEXCEPT_(__is_nothrow_swappable<hasher>::value&& __is_nothrow_swappable<key_equal>::value && 932 (!allocator_traits<__pointer_allocator>::propagate_on_container_swap::value || 933 __is_nothrow_swappable<__pointer_allocator>::value) && 934 (!__node_traits::propagate_on_container_swap::value || 935 __is_nothrow_swappable<__node_allocator>::value)); 936#else 937 _NOEXCEPT_(__is_nothrow_swappable<hasher>::value&& __is_nothrow_swappable<key_equal>::value); 938#endif 939 940 _LIBCPP_HIDE_FROM_ABI size_type max_bucket_count() const _NOEXCEPT { return max_size(); } 941 _LIBCPP_HIDE_FROM_ABI size_type bucket_size(size_type __n) const; 942 _LIBCPP_HIDE_FROM_ABI float load_factor() const _NOEXCEPT { 943 size_type __bc = bucket_count(); 944 return __bc != 0 ? (float)size() / __bc : 0.f; 945 } 946 _LIBCPP_HIDE_FROM_ABI void max_load_factor(float __mlf) _NOEXCEPT { 947 // While passing a non-positive load factor is undefined behavior, in practice the result will be benign (the 948 // call will be equivalent to `max_load_factor(load_factor())`, which is also the case for passing a valid value 949 // less than the current `load_factor`). 950 _LIBCPP_ASSERT_PEDANTIC(__mlf > 0, "unordered container::max_load_factor(lf) called with lf <= 0"); 951 max_load_factor() = std::max(__mlf, load_factor()); 952 } 953 954 _LIBCPP_HIDE_FROM_ABI local_iterator begin(size_type __n) { 955 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 956 __n < bucket_count(), "unordered container::begin(n) called with n >= bucket_count()"); 957 return local_iterator(__bucket_list_[__n], __n, bucket_count()); 958 } 959 960 _LIBCPP_HIDE_FROM_ABI local_iterator end(size_type __n) { 961 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 962 __n < bucket_count(), "unordered container::end(n) called with n >= bucket_count()"); 963 return local_iterator(nullptr, __n, bucket_count()); 964 } 965 966 _LIBCPP_HIDE_FROM_ABI const_local_iterator cbegin(size_type __n) const { 967 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 968 __n < bucket_count(), "unordered container::cbegin(n) called with n >= bucket_count()"); 969 return const_local_iterator(__bucket_list_[__n], __n, bucket_count()); 970 } 971 972 _LIBCPP_HIDE_FROM_ABI const_local_iterator cend(size_type __n) const { 973 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 974 __n < bucket_count(), "unordered container::cend(n) called with n >= bucket_count()"); 975 return const_local_iterator(nullptr, __n, bucket_count()); 976 } 977 978private: 979 template <bool _UniqueKeys> 980 _LIBCPP_HIDE_FROM_ABI void __rehash(size_type __n); 981 template <bool _UniqueKeys> 982 _LIBCPP_HIDE_FROM_ABI void __do_rehash(size_type __n); 983 984 template <class... _Args> 985 _LIBCPP_HIDE_FROM_ABI __node_holder __construct_node(_Args&&... __args); 986 987 template <class _First, class... _Rest> 988 _LIBCPP_HIDE_FROM_ABI __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest); 989 990 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const __hash_table& __u) { 991 __copy_assign_alloc(__u, integral_constant<bool, __node_traits::propagate_on_container_copy_assignment::value>()); 992 } 993 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const __hash_table& __u, true_type); 994 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const __hash_table&, false_type) {} 995 996 _LIBCPP_HIDE_FROM_ABI void __move_assign(__hash_table& __u, false_type); 997 _LIBCPP_HIDE_FROM_ABI void __move_assign(__hash_table& __u, true_type) 998 _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value&& is_nothrow_move_assignable<hasher>::value&& 999 is_nothrow_move_assignable<key_equal>::value); 1000 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(__hash_table& __u) _NOEXCEPT_( 1001 !__node_traits::propagate_on_container_move_assignment::value || 1002 (is_nothrow_move_assignable<__pointer_allocator>::value && is_nothrow_move_assignable<__node_allocator>::value)) { 1003 __move_assign_alloc(__u, integral_constant<bool, __node_traits::propagate_on_container_move_assignment::value>()); 1004 } 1005 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(__hash_table& __u, true_type) _NOEXCEPT_( 1006 is_nothrow_move_assignable<__pointer_allocator>::value&& is_nothrow_move_assignable<__node_allocator>::value) { 1007 __bucket_list_.get_deleter().__alloc() = std::move(__u.__bucket_list_.get_deleter().__alloc()); 1008 __node_alloc() = std::move(__u.__node_alloc()); 1009 } 1010 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(__hash_table&, false_type) _NOEXCEPT {} 1011 1012 _LIBCPP_HIDE_FROM_ABI void __deallocate_node(__next_pointer __np) _NOEXCEPT; 1013 _LIBCPP_HIDE_FROM_ABI __next_pointer __detach() _NOEXCEPT; 1014 1015 template <class, class, class, class, class> 1016 friend class _LIBCPP_TEMPLATE_VIS unordered_map; 1017 template <class, class, class, class, class> 1018 friend class _LIBCPP_TEMPLATE_VIS unordered_multimap; 1019}; 1020 1021template <class _Tp, class _Hash, class _Equal, class _Alloc> 1022inline __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table() _NOEXCEPT_( 1023 is_nothrow_default_constructible<__bucket_list>::value&& is_nothrow_default_constructible<__first_node>::value&& 1024 is_nothrow_default_constructible<__node_allocator>::value&& is_nothrow_default_constructible<hasher>::value&& 1025 is_nothrow_default_constructible<key_equal>::value) 1026 : __p2_(0, __default_init_tag()), __p3_(1.0f, __default_init_tag()) {} 1027 1028template <class _Tp, class _Hash, class _Equal, class _Alloc> 1029inline __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const hasher& __hf, const key_equal& __eql) 1030 : __bucket_list_(nullptr, __bucket_list_deleter()), __p1_(), __p2_(0, __hf), __p3_(1.0f, __eql) {} 1031 1032template <class _Tp, class _Hash, class _Equal, class _Alloc> 1033__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table( 1034 const hasher& __hf, const key_equal& __eql, const allocator_type& __a) 1035 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)), 1036 __p1_(__default_init_tag(), __node_allocator(__a)), 1037 __p2_(0, __hf), 1038 __p3_(1.0f, __eql) {} 1039 1040template <class _Tp, class _Hash, class _Equal, class _Alloc> 1041__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const allocator_type& __a) 1042 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)), 1043 __p1_(__default_init_tag(), __node_allocator(__a)), 1044 __p2_(0, __default_init_tag()), 1045 __p3_(1.0f, __default_init_tag()) {} 1046 1047template <class _Tp, class _Hash, class _Equal, class _Alloc> 1048__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const __hash_table& __u) 1049 : __bucket_list_(nullptr, 1050 __bucket_list_deleter(allocator_traits<__pointer_allocator>::select_on_container_copy_construction( 1051 __u.__bucket_list_.get_deleter().__alloc()), 1052 0)), 1053 __p1_(__default_init_tag(), 1054 allocator_traits<__node_allocator>::select_on_container_copy_construction(__u.__node_alloc())), 1055 __p2_(0, __u.hash_function()), 1056 __p3_(__u.__p3_) {} 1057 1058template <class _Tp, class _Hash, class _Equal, class _Alloc> 1059__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const __hash_table& __u, const allocator_type& __a) 1060 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)), 1061 __p1_(__default_init_tag(), __node_allocator(__a)), 1062 __p2_(0, __u.hash_function()), 1063 __p3_(__u.__p3_) {} 1064 1065template <class _Tp, class _Hash, class _Equal, class _Alloc> 1066__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(__hash_table&& __u) _NOEXCEPT_( 1067 is_nothrow_move_constructible<__bucket_list>::value&& is_nothrow_move_constructible<__first_node>::value&& 1068 is_nothrow_move_constructible<__node_allocator>::value&& is_nothrow_move_constructible<hasher>::value&& 1069 is_nothrow_move_constructible<key_equal>::value) 1070 : __bucket_list_(std::move(__u.__bucket_list_)), 1071 __p1_(std::move(__u.__p1_)), 1072 __p2_(std::move(__u.__p2_)), 1073 __p3_(std::move(__u.__p3_)) { 1074 if (size() > 0) { 1075 __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.first().__ptr(); 1076 __u.__p1_.first().__next_ = nullptr; 1077 __u.size() = 0; 1078 } 1079} 1080 1081template <class _Tp, class _Hash, class _Equal, class _Alloc> 1082__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(__hash_table&& __u, const allocator_type& __a) 1083 : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)), 1084 __p1_(__default_init_tag(), __node_allocator(__a)), 1085 __p2_(0, std::move(__u.hash_function())), 1086 __p3_(std::move(__u.__p3_)) { 1087 if (__a == allocator_type(__u.__node_alloc())) { 1088 __bucket_list_.reset(__u.__bucket_list_.release()); 1089 __bucket_list_.get_deleter().size() = __u.__bucket_list_.get_deleter().size(); 1090 __u.__bucket_list_.get_deleter().size() = 0; 1091 if (__u.size() > 0) { 1092 __p1_.first().__next_ = __u.__p1_.first().__next_; 1093 __u.__p1_.first().__next_ = nullptr; 1094 __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.first().__ptr(); 1095 size() = __u.size(); 1096 __u.size() = 0; 1097 } 1098 } 1099} 1100 1101template <class _Tp, class _Hash, class _Equal, class _Alloc> 1102__hash_table<_Tp, _Hash, _Equal, _Alloc>::~__hash_table() { 1103#if defined(_LIBCPP_CXX03_LANG) 1104 static_assert((is_copy_constructible<key_equal>::value), "Predicate must be copy-constructible."); 1105 static_assert((is_copy_constructible<hasher>::value), "Hasher must be copy-constructible."); 1106#endif 1107 1108 __deallocate_node(__p1_.first().__next_); 1109} 1110 1111template <class _Tp, class _Hash, class _Equal, class _Alloc> 1112void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__copy_assign_alloc(const __hash_table& __u, true_type) { 1113 if (__node_alloc() != __u.__node_alloc()) { 1114 clear(); 1115 __bucket_list_.reset(); 1116 __bucket_list_.get_deleter().size() = 0; 1117 } 1118 __bucket_list_.get_deleter().__alloc() = __u.__bucket_list_.get_deleter().__alloc(); 1119 __node_alloc() = __u.__node_alloc(); 1120} 1121 1122template <class _Tp, class _Hash, class _Equal, class _Alloc> 1123__hash_table<_Tp, _Hash, _Equal, _Alloc>& __hash_table<_Tp, _Hash, _Equal, _Alloc>::operator=(const __hash_table& __u) { 1124 if (this != std::addressof(__u)) { 1125 __copy_assign_alloc(__u); 1126 hash_function() = __u.hash_function(); 1127 key_eq() = __u.key_eq(); 1128 max_load_factor() = __u.max_load_factor(); 1129 __assign_multi(__u.begin(), __u.end()); 1130 } 1131 return *this; 1132} 1133 1134template <class _Tp, class _Hash, class _Equal, class _Alloc> 1135void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__deallocate_node(__next_pointer __np) _NOEXCEPT { 1136 __node_allocator& __na = __node_alloc(); 1137 while (__np != nullptr) { 1138 __next_pointer __next = __np->__next_; 1139 __node_pointer __real_np = __np->__upcast(); 1140 __node_traits::destroy(__na, _NodeTypes::__get_ptr(__real_np->__get_value())); 1141 std::__destroy_at(std::addressof(*__real_np)); 1142 __node_traits::deallocate(__na, __real_np, 1); 1143 __np = __next; 1144 } 1145} 1146 1147template <class _Tp, class _Hash, class _Equal, class _Alloc> 1148typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer 1149__hash_table<_Tp, _Hash, _Equal, _Alloc>::__detach() _NOEXCEPT { 1150 size_type __bc = bucket_count(); 1151 for (size_type __i = 0; __i < __bc; ++__i) 1152 __bucket_list_[__i] = nullptr; 1153 size() = 0; 1154 __next_pointer __cache = __p1_.first().__next_; 1155 __p1_.first().__next_ = nullptr; 1156 return __cache; 1157} 1158 1159template <class _Tp, class _Hash, class _Equal, class _Alloc> 1160void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__move_assign(__hash_table& __u, true_type) 1161 _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value&& is_nothrow_move_assignable<hasher>::value&& 1162 is_nothrow_move_assignable<key_equal>::value) { 1163 clear(); 1164 __bucket_list_.reset(__u.__bucket_list_.release()); 1165 __bucket_list_.get_deleter().size() = __u.__bucket_list_.get_deleter().size(); 1166 __u.__bucket_list_.get_deleter().size() = 0; 1167 __move_assign_alloc(__u); 1168 size() = __u.size(); 1169 hash_function() = std::move(__u.hash_function()); 1170 max_load_factor() = __u.max_load_factor(); 1171 key_eq() = std::move(__u.key_eq()); 1172 __p1_.first().__next_ = __u.__p1_.first().__next_; 1173 if (size() > 0) { 1174 __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.first().__ptr(); 1175 __u.__p1_.first().__next_ = nullptr; 1176 __u.size() = 0; 1177 } 1178} 1179 1180template <class _Tp, class _Hash, class _Equal, class _Alloc> 1181void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__move_assign(__hash_table& __u, false_type) { 1182 if (__node_alloc() == __u.__node_alloc()) 1183 __move_assign(__u, true_type()); 1184 else { 1185 hash_function() = std::move(__u.hash_function()); 1186 key_eq() = std::move(__u.key_eq()); 1187 max_load_factor() = __u.max_load_factor(); 1188 if (bucket_count() != 0) { 1189 __next_pointer __cache = __detach(); 1190#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 1191 try { 1192#endif // _LIBCPP_HAS_NO_EXCEPTIONS 1193 const_iterator __i = __u.begin(); 1194 while (__cache != nullptr && __u.size() != 0) { 1195 __cache->__upcast()->__get_value() = std::move(__u.remove(__i++)->__get_value()); 1196 __next_pointer __next = __cache->__next_; 1197 __node_insert_multi(__cache->__upcast()); 1198 __cache = __next; 1199 } 1200#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 1201 } catch (...) { 1202 __deallocate_node(__cache); 1203 throw; 1204 } 1205#endif // _LIBCPP_HAS_NO_EXCEPTIONS 1206 __deallocate_node(__cache); 1207 } 1208 const_iterator __i = __u.begin(); 1209 while (__u.size() != 0) { 1210 __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__get_value())); 1211 __node_insert_multi(__h.get()); 1212 __h.release(); 1213 } 1214 } 1215} 1216 1217template <class _Tp, class _Hash, class _Equal, class _Alloc> 1218inline __hash_table<_Tp, _Hash, _Equal, _Alloc>& 1219__hash_table<_Tp, _Hash, _Equal, _Alloc>::operator=(__hash_table&& __u) _NOEXCEPT_( 1220 __node_traits::propagate_on_container_move_assignment::value&& is_nothrow_move_assignable<__node_allocator>::value&& 1221 is_nothrow_move_assignable<hasher>::value&& is_nothrow_move_assignable<key_equal>::value) { 1222 __move_assign(__u, integral_constant<bool, __node_traits::propagate_on_container_move_assignment::value>()); 1223 return *this; 1224} 1225 1226template <class _Tp, class _Hash, class _Equal, class _Alloc> 1227template <class _InputIterator> 1228void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_unique(_InputIterator __first, _InputIterator __last) { 1229 typedef iterator_traits<_InputIterator> _ITraits; 1230 typedef typename _ITraits::value_type _ItValueType; 1231 static_assert((is_same<_ItValueType, __container_value_type>::value), 1232 "__assign_unique may only be called with the containers value type"); 1233 1234 if (bucket_count() != 0) { 1235 __next_pointer __cache = __detach(); 1236#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 1237 try { 1238#endif // _LIBCPP_HAS_NO_EXCEPTIONS 1239 for (; __cache != nullptr && __first != __last; ++__first) { 1240 __cache->__upcast()->__get_value() = *__first; 1241 __next_pointer __next = __cache->__next_; 1242 __node_insert_unique(__cache->__upcast()); 1243 __cache = __next; 1244 } 1245#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 1246 } catch (...) { 1247 __deallocate_node(__cache); 1248 throw; 1249 } 1250#endif // _LIBCPP_HAS_NO_EXCEPTIONS 1251 __deallocate_node(__cache); 1252 } 1253 for (; __first != __last; ++__first) 1254 __insert_unique(*__first); 1255} 1256 1257template <class _Tp, class _Hash, class _Equal, class _Alloc> 1258template <class _InputIterator> 1259void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_multi(_InputIterator __first, _InputIterator __last) { 1260 typedef iterator_traits<_InputIterator> _ITraits; 1261 typedef typename _ITraits::value_type _ItValueType; 1262 static_assert( 1263 (is_same<_ItValueType, __container_value_type>::value || is_same<_ItValueType, __node_value_type>::value), 1264 "__assign_multi may only be called with the containers value type" 1265 " or the nodes value type"); 1266 if (bucket_count() != 0) { 1267 __next_pointer __cache = __detach(); 1268#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 1269 try { 1270#endif // _LIBCPP_HAS_NO_EXCEPTIONS 1271 for (; __cache != nullptr && __first != __last; ++__first) { 1272 __cache->__upcast()->__get_value() = *__first; 1273 __next_pointer __next = __cache->__next_; 1274 __node_insert_multi(__cache->__upcast()); 1275 __cache = __next; 1276 } 1277#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 1278 } catch (...) { 1279 __deallocate_node(__cache); 1280 throw; 1281 } 1282#endif // _LIBCPP_HAS_NO_EXCEPTIONS 1283 __deallocate_node(__cache); 1284 } 1285 for (; __first != __last; ++__first) 1286 __insert_multi(_NodeTypes::__get_value(*__first)); 1287} 1288 1289template <class _Tp, class _Hash, class _Equal, class _Alloc> 1290inline typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1291__hash_table<_Tp, _Hash, _Equal, _Alloc>::begin() _NOEXCEPT { 1292 return iterator(__p1_.first().__next_); 1293} 1294 1295template <class _Tp, class _Hash, class _Equal, class _Alloc> 1296inline typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1297__hash_table<_Tp, _Hash, _Equal, _Alloc>::end() _NOEXCEPT { 1298 return iterator(nullptr); 1299} 1300 1301template <class _Tp, class _Hash, class _Equal, class _Alloc> 1302inline typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator 1303__hash_table<_Tp, _Hash, _Equal, _Alloc>::begin() const _NOEXCEPT { 1304 return const_iterator(__p1_.first().__next_); 1305} 1306 1307template <class _Tp, class _Hash, class _Equal, class _Alloc> 1308inline typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator 1309__hash_table<_Tp, _Hash, _Equal, _Alloc>::end() const _NOEXCEPT { 1310 return const_iterator(nullptr); 1311} 1312 1313template <class _Tp, class _Hash, class _Equal, class _Alloc> 1314void __hash_table<_Tp, _Hash, _Equal, _Alloc>::clear() _NOEXCEPT { 1315 if (size() > 0) { 1316 __deallocate_node(__p1_.first().__next_); 1317 __p1_.first().__next_ = nullptr; 1318 size_type __bc = bucket_count(); 1319 for (size_type __i = 0; __i < __bc; ++__i) 1320 __bucket_list_[__i] = nullptr; 1321 size() = 0; 1322 } 1323} 1324 1325// Prepare the container for an insertion of the value __value with the hash 1326// __hash. This does a lookup into the container to see if __value is already 1327// present, and performs a rehash if necessary. Returns a pointer to the 1328// existing element if it exists, otherwise nullptr. 1329// 1330// Note that this function does forward exceptions if key_eq() throws, and never 1331// mutates __value or actually inserts into the map. 1332template <class _Tp, class _Hash, class _Equal, class _Alloc> 1333_LIBCPP_HIDE_FROM_ABI typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer 1334__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique_prepare(size_t __hash, value_type& __value) { 1335 size_type __bc = bucket_count(); 1336 1337 if (__bc != 0) { 1338 size_t __chash = std::__constrain_hash(__hash, __bc); 1339 __next_pointer __ndptr = __bucket_list_[__chash]; 1340 if (__ndptr != nullptr) { 1341 for (__ndptr = __ndptr->__next_; 1342 __ndptr != nullptr && 1343 (__ndptr->__hash() == __hash || std::__constrain_hash(__ndptr->__hash(), __bc) == __chash); 1344 __ndptr = __ndptr->__next_) { 1345 if ((__ndptr->__hash() == __hash) && key_eq()(__ndptr->__upcast()->__get_value(), __value)) 1346 return __ndptr; 1347 } 1348 } 1349 } 1350 if (size() + 1 > __bc * max_load_factor() || __bc == 0) { 1351 __rehash_unique(std::max<size_type>( 1352 2 * __bc + !std::__is_hash_power2(__bc), size_type(std::ceil(float(size() + 1) / max_load_factor())))); 1353 } 1354 return nullptr; 1355} 1356 1357// Insert the node __nd into the container by pushing it into the right bucket, 1358// and updating size(). Assumes that __nd->__hash is up-to-date, and that 1359// rehashing has already occurred and that no element with the same key exists 1360// in the map. 1361template <class _Tp, class _Hash, class _Equal, class _Alloc> 1362_LIBCPP_HIDE_FROM_ABI void 1363__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique_perform(__node_pointer __nd) _NOEXCEPT { 1364 size_type __bc = bucket_count(); 1365 size_t __chash = std::__constrain_hash(__nd->__hash(), __bc); 1366 // insert_after __bucket_list_[__chash], or __first_node if bucket is null 1367 __next_pointer __pn = __bucket_list_[__chash]; 1368 if (__pn == nullptr) { 1369 __pn = __p1_.first().__ptr(); 1370 __nd->__next_ = __pn->__next_; 1371 __pn->__next_ = __nd->__ptr(); 1372 // fix up __bucket_list_ 1373 __bucket_list_[__chash] = __pn; 1374 if (__nd->__next_ != nullptr) 1375 __bucket_list_[std::__constrain_hash(__nd->__next_->__hash(), __bc)] = __nd->__ptr(); 1376 } else { 1377 __nd->__next_ = __pn->__next_; 1378 __pn->__next_ = __nd->__ptr(); 1379 } 1380 ++size(); 1381} 1382 1383template <class _Tp, class _Hash, class _Equal, class _Alloc> 1384pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool> 1385__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique(__node_pointer __nd) { 1386 __nd->__hash_ = hash_function()(__nd->__get_value()); 1387 __next_pointer __existing_node = __node_insert_unique_prepare(__nd->__hash(), __nd->__get_value()); 1388 1389 // Insert the node, unless it already exists in the container. 1390 bool __inserted = false; 1391 if (__existing_node == nullptr) { 1392 __node_insert_unique_perform(__nd); 1393 __existing_node = __nd->__ptr(); 1394 __inserted = true; 1395 } 1396 return pair<iterator, bool>(iterator(__existing_node), __inserted); 1397} 1398 1399// Prepare the container for an insertion of the value __cp_val with the hash 1400// __cp_hash. This does a lookup into the container to see if __cp_value is 1401// already present, and performs a rehash if necessary. Returns a pointer to the 1402// last occurrence of __cp_val in the map. 1403// 1404// Note that this function does forward exceptions if key_eq() throws, and never 1405// mutates __value or actually inserts into the map. 1406template <class _Tp, class _Hash, class _Equal, class _Alloc> 1407typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer 1408__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi_prepare(size_t __cp_hash, value_type& __cp_val) { 1409 size_type __bc = bucket_count(); 1410 if (size() + 1 > __bc * max_load_factor() || __bc == 0) { 1411 __rehash_multi(std::max<size_type>( 1412 2 * __bc + !std::__is_hash_power2(__bc), size_type(std::ceil(float(size() + 1) / max_load_factor())))); 1413 __bc = bucket_count(); 1414 } 1415 size_t __chash = std::__constrain_hash(__cp_hash, __bc); 1416 __next_pointer __pn = __bucket_list_[__chash]; 1417 if (__pn != nullptr) { 1418 for (bool __found = false; 1419 __pn->__next_ != nullptr && std::__constrain_hash(__pn->__next_->__hash(), __bc) == __chash; 1420 __pn = __pn->__next_) { 1421 // __found key_eq() action 1422 // false false loop 1423 // true true loop 1424 // false true set __found to true 1425 // true false break 1426 if (__found != 1427 (__pn->__next_->__hash() == __cp_hash && key_eq()(__pn->__next_->__upcast()->__get_value(), __cp_val))) { 1428 if (!__found) 1429 __found = true; 1430 else 1431 break; 1432 } 1433 } 1434 } 1435 return __pn; 1436} 1437 1438// Insert the node __cp into the container after __pn (which is the last node in 1439// the bucket that compares equal to __cp). Rehashing, and checking for 1440// uniqueness has already been performed (in __node_insert_multi_prepare), so 1441// all we need to do is update the bucket and size(). Assumes that __cp->__hash 1442// is up-to-date. 1443template <class _Tp, class _Hash, class _Equal, class _Alloc> 1444void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi_perform( 1445 __node_pointer __cp, __next_pointer __pn) _NOEXCEPT { 1446 size_type __bc = bucket_count(); 1447 size_t __chash = std::__constrain_hash(__cp->__hash_, __bc); 1448 if (__pn == nullptr) { 1449 __pn = __p1_.first().__ptr(); 1450 __cp->__next_ = __pn->__next_; 1451 __pn->__next_ = __cp->__ptr(); 1452 // fix up __bucket_list_ 1453 __bucket_list_[__chash] = __pn; 1454 if (__cp->__next_ != nullptr) 1455 __bucket_list_[std::__constrain_hash(__cp->__next_->__hash(), __bc)] = __cp->__ptr(); 1456 } else { 1457 __cp->__next_ = __pn->__next_; 1458 __pn->__next_ = __cp->__ptr(); 1459 if (__cp->__next_ != nullptr) { 1460 size_t __nhash = std::__constrain_hash(__cp->__next_->__hash(), __bc); 1461 if (__nhash != __chash) 1462 __bucket_list_[__nhash] = __cp->__ptr(); 1463 } 1464 } 1465 ++size(); 1466} 1467 1468template <class _Tp, class _Hash, class _Equal, class _Alloc> 1469typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1470__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(__node_pointer __cp) { 1471 __cp->__hash_ = hash_function()(__cp->__get_value()); 1472 __next_pointer __pn = __node_insert_multi_prepare(__cp->__hash(), __cp->__get_value()); 1473 __node_insert_multi_perform(__cp, __pn); 1474 1475 return iterator(__cp->__ptr()); 1476} 1477 1478template <class _Tp, class _Hash, class _Equal, class _Alloc> 1479typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1480__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(const_iterator __p, __node_pointer __cp) { 1481 if (__p != end() && key_eq()(*__p, __cp->__get_value())) { 1482 __next_pointer __np = __p.__node_; 1483 __cp->__hash_ = __np->__hash(); 1484 size_type __bc = bucket_count(); 1485 if (size() + 1 > __bc * max_load_factor() || __bc == 0) { 1486 __rehash_multi(std::max<size_type>( 1487 2 * __bc + !std::__is_hash_power2(__bc), size_type(std::ceil(float(size() + 1) / max_load_factor())))); 1488 __bc = bucket_count(); 1489 } 1490 size_t __chash = std::__constrain_hash(__cp->__hash_, __bc); 1491 __next_pointer __pp = __bucket_list_[__chash]; 1492 while (__pp->__next_ != __np) 1493 __pp = __pp->__next_; 1494 __cp->__next_ = __np; 1495 __pp->__next_ = static_cast<__next_pointer>(__cp); 1496 ++size(); 1497 return iterator(static_cast<__next_pointer>(__cp)); 1498 } 1499 return __node_insert_multi(__cp); 1500} 1501 1502template <class _Tp, class _Hash, class _Equal, class _Alloc> 1503template <class _Key, class... _Args> 1504pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool> 1505__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args) { 1506 size_t __hash = hash_function()(__k); 1507 size_type __bc = bucket_count(); 1508 bool __inserted = false; 1509 __next_pointer __nd; 1510 size_t __chash; 1511 if (__bc != 0) { 1512 __chash = std::__constrain_hash(__hash, __bc); 1513 __nd = __bucket_list_[__chash]; 1514 if (__nd != nullptr) { 1515 for (__nd = __nd->__next_; 1516 __nd != nullptr && (__nd->__hash() == __hash || std::__constrain_hash(__nd->__hash(), __bc) == __chash); 1517 __nd = __nd->__next_) { 1518 if ((__nd->__hash() == __hash) && key_eq()(__nd->__upcast()->__get_value(), __k)) 1519 goto __done; 1520 } 1521 } 1522 } 1523 { 1524 __node_holder __h = __construct_node_hash(__hash, std::forward<_Args>(__args)...); 1525 if (size() + 1 > __bc * max_load_factor() || __bc == 0) { 1526 __rehash_unique(std::max<size_type>( 1527 2 * __bc + !std::__is_hash_power2(__bc), size_type(std::ceil(float(size() + 1) / max_load_factor())))); 1528 __bc = bucket_count(); 1529 __chash = std::__constrain_hash(__hash, __bc); 1530 } 1531 // insert_after __bucket_list_[__chash], or __first_node if bucket is null 1532 __next_pointer __pn = __bucket_list_[__chash]; 1533 if (__pn == nullptr) { 1534 __pn = __p1_.first().__ptr(); 1535 __h->__next_ = __pn->__next_; 1536 __pn->__next_ = __h.get()->__ptr(); 1537 // fix up __bucket_list_ 1538 __bucket_list_[__chash] = __pn; 1539 if (__h->__next_ != nullptr) 1540 __bucket_list_[std::__constrain_hash(__h->__next_->__hash(), __bc)] = __h.get()->__ptr(); 1541 } else { 1542 __h->__next_ = __pn->__next_; 1543 __pn->__next_ = static_cast<__next_pointer>(__h.get()); 1544 } 1545 __nd = static_cast<__next_pointer>(__h.release()); 1546 // increment size 1547 ++size(); 1548 __inserted = true; 1549 } 1550__done: 1551 return pair<iterator, bool>(iterator(__nd), __inserted); 1552} 1553 1554template <class _Tp, class _Hash, class _Equal, class _Alloc> 1555template <class... _Args> 1556pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool> 1557__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_impl(_Args&&... __args) { 1558 __node_holder __h = __construct_node(std::forward<_Args>(__args)...); 1559 pair<iterator, bool> __r = __node_insert_unique(__h.get()); 1560 if (__r.second) 1561 __h.release(); 1562 return __r; 1563} 1564 1565template <class _Tp, class _Hash, class _Equal, class _Alloc> 1566template <class... _Args> 1567typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1568__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_multi(_Args&&... __args) { 1569 __node_holder __h = __construct_node(std::forward<_Args>(__args)...); 1570 iterator __r = __node_insert_multi(__h.get()); 1571 __h.release(); 1572 return __r; 1573} 1574 1575template <class _Tp, class _Hash, class _Equal, class _Alloc> 1576template <class... _Args> 1577typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1578__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_hint_multi(const_iterator __p, _Args&&... __args) { 1579 __node_holder __h = __construct_node(std::forward<_Args>(__args)...); 1580 iterator __r = __node_insert_multi(__p, __h.get()); 1581 __h.release(); 1582 return __r; 1583} 1584 1585#if _LIBCPP_STD_VER >= 17 1586template <class _Tp, class _Hash, class _Equal, class _Alloc> 1587template <class _NodeHandle, class _InsertReturnType> 1588_LIBCPP_HIDE_FROM_ABI _InsertReturnType 1589__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_unique(_NodeHandle&& __nh) { 1590 if (__nh.empty()) 1591 return _InsertReturnType{end(), false, _NodeHandle()}; 1592 pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_); 1593 if (__result.second) 1594 __nh.__release_ptr(); 1595 return _InsertReturnType{__result.first, __result.second, std::move(__nh)}; 1596} 1597 1598template <class _Tp, class _Hash, class _Equal, class _Alloc> 1599template <class _NodeHandle> 1600_LIBCPP_HIDE_FROM_ABI typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1601__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_unique(const_iterator, _NodeHandle&& __nh) { 1602 if (__nh.empty()) 1603 return end(); 1604 pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_); 1605 if (__result.second) 1606 __nh.__release_ptr(); 1607 return __result.first; 1608} 1609 1610template <class _Tp, class _Hash, class _Equal, class _Alloc> 1611template <class _NodeHandle> 1612_LIBCPP_HIDE_FROM_ABI _NodeHandle 1613__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_extract(key_type const& __key) { 1614 iterator __i = find(__key); 1615 if (__i == end()) 1616 return _NodeHandle(); 1617 return __node_handle_extract<_NodeHandle>(__i); 1618} 1619 1620template <class _Tp, class _Hash, class _Equal, class _Alloc> 1621template <class _NodeHandle> 1622_LIBCPP_HIDE_FROM_ABI _NodeHandle __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_extract(const_iterator __p) { 1623 allocator_type __alloc(__node_alloc()); 1624 return _NodeHandle(remove(__p).release(), __alloc); 1625} 1626 1627template <class _Tp, class _Hash, class _Equal, class _Alloc> 1628template <class _Table> 1629_LIBCPP_HIDE_FROM_ABI void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_merge_unique(_Table& __source) { 1630 static_assert(is_same<__node, typename _Table::__node>::value, ""); 1631 1632 for (typename _Table::iterator __it = __source.begin(); __it != __source.end();) { 1633 __node_pointer __src_ptr = __it.__node_->__upcast(); 1634 size_t __hash = hash_function()(__src_ptr->__get_value()); 1635 __next_pointer __existing_node = __node_insert_unique_prepare(__hash, __src_ptr->__get_value()); 1636 auto __prev_iter = __it++; 1637 if (__existing_node == nullptr) { 1638 (void)__source.remove(__prev_iter).release(); 1639 __src_ptr->__hash_ = __hash; 1640 __node_insert_unique_perform(__src_ptr); 1641 } 1642 } 1643} 1644 1645template <class _Tp, class _Hash, class _Equal, class _Alloc> 1646template <class _NodeHandle> 1647_LIBCPP_HIDE_FROM_ABI typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1648__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_multi(_NodeHandle&& __nh) { 1649 if (__nh.empty()) 1650 return end(); 1651 iterator __result = __node_insert_multi(__nh.__ptr_); 1652 __nh.__release_ptr(); 1653 return __result; 1654} 1655 1656template <class _Tp, class _Hash, class _Equal, class _Alloc> 1657template <class _NodeHandle> 1658_LIBCPP_HIDE_FROM_ABI typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1659__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_multi(const_iterator __hint, _NodeHandle&& __nh) { 1660 if (__nh.empty()) 1661 return end(); 1662 iterator __result = __node_insert_multi(__hint, __nh.__ptr_); 1663 __nh.__release_ptr(); 1664 return __result; 1665} 1666 1667template <class _Tp, class _Hash, class _Equal, class _Alloc> 1668template <class _Table> 1669_LIBCPP_HIDE_FROM_ABI void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_merge_multi(_Table& __source) { 1670 static_assert(is_same<typename _Table::__node, __node>::value, ""); 1671 1672 for (typename _Table::iterator __it = __source.begin(); __it != __source.end();) { 1673 __node_pointer __src_ptr = __it.__node_->__upcast(); 1674 size_t __src_hash = hash_function()(__src_ptr->__get_value()); 1675 __next_pointer __pn = __node_insert_multi_prepare(__src_hash, __src_ptr->__get_value()); 1676 (void)__source.remove(__it++).release(); 1677 __src_ptr->__hash_ = __src_hash; 1678 __node_insert_multi_perform(__src_ptr, __pn); 1679 } 1680} 1681#endif // _LIBCPP_STD_VER >= 17 1682 1683template <class _Tp, class _Hash, class _Equal, class _Alloc> 1684template <bool _UniqueKeys> 1685void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__rehash(size_type __n) _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK { 1686 if (__n == 1) 1687 __n = 2; 1688 else if (__n & (__n - 1)) 1689 __n = std::__next_prime(__n); 1690 size_type __bc = bucket_count(); 1691 if (__n > __bc) 1692 __do_rehash<_UniqueKeys>(__n); 1693 else if (__n < __bc) { 1694 __n = std::max<size_type>( 1695 __n, 1696 std::__is_hash_power2(__bc) ? std::__next_hash_pow2(size_t(std::ceil(float(size()) / max_load_factor()))) 1697 : std::__next_prime(size_t(std::ceil(float(size()) / max_load_factor())))); 1698 if (__n < __bc) 1699 __do_rehash<_UniqueKeys>(__n); 1700 } 1701} 1702 1703template <class _Tp, class _Hash, class _Equal, class _Alloc> 1704template <bool _UniqueKeys> 1705void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__do_rehash(size_type __nbc) { 1706 __pointer_allocator& __npa = __bucket_list_.get_deleter().__alloc(); 1707 __bucket_list_.reset(__nbc > 0 ? __pointer_alloc_traits::allocate(__npa, __nbc) : nullptr); 1708 __bucket_list_.get_deleter().size() = __nbc; 1709 if (__nbc > 0) { 1710 for (size_type __i = 0; __i < __nbc; ++__i) 1711 __bucket_list_[__i] = nullptr; 1712 __next_pointer __pp = __p1_.first().__ptr(); 1713 __next_pointer __cp = __pp->__next_; 1714 if (__cp != nullptr) { 1715 size_type __chash = std::__constrain_hash(__cp->__hash(), __nbc); 1716 __bucket_list_[__chash] = __pp; 1717 size_type __phash = __chash; 1718 for (__pp = __cp, void(), __cp = __cp->__next_; __cp != nullptr; __cp = __pp->__next_) { 1719 __chash = std::__constrain_hash(__cp->__hash(), __nbc); 1720 if (__chash == __phash) 1721 __pp = __cp; 1722 else { 1723 if (__bucket_list_[__chash] == nullptr) { 1724 __bucket_list_[__chash] = __pp; 1725 __pp = __cp; 1726 __phash = __chash; 1727 } else { 1728 __next_pointer __np = __cp; 1729 if _LIBCPP_CONSTEXPR_SINCE_CXX17 (!_UniqueKeys) { 1730 for (; __np->__next_ != nullptr && 1731 key_eq()(__cp->__upcast()->__get_value(), __np->__next_->__upcast()->__get_value()); 1732 __np = __np->__next_) 1733 ; 1734 } 1735 __pp->__next_ = __np->__next_; 1736 __np->__next_ = __bucket_list_[__chash]->__next_; 1737 __bucket_list_[__chash]->__next_ = __cp; 1738 } 1739 } 1740 } 1741 } 1742 } 1743} 1744 1745template <class _Tp, class _Hash, class _Equal, class _Alloc> 1746template <class _Key> 1747typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1748__hash_table<_Tp, _Hash, _Equal, _Alloc>::find(const _Key& __k) { 1749 size_t __hash = hash_function()(__k); 1750 size_type __bc = bucket_count(); 1751 if (__bc != 0) { 1752 size_t __chash = std::__constrain_hash(__hash, __bc); 1753 __next_pointer __nd = __bucket_list_[__chash]; 1754 if (__nd != nullptr) { 1755 for (__nd = __nd->__next_; 1756 __nd != nullptr && (__nd->__hash() == __hash || std::__constrain_hash(__nd->__hash(), __bc) == __chash); 1757 __nd = __nd->__next_) { 1758 if ((__nd->__hash() == __hash) && key_eq()(__nd->__upcast()->__get_value(), __k)) 1759 return iterator(__nd); 1760 } 1761 } 1762 } 1763 return end(); 1764} 1765 1766template <class _Tp, class _Hash, class _Equal, class _Alloc> 1767template <class _Key> 1768typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator 1769__hash_table<_Tp, _Hash, _Equal, _Alloc>::find(const _Key& __k) const { 1770 size_t __hash = hash_function()(__k); 1771 size_type __bc = bucket_count(); 1772 if (__bc != 0) { 1773 size_t __chash = std::__constrain_hash(__hash, __bc); 1774 __next_pointer __nd = __bucket_list_[__chash]; 1775 if (__nd != nullptr) { 1776 for (__nd = __nd->__next_; 1777 __nd != nullptr && (__hash == __nd->__hash() || std::__constrain_hash(__nd->__hash(), __bc) == __chash); 1778 __nd = __nd->__next_) { 1779 if ((__nd->__hash() == __hash) && key_eq()(__nd->__upcast()->__get_value(), __k)) 1780 return const_iterator(__nd); 1781 } 1782 } 1783 } 1784 return end(); 1785} 1786 1787template <class _Tp, class _Hash, class _Equal, class _Alloc> 1788template <class... _Args> 1789typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder 1790__hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node(_Args&&... __args) { 1791 static_assert(!__is_hash_value_type<_Args...>::value, "Construct cannot be called with a hash value type"); 1792 __node_allocator& __na = __node_alloc(); 1793 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); 1794 1795 // Begin the lifetime of the node itself. Note that this doesn't begin the lifetime of the value 1796 // held inside the node, since we need to use the allocator's construct() method for that. 1797 // 1798 // We don't use the allocator's construct() method to construct the node itself since the 1799 // Cpp17FooInsertable named requirements don't require the allocator's construct() method 1800 // to work on anything other than the value_type. 1801 std::__construct_at(std::addressof(*__h), /* next = */ nullptr, /* hash = */ 0); 1802 1803 // Now construct the value_type using the allocator's construct() method. 1804 __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__get_value()), std::forward<_Args>(__args)...); 1805 __h.get_deleter().__value_constructed = true; 1806 1807 __h->__hash_ = hash_function()(__h->__get_value()); 1808 return __h; 1809} 1810 1811template <class _Tp, class _Hash, class _Equal, class _Alloc> 1812template <class _First, class... _Rest> 1813typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder 1814__hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest) { 1815 static_assert(!__is_hash_value_type<_First, _Rest...>::value, "Construct cannot be called with a hash value type"); 1816 __node_allocator& __na = __node_alloc(); 1817 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); 1818 std::__construct_at(std::addressof(*__h), /* next = */ nullptr, /* hash = */ __hash); 1819 __node_traits::construct( 1820 __na, _NodeTypes::__get_ptr(__h->__get_value()), std::forward<_First>(__f), std::forward<_Rest>(__rest)...); 1821 __h.get_deleter().__value_constructed = true; 1822 return __h; 1823} 1824 1825template <class _Tp, class _Hash, class _Equal, class _Alloc> 1826typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1827__hash_table<_Tp, _Hash, _Equal, _Alloc>::erase(const_iterator __p) { 1828 __next_pointer __np = __p.__node_; 1829 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 1830 __p != end(), "unordered container::erase(iterator) called with a non-dereferenceable iterator"); 1831 iterator __r(__np); 1832 ++__r; 1833 remove(__p); 1834 return __r; 1835} 1836 1837template <class _Tp, class _Hash, class _Equal, class _Alloc> 1838typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator 1839__hash_table<_Tp, _Hash, _Equal, _Alloc>::erase(const_iterator __first, const_iterator __last) { 1840 for (const_iterator __p = __first; __first != __last; __p = __first) { 1841 ++__first; 1842 erase(__p); 1843 } 1844 __next_pointer __np = __last.__node_; 1845 return iterator(__np); 1846} 1847 1848template <class _Tp, class _Hash, class _Equal, class _Alloc> 1849template <class _Key> 1850typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type 1851__hash_table<_Tp, _Hash, _Equal, _Alloc>::__erase_unique(const _Key& __k) { 1852 iterator __i = find(__k); 1853 if (__i == end()) 1854 return 0; 1855 erase(__i); 1856 return 1; 1857} 1858 1859template <class _Tp, class _Hash, class _Equal, class _Alloc> 1860template <class _Key> 1861typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type 1862__hash_table<_Tp, _Hash, _Equal, _Alloc>::__erase_multi(const _Key& __k) { 1863 size_type __r = 0; 1864 iterator __i = find(__k); 1865 if (__i != end()) { 1866 iterator __e = end(); 1867 do { 1868 erase(__i++); 1869 ++__r; 1870 } while (__i != __e && key_eq()(*__i, __k)); 1871 } 1872 return __r; 1873} 1874 1875template <class _Tp, class _Hash, class _Equal, class _Alloc> 1876typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder 1877__hash_table<_Tp, _Hash, _Equal, _Alloc>::remove(const_iterator __p) _NOEXCEPT { 1878 // current node 1879 __next_pointer __cn = __p.__node_; 1880 size_type __bc = bucket_count(); 1881 size_t __chash = std::__constrain_hash(__cn->__hash(), __bc); 1882 // find previous node 1883 __next_pointer __pn = __bucket_list_[__chash]; 1884 for (; __pn->__next_ != __cn; __pn = __pn->__next_) 1885 ; 1886 // Fix up __bucket_list_ 1887 // if __pn is not in same bucket (before begin is not in same bucket) && 1888 // if __cn->__next_ is not in same bucket (nullptr is not in same bucket) 1889 if (__pn == __p1_.first().__ptr() || std::__constrain_hash(__pn->__hash(), __bc) != __chash) { 1890 if (__cn->__next_ == nullptr || std::__constrain_hash(__cn->__next_->__hash(), __bc) != __chash) 1891 __bucket_list_[__chash] = nullptr; 1892 } 1893 // if __cn->__next_ is not in same bucket (nullptr is in same bucket) 1894 if (__cn->__next_ != nullptr) { 1895 size_t __nhash = std::__constrain_hash(__cn->__next_->__hash(), __bc); 1896 if (__nhash != __chash) 1897 __bucket_list_[__nhash] = __pn; 1898 } 1899 // remove __cn 1900 __pn->__next_ = __cn->__next_; 1901 __cn->__next_ = nullptr; 1902 --size(); 1903 return __node_holder(__cn->__upcast(), _Dp(__node_alloc(), true)); 1904} 1905 1906template <class _Tp, class _Hash, class _Equal, class _Alloc> 1907template <class _Key> 1908inline typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type 1909__hash_table<_Tp, _Hash, _Equal, _Alloc>::__count_unique(const _Key& __k) const { 1910 return static_cast<size_type>(find(__k) != end()); 1911} 1912 1913template <class _Tp, class _Hash, class _Equal, class _Alloc> 1914template <class _Key> 1915typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type 1916__hash_table<_Tp, _Hash, _Equal, _Alloc>::__count_multi(const _Key& __k) const { 1917 size_type __r = 0; 1918 const_iterator __i = find(__k); 1919 if (__i != end()) { 1920 const_iterator __e = end(); 1921 do { 1922 ++__i; 1923 ++__r; 1924 } while (__i != __e && key_eq()(*__i, __k)); 1925 } 1926 return __r; 1927} 1928 1929template <class _Tp, class _Hash, class _Equal, class _Alloc> 1930template <class _Key> 1931pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, 1932 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator> 1933__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_unique(const _Key& __k) { 1934 iterator __i = find(__k); 1935 iterator __j = __i; 1936 if (__i != end()) 1937 ++__j; 1938 return pair<iterator, iterator>(__i, __j); 1939} 1940 1941template <class _Tp, class _Hash, class _Equal, class _Alloc> 1942template <class _Key> 1943pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator, 1944 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator> 1945__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_unique(const _Key& __k) const { 1946 const_iterator __i = find(__k); 1947 const_iterator __j = __i; 1948 if (__i != end()) 1949 ++__j; 1950 return pair<const_iterator, const_iterator>(__i, __j); 1951} 1952 1953template <class _Tp, class _Hash, class _Equal, class _Alloc> 1954template <class _Key> 1955pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, 1956 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator> 1957__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_multi(const _Key& __k) { 1958 iterator __i = find(__k); 1959 iterator __j = __i; 1960 if (__i != end()) { 1961 iterator __e = end(); 1962 do { 1963 ++__j; 1964 } while (__j != __e && key_eq()(*__j, __k)); 1965 } 1966 return pair<iterator, iterator>(__i, __j); 1967} 1968 1969template <class _Tp, class _Hash, class _Equal, class _Alloc> 1970template <class _Key> 1971pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator, 1972 typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator> 1973__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_multi(const _Key& __k) const { 1974 const_iterator __i = find(__k); 1975 const_iterator __j = __i; 1976 if (__i != end()) { 1977 const_iterator __e = end(); 1978 do { 1979 ++__j; 1980 } while (__j != __e && key_eq()(*__j, __k)); 1981 } 1982 return pair<const_iterator, const_iterator>(__i, __j); 1983} 1984 1985template <class _Tp, class _Hash, class _Equal, class _Alloc> 1986void __hash_table<_Tp, _Hash, _Equal, _Alloc>::swap(__hash_table& __u) 1987#if _LIBCPP_STD_VER <= 11 1988 _NOEXCEPT_(__is_nothrow_swappable<hasher>::value&& __is_nothrow_swappable<key_equal>::value && 1989 (!allocator_traits<__pointer_allocator>::propagate_on_container_swap::value || 1990 __is_nothrow_swappable<__pointer_allocator>::value) && 1991 (!__node_traits::propagate_on_container_swap::value || __is_nothrow_swappable<__node_allocator>::value)) 1992#else 1993 _NOEXCEPT_(__is_nothrow_swappable<hasher>::value&& __is_nothrow_swappable<key_equal>::value) 1994#endif 1995{ 1996 _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( 1997 __node_traits::propagate_on_container_swap::value || this->__node_alloc() == __u.__node_alloc(), 1998 "unordered container::swap: Either propagate_on_container_swap " 1999 "must be true or the allocators must compare equal"); 2000 { 2001 __node_pointer_pointer __npp = __bucket_list_.release(); 2002 __bucket_list_.reset(__u.__bucket_list_.release()); 2003 __u.__bucket_list_.reset(__npp); 2004 } 2005 std::swap(__bucket_list_.get_deleter().size(), __u.__bucket_list_.get_deleter().size()); 2006 std::__swap_allocator(__bucket_list_.get_deleter().__alloc(), __u.__bucket_list_.get_deleter().__alloc()); 2007 std::__swap_allocator(__node_alloc(), __u.__node_alloc()); 2008 std::swap(__p1_.first().__next_, __u.__p1_.first().__next_); 2009 __p2_.swap(__u.__p2_); 2010 __p3_.swap(__u.__p3_); 2011 if (size() > 0) 2012 __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.first().__ptr(); 2013 if (__u.size() > 0) 2014 __u.__bucket_list_[std::__constrain_hash(__u.__p1_.first().__next_->__hash(), __u.bucket_count())] = 2015 __u.__p1_.first().__ptr(); 2016} 2017 2018template <class _Tp, class _Hash, class _Equal, class _Alloc> 2019typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type 2020__hash_table<_Tp, _Hash, _Equal, _Alloc>::bucket_size(size_type __n) const { 2021 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 2022 __n < bucket_count(), "unordered container::bucket_size(n) called with n >= bucket_count()"); 2023 __next_pointer __np = __bucket_list_[__n]; 2024 size_type __bc = bucket_count(); 2025 size_type __r = 0; 2026 if (__np != nullptr) { 2027 for (__np = __np->__next_; __np != nullptr && std::__constrain_hash(__np->__hash(), __bc) == __n; 2028 __np = __np->__next_, (void)++__r) 2029 ; 2030 } 2031 return __r; 2032} 2033 2034template <class _Tp, class _Hash, class _Equal, class _Alloc> 2035inline _LIBCPP_HIDE_FROM_ABI void 2036swap(__hash_table<_Tp, _Hash, _Equal, _Alloc>& __x, __hash_table<_Tp, _Hash, _Equal, _Alloc>& __y) 2037 _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { 2038 __x.swap(__y); 2039} 2040 2041_LIBCPP_END_NAMESPACE_STD 2042 2043_LIBCPP_POP_MACROS 2044 2045#endif // _LIBCPP___HASH_TABLE 2046