| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.indirect.array/ |
| default.fail.cpp | 21 std::indirect_array<int> ia; local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.partitions/ |
| is_partitioned.pass.cpp | 29 const int ia[] = {1, 2, 3, 4, 5, 6}; local
30 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
31 input_iterator<const int*>(std::end(ia)),
35 const int ia[] = {1, 3, 5, 2, 4, 6}; local
36 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
37 input_iterator<const int*>(std::end(ia)),
41 const int ia[] = {2, 4, 6, 1, 3, 5}; local
42 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
43 input_iterator<const int*>(std::end(ia)),
47 const int ia[] = {1, 3, 5, 2, 4, 6, 7} local
53 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
[all...] |
| partition_point.pass.cpp | 29 const int ia[] = {2, 4, 6, 8, 10}; local
30 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
31 forward_iterator<const int*>(std::end(ia)),
32 is_odd()) == forward_iterator<const int*>(ia));
35 const int ia[] = {1, 2, 4, 6, 8}; local
36 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
37 forward_iterator<const int*>(std::end(ia)),
38 is_odd()) == forward_iterator<const int*>(ia + 1));
41 const int ia[] = {1, 3, 2, 4, 6}; local
42 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
47 const int ia[] = {1, 3, 5, 2, 4, 6}; local
53 const int ia[] = {1, 3, 5, 7, 2, 4}; local
59 const int ia[] = {1, 3, 5, 7, 9, 2}; local
65 const int ia[] = {1, 3, 5, 7, 9, 11}; local
71 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 std::replace(Iter(ia), Iter(ia+sa), 2, 5);
31 assert(ia[0] == 0);
32 assert(ia[1] == 1);
33 assert(ia[2] == 5);
34 assert(ia[3] == 3);
35 assert(ia[4] == 4)
[all...] |
| replace_if.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
32 assert(ia[0] == 0);
33 assert(ia[1] == 1);
34 assert(ia[2] == 5);
35 assert(ia[3] == 3);
36 assert(ia[4] == 4)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| adjacent_find.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
26 assert(std::adjacent_find(forward_iterator<const int*>(ia),
27 forward_iterator<const int*>(ia + sa)) ==
28 forward_iterator<const int*>(ia+2));
29 assert(std::adjacent_find(forward_iterator<const int*>(ia),
30 forward_iterator<const int*>(ia)) ==
31 forward_iterator<const int*>(ia));
32 assert(std::adjacent_find(forward_iterator<const int*>(ia+3)
[all...] |
| adjacent_find_pred.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
27 assert(std::adjacent_find(forward_iterator<const int*>(ia),
28 forward_iterator<const int*>(ia + sa),
30 forward_iterator<const int*>(ia+2));
31 assert(std::adjacent_find(forward_iterator<const int*>(ia),
32 forward_iterator<const int*>(ia),
34 forward_iterator<const int*>(ia));
35 assert(std::adjacent_find(forward_iterator<const int*>(ia+3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.count/ |
| count.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
26 assert(std::count(input_iterator<const int*>(ia),
27 input_iterator<const int*>(ia + sa), 2) == 3);
28 assert(std::count(input_iterator<const int*>(ia),
29 input_iterator<const int*>(ia + sa), 7) == 0);
30 assert(std::count(input_iterator<const int*>(ia),
31 input_iterator<const int*>(ia), 2) == 0);
|
| count_if.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
27 assert(std::count_if(input_iterator<const int*>(ia),
28 input_iterator<const int*>(ia + sa),
30 assert(std::count_if(input_iterator<const int*>(ia),
31 input_iterator<const int*>(ia + sa),
33 assert(std::count_if(input_iterator<const int*>(ia),
34 input_iterator<const int*>(ia),
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 4, 5}; local
25 const unsigned s = sizeof(ia)/sizeof(ia[0]);
27 assert(std::equal(input_iterator<const int*>(ia),
28 input_iterator<const int*>(ia+s),
29 input_iterator<const int*>(ia)));
30 assert(!std::equal(input_iterator<const int*>(ia),
31 input_iterator<const int*>(ia+s),
|
| equal_pred.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5}; local
27 const unsigned s = sizeof(ia)/sizeof(ia[0]);
29 assert(std::equal(input_iterator<const int*>(ia),
30 input_iterator<const int*>(ia+s),
31 input_iterator<const int*>(ia),
33 assert(!std::equal(input_iterator<const int*>(ia),
34 input_iterator<const int*>(ia+s),
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find/ |
| find.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 4, 5}; local
25 const unsigned s = sizeof(ia)/sizeof(ia[0]);
26 input_iterator<const int*> r = std::find(input_iterator<const int*>(ia),
27 input_iterator<const int*>(ia+s), 3);
29 r = std::find(input_iterator<const int*>(ia), input_iterator<const int*>(ia+s), 10);
30 assert(r == input_iterator<const int*>(ia+s));
|
| find_if.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4, 5}; local
26 const unsigned s = sizeof(ia)/sizeof(ia[0]);
27 input_iterator<const int*> r = std::find_if(input_iterator<const int*>(ia),
28 input_iterator<const int*>(ia+s),
31 r = std::find_if(input_iterator<const int*>(ia),
32 input_iterator<const int*>(ia+s),
34 assert(r == input_iterator<const int*>(ia+s));
|
| find_if_not.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4, 5}; local
26 const unsigned s = sizeof(ia)/sizeof(ia[0]);
27 input_iterator<const int*> r = std::find_if_not(input_iterator<const int*>(ia),
28 input_iterator<const int*>(ia+s),
31 r = std::find_if_not(input_iterator<const int*>(ia),
32 input_iterator<const int*>(ia+s),
34 assert(r == input_iterator<const int*>(ia+s));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| is_permutation.pass.cpp | 25 const int ia[] = {0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(std::is_permutation(forward_iterator<const int*>(ia),
29 forward_iterator<const int*>(ia + 0),
31 assert(std::is_permutation(forward_iterator<const int*>(ia),
32 forward_iterator<const int*>(ia + sa),
36 const int ia[] = {0}; local
38 const unsigned sa = sizeof(ia)/sizeof(ia[0])
45 const int ia[] = {0, 0}; local
53 const int ia[] = {0, 0}; local
61 const int ia[] = {0, 0}; local
69 const int ia[] = {0, 0}; local
77 const int ia[] = {0, 1}; local
85 const int ia[] = {0, 1}; local
93 const int ia[] = {0, 1}; local
101 const int ia[] = {0, 1}; local
109 const int ia[] = {1, 0}; local
117 const int ia[] = {1, 0}; local
125 const int ia[] = {1, 0}; local
133 const int ia[] = {1, 0}; local
141 const int ia[] = {1, 1}; local
149 const int ia[] = {1, 1}; local
157 const int ia[] = {1, 1}; local
165 const int ia[] = {1, 1}; local
174 const int ia[] = {0, 0, 0}; local
182 const int ia[] = {0, 0, 0}; local
190 const int ia[] = {0, 0, 0}; local
198 const int ia[] = {0, 0, 0}; local
206 const int ia[] = {0, 0, 0}; local
214 const int ia[] = {0, 0, 0}; local
222 const int ia[] = {0, 0, 0}; local
230 const int ia[] = {0, 0, 0}; local
238 const int ia[] = {0, 0, 0}; local
246 const int ia[] = {0, 0, 1}; local
254 const int ia[] = {0, 0, 1}; local
262 const int ia[] = {0, 1, 2}; local
270 const int ia[] = {0, 1, 2}; local
278 const int ia[] = {0, 1, 2}; local
286 const int ia[] = {0, 1, 2}; local
294 const int ia[] = {0, 0, 1}; local
302 const int ia[] = {0, 0, 1}; local
310 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
318 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
[all...] |
| is_permutation_pred.pass.cpp | 26 const int ia[] = {0}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 assert(std::is_permutation(forward_iterator<const int*>(ia),
30 forward_iterator<const int*>(ia + 0),
33 assert(std::is_permutation(forward_iterator<const int*>(ia),
34 forward_iterator<const int*>(ia + sa),
39 const int ia[] = {0}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0])
49 const int ia[] = {0, 0}; local
58 const int ia[] = {0, 0}; local
67 const int ia[] = {0, 0}; local
76 const int ia[] = {0, 0}; local
85 const int ia[] = {0, 1}; local
94 const int ia[] = {0, 1}; local
103 const int ia[] = {0, 1}; local
112 const int ia[] = {0, 1}; local
121 const int ia[] = {1, 0}; local
130 const int ia[] = {1, 0}; local
139 const int ia[] = {1, 0}; local
148 const int ia[] = {1, 0}; local
157 const int ia[] = {1, 1}; local
166 const int ia[] = {1, 1}; local
175 const int ia[] = {1, 1}; local
184 const int ia[] = {1, 1}; local
194 const int ia[] = {0, 0, 0}; local
203 const int ia[] = {0, 0, 0}; local
212 const int ia[] = {0, 0, 0}; local
221 const int ia[] = {0, 0, 0}; local
230 const int ia[] = {0, 0, 0}; local
239 const int ia[] = {0, 0, 0}; local
248 const int ia[] = {0, 0, 0}; local
257 const int ia[] = {0, 0, 0}; local
266 const int ia[] = {0, 0, 0}; local
275 const int ia[] = {0, 0, 1}; local
284 const int ia[] = {0, 0, 1}; local
293 const int ia[] = {0, 1, 2}; local
302 const int ia[] = {0, 1, 2}; local
311 const int ia[] = {0, 1, 2}; local
320 const int ia[] = {0, 1, 2}; local
329 const int ia[] = {0, 0, 1}; local
338 const int ia[] = {0, 0, 1}; local
347 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
356 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
27 assert(std::mismatch(input_iterator<const int*>(ia),
28 input_iterator<const int*>(ia + sa),
32 input_iterator<const int*>(ia+3),
|
| mismatch_pred.pass.cpp | 26 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 assert(std::mismatch(input_iterator<const int*>(ia),
30 input_iterator<const int*>(ia + sa),
35 input_iterator<const int*>(ia+3),
37 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) ==
38 (std::pair<int*,int*>(ia+3,ib+3)));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap.pass.cpp | 22 int* ia = new int [N]; local
24 ia[i] = i;
25 std::random_shuffle(ia, ia+N);
26 std::make_heap(ia, ia+N);
27 assert(std::is_heap(ia, ia+N));
28 delete [] ia;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap.pass.cpp | 22 int* ia = new int [N]; local
24 ia[i] = i;
25 std::random_shuffle(ia, ia+N);
26 std::make_heap(ia, ia+N);
29 std::pop_heap(ia, ia+i);
30 assert(std::is_heap(ia, ia+i-1))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 23 int* ia = new int [N]; local
25 ia[i] = i;
26 std::random_shuffle(ia, ia+N);
29 std::push_heap(ia, ia+i);
30 assert(std::is_heap(ia, ia+i));
32 delete [] ia;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| sort_heap.pass.cpp | 22 int* ia = new int [N]; local
24 ia[i] = i;
25 std::random_shuffle(ia, ia+N);
26 std::make_heap(ia, ia+N);
27 std::sort_heap(ia, ia+N);
28 assert(std::is_sorted(ia, ia+N))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.merge/ |
| inplace_merge.pass.cpp | 28 int* ia = new int[N]; local
30 ia[i] = i;
31 std::random_shuffle(ia, ia+N);
32 std::sort(ia, ia+M);
33 std::sort(ia+M, ia+N);
34 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/stream.iterators/iterator.range/ |
| begin_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
23 assert(ia[0] == 2);
|
| begin_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
