| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.partitions/ |
| D | partition_point.pass.cpp | 29 const int ia[] = {2, 4, 6, 8, 10}; in main() local
35 const int ia[] = {1, 2, 4, 6, 8}; in main() local
41 const int ia[] = {1, 3, 2, 4, 6}; in main() local
47 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
53 const int ia[] = {1, 3, 5, 7, 2, 4}; in main() local
59 const int ia[] = {1, 3, 5, 7, 9, 2}; in main() local
65 const int ia[] = {1, 3, 5, 7, 9, 11}; in main() local
71 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
|
| D | is_partitioned.pass.cpp | 29 const int ia[] = {1, 2, 3, 4, 5, 6}; in main() local
35 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
41 const int ia[] = {2, 4, 6, 1, 3, 5}; in main() local
47 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
53 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation_pred.pass.cpp | 26 const int ia[] = {0}; in main() local
39 const int ia[] = {0}; in main() local
49 const int ia[] = {0, 0}; in main() local
58 const int ia[] = {0, 0}; in main() local
67 const int ia[] = {0, 0}; in main() local
76 const int ia[] = {0, 0}; in main() local
85 const int ia[] = {0, 1}; in main() local
94 const int ia[] = {0, 1}; in main() local
103 const int ia[] = {0, 1}; in main() local
112 const int ia[] = {0, 1}; in main() local
[all …]
|
| D | is_permutation.pass.cpp | 25 const int ia[] = {0}; in main() local
36 const int ia[] = {0}; in main() local
45 const int ia[] = {0, 0}; in main() local
53 const int ia[] = {0, 0}; in main() local
61 const int ia[] = {0, 0}; in main() local
69 const int ia[] = {0, 0}; in main() local
77 const int ia[] = {0, 1}; in main() local
85 const int ia[] = {0, 1}; in main() local
93 const int ia[] = {0, 1}; in main() local
101 const int ia[] = {0, 1}; in main() local
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.any_of/ |
| D | any_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; in main() local
40 const int ia[] = {2, 4, 5, 8}; in main() local
48 const int ia[] = {1, 3, 5, 7}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.none_of/ |
| D | none_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; in main() local
40 const int ia[] = {2, 4, 5, 8}; in main() local
48 const int ia[] = {1, 3, 5, 7}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.all_of/ |
| D | all_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; in main() local
40 const int ia[] = {2, 4, 5, 8}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.remove/ |
| D | remove.pass.cpp | 30 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
49 std::unique_ptr<int> ia[sa]; in test1() local
|
| D | remove_if.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
55 std::unique_ptr<int> ia[sa]; in test1() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 24 const char ia[] = "1234"; in main() local
37 const wchar_t ia[] = L"1234"; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.indirect.array/ |
| D | default.fail.cpp | 21 std::indirect_array<int> ia; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| D | sort_heap_comp.pass.cpp | 34 int* ia = new int [N]; in test() local
56 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| D | make_heap_comp.pass.cpp | 34 int* ia = new int [N]; in test() local
55 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| D | adjacent_find_pred.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| D | adjacent_find.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.count/ |
| D | count.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| D | count_if.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/stream.iterators/iterator.range/ |
| D | begin_array.pass.cpp | 19 int ia[] = {1, 2, 3}; in main() local
|
| D | begin_non_const.pass.cpp | 19 int ia[] = {1, 2, 3}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap_comp.pass.cpp | 34 int* ia = new int [N]; in test() local
55 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| D | push_heap_comp.pass.cpp | 35 int* ia = new int [N]; in test() local
54 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find/ |
| D | find_if_not.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4, 5}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.equal/ |
| D | equal.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 4, 5}; in main() local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.replace/ |
| D | replace_if.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; in test() local
|