Lines Matching full:__bkt
365 _M_bucket_begin(size_type __bkt) const;
601 _M_find_node(size_type __bkt, const key_type& __key,
604 __node_base* __before_n = _M_find_before_node(__bkt, __key, __c);
616 _M_remove_bucket_begin(size_type __bkt, __node_type* __next_n,
619 // Get the node before __n in the bucket __bkt
621 _M_get_previous_node(size_type __bkt, __node_base* __n);
627 _M_insert_unique_node(size_type __bkt, __hash_code __code,
658 _M_erase(size_type __bkt, __node_base* __prev_n, __node_type* __n);
806 _M_bucket_begin(size_type __bkt) const
808 __node_base* __n = _M_buckets[__bkt];
910 size_type __bkt = _M_bucket_index(__this_n);
911 if (!_M_buckets[__bkt])
912 _M_buckets[__bkt] = __prev_n;
1181 _M_insert_bucket_begin(size_type __bkt, __node_type* __node)
1183 if (_M_buckets[__bkt])
1187 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt;
1188 _M_buckets[__bkt]->_M_nxt = __node;
1201 _M_buckets[__bkt] = &_M_before_begin();
1212 _M_remove_bucket_begin(size_type __bkt, __node_type* __next,
1215 if (!__next || __next_bkt != __bkt)
1220 _M_buckets[__next_bkt] = _M_buckets[__bkt];
1223 if (&_M_before_begin() == _M_buckets[__bkt])
1225 _M_buckets[__bkt] = nullptr;
1238 _M_get_previous_node(size_type __bkt, __node_base* __n)
1240 __node_base* __prev_n = _M_buckets[__bkt];
1273 size_type __bkt = _M_bucket_index(__k, __code);
1274 if (__node_type* __p = _M_find_node(__bkt, __k, __code))
1282 return std::make_pair(_M_insert_unique_node(__bkt, __code, __node),
1324 _M_insert_unique_node(size_type __bkt, __hash_code __code,
1336 __bkt = _M_bucket_index(this->_M_extract()(__node->_M_v), __code);
1342 _M_insert_bucket_begin(__bkt, __node);
1377 size_type __bkt = _M_bucket_index(__k, __code);
1380 __node_base* __prev = _M_find_before_node(__bkt, __k, __code);
1392 _M_insert_bucket_begin(__bkt, __node);
1419 size_type __bkt = _M_bucket_index(__k, __code);
1421 __node_type* __n = _M_find_node(__bkt, __k, __code);
1426 return std::make_pair(_M_insert_unique_node(__bkt, __code, __n), true);
1464 std::size_t __bkt = _M_bucket_index(__n);
1469 __node_base* __prev_n = _M_get_previous_node(__bkt, __n);
1470 return _M_erase(__bkt, __prev_n, __n);
1482 _M_erase(size_type __bkt, __node_base* __prev_n, __node_type* __n)
1484 if (__prev_n == _M_buckets[__bkt])
1485 _M_remove_bucket_begin(__bkt, __n->_M_next(),
1490 if (__next_bkt != __bkt)
1514 std::size_t __bkt = _M_bucket_index(__k, __code);
1517 __node_base* __prev_n = _M_find_before_node(__bkt, __k, __code);
1523 _M_erase(__bkt, __prev_n, __n);
1539 std::size_t __bkt = _M_bucket_index(__k, __code);
1542 __node_base* __prev_n = _M_find_before_node(__bkt, __k, __code);
1554 std::size_t __n_last_bkt = __bkt;
1562 while (__n_last_bkt == __bkt && this->_M_equals(__k, __code, __n_last));
1576 if (__prev_n == _M_buckets[__bkt])
1577 _M_remove_bucket_begin(__bkt, __n_last, __n_last_bkt);
1578 else if (__n_last && __n_last_bkt != __bkt)
1600 std::size_t __bkt = _M_bucket_index(__n);
1602 __node_base* __prev_n = _M_get_previous_node(__bkt, __n);
1603 bool __is_bucket_begin = __n == _M_bucket_begin(__bkt);
1604 std::size_t __n_bkt = __bkt;
1617 while (__n != __last_n && __n_bkt == __bkt);
1619 _M_remove_bucket_begin(__bkt, __n, __n_bkt);
1623 __bkt = __n_bkt;
1626 if (__n && (__n_bkt != __bkt || __is_bucket_begin))
1708 std::size_t __bkt = __hash_code_base::_M_bucket_index(__p, __n);
1709 if (!__new_buckets[__bkt])
1713 __new_buckets[__bkt] = &_M_before_begin();
1716 __bbegin_bkt = __bkt;
1720 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
1721 __new_buckets[__bkt]->_M_nxt = __p;
1753 std::size_t __bkt = __hash_code_base::_M_bucket_index(__p, __n);
1755 if (__prev_p && __prev_bkt == __bkt)
1787 if (!__new_buckets[__bkt])
1791 __new_buckets[__bkt] = &_M_before_begin();
1794 __bbegin_bkt = __bkt;
1798 __p->_M_nxt = __new_buckets[__bkt]->_M_nxt;
1799 __new_buckets[__bkt]->_M_nxt = __p;
1803 __prev_bkt = __bkt;
