699         while (this->is_valid(n) && !my_hash_compare.equal(key, n->value().first))  in __TBB_requires()
740 …      hashcode_type curr_node_hash = my_hash_compare.hash(static_cast<node*>(curr)->value().first);  in __TBB_requires()
897     concurrent_hash_map( I first, I last, const allocator_type &a = allocator_type() )  in __TBB_requires()
901             internal_copy(first, last, std::distance(first, last));  in __TBB_requires()
908 …concurrent_hash_map( I first, I last, const hash_compare_type& compare, const allocator_type& a = …  in __TBB_requires()
912             internal_copy(first, last, std::distance(first, last));  in __TBB_requires()
984 …      hashcode_type curr_node_hash = my_hash_compare.hash(static_cast<node*>(curr)->value().first);  in __TBB_requires()
1169 …return lookup</*insert*/true>(value.first, &value.second, &result, /*write=*/false, &allocate_node…  in __TBB_requires()
1176 …return lookup</*insert*/true>(value.first, &value.second, &result, /*write=*/true, &allocate_node_…  in __TBB_requires()
1182 …return lookup</*insert*/true>(value.first, &value.second, nullptr, /*write=*/false, &allocate_node…  in __TBB_requires()
1226     void insert( I first, I last ) {  in __TBB_requires()
1227         for ( ; first != last; ++first )  in __TBB_requires()
1228             insert( *first );  in __TBB_requires()
1370 …return lookup</*insert*/true>(value.first, &value.second, accessor_location(result), is_write_acce…  in __TBB_requires()
1377 …return lookup</*insert*/true>(node_ptr->value().first, nullptr, accessor_location(result), is_writ…  in __TBB_requires()
1435 …alid(erase_node) && !my_hash_compare.equal(key, static_cast<node*>(erase_node)->value().first ) ) {  in __TBB_requires()
1501 …     node* node_ptr = create_node(base_type::get_allocator(), n->value().first, n->value().second);  in __TBB_requires()
1511     void internal_copy( I first, I last, size_type reserve_size ) {  in __TBB_requires()
1514         for(; first != last; ++first) {  in __TBB_requires()
1515             hashcode_type h = my_hash_compare.hash( (*first).first );  in __TBB_requires()
1518 …         node* node_ptr = create_node(base_type::get_allocator(), (*first).first, (*first).second);  in __TBB_requires()
1637         j = b.equal_range(i->first).first;