Home
last modified time | relevance | path

Searched refs:back (Results 1 – 25 of 28) sorted by relevance

12

/oneTBB/doc/main/tbb_userguide/snippets/
H A Dflow_graph_examples.cpp31 tbb::task_arena::constraints{}.set_core_type(core_types.back()) in flow_graph_attach_to_arena_1()
56 tbb::task_arena::constraints{}.set_core_type(core_types.back()) in flow_graph_attach_to_arena_2()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_priority_queue.h275 my_compare(data[0], data.back())) in handle_operations()
278 *(tmp->elem) = std::move(data.back()); in handle_operations()
320 my_compare(data[0], data.back())) in handle_operations()
323 *(tmp->elem) = std::move(data.back()); in handle_operations()
371 if (my_compare(data[target], data.back())) in reheap()
378 data[cur_pos] = std::move(data.back()); in reheap()
H A Dpartitioner.h234 T& back() { in back() function
252 return back_depth() < max_depth && back().is_divisible(); in is_divisible()
450 start.run_body( range_pool.back() ); in work_balance()
H A Dconcurrent_lru_cache.h151 storage_map_iterator_type map_it_to_evict = my_history_list.back(); in signal_end_of_usage_serial()
H A Dconcurrent_vector.h453 reference back() { in back() function
457 const_reference back() const { in back() function
/oneTBB/test/tbb/
H A Dtest_function_node.cpp102 senders.back()->my_limit = N; in buffered_levels()
103 senders.back()->register_successor(pass_thru_vec[node_idx] ); in buffered_levels()
188 senders.back()->my_limit = N; in buffered_levels_with_copy()
189 tbb::flow::make_edge( *senders.back(), exe_node ); in buffered_levels_with_copy()
297 senders.back()->my_limit = N; in concurrency_levels()
298 exe_node.register_predecessor( *senders.back() ); in concurrency_levels()
H A Dtest_multifunction_node.cpp94 senders.back()->my_limit = N; in buffered_levels()
95 tbb::flow::make_edge( *senders.back(), exe_vec[node_idx] ); in buffered_levels()
179 senders.back()->my_limit = N; in buffered_levels_with_copy()
180 tbb::flow::make_edge( *senders.back(), exe_node ); in buffered_levels_with_copy()
283 senders.back()->my_limit = N; in concurrency_levels()
284 exe_node.register_predecessor( *senders.back() ); in concurrency_levels()
H A Dtest_flow_graph_priorities.cpp141 make_edge( bn, *nodes.back() ); in test_node()
142 make_edge( *nodes.back(), tn ); in test_node()
H A Dtest_eh_algorithms.cpp787 return iterator{&my_array.back()}; in end()
790 return iterator{&my_array.back()}; in end()
H A Dtest_concurrent_vector.cpp295 REQUIRE( utils::IsEqual()(cvcr.back(), *c2.rbegin())); in Examine()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h134 const item_type& back() const in back() function
196 v = this->back(); in pop_back()
/oneTBB/doc/main/tbb_userguide/
H A Dcreate_token_based_system.rst110 back to the ``buffer_node``. This cycle in the flow graph allows the token
124 free list of big objects using a cycle back to the ``buffer_node``.
H A DFlow_Graph_Reservation.rst210 switches back to the forward direction.
239 switches back to the forward direction.
H A Duse_input_node.rst66 largest depth in the tree first, and work back to the shallowest edges.
H A Dappendix_A.rst23 has to evict items from cache and put them back into main memory.
H A DGuiding_Task_Scheduler_Execution.rst74 tbb::task_arena::constraints{}.set_core_type(core_types.back())
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A DREADME.md6 This algorithm varies from serial `A*` in that it needs to add nodes back to the open set when the …
/oneTBB/test/conformance/
H A Dconformance_indexer_node.cpp40 oneapi::tbb::flow::make_edge(testing_node, *receiver_nodes.back());
H A Dconformance_parallel_scan.cpp146 CHECK(result.get() == result_vector.back()); in test_pscan_invoke()
H A Dconformance_flowgraph.h483 oneapi::tbb::flow::make_edge(testing_node, *receiver_nodes.back()); in test_forwarding()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_whitebox.cpp249 setBackRef(blocks.back().idx, &blocks.back().data); in operator ()()
986 uintptr_t obj_age = objects.back(); in get()
1087 rml::internal::LargeMemoryBlock *ret = lmbArray.back(); in next()
1115 rml::internal::LargeMemoryBlock *lmb = lmbArray.back(); in next()
/oneTBB/src/tbb/
H A Dtask_stream.h139 result = queue.back(); in get_item()
/oneTBB/test/common/
H A Dutils_concurrency_limit.h61 if(threads_range.back() != max_threads) in concurrency_range()
H A Ddoctest.h3401 std::streampos pos = stack.back();
3940 auto back = std::strrchr(file, '\\');
3942 if(back || forward) {
3943 if(back > forward)
3944 forward = back;
5391 m_os << m_indent << "</" << m_tags.back() << ">";
5820 testcases.back().name += std::string("/") + curr.c_str();
5826 testcases.back().time = time;
5831 testcases.back().failures.emplace_back(message, type, details);
5836 testcases.back().errors.emplace_back(message, details);
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DGUI_Thread.rst189 results back to the GUI thread. Since only the most recent result

12