| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
144 const int ib[] = {0, 0}; in main() local
158 const int ib[] = {0, 1}; in main() local
176 const int ib[] = {1, 0}; in main() local
[all …]
|
| H A D | is_permutation_pred.pass.cpp | 33 int ib[] = {1, 1, 0}; in test_constexpr() local
62 const int ib[] = {0}; in main() local
87 const int ib[] = {1}; main() local
104 const int ib[] = {0, 0}; main() local
125 const int ib[] = {0, 1}; main() local
141 const int ib[] = {1, 0}; main() local
157 const int ib[] = {1, 1}; main() local
173 const int ib[] = {0, 0}; main() local
189 const int ib[] = {0, 1}; main() local
210 const int ib[] = {1, 0}; main() local
231 const int ib[] = {1, 1}; main() local
247 const int ib[] = {0, 0}; main() local
263 const int ib[] = {0, 1}; main() local
284 const int ib[] = {1, 0}; main() local
305 const int ib[] = {1, 1}; main() local
321 const int ib[] = {0, 0}; main() local
337 const int ib[] = {0, 1}; main() local
353 const int ib[] = {1, 0}; main() local
369 const int ib[] = {1, 1}; main() local
391 const int ib[] = {1, 0, 0}; main() local
407 const int ib[] = {1, 0, 1}; main() local
423 const int ib[] = {1, 0, 2}; main() local
439 const int ib[] = {1, 1, 0}; main() local
455 const int ib[] = {1, 1, 1}; main() local
471 const int ib[] = {1, 1, 2}; main() local
487 const int ib[] = {1, 2, 0}; main() local
503 const int ib[] = {1, 2, 1}; main() local
519 const int ib[] = {1, 2, 2}; main() local
535 const int ib[] = {1, 0, 0}; main() local
556 const int ib[] = {1, 0, 1}; main() local
572 const int ib[] = {1, 0, 2}; main() local
593 const int ib[] = {1, 2, 0}; main() local
614 const int ib[] = {2, 1, 0}; main() local
635 const int ib[] = {2, 0, 1}; main() local
656 const int ib[] = {1, 0, 1}; main() local
672 const int ib[] = {1, 0, 0}; main() local
698 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; main() local
738 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; main() local
[all...] |
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 26 int ib[] = {1, 3, 5, 2, 4, 6}; test_constexpr() local
40 int ib[] = {1, 2, 3}; test() local
[all...] |
| H A D | lexicographical_compare_comp.pass.cpp | 28 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
43 int ib[] = {1, 2, 3}; in test() local
|
| /llvm-project/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| H A D | compare.pass.cpp | 30 const char ib[] = "123"; in main() local
44 const wchar_t ib[] = L"123"; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| H A D | replace_copy.pass.cpp | 29 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger in test_constexpr() local
47 int ib[sa] = {0}; in test() local
|
| H A D | replace_copy_if.pass.cpp | 32 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger in test_constexpr() local
50 int ib[sa] = {0}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| H A D | binary_transform.pass.cpp | 27 const int ib[] = {2, 4, 7, 8}; in test_constexpr() local
48 int ib[sa] = {1, 2, 3, 4, 5}; in test() local
|
| H A D | unary_transform.pass.cpp | 30 int ib[] = {0, 0, 0, 0, 0}; // one bigger in test_constexpr() local
49 int ib[sa] = {0}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| H A D | find_first_of.pass.cpp | 25 int ib[] = {7, 8, 9}; in test_constexpr() local
45 int ib[] = {1, 3, 5, 7}; in main() local
|
| H A D | find_first_of_pred.pass.cpp | 27 int ib[] = {7, 8, 9}; in test_constexpr() local
47 int ib[] = {1, 3, 5, 7}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| H A D | remove_copy.pass.cpp | 25 int ib[std::size(ia)] = {0}; in test_constexpr() local
42 int ib[sa]; in test() local
|
| H A D | remove_copy_if.pass.cpp | 29 int ib[std::size(ia)] = {0}; in test_constexpr() local
46 int ib[sa]; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| H A D | equal_pred.pass.cpp | 37 int ib[] = {1, 3}; in test_constexpr() local
65 int ib[s] = {0, 1, 2, 5, 4, 5}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| H A D | reverse_copy.pass.cpp | 24 int ib[std::size(ia)] = {0}; in test_constexpr() local
47 const int ib[] = {0, 1}; in test() local
|
| /llvm-project/offload/test/offloading/ |
| H A D | bug49021.cpp | 45 for (int ib = 0; ib < nblock; ib++) { in test_reduction() local
56 for (int ib = 0; ib < nblock; ib++) { in test_reduction() local
|
| H A D | complex_reduction.cpp | 62 for (int ib = 0; ib < nblock; ib++) { in test_reduction() local
73 for (int ib = 0; ib < nblock; ib++) in test_reduction() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
| H A D | contiguous_trivial_optimization.pass.cpp | 38 TMBNTC ib[] = { copies, copies, copies, copies }; in test_trivial_moveassign_but_no_trivial_copyassign() local
72 TCBNTM ib[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| H A D | search_pred.pass.cpp | 27 int ib[] = {0, 1, 5, 3}; in test_constexpr() local
88 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; test() local
[all...] |
| /llvm-project/clang/test/OpenMP/ |
| H A D | nvptx_target_parallel_reduction_codegen_tbaa_PR46146.cpp | 17 for (int ib = 0; ib < 100; ib++) { in complex_reduction() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| H A D | adjacent_find.pass.cpp | 25 int ib[] = {0, 1, 2, 7, 0, 1, 2, 3}; in test_constexpr() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | rotate.pass.cpp | 38 int ib[] = {0, 1}; in test() local
236 std::unique_ptr<int> ib[2]; in test1() local
|
| /llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| H A D | hash.pass.cpp | 70 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; test2() local
[all...] |
| /llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| H A D | hash.pass.cpp | 71 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; test2() local
[all...] |
| H A D | pred.pass.cpp | 80 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
114 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
|