Lines Matching defs:__code
623 // Insert node with hash code __code, in bucket bkt if no rehash (assumes
627 _M_insert_unique_node(size_type __bkt, __hash_code __code,
630 // Insert node with hash code __code. Take ownership of the node,
633 _M_insert_multi_node(__hash_code __code, __node_type* __n);
1023 __hash_code __code = this->_M_hash_code(__k);
1024 std::size_t __n = _M_bucket_index(__k, __code);
1025 __node_type* __p = _M_find_node(__n, __k, __code);
1040 __hash_code __code = this->_M_hash_code(__k);
1041 std::size_t __n = _M_bucket_index(__k, __code);
1042 __node_type* __p = _M_find_node(__n, __k, __code);
1057 __hash_code __code = this->_M_hash_code(__k);
1058 std::size_t __n = _M_bucket_index(__k, __code);
1066 if (this->_M_equals(__k, __code, __p))
1095 __hash_code __code = this->_M_hash_code(__k);
1096 std::size_t __n = _M_bucket_index(__k, __code);
1097 __node_type* __p = _M_find_node(__n, __k, __code);
1103 && this->_M_equals(__k, __code, __p1))
1128 __hash_code __code = this->_M_hash_code(__k);
1129 std::size_t __n = _M_bucket_index(__k, __code);
1130 __node_type* __p = _M_find_node(__n, __k, __code);
1136 && this->_M_equals(__k, __code, __p1))
1157 __hash_code __code) const
1165 if (this->_M_equals(__k, __code, __p))
1262 __hash_code __code;
1265 __code = this->_M_hash_code(__k);
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),
1301 __hash_code __code;
1304 __code = this->_M_hash_code(this->_M_extract()(__node->_M_v));
1312 return _M_insert_multi_node(__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);
1339 this->_M_store_code(__node, __code);
1364 _M_insert_multi_node(__hash_code __code, __node_type* __node)
1375 this->_M_store_code(__node, __code);
1377 size_type __bkt = _M_bucket_index(__k, __code);
1380 __node_base* __prev = _M_find_before_node(__bkt, __k, __code);
1418 __code = this->_M_hash_code(__k);
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);
1444 __hash_code __code = this->_M_hash_code(this->_M_extract()(__v));
1449 return _M_insert_multi_node(__code, __node);
1513 __hash_code __code = this->_M_hash_code(__k);
1514 std::size_t __bkt = _M_bucket_index(__k, __code);
1517 __node_base* __prev_n = _M_find_before_node(__bkt, __k, __code);
1538 __hash_code __code = this->_M_hash_code(__k);
1539 std::size_t __bkt = _M_bucket_index(__k, __code);
1542 __node_base* __prev_n = _M_find_before_node(__bkt, __k, __code);
1562 while (__n_last_bkt == __bkt && this->_M_equals(__k, __code, __n_last));
