| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 25 int ia[] = {0, 0, 0}; in test_constexpr() local
41 const int ia[] = {0}; in main() local
68 const int ia[] = {0}; in main() local
83 const int ia[] = {0, 0}; in main() local
101 const int ia[] = {0, 0}; in main() local
115 const int ia[] = {0, 0}; in main() local
129 const int ia[] = {0, 0}; in main() local
143 const int ia[] = {0, 1}; in main() local
157 const int ia[] = {0, 1}; in main() local
175 const int ia[] = {0, 1}; in main() local
[all …]
|
| H A D | is_permutation_pred.pass.cpp | 32 int ia[] = {0, 0, 0}; in test_constexpr() local
61 const int ia[] = {0}; in main() local
86 const int ia[] = {0}; main() local
103 const int ia[] = {0, 0}; main() local
124 const int ia[] = {0, 0}; main() local
140 const int ia[] = {0, 0}; main() local
156 const int ia[] = {0, 0}; main() local
172 const int ia[] = {0, 1}; main() local
188 const int ia[] = {0, 1}; main() local
209 const int ia[] = {0, 1}; main() local
230 const int ia[] = {0, 1}; main() local
246 const int ia[] = {1, 0}; main() local
262 const int ia[] = {1, 0}; main() local
283 const int ia[] = {1, 0}; main() local
304 const int ia[] = {1, 0}; main() local
320 const int ia[] = {1, 1}; main() local
336 const int ia[] = {1, 1}; main() local
352 const int ia[] = {1, 1}; main() local
368 const int ia[] = {1, 1}; main() local
390 const int ia[] = {0, 0, 0}; main() local
406 const int ia[] = {0, 0, 0}; main() local
422 const int ia[] = {0, 0, 0}; main() local
438 const int ia[] = {0, 0, 0}; main() local
454 const int ia[] = {0, 0, 0}; main() local
470 const int ia[] = {0, 0, 0}; main() local
486 const int ia[] = {0, 0, 0}; main() local
502 const int ia[] = {0, 0, 0}; main() local
518 const int ia[] = {0, 0, 0}; main() local
534 const int ia[] = {0, 0, 1}; main() local
555 const int ia[] = {0, 0, 1}; main() local
571 const int ia[] = {0, 1, 2}; main() local
592 const int ia[] = {0, 1, 2}; main() local
613 const int ia[] = {0, 1, 2}; main() local
634 const int ia[] = {0, 1, 2}; main() local
655 const int ia[] = {0, 0, 1}; main() local
671 const int ia[] = {0, 0, 1}; main() local
697 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; main() local
737 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; main() local
[all...] |
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| H A D | partition_point.pass.cpp | 29 int ia[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
41 const int ia[] = {2, 4, 6, 8, 10}; in main() local
47 const int ia[] = {1, 2, 4, 6, 8}; in main() local
53 const int ia[] = {1, 3, 2, 4, 6}; in main() local
59 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
65 const int ia[] = {1, 3, 5, 7, 2, 4}; in main() local
71 const int ia[] = {1, 3, 5, 7, 9, 2}; in main() local
77 const int ia[] = {1, 3, 5, 7, 9, 11}; in main() local
83 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
|
| H A D | is_partitioned.pass.cpp | 30 int ia[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
40 const int ia[] = {1, 2, 3, 4, 5, 6}; in main() local
49 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
58 const int ia[] = {2, 4, 6, 1, 3, 5}; in main() local
67 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
76 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
85 const int ia[] = {1, 3, 5, 7, 9, 11, 2}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.none_of/ |
| H A D | none_of.pass.cpp | 31 int ia[] = {1, 3, 6, 7}; in test_constexpr() local
42 int ia[] = {2, 4, 6, 8}; in main() local
50 const int ia[] = {2, 4, 5, 8}; in main() local
58 const int ia[] = {1, 3, 5, 7}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.any_of/ |
| H A D | any_of.pass.cpp | 31 int ia[] = {2, 4, 6, 8}; in test_constexpr() local
42 int ia[] = {2, 4, 6, 8}; in main() local
50 const int ia[] = {2, 4, 5, 8}; in main() local
58 const int ia[] = {1, 3, 5, 7}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.all_of/ |
| H A D | all_of.pass.cpp | 31 int ia[] = {2, 4, 6, 8}; in test_constexpr() local
42 int ia[] = {2, 4, 6, 8}; in main() local
50 const int ia[] = {2, 4, 5, 8}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| H A D | remove.pass.cpp | 26 int ia[] = {1, 3, 5, 2, 5, 6}; in test_constexpr() local
40 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
58 std::unique_ptr<int> ia[sa]; in test1() local
|
| H A D | remove_if.pass.cpp | 30 int ia[] = {1, 3, 5, 2, 5, 6}; in test_constexpr() local
44 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
70 std::unique_ptr<int> ia[sa]; in test1() local
|
| H A D | remove_copy.pass.cpp | 24 int ia[] = {1, 3, 5, 2, 5, 6}; in test_constexpr() local
40 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| H A D | adjacent_find.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in test_constexpr() local
35 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| H A D | adjacent_find_pred.pass.cpp | 28 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in test_constexpr() local
39 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| H A D | replace.pass.cpp | 27 int ia[] = {0, 1, 2, 3, 4}; in test_constexpr() local
40 int ia[] = {0, 1, 2, 3, 4}; in test() local
|
| H A D | replace_if.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; in test_constexpr() local
43 int ia[] = {0, 1, 2, 3, 4}; in test() local
|
| H A D | replace_copy.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4}; in test_constexpr() local
45 int ia[] = {0, 1, 2, 3, 4}; in test() local
|
| H A D | replace_copy_if.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4}; in test_constexpr() local
48 int ia[] = {0, 1, 2, 3, 4}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 25 int ia[] = {1, 2, 3}; test_constexpr() local
38 int ia[] = {1, 2, 3, 4}; test() local
[all...] |
| H A D | lexicographical_compare_comp.pass.cpp | 27 int ia[] = {1, 2, 3}; in test_constexpr() local
41 int ia[] = {1, 2, 3, 4}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| H A D | search_n.pass.cpp | 25 int ia[] = {0, 0, 1, 1, 2, 2}; in test_constexpr() local
37 int ia[] = {0, 1, 2, 3, 4, 5}; in test() local
|
| /llvm-project/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| H A D | compare.pass.cpp | 28 const char ia[] = "1234"; in main() local
42 const wchar_t ia[] = L"1234"; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/ |
| H A D | generate.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4}; in test_constexpr() local
46 int ia[n] = {0}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| H A D | binary_transform.pass.cpp | 26 const int ia[] = {1, 3, 6, 7}; in test_constexpr() local
46 int ia[] = {0, 1, 2, 3, 4}; in test() local
|
| H A D | unary_transform.pass.cpp | 29 int ia[] = {1, 3, 6, 7}; in test_constexpr() local
47 int ia[] = {0, 1, 2, 3, 4}; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ |
| H A D | count_if.pass.cpp | 31 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in test_constexpr() local
41 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| H A D | find_first_of.pass.cpp | 24 int ia[] = {1, 2, 3}; in test_constexpr() local
43 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
|