676 …static node* allocate_node_copy_construct(bucket_allocator_type& allocator, const Key &key, const …  in __TBB_requires()
677         return create_node(allocator, key, *t);  in __TBB_requires()
680 …static node* allocate_node_move_construct(bucket_allocator_type& allocator, const Key &key, const …  in __TBB_requires()
681         return create_node(allocator, key, std::move(*const_cast<T*>(t)));  in __TBB_requires()
685 …static node* allocate_node_default_construct(bucket_allocator_type& allocator, const K &key, const…  in __TBB_requires()
688                            std::forward_as_tuple(key), std::forward_as_tuple());  in __TBB_requires()
697     node *search_bucket( const K &key, bucket *b ) const {  in __TBB_requires()
699         while (this->is_valid(n) && !my_hash_compare.equal(key, n->value().first))  in __TBB_requires()
1052 …std::pair<iterator, iterator> equal_range( const Key& key ) { return internal_equal_range( key, en…  in __TBB_requires()
1053 …st_iterator, const_iterator> equal_range( const Key& key ) const { return internal_equal_range( ke…  in __TBB_requires()
1057                             std::pair<iterator, iterator>>::type equal_range( const K& key ) {  in __TBB_requires()
1058         return internal_equal_range(key, end());  in __TBB_requires()
1063 …               std::pair<const_iterator, const_iterator>>::type equal_range( const K& key ) const {  in __TBB_requires()
1064         return internal_equal_range(key, end());  in __TBB_requires()
1097     size_type count( const Key &key ) const {  in __TBB_requires()
1098 …return const_cast<concurrent_hash_map*>(this)->lookup</*insert*/false>(key, nullptr, nullptr, /*wr…  in __TBB_requires()
1103                             size_type>::type count( const K& key ) const {  in __TBB_requires()
1104 …return const_cast<concurrent_hash_map*>(this)->lookup</*insert*/false>(key, nullptr, nullptr, /*wr…  in __TBB_requires()
1109     bool find( const_accessor &result, const Key &key ) const {  in __TBB_requires()
1111 …return const_cast<concurrent_hash_map*>(this)->lookup</*insert*/false>(key, nullptr, &result, /*wr…  in __TBB_requires()
1116     bool find( accessor &result, const Key &key ) {  in __TBB_requires()
1118 …      return lookup</*insert*/false>(key, nullptr, &result, /*write=*/true, &do_not_allocate_node);  in __TBB_requires()
1123                             bool>::type find( const_accessor& result, const K& key ) {  in __TBB_requires()
1125 …     return lookup</*insert*/false>(key, nullptr, &result, /*write=*/false, &do_not_allocate_node);  in __TBB_requires()
1130                             bool>::type find( accessor& result, const K& key ) {  in __TBB_requires()
1132 …      return lookup</*insert*/false>(key, nullptr, &result, /*write=*/true, &do_not_allocate_node);  in __TBB_requires()
1137     bool insert( const_accessor &result, const Key &key ) {  in __TBB_requires()
1139 …return lookup</*insert*/true>(key, nullptr, &result, /*write=*/false, &allocate_node_default_const…  in __TBB_requires()
1144     bool insert( accessor &result, const Key &key ) {  in __TBB_requires()
1146 …return lookup</*insert*/true>(key, nullptr, &result, /*write=*/true, &allocate_node_default_constr…  in __TBB_requires()
1152                             bool>::type insert( const_accessor& result, const K& key ) {  in __TBB_requires()
1154 …return lookup</*insert*/true>(key, nullptr, &result, /*write=*/false, &allocate_node_default_const…  in __TBB_requires()
1160                             bool>::type insert( accessor& result, const K& key ) {  in __TBB_requires()
1162 …return lookup</*insert*/true>(key, nullptr, &result, /*write=*/true, &allocate_node_default_constr…  in __TBB_requires()
1238     bool erase( const Key &key ) {  in __TBB_requires()
1239         return internal_erase(key);  in __TBB_requires()
1244                             bool>::type erase( const K& key ) {  in __TBB_requires()
1245         return internal_erase(key);  in __TBB_requires()
1262 …node* allocate_node_helper( const K& key, const T* t, AllocateNodeType allocate_node, std::true_ty…  in __TBB_requires()
1263         return allocate_node(base_type::get_allocator(), key, t);  in __TBB_requires()
1274 …bool lookup( const K &key, const T *t, const_accessor *result, bool write, AllocateNodeType alloca…  in __TBB_requires()
1278         hashcode_type const h = my_hash_compare.hash( key );  in __TBB_requires()
1289             n = search_bucket( key, b() );  in __TBB_requires()
1294 …     tmp_n = allocate_node_helper(key, t, allocate_node, std::integral_constant<bool, OpInsert>{});  in __TBB_requires()
1298                         n = search_bucket(key, b());  in __TBB_requires()
1303                                 n = search_bucket(key, b());  in __TBB_requires()
1424     bool internal_erase( const K& key ) {  in __TBB_requires()
1426         hashcode_type const hash = my_hash_compare.hash(key);  in __TBB_requires()
1435 …while (this->is_valid(erase_node) && !my_hash_compare.equal(key, static_cast<node*>(erase_node)->v…  in __TBB_requires()
1468     std::pair<I, I> internal_equal_range( const K& key, I end_ ) const {  in __TBB_requires()
1469         hashcode_type h = my_hash_compare.hash( key );  in __TBB_requires()
1478         node *n = search_bucket( key, b );  in __TBB_requires()
1573     const_pointer internal_fast_find( const Key& key ) const {  in __TBB_requires()
1574         hashcode_type h = my_hash_compare.hash( key );  in __TBB_requires()
1591         n = search_bucket( key, b );  in __TBB_requires()