Searched refs:max_n (Results 1 – 6 of 6) sorted by relevance
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
52 Sequence<T2> in2(2 * max_n, [](std::size_t k) { return T2(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
62 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.cbegin(), in2.cbeg… in test()
64 … invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.begin() + max_n2, in test()
68 max_n2 = 2 * max_n; in test()
69 …invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.begin(), in2.beg… in test()
[all …]
|
| /external/mesa3d/src/gallium/drivers/lima/ |
| D | lima_gpu.h | 105 int i = 0, max_n = max; \
107 uint32_t *plbu_cmd = util_dynarray_ensure_cap(plbu_cmd_array, plbu_cmd_array->size + max_n * 4);
110 assert(i <= max_n); \
160 int i = 0, max_n = max; \
162 uint32_t *vs_cmd = util_dynarray_ensure_cap(vs_cmd_array, vs_cmd_array->size + max_n * 4);
165 assert(i <= max_n); \
|
| /external/curl/src/ |
| D | tool_urlglob.c | 241 unsigned long max_n = 0; in glob_range() local
274 max_n = strtoul(pattern, &endp, 10); in glob_range()
300 (min_n == max_n && step_n != 1) || in glob_range()
301 (min_n != max_n && (min_n > max_n || step_n > (max_n - min_n)))) in glob_range()
308 pat->content.NumRange.max_n = max_n; in glob_range()
311 if(multiply(amount, ((pat->content.NumRange.max_n - in glob_range()
556 if(pat->content.NumRange.ptr_n > pat->content.NumRange.max_n) { in glob_next_url()
|
| D | tool_urlglob.h | 50 unsigned long max_n; member
|
| /external/llvm-project/pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| D | is_partitioned.pass.cpp | 53 const std::size_t max_n = 1000000; in test() local
54 Sequence<T> in(max_n, [](std::size_t k) { return T(k); }); in test()
56 for (std::size_t n1 = 0; n1 <= max_n; n1 = n1 <= 16 ? n1 + 1 : std::size_t(3.1415 * n1)) in test()
|
| /external/gemmlowp/test/ |
| D | correctness_meta_gemm.cc | 267 const std::int32_t max_n = 1024; in main() local
272 std::uint8_t* right = new std::uint8_t[max_n * max_k]; in main()
273 std::uint8_t* result = new std::uint8_t[max_m * max_n]; in main()
274 float* result_float = new float[max_m * max_n]; in main()
275 std::int32_t* result_i32 = new std::int32_t[max_m * max_n]; in main()
|