Home
last modified time | relevance | path

Searched refs:Iter (Results 1 – 25 of 141) sorted by relevance

123456

/minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp23 template <class Iter>
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); in test()
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); in test()
31 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); in test()
32 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); in test()
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); in test()
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); in test()
35 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); in test()
36 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); in test()
37 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); in test()
[all …]
H A Dsearch_n_pred.pass.cpp34 template <class Iter>
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); in test()
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); in test()
47 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); in test()
50 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); in test()
53 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); in test()
56 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3)); in test()
59 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa)); in test()
62 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa)); in test()
65 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia)); in test()
[all …]
/minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp22 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 …]
H A Dsearch_n_pred.pass.cpp32 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/
H A Dis_sorted_until.pass.cpp22 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 …]
H A Dis_sorted_until_comp.pass.cpp23 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 …]
H A Dis_sorted.pass.cpp22 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 …]
H A Dis_sorted_comp.pass.cpp23 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/
H A Dis_sorted_until.pass.cpp22 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 …]
H A Dis_sorted_until_comp.pass.cpp23 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 …]
H A Dis_sorted.pass.cpp22 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 …]
H A Dis_sorted_comp.pass.cpp23 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp24 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp24 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.merge/
H A Dinplace_merge.pass.cpp23 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dpartial_sort_copy.pass.cpp25 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 …]
H A Dpartial_sort_copy_comp.pass.cpp28 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dpartial_sort_copy.pass.cpp25 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 …]
H A Dpartial_sort_copy_comp.pass.cpp28 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/numerics/numeric.ops/accumulate/
H A Daccumulate_op.pass.cpp25 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 …]
H A Daccumulate.pass.cpp23 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/std/numerics/numeric.ops/accumulate/
H A Daccumulate_op.pass.cpp25 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 …]
H A Daccumulate.pass.cpp23 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 …]
/minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dinplace_merge.pass.cpp45 template <class Iter>
49 typedef typename std::iterator_traits<Iter>::value_type value_type; in test_one()
57 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N)); in test_one()
67 template <class Iter>
71 test_one<Iter>(N, 0); in test()
72 test_one<Iter>(N, N/4); in test()
73 test_one<Iter>(N, N/2); in test()
74 test_one<Iter>(N, 3*N/4); in test()
75 test_one<Iter>(N, N); in test()
78 template <class Iter>
[all …]
/minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.min.max/
H A Dminmax_element.pass.cpp22 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 …]

123456