Home
last modified time | relevance | path

Searched refs:array_size (Results 1 – 4 of 4) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_parallel_sort.cpp354 constexpr std::size_t array_size = 10000; variable
358 int test_array[array_size]; in sort_array_test()
359 for (std::size_t i = 0; i < array_size; ++i) in sort_array_test()
360 test_array[i] = rand() % array_size; in sort_array_test()
364 for (std::size_t i = 0; i < array_size - 1; ++i) in sort_array_test()
382 sort_array_test([](int (&array)[array_size]) { in __anon54e49e5e0302() argument
390 sort_array_test([](int (&array)[array_size]) { in __anon54e49e5e0402() argument
401 for (std::size_t i = 0; i < array_size; ++i)
417 int test_array[array_size];
418 for (std::size_t i = 0; i < array_size; ++i)
[all …]
/oneTBB/src/tbb/
H A Dparallel_pipeline.cpp123 size_type array_size; member in tbb::detail::r1::input_buffer
158 array_size(0), in input_buffer()
171 cache_aligned_allocator<task_info>().deallocate(array,array_size); in ~input_buffer()
203 if( token-low_token>=array_size ) in try_put_token()
206 array[token&(array_size-1)] = info; in try_put_token()
221 task_info& item = array[++low_token & (array_size-1)]; in try_to_spawn_task_for_next_token()
251 size_type old_size = array_size; in grow()
263 array_size = new_size; in grow()
/oneTBB/test/common/
H A Dconcurrent_lru_cache_common.h83 template<typename key_type, typename value_type, std::size_t array_size>
85 using array_type = value_type[array_size];
93 REQUIRE_MESSAGE(k < array_size, "incorrect test setup"); in operator()
/oneTBB/doc/main/tbb_userguide/
H A Dstd_invoke.rst75 std::size_t array_size = 1000;
77 int* array_to_iterate = new int[array_size];
79 StrideRange range(array_to_iterate, array_size, /* stride = */ 2);
99 std::size_t array_size = 1000;
101 int* array_to_iterate = new int[array_size];
104 StrideRange range(array_to_iterate, array_size, /* stride = */ 2);