| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.random.sample/ |
| sample.fail.cpp | 27 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
28 const unsigned is = sizeof(ia) / sizeof(ia[0]);
32 std::sample(PopulationIterator(ia), PopulationIterator(ia + is),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle_rand.pass.cpp | 35 int ia[] = {1, 2, 3, 4}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 std::random_shuffle(ia, ia+sa, r);
40 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
41 assert(std::is_permutation(ia, ia+sa, ia1));
|
| 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.remove/ |
| 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...] |
| remove_copy.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
|
| remove_copy_if.pass.cpp | 30 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local
31 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
33 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| replace_copy.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
|
| replace_copy_if.pass.cpp | 32 int ia[] = {0, 1, 2, 3, 4}; local
33 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
35 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate_copy.pass.cpp | 25 int ia[] = {0, 1, 2, 3}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| binary_transform.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
|
| unary_transform.pass.cpp | 30 int ia[] = {0, 1, 2, 3, 4}; local
31 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
33 OutIter r = std::transform(InIter(ia), InIter(ia+sa),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.count/ |
| count_if.pass.cpp | 32 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
33 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(std::count_if(input_iterator<const int*>(ia),
35 input_iterator<const int*>(ia + sa),
37 assert(std::count_if(input_iterator<const int*>(ia),
38 input_iterator<const int*>(ia + sa),
40 assert(std::count_if(input_iterator<const int*>(ia),
41 input_iterator<const int*>(ia),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal_pred.pass.cpp | 34 int ia[] = {0, 1, 2, 3, 4, 5}; local
35 const unsigned s = sizeof(ia)/sizeof(ia[0]);
37 assert(std::equal(input_iterator<const int*>(ia),
38 input_iterator<const int*>(ia+s),
39 input_iterator<const int*>(ia),
42 assert(std::equal(input_iterator<const int*>(ia),
43 input_iterator<const int*>(ia+s),
44 input_iterator<const int*>(ia),
45 input_iterator<const int*>(ia+s)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find/ |
| find_if.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4, 5}; local
32 const unsigned s = sizeof(ia)/sizeof(ia[0]);
33 input_iterator<const int*> r = std::find_if(input_iterator<const int*>(ia),
34 input_iterator<const int*>(ia+s),
37 r = std::find_if(input_iterator<const int*>(ia),
38 input_iterator<const int*>(ia+s),
40 assert(r == input_iterator<const int*>(ia+s));
|
| find_if_not.pass.cpp | 32 int ia[] = {0, 1, 2, 3, 4, 5}; local
33 const unsigned s = sizeof(ia)/sizeof(ia[0]);
34 input_iterator<const int*> r = std::find_if_not(input_iterator<const int*>(ia),
35 input_iterator<const int*>(ia+s),
38 r = std::find_if_not(input_iterator<const int*>(ia),
39 input_iterator<const int*>(ia+s),
41 assert(r == input_iterator<const int*>(ia+s));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(std::find_first_of(input_iterator<const int*>(ia),
29 input_iterator<const int*>(ia + sa),
32 input_iterator<const int*>(ia+1));
34 assert(std::find_first_of(input_iterator<const int*>(ia),
35 input_iterator<const int*>(ia + sa),
38 input_iterator<const int*>(ia+sa));
39 assert(std::find_first_of(input_iterator<const int*>(ia),
[all...] |
| find_first_of_pred.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 assert(std::find_first_of(input_iterator<const int*>(ia),
31 input_iterator<const int*>(ia + sa),
35 input_iterator<const int*>(ia+1));
37 assert(std::find_first_of(input_iterator<const int*>(ia),
38 input_iterator<const int*>(ia + sa),
42 input_iterator<const int*>(ia+sa));
43 assert(std::find_first_of(input_iterator<const int*>(ia),
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.foreach/ |
| test.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4, 5}; local
32 const unsigned s = sizeof(ia)/sizeof(ia[0]);
33 for_each_test f = std::for_each(input_iterator<int*>(ia),
34 input_iterator<int*>(ia+s),
38 assert(ia[i] == static_cast<int>(i+1));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| is_permutation_pred.pass.cpp | 35 const int ia[] = {0}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
38 assert(std::is_permutation(forward_iterator<const int*>(ia),
39 forward_iterator<const int*>(ia + 0),
42 assert(std::is_permutation(forward_iterator<const int*>(ia),
43 forward_iterator<const int*>(ia + sa),
47 assert(std::is_permutation(forward_iterator<const int*>(ia),
48 forward_iterator<const int*>(ia + sa),
52 assert(std::is_permutation(forward_iterator<const int*>(ia),
60 const int ia[] = {0}; local
77 const int ia[] = {0, 0}; local
98 const int ia[] = {0, 0}; local
114 const int ia[] = {0, 0}; local
130 const int ia[] = {0, 0}; local
146 const int ia[] = {0, 1}; local
162 const int ia[] = {0, 1}; local
183 const int ia[] = {0, 1}; local
204 const int ia[] = {0, 1}; local
220 const int ia[] = {1, 0}; local
236 const int ia[] = {1, 0}; local
257 const int ia[] = {1, 0}; local
278 const int ia[] = {1, 0}; local
294 const int ia[] = {1, 1}; local
310 const int ia[] = {1, 1}; local
326 const int ia[] = {1, 1}; local
342 const int ia[] = {1, 1}; local
364 const int ia[] = {0, 0, 0}; local
380 const int ia[] = {0, 0, 0}; local
396 const int ia[] = {0, 0, 0}; local
412 const int ia[] = {0, 0, 0}; local
428 const int ia[] = {0, 0, 0}; local
444 const int ia[] = {0, 0, 0}; local
460 const int ia[] = {0, 0, 0}; local
476 const int ia[] = {0, 0, 0}; local
492 const int ia[] = {0, 0, 0}; local
508 const int ia[] = {0, 0, 1}; local
529 const int ia[] = {0, 0, 1}; local
545 const int ia[] = {0, 1, 2}; local
566 const int ia[] = {0, 1, 2}; local
587 const int ia[] = {0, 1, 2}; local
608 const int ia[] = {0, 1, 2}; local
629 const int ia[] = {0, 0, 1}; local
645 const int ia[] = {0, 0, 1}; local
671 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local
711 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.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 26 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(std::mismatch(II(ia), II(ia + sa), II(ib))
35 == (std::pair<II, II>(II(ia+3), II(ib+3))));
37 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib))
38 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap_comp.pass.cpp | 37 int* ia = new int [N]; local
40 ia[i] = i;
41 std::shuffle(ia, ia+N, randomness);
42 std::make_heap(ia, ia+N, std::greater<int>());
43 assert(std::is_heap(ia, ia+N, std::greater<int>()));
50 ia[i] = i;
51 std::make_heap(ia, ia+N, std::ref(pred))
92 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap_comp.pass.cpp | 37 int* ia = new int [N]; local
39 ia[i] = i;
40 std::shuffle(ia, ia+N, randomness);
41 std::make_heap(ia, ia+N, std::greater<int>());
44 std::pop_heap(ia, ia+i, std::greater<int>());
45 assert(std::is_heap(ia, ia+i-1, std::greater<int>()))
58 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap_comp.pass.cpp | 37 int* ia = new int [N]; local
39 ia[i] = i;
40 std::shuffle(ia, ia+N, randomness);
43 std::push_heap(ia, ia+i, std::greater<int>());
44 assert(std::is_heap(ia, ia+i, std::greater<int>()));
46 delete [] ia;
56 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N] local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| sort_heap_comp.pass.cpp | 36 int* ia = new int [N]; local
38 ia[i] = i;
39 std::shuffle(ia, ia+N, randomness);
40 std::make_heap(ia, ia+N, std::greater<int>());
41 std::sort_heap(ia, ia+N, std::greater<int>());
42 assert(std::is_sorted(ia, ia+N, std::greater<int>()))
58 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare_comp.pass.cpp | 29 int ia[] = {1, 2, 3, 4}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c));
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c));
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c))
[all...] |
