| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 22 template <class Iter>
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); in test()
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); in test()
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); in test()
31 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); in test()
32 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); in test()
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); in test()
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); in test()
35 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); in test()
36 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); in test()
[all …]
|
| D | search_n_pred.pass.cpp | 32 template <class Iter>
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); in test()
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); in test()
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); in test()
48 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); in test()
51 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); in test()
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3)); in test()
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa)); in test()
60 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa)); in test()
63 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia)); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 22 template <class Iter>
29 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); in test()
30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
57 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
62 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
67 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 23 template <class Iter>
30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); in test()
31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
58 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
63 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); in test()
68 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
[all …]
|
| D | is_sorted.pass.cpp | 22 template <class Iter>
29 assert(std::is_sorted(Iter(a), Iter(a))); in test()
30 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
36 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
41 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
51 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
57 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
62 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
67 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 23 template <class Iter>
30 assert(std::is_sorted(Iter(a), Iter(a))); in test()
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
58 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
63 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
68 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate.pass.cpp | 24 template <class Iter>
30 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia)); in test()
33 r = std::rotate(Iter(ia), Iter(ia), Iter(ia+sa)); in test()
36 r = std::rotate(Iter(ia), Iter(ia+sa), Iter(ia+sa)); in test()
42 r = std::rotate(Iter(ib), Iter(ib), Iter(ib+sb)); in test()
46 r = std::rotate(Iter(ib), Iter(ib+1), Iter(ib+sb)); in test()
50 r = std::rotate(Iter(ib), Iter(ib+sb), Iter(ib+sb)); in test()
57 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
62 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
67 r = std::rotate(Iter(ic), Iter(ic+2), Iter(ic+sc)); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/accumulate/ |
| D | accumulate_op.pass.cpp | 25 template <class Iter, class T>
27 test(Iter first, Iter last, T init, T x) in test()
32 template <class Iter>
38 test(Iter(ia), Iter(ia), 1, 1); in test()
39 test(Iter(ia), Iter(ia), 10, 10); in test()
40 test(Iter(ia), Iter(ia+1), 1, 1); in test()
41 test(Iter(ia), Iter(ia+1), 10, 10); in test()
42 test(Iter(ia), Iter(ia+2), 1, 2); in test()
43 test(Iter(ia), Iter(ia+2), 10, 20); in test()
44 test(Iter(ia), Iter(ia+sa), 1, 720); in test()
[all …]
|
| D | accumulate.pass.cpp | 23 template <class Iter, class T>
25 test(Iter first, Iter last, T init, T x) in test()
30 template <class Iter>
36 test(Iter(ia), Iter(ia), 0, 0); in test()
37 test(Iter(ia), Iter(ia), 10, 10); in test()
38 test(Iter(ia), Iter(ia+1), 0, 1); in test()
39 test(Iter(ia), Iter(ia+1), 10, 11); in test()
40 test(Iter(ia), Iter(ia+2), 0, 3); in test()
41 test(Iter(ia), Iter(ia+2), 10, 13); in test()
42 test(Iter(ia), Iter(ia+sa), 0, 21); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| D | inplace_merge.pass.cpp | 23 template <class Iter>
34 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N)); in test_one()
44 template <class Iter>
48 test_one<Iter>(N, 0); in test()
49 test_one<Iter>(N, N/4); in test()
50 test_one<Iter>(N, N/2); in test()
51 test_one<Iter>(N, 3*N/4); in test()
52 test_one<Iter>(N, N); in test()
55 template <class Iter>
59 test_one<Iter>(0, 0); in test()
[all …]
|
| D | inplace_merge_comp.pass.cpp | 35 template <class Iter>
46 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::greater<int>()); in test_one()
56 template <class Iter>
60 test_one<Iter>(N, 0); in test()
61 test_one<Iter>(N, N/4); in test()
62 test_one<Iter>(N, N/2); in test()
63 test_one<Iter>(N, 3*N/4); in test()
64 test_one<Iter>(N, N); in test()
67 template <class Iter>
71 test_one<Iter>(0, 0); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| D | partial_sort_copy.pass.cpp | 25 template <class Iter>
34 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M); in test_larger_sorts()
44 template <class Iter>
48 test_larger_sorts<Iter>(N, 0); in test_larger_sorts()
49 test_larger_sorts<Iter>(N, 1); in test_larger_sorts()
50 test_larger_sorts<Iter>(N, 2); in test_larger_sorts()
51 test_larger_sorts<Iter>(N, 3); in test_larger_sorts()
52 test_larger_sorts<Iter>(N, N/2-1); in test_larger_sorts()
53 test_larger_sorts<Iter>(N, N/2); in test_larger_sorts()
54 test_larger_sorts<Iter>(N, N/2+1); in test_larger_sorts()
[all …]
|
| D | partial_sort_copy_comp.pass.cpp | 28 template <class Iter>
37 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M, in test_larger_sorts()
48 template <class Iter>
52 test_larger_sorts<Iter>(N, 0); in test_larger_sorts()
53 test_larger_sorts<Iter>(N, 1); in test_larger_sorts()
54 test_larger_sorts<Iter>(N, 2); in test_larger_sorts()
55 test_larger_sorts<Iter>(N, 3); in test_larger_sorts()
56 test_larger_sorts<Iter>(N, N/2-1); in test_larger_sorts()
57 test_larger_sorts<Iter>(N, N/2); in test_larger_sorts()
58 test_larger_sorts<Iter>(N, N/2+1); in test_larger_sorts()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| D | minmax_element.pass.cpp | 22 template <class Iter>
24 test(Iter first, Iter last) in test()
26 std::pair<Iter, Iter> p = std::minmax_element(first, last); in test()
29 for (Iter j = first; j != last; ++j) in test()
42 template <class Iter>
50 test(Iter(a), Iter(a+N)); in test()
54 template <class Iter>
58 test<Iter>(0); in test()
59 test<Iter>(1); in test()
60 test<Iter>(2); in test()
[all …]
|
| D | max_element.pass.cpp | 22 template <class Iter>
24 test(Iter first, Iter last) in test()
26 Iter i = std::max_element(first, last); in test()
29 for (Iter j = first; j != last; ++j) in test()
36 template <class Iter>
44 test(Iter(a), Iter(a+N)); in test()
48 template <class Iter>
52 test<Iter>(0); in test()
53 test<Iter>(1); in test()
54 test<Iter>(2); in test()
[all …]
|
| D | min_element.pass.cpp | 22 template <class Iter>
24 test(Iter first, Iter last) in test()
26 Iter i = std::min_element(first, last); in test()
29 for (Iter j = first; j != last; ++j) in test()
36 template <class Iter>
44 test(Iter(a), Iter(a+N)); in test()
48 template <class Iter>
52 test<Iter>(0); in test()
53 test<Iter>(1); in test()
54 test<Iter>(2); in test()
[all …]
|
| D | min_element_comp.pass.cpp | 23 template <class Iter>
25 test(Iter first, Iter last) in test()
27 Iter i = std::min_element(first, last, std::greater<int>()); in test()
30 for (Iter j = first; j != last; ++j) in test()
37 template <class Iter>
45 test(Iter(a), Iter(a+N)); in test()
49 template <class Iter>
53 test<Iter>(0); in test()
54 test<Iter>(1); in test()
55 test<Iter>(2); in test()
[all …]
|
| D | max_element_comp.pass.cpp | 23 template <class Iter>
25 test(Iter first, Iter last) in test()
27 Iter i = std::max_element(first, last, std::greater<int>()); in test()
30 for (Iter j = first; j != last; ++j) in test()
37 template <class Iter>
45 test(Iter(a), Iter(a+N)); in test()
49 template <class Iter>
53 test<Iter>(0); in test()
54 test<Iter>(1); in test()
55 test<Iter>(2); in test()
[all …]
|
| D | minmax_element_comp.pass.cpp | 23 template <class Iter>
25 test(Iter first, Iter last) in test()
29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); in test()
32 for (Iter j = first; j != last; ++j) in test()
45 template <class Iter>
53 test(Iter(a), Iter(a+N)); in test()
57 template <class Iter>
61 test<Iter>(0); in test()
62 test<Iter>(1); in test()
63 test<Iter>(2); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| D | unique.pass.cpp | 26 template <class Iter>
32 Iter r = std::unique(Iter(ia), Iter(ia+sa)); in test()
38 r = std::unique(Iter(ib), Iter(ib+sb)); in test()
45 r = std::unique(Iter(ic), Iter(ic+sc)); in test()
51 r = std::unique(Iter(id), Iter(id+sd)); in test()
58 r = std::unique(Iter(ie), Iter(ie+se)); in test()
66 r = std::unique(Iter(ig), Iter(ig+sg)); in test()
73 r = std::unique(Iter(ih), Iter(ih+sh)); in test()
80 r = std::unique(Iter(ii), Iter(ii+si)); in test()
96 template <class Iter>
[all …]
|
| D | unique_pred.pass.cpp | 36 template <class Iter>
43 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal()); in test()
51 r = std::unique(Iter(ib), Iter(ib+sb), count_equal()); in test()
60 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test()
68 r = std::unique(Iter(id), Iter(id+sd), count_equal()); in test()
77 r = std::unique(Iter(ie), Iter(ie+se), count_equal()); in test()
87 r = std::unique(Iter(ig), Iter(ig+sg), count_equal()); in test()
96 r = std::unique(Iter(ih), Iter(ih+sh), count_equal()); in test()
105 r = std::unique(Iter(ii), Iter(ii+si), count_equal()); in test()
122 template <class Iter>
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| D | reverse.pass.cpp | 22 template <class Iter>
28 std::reverse(Iter(ia), Iter(ia)); in test()
30 std::reverse(Iter(ia), Iter(ia+sa)); in test()
35 std::reverse(Iter(ib), Iter(ib+sb)); in test()
41 std::reverse(Iter(ic), Iter(ic+sc)); in test()
48 std::reverse(Iter(id), Iter(id+sd)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| D | stable_partition.pass.cpp | 37 template <class Iter>
57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
86 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
99 r = std::stable_partition(Iter(array), Iter(array), odd_first()); in test()
102 r = std::stable_partition(Iter(array), Iter(array+1), odd_first()); in test()
106 r = std::stable_partition(Iter(array+4), Iter(array+5), odd_first()); in test()
126 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
155 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
184 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
213 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| D | equal_range.pass.cpp | 24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value) in test()
28 std::pair<Iter, Iter> i = std::equal_range(first, last, value); in test()
29 for (Iter j = first; j != i.first; ++j) in test()
31 for (Iter j = i.first; j != last; ++j) in test()
33 for (Iter j = first; j != i.second; ++j) in test()
35 for (Iter j = i.second; j != last; ++j) in test()
39 template <class Iter>
55 test(Iter(v.data()), Iter(v.data()+v.size()), x); in test()
|
| D | equal_range_comp.pass.cpp | 25 template <class Iter, class T>
27 test(Iter first, Iter last, const T& value) in test()
29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>()); in test()
30 for (Iter j = first; j != i.first; ++j) in test()
32 for (Iter j = i.first; j != last; ++j) in test()
34 for (Iter j = first; j != i.second; ++j) in test()
36 for (Iter j = i.second; j != last; ++j) in test()
40 template <class Iter>
56 test(Iter(v.data()), Iter(v.data()+v.size()), x); in test()
|