Lines Matching refs:max_n
58 const std::size_t max_n = 1000000; in test() local
59 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
60 Sequence<T2> in2(2 * max_n, [](std::size_t k) { return T2(k); }); in test()
65 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
66 in2.cbegin() + 5 * max_n / 10); in test()
69 std::size_t max_n2 = max_n / 10; in test()
70 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.cbegin(), in2.cbeg… in test()
72 … invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.begin() + max_n2, in test()
76 max_n2 = 2 * max_n; in test()
77 …invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.begin(), in2.beg… in test()
80 for (std::size_t n1 = 0; n1 <= max_n; n1 = n1 <= 16 ? n1 + 1 : std::size_t(3.1415 * n1)) in test()
106 const std::size_t max_n = 1000000; in test_string() local
109 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
114 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
136 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
137 in2.cbegin() + 5 * max_n / 10); in test_string()