| /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...] |
| /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);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle.pass.cpp | 25 int ia[] = {1, 2, 3, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 std::random_shuffle(ia, ia+sa);
30 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
31 assert(std::is_permutation(ia, ia+sa, ia1));
32 std::random_shuffle(ia, ia+sa)
[all...] |
| random_shuffle_urng.pass.cpp | 24 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 std::shuffle(ia, ia+sa, g);
30 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
31 assert(std::is_permutation(ia, ia+sa, ia1));
32 std::shuffle(ia, ia+sa, std::move(g))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle.pass.cpp | 25 int ia[] = {1, 2, 3, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 std::random_shuffle(ia, ia+sa);
30 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
31 assert(std::is_permutation(ia, ia+sa, ia1));
32 std::random_shuffle(ia, ia+sa)
[all...] |
| random_shuffle_urng.pass.cpp | 24 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 std::shuffle(ia, ia+sa, g);
30 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
31 assert(std::is_permutation(ia, ia+sa, ia1));
32 std::shuffle(ia, ia+sa, std::move(g))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.any_of/ |
| any_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local
33 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(std::any_of(input_iterator<const int*>(ia),
35 input_iterator<const int*>(ia + sa), test1()) == true);
36 assert(std::any_of(input_iterator<const int*>(ia),
37 input_iterator<const int*>(ia), test1()) == false);
40 const int ia[] = {2, 4, 5, 8}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0])
48 const int ia[] = {1, 3, 5, 7}; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.none_of/ |
| none_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local
33 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(std::none_of(input_iterator<const int*>(ia),
35 input_iterator<const int*>(ia + sa), test1()) == false);
36 assert(std::none_of(input_iterator<const int*>(ia),
37 input_iterator<const int*>(ia), test1()) == true);
40 const int ia[] = {2, 4, 5, 8}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0])
48 const int ia[] = {1, 3, 5, 7}; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| 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.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));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.all_of/ |
| all_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local
33 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(std::all_of(input_iterator<const int*>(ia),
35 input_iterator<const int*>(ia + sa), test1()) == true);
36 assert(std::all_of(input_iterator<const int*>(ia),
37 input_iterator<const int*>(ia), test1()) == true);
40 const int ia[] = {2, 4, 5, 8}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/libcxx/test/std/iterators/stream.iterators/iterator.range/ |
| begin_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/iterators/stream.iterators/iterator.range/ |
| begin_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove_if.pass.cpp | 33 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local
34 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
35 // int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2));
37 int* r = std::remove_if(ia, ia+sa, std::ref(cp));
38 assert(r == ia + sa-3);
39 assert(ia[0] == 0);
40 assert(ia[1] == 1)
59 std::unique_ptr<int> ia[sa]; local
[all...] |
| remove.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
31 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2);
32 assert(base(r) == ia + sa-3);
33 assert(ia[0] == 0);
34 assert(ia[1] == 1);
35 assert(ia[2] == 3);
36 assert(ia[3] == 4)
47 std::unique_ptr<int> ia[sa]; 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...] |
| replace_if.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4}; local
32 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
33 std::replace_if(Iter(ia), Iter(ia+sa), equalToTwo, 5);
34 assert(ia[0] == 0);
35 assert(ia[1] == 1);
36 assert(ia[2] == 5);
37 assert(ia[3] == 3);
38 assert(ia[4] == 4)
[all...] |
| /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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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...] |
| /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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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.modifying.operations/alg.remove/ |
| remove_if.pass.cpp | 31 int ia[] = {1, 3, 5, 2, 5, 6}; local
33 auto it = std::remove_if(std::begin(ia), std::end(ia), equal2);
35 return (std::begin(ia) + std::size(ia) - 1) == it // we removed one element
36 && std::none_of(std::begin(ia), it, equal2)
45 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local
46 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
47 // int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2))
71 std::unique_ptr<int> ia[sa]; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| is_permutation.pass.cpp | 27 const int ia[] = {0}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 assert(std::is_permutation(forward_iterator<const int*>(ia),
31 forward_iterator<const int*>(ia + 0),
34 assert(std::is_permutation(forward_iterator<const int*>(ia),
35 forward_iterator<const int*>(ia + 0),
39 assert(std::is_permutation(forward_iterator<const int*>(ia),
40 forward_iterator<const int*>(ia + sa),
43 assert(std::is_permutation(forward_iterator<const int*>(ia),
54 const int ia[] = {0}; local
69 const int ia[] = {0, 0}; local
87 const int ia[] = {0, 0}; local
101 const int ia[] = {0, 0}; local
115 const int ia[] = {0, 0}; local
129 const int ia[] = {0, 1}; local
143 const int ia[] = {0, 1}; local
161 const int ia[] = {0, 1}; local
175 const int ia[] = {0, 1}; local
189 const int ia[] = {1, 0}; local
203 const int ia[] = {1, 0}; local
217 const int ia[] = {1, 0}; local
231 const int ia[] = {1, 0}; local
245 const int ia[] = {1, 1}; local
259 const int ia[] = {1, 1}; local
273 const int ia[] = {1, 1}; local
287 const int ia[] = {1, 1}; local
302 const int ia[] = {0, 0, 0}; local
316 const int ia[] = {0, 0, 0}; local
330 const int ia[] = {0, 0, 0}; local
344 const int ia[] = {0, 0, 0}; local
358 const int ia[] = {0, 0, 0}; local
372 const int ia[] = {0, 0, 0}; local
386 const int ia[] = {0, 0, 0}; local
400 const int ia[] = {0, 0, 0}; local
414 const int ia[] = {0, 0, 0}; local
428 const int ia[] = {0, 0, 1}; local
446 const int ia[] = {0, 0, 1}; local
460 const int ia[] = {0, 1, 2}; local
478 const int ia[] = {0, 1, 2}; local
496 const int ia[] = {0, 1, 2}; local
514 const int ia[] = {0, 1, 2}; local
532 const int ia[] = {0, 0, 1}; local
546 const int ia[] = {0, 0, 1}; local
568 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
590 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.generate/ |
| generate.pass.cpp | 33 int ia[n] = {0}; local
34 std::generate(Iter(ia), Iter(ia+n), gen_test());
35 assert(ia[0] == 1);
36 assert(ia[1] == 1);
37 assert(ia[2] == 1);
38 assert(ia[3] == 1);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal.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),
35 input_iterator<const int*>(ia),
36 input_iterator<const int*>(ia+s)))
[all...] |
