Home
last modified time | relevance | path

Searched defs:new_node (Results 1 – 4 of 4) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_split_node.cpp154 my_sink_node_type *new_node = new my_sink_node_type(g); in add_sink_nodes() local
194 my_sink_node_type *new_node = new my_sink_node_type(g); in add_sink_nodes() local
H A Dtest_indexer_node.cpp175 …my_input_node_type *new_node = new my_input_node_type(g, my_input_body<IT>((IT)(ELEM+1), i, nInput… in add_input_nodes() local
221 … my_input_node_type *new_node = new my_input_node_type(g, my_input_body<IT>((IT)2, i, nInputs)); in add_input_nodes() local
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_unordered_base.h1001 value_node_ptr new_node = create_insert_node(order_key); in internal_insert() local
1074 static bool try_insert( node_ptr prev_node, node_ptr new_node, node_ptr current_next_node ) { in try_insert()
1130 value_node_ptr new_node = value_node_allocator_traits::allocate(value_node_allocator, 1); in create_node() local
1324 node_ptr new_node; in internal_copy() local
1344 node_ptr new_node; in internal_move() local
H A D_concurrent_skip_list.h943 node_ptr new_node = create_value_node(std::forward<Args>(args)...); in internal_insert() local
951 std::pair<iterator, bool> internal_insert_node( node_ptr new_node ) { in internal_insert_node()