Searched refs:nb_values (Results 1 - 4 of 4) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/make_heap/
H A Dcomplexity.cc32 const std::size_t nb_values = 1000; local
37 values.reserve(nb_values);
38 for (std::size_t i = 0; i != nb_values; ++i)
45 VERIFY( counter_type::less_compare_count <= 3.0 * nb_values );
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/sort_heap/
H A Dcomplexity.cc34 const std::size_t nb_values = 1000; local
39 values.reserve(nb_values);
40 for (std::size_t i = 0; i != nb_values; ++i)
49 VERIFY( counter_type::less_compare_count <= 2.0 * nb_values * std::log2(nb_values) );
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/pop_heap/
H A Dcomplexity.cc35 const std::size_t nb_values = 1000; local
40 values.reserve(nb_values);
41 for (std::size_t i = 0; i != nb_values; ++i)
50 VERIFY( counter_type::less_compare_count <= 2.0 * std::log2(nb_values) );
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/push_heap/
H A Dcomplexity.cc35 const std::size_t nb_values = 1000; local
40 values.reserve(nb_values);
41 for (std::size_t i = 0; i != nb_values; ++i)

Completed in 46 milliseconds