Home
last modified time | relevance | path

Searched refs:create_node (Results 1 – 3 of 3) sorted by relevance

/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h662 static node* create_node(bucket_allocator_type& allocator, Args&&... args) { in __TBB_requires()
677 return create_node(allocator, key, *t); in __TBB_requires()
681 return create_node(allocator, key, std::move(*const_cast<T*>(t))); in __TBB_requires()
687 return create_node(allocator, std::piecewise_construct, in __TBB_requires()
1376 node * node_ptr = create_node(base_type::get_allocator(), std::forward<Args>(args)...); 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()
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_unordered_base.h470 value_node_ptr insert_node = create_node(0, std::forward<Args>(args)...); in emplace()
955 return create_node(order_key, std::forward<ValueType>(value)); in internal_insert_value()
1127 value_node_ptr create_node( sokey_type order_key, Args&&... args ) { in create_node() function
1327 … new_node = create_node(node->order_key(), static_cast<value_node_ptr>(node)->value()); in internal_copy()
1347 … new_node = create_node(node->order_key(), std::move(static_cast<value_node_ptr>(node)->value())); in internal_move()
H A D_concurrent_skip_list.h1097 node_ptr create_node( size_type height ) { in create_node() function
1103 node_ptr node = create_node(my_rng()); in create_value_node()
1118 return create_node(max_level); in create_head_node()