Home
last modified time | relevance | path

Searched refs:advance (Results 1 – 9 of 9) sorted by relevance

/oneTBB/doc/main/tbb_userguide/
H A DCook_Until_Done_parallel_do.rst7 For some loops, the end of the iteration space is not known in advance,
13 advance. In parallel programming, it is usually better to use dynamic
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_queue_base.h527 if (!get_item(my_item, my_head_counter)) advance(); in concurrent_queue_iterator_base()
543 void advance() { in advance() function
558 if (!get_item(my_item, k)) advance(); in advance()
625 this->advance();
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DWavefront.rst36 advance, or can be determined some time before the last
57 advance, treat the information "know number of predecessors" as an
H A DElementwise.rst43 If the number of items is known in advance, use
/oneTBB/test/tbb/
H A Dtest_task_arena.cpp1438 std::advance(it, failure_ratio.size() / 2); in TestArenaWorkersMigrationWithNumThreads()
1448 std::advance(it, failure_ratio.size() / 2); in TestArenaWorkersMigrationWithNumThreads()
1692 std::advance(curr_arena, arena_number); in StressTestMixFunctionality()
H A Dtest_concurrent_hash_map.cpp230 std::advance( begin5, 5 ); in Examine()
/oneTBB/test/common/
H A Dutils.h55 std::advance(first, distance / 2 - 1); in median()
H A Dconcurrent_associative_common.h1168 std::advance(begin5, 5);
/oneTBB/doc/main/tbb_userguide/Migration_Guide/
H A DTask_API.rst94 In TBB, cases when the amount of work is not known in advance and the work needs to be added during