Home
last modified time | relevance | path

Searched refs:array_length (Results 1 – 5 of 5) sorted by relevance

/oneTBB/examples/common/utility/
H A Dutility.hpp415 inline std::size_t array_length(const T (&)[N]) { in array_length() function
441 while ((i < array_length(step_function_descriptors)) && in operator >>()
444 if (i >= array_length(step_function_descriptors)) { in operator >>()
522 for (; i < array_length(step_function_descriptors) && in operator <<()
526 if (i >= array_length(step_function_descriptors)) { in operator <<()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_compliance.cpp309 for (unsigned i=0; i<utils::array_length(params); i++) { in CheckArgumentsOverflow()
327 for (unsigned i=0; i<utils::array_length(params); i++) { in CheckArgumentsOverflow()
337 for (unsigned i=0; i<utils::array_length(params); i++) { in CheckArgumentsOverflow()
/oneTBB/test/common/
H A Dutils.h370 inline std::size_t array_length(const T(&)[N]) {
/oneTBB/test/tbb/
H A Dtest_concurrent_vector.cpp394 …REQUIRE_MESSAGE( (v.grow_by( init_range, init_range + (utils::array_length( init_range )) ) == v.b… in TestSerialGrowByRange()
/oneTBB/test/conformance/
H A Dconformance_concurrent_vector.cpp228 return array + utils::array_length(array) ; in end()
1009 for (std::size_t i=0; i < utils::array_length(concurrent_grow_single_range_map); ++i){ in TestConcurrentGrowBy()