| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap_comp.pass.cpp | 35 int* ia = new int [N]; local
37 ia[i] = i;
38 std::random_shuffle(ia, ia+N);
41 std::push_heap(ia, ia+i, std::greater<int>());
42 assert(std::is_heap(ia, ia+i, std::greater<int>()));
44 delete [] ia;
54 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N] local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| inplace_merge_comp.pass.cpp | 40 int* ia = new int[N]; local
42 ia[i] = i;
43 std::random_shuffle(ia, ia+N);
44 std::sort(ia, ia+M, std::greater<int>());
45 std::sort(ia+M, ia+N, std::greater<int>());
46 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::greater<int>())
96 std::unique_ptr<int>* ia = new std::unique_ptr<int>[N]; local
[all...] |
| 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...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 37 int ia[] = {1, 2, 3, 4, 5, 6}; local
38 const int sa = sizeof(ia)/sizeof(ia[0]);
46 std::copy(ia, ia+e, prev);
47 x = std::next_permutation(Iter(ia), Iter(ia+e));
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e))
[all...] |
| next_permutation_comp.pass.cpp | 39 int ia[] = {6, 5, 4, 3, 2, 1}; local
40 const int sa = sizeof(ia)/sizeof(ia[0]);
48 std::copy(ia, ia+e, prev);
49 x = std::next_permutation(Iter(ia), Iter(ia+e), C());
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()))
[all...] |
| prev_permutation.pass.cpp | 37 int ia[] = {6, 5, 4, 3, 2, 1}; local
38 const int sa = sizeof(ia)/sizeof(ia[0]);
46 std::copy(ia, ia+e, prev);
47 x = std::prev_permutation(Iter(ia), Iter(ia+e));
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e))
[all...] |
| prev_permutation_comp.pass.cpp | 39 int ia[] = {1, 2, 3, 4, 5, 6}; local
40 const int sa = sizeof(ia)/sizeof(ia[0]);
48 std::copy(ia, ia+e, prev);
49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C());
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 37 int ia[] = {1, 2, 3, 4, 5, 6}; local
38 const int sa = sizeof(ia)/sizeof(ia[0]);
46 std::copy(ia, ia+e, prev);
47 x = std::next_permutation(Iter(ia), Iter(ia+e));
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e))
[all...] |
| next_permutation_comp.pass.cpp | 39 int ia[] = {6, 5, 4, 3, 2, 1}; local
40 const int sa = sizeof(ia)/sizeof(ia[0]);
48 std::copy(ia, ia+e, prev);
49 x = std::next_permutation(Iter(ia), Iter(ia+e), C());
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()))
[all...] |
| prev_permutation.pass.cpp | 37 int ia[] = {6, 5, 4, 3, 2, 1}; local
38 const int sa = sizeof(ia)/sizeof(ia[0]);
46 std::copy(ia, ia+e, prev);
47 x = std::prev_permutation(Iter(ia), Iter(ia+e));
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e))
[all...] |
| prev_permutation_comp.pass.cpp | 39 int ia[] = {1, 2, 3, 4, 5, 6}; local
40 const int sa = sizeof(ia)/sizeof(ia[0]);
48 std::copy(ia, ia+e, prev);
49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C());
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()))
[all...] |
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1));
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18));
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15))
[all...] |
| find_end_pred.pass.cpp | 37 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1));
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18));
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15))
[all...] |
| find_end_pred.pass.cpp | 37 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15))
[all...] |
| /external/libcxx/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...] |
| /external/libcxx/test/numerics/numarray/template.indirect.array/ |
| default.fail.cpp | 21 std::indirect_array<int> ia; local
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/ |
| default.fail.cpp | 21 std::indirect_array<int> ia; local
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia));
42 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia));
42 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia))
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 27 int ia[] = {1, 2, 3, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2));
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa));
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3));
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa))
[all...] |
| /external/libcxx/test/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 40 int ia[n] = {0}; local
41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
42 assert(ia[0] == 1);
43 assert(ia[1] == 1);
44 assert(ia[2] == 1);
45 assert(ia[3] == 1);
52 int ia[n] = {0}; local
53 assert(std::fill_n(ia, n, static_cast<char>(1)) == std::next(ia, n))
71 int ia[n] = {0}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 40 int ia[n] = {0}; local
41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
42 assert(ia[0] == 1);
43 assert(ia[1] == 1);
44 assert(ia[2] == 1);
45 assert(ia[3] == 1);
52 int ia[n] = {0}; local
53 assert(std::fill_n(ia, n, static_cast<char>(1)) == std::next(ia, n))
71 int ia[n] = {0}; local
[all...] |
