Searched refs:max_n2 (Results 1 – 3 of 3) sorted by relevance
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 61 std::size_t max_n2 = max_n / 10; in test() local
62 …_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.cbegin(), in2.cbegin() + max_n2, in test()
64 … invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.begin() + max_n2, in test()
65 in2.begin() + 3 * max_n2, pred); in test()
68 max_n2 = 2 * max_n; in test()
69 …_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.begin(), in2.begin() + max_n2, in test()
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | find_first_of.pass.cpp | 60 const std::size_t max_n2 = (max_n1 * 10) / 8; in test() local
62 Sequence<T> in2(max_n2, [](std::size_t) { return T(0); }); in test()
|
| H A D | find_end.pass.cpp | 72 const std::size_t max_n2 = (max_n1 * 10) / 8; in test() local
74 Sequence<T> sub(max_n2, [bits](std::size_t) { return T(2 * HashBits(max_n1, bits - 1)); }); in test()
|