374     using node = typename Container::node;  variable
411         my_node = static_cast<node*>( my_node->next );
448                 my_node = static_cast<node*>(n);  in advance_to_next_bucket()
470         my_map(&map), my_index(index), my_bucket(b), my_node(static_cast<node*>(n))  in hash_map_iterator()
483     node* my_node;
631     class node;  in __TBB_requires()  local
638 …using node_allocator_type = typename base_type::allocator_traits_type::template rebind_alloc<node>;  in __TBB_requires()
642     class node : public node_base {  in __TBB_requires()
644         node() {}  in __TBB_requires()
645         ~node() {}  in __TBB_requires()
656         node_allocator_traits::destroy(node_allocator, static_cast<node*>(n)->storage());  in __TBB_requires()
657         node_allocator_traits::destroy(node_allocator, static_cast<node*>(n));  in __TBB_requires()
658         node_allocator_traits::deallocate(node_allocator, static_cast<node*>(n), 1);  in __TBB_requires()
662     static node* create_node(bucket_allocator_type& allocator, Args&&... args) {  in __TBB_requires()
664         node* node_ptr = node_allocator_traits::allocate(node_allocator, 1);  in __TBB_requires()
676 …static node* allocate_node_copy_construct(bucket_allocator_type& allocator, const Key &key, const …  in __TBB_requires()
680 …static node* allocate_node_move_construct(bucket_allocator_type& allocator, const Key &key, const …  in __TBB_requires()
685 …static node* allocate_node_default_construct(bucket_allocator_type& allocator, const K &key, const…  in __TBB_requires()
691     static node* do_not_allocate_node(bucket_allocator_type& , const Key &, const T * ){  in __TBB_requires()
697     node *search_bucket( const K &key, bucket *b ) const {  in __TBB_requires()
698         node *n = static_cast<node*>( b->node_list.load(std::memory_order_relaxed) );  in __TBB_requires()
700             n = static_cast<node*>( n->next );  in __TBB_requires()
740 …      hashcode_type curr_node_hash = my_hash_compare.hash(static_cast<node*>(curr)->value().first);  in __TBB_requires()
771     class const_accessor : private node::scoped_type /*which derived from no_copy*/ {  in __TBB_requires()
788                 node::scoped_type::release();  in __TBB_requires()
812         bool is_writer() { return node::scoped_type::is_writer(); }  in __TBB_requires()
813         node *my_node;  in __TBB_requires()
984 …      hashcode_type curr_node_hash = my_hash_compare.hash(static_cast<node*>(curr)->value().first);  in __TBB_requires()
1262 …node* allocate_node_helper( const K& key, const T* t, AllocateNodeType allocate_node, std::true_ty…  in __TBB_requires()
1267     node* allocate_node_helper( const K&, const T*, AllocateNodeType, std::false_type ) {  in __TBB_requires()
1274 …t T *t, const_accessor *result, bool write, AllocateNodeType allocate_node, node *tmp_n  = nullptr)  in __TBB_requires()
1281         node *n;  in __TBB_requires()
1376         node * node_ptr = create_node(base_type::get_allocator(), std::forward<Args>(args)...);  in __TBB_requires()
1435 …while (this->is_valid(erase_node) && !my_hash_compare.equal(key, static_cast<node*>(erase_node)->v…  in __TBB_requires()
1459             typename node::scoped_type item_locker( erase_node->mutex, /*write=*/true );  in __TBB_requires()
1478         node *n = search_bucket( key, b );  in __TBB_requires()
1496                 node *n = static_cast<node*>( src->node_list.load(std::memory_order_relaxed) );  in __TBB_requires()
1500                 } else for(; n; n = static_cast<node*>( n->next ) ) {  in __TBB_requires()
1501 …     node* node_ptr = create_node(base_type::get_allocator(), n->value().first, n->value().second);  in __TBB_requires()
1518 …         node* node_ptr = create_node(base_type::get_allocator(), (*first).first, (*first).second);  in __TBB_requires()
1576         node *n;  in __TBB_requires()