| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4}; local
27 std::fill(std::begin(ia), std::end(ia), 5);
29 return std::all_of(std::begin(ia), std::end(ia), [](int a) {return a == 5; })
52 int ia[n] = {0};
53 std::fill(Iter(ia), Iter(ia+n), 1);
54 assert(ia[0] == 1);
55 assert(ia[1] == 1)
[all...] |
| /external/libcxx/test/std/numerics/numarray/template.indirect.array/ |
| default.fail.cpp | 21 std::indirect_array<int> ia; local
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numarray/template.indirect.array/ |
| default.fail.cpp | 21 std::indirect_array<int> ia; local
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/ |
| generate.pass.cpp | 32 int ia[] = {0, 1, 2, 3, 4}; local
34 std::generate(std::begin(ia), std::end(ia), gen_test());
36 return std::all_of(std::begin(ia), std::end(ia), [](int x) { return x == 1; })
47 int ia[n] = {0};
48 std::generate(Iter(ia), Iter(ia+n), gen_test());
49 assert(ia[0] == 1);
50 assert(ia[1] == 1)
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove.pass.cpp | 27 int ia[] = {1, 3, 5, 2, 5, 6}; local
29 auto it = std::remove(std::begin(ia), std::end(ia), 5);
31 return (std::begin(ia) + std::size(ia) - 2) == it // we removed two elements
32 && std::none_of(std::begin(ia), it, [](int a) {return a == 5; })
41 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2};
42 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
43 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2)
[all...] |
| remove_copy.pass.cpp | 25 int ia[] = {1, 3, 5, 2, 5, 6}; local
26 int ib[std::size(ia)] = {0};
28 auto it = std::remove_copy(std::begin(ia), std::end(ia), std::begin(ib), 5);
30 return std::distance(std::begin(ib), it) == (std::size(ia) - 2) // we removed two elements
41 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2};
42 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
44 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 26 int ia[] = {1, 3, 6, 7}; local
28 return (std::upper_bound(std::begin(ia), std::end(ia), 2) == ia+1)
29 && (std::upper_bound(std::begin(ia), std::end(ia), 3) == ia+2)
30 && (std::upper_bound(std::begin(ia), std::end(ia), 9) == std::end(ia))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap.pass.cpp | 25 int* ia = new int [N]; local
27 ia[i] = i;
28 std::shuffle(ia, ia+N, randomness);
29 std::make_heap(ia, ia+N);
30 assert(std::is_heap(ia, ia+N));
31 delete [] ia;
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap.pass.cpp | 25 int* ia = new int [N]; local
27 ia[i] = i;
28 std::shuffle(ia, ia+N, randomness);
29 std::make_heap(ia, ia+N);
32 std::pop_heap(ia, ia+i);
33 assert(std::is_heap(ia, ia+i-1))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 26 int* ia = new int [N]; local
28 ia[i] = i;
29 std::shuffle(ia, ia+N, randomness);
32 std::push_heap(ia, ia+i);
33 assert(std::is_heap(ia, ia+i));
35 delete [] ia;
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| sort_heap.pass.cpp | 25 int* ia = new int [N]; local
27 ia[i] = i;
28 std::shuffle(ia, ia+N, randomness);
29 std::make_heap(ia, ia+N);
30 std::sort_heap(ia, ia+N);
31 assert(std::is_sorted(ia, ia+N))
[all...] |
| /external/libcxx/test/std/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]));
|
| begin_non_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
| end_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
21 int* e = std::end(ia);
22 assert(e == ia + 3);
|
| end_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
| end_non_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
| /external/libcxx/test/std/numerics/numeric.ops/accumulate/ |
| accumulate.pass.cpp | 34 int ia[] = {1, 2, 3, 4, 5, 6}; local
35 unsigned sa = sizeof(ia) / sizeof(ia[0]);
36 test(Iter(ia), Iter(ia), 0, 0);
37 test(Iter(ia), Iter(ia), 10, 10);
38 test(Iter(ia), Iter(ia+1), 0, 1);
39 test(Iter(ia), Iter(ia+1), 10, 11)
[all...] |
| accumulate_op.pass.cpp | 36 int ia[] = {1, 2, 3, 4, 5, 6}; local
37 unsigned sa = sizeof(ia) / sizeof(ia[0]);
38 test(Iter(ia), Iter(ia), 1, 1);
39 test(Iter(ia), Iter(ia), 10, 10);
40 test(Iter(ia), Iter(ia+1), 1, 1);
41 test(Iter(ia), Iter(ia+1), 10, 10)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| is_partitioned.pass.cpp | 30 const int ia[] = {1, 2, 3, 4, 5, 6}; local
32 assert(!std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
33 input_iterator<const int *>(std::end(ia)),
36 std::distance(std::begin(ia), std::end(ia)));
39 const int ia[] = {1, 3, 5, 2, 4, 6}; local
41 assert(std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
42 input_iterator<const int *>(std::end(ia)),
45 std::distance(std::begin(ia), std::end(ia)));
48 const int ia[] = {2, 4, 6, 1, 3, 5}; local
57 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
66 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
75 const int ia[] = {1, 3, 5, 7, 9, 11, 2}; 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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/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);
|
