Home
last modified time | relevance | path

Searched refs:ia (Results 1 – 25 of 322) sorted by relevance

12345678910>>...13

/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dis_permutation.pass.cpp31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
73 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
91 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
105 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
119 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
133 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
147 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
165 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
179 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
[all …]
H A Dis_permutation_pred.pass.cpp40 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
65 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
82 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
103 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
119 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
135 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
151 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
167 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
188 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
209 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dis_permutation.pass.cpp31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
73 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
91 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
105 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
119 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
133 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
147 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
165 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
179 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
[all …]
H A Dis_permutation_pred.pass.cpp40 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
65 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
82 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
103 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
119 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
135 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
151 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
167 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
188 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
209 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test()
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test()
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test()
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test()
56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
58 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia)); in test()
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)); in test()
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3)); in test()
61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia)); in test()
[all …]
H A Ddefault.pred.pass.cpp64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
70 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); in test()
71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/
H A Dmake_default_searcher.pass.cpp38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test()
39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test()
40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test()
41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test()
42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
44 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia)); in test()
45 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)); in test()
46 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3)); in test()
47 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia)); in test()
[all …]
H A Dmake_default_searcher.pred.pass.cpp50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
56 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); in test()
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); in test()
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); in test()
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); in test()
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); in test()
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
34 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); in test()
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
37 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); in test()
38 assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
[all …]
H A Dsearch_pred.pass.cpp39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); in test()
42 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); in test()
45 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1… in test()
48 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); in test()
51 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
54 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
57 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia)); in test()
60 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), count_equal()) == Iter1(… in test()
66 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia)); in test()
69 …assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia+… in test()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); in test()
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); in test()
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); in test()
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); in test()
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
34 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); in test()
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
37 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); in test()
38 assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
[all …]
H A Dsearch_pred.pass.cpp39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); in test()
42 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); in test()
45 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1… in test()
48 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); in test()
51 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
54 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
57 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia)); in test()
60 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), count_equal()) == Iter1(… in test()
66 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia)); in test()
69 …assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia+… in test()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_point.pass.cpp29 const int ia[] = {2, 4, 6, 8, 10}; in main() local
30 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
31 forward_iterator<const int*>(std::end(ia)), in main()
35 const int ia[] = {1, 2, 4, 6, 8}; in main() local
37 forward_iterator<const int*>(std::end(ia)), in main()
41 const int ia[] = {1, 3, 2, 4, 6}; in main() local
47 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
53 const int ia[] = {1, 3, 5, 7, 2, 4}; in main() local
59 const int ia[] = {1, 3, 5, 7, 9, 2}; in main() local
65 const int ia[] = {1, 3, 5, 7, 9, 11}; in main() local
[all …]
H A Dpartition.pass.cpp37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test()
45 r = std::partition(Iter(ia), Iter(ia), is_odd()); in test()
50 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
55 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
61 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
70 ia[0] = 10; in test()
71 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
81 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
90 ia[0] = 11; in test()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_point.pass.cpp29 const int ia[] = {2, 4, 6, 8, 10}; in main() local
30 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
31 forward_iterator<const int*>(std::end(ia)), in main()
35 const int ia[] = {1, 2, 4, 6, 8}; in main() local
37 forward_iterator<const int*>(std::end(ia)), in main()
41 const int ia[] = {1, 3, 2, 4, 6}; in main() local
47 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
53 const int ia[] = {1, 3, 5, 7, 2, 4}; in main() local
59 const int ia[] = {1, 3, 5, 7, 9, 2}; in main() local
65 const int ia[] = {1, 3, 5, 7, 9, 11}; in main() local
[all …]
H A Dpartition.pass.cpp37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test()
45 r = std::partition(Iter(ia), Iter(ia), is_odd()); in test()
50 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
55 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
61 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
70 ia[0] = 10; in test()
71 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
81 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
90 ia[0] = 11; in test()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dcompare.pass.cpp25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
33 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
34 assert(f.compare(ia, ia+3, ib, ib+3) == 0); in main()
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
43 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dcompare.pass.cpp25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
33 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
34 assert(f.compare(ia, ia+3, ib, ib+3) == 0); in main()
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main()
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
43 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
H A Dremove_if.pass.cpp35 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
38 int* r = std::remove_if(ia, ia+sa, std::ref(cp)); in test()
40 assert(ia[0] == 0); in test()
41 assert(ia[1] == 1); in test()
42 assert(ia[2] == 3); in test()
43 assert(ia[3] == 4); in test()
44 assert(ia[4] == 3); in test()
45 assert(ia[5] == 4); in test()
71 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred()); in test1()
73 assert(*ia[0] == 0); in test1()
[all …]
H A Dremove.pass.cpp31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2); in test()
34 assert(ia[0] == 0); in test()
35 assert(ia[1] == 1); in test()
36 assert(ia[2] == 3); in test()
37 assert(ia[3] == 4); in test()
38 assert(ia[4] == 3); in test()
39 assert(ia[5] == 4); in test()
56 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>()); in test1()
58 assert(*ia[0] == 0); in test1()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
H A Dremove_if.pass.cpp35 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
38 int* r = std::remove_if(ia, ia+sa, std::ref(cp)); in test()
40 assert(ia[0] == 0); in test()
41 assert(ia[1] == 1); in test()
42 assert(ia[2] == 3); in test()
43 assert(ia[3] == 4); in test()
44 assert(ia[4] == 3); in test()
45 assert(ia[5] == 4); in test()
71 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred()); in test1()
73 assert(*ia[0] == 0); in test1()
[all …]
H A Dremove.pass.cpp31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test()
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2); in test()
34 assert(ia[0] == 0); in test()
35 assert(ia[1] == 1); in test()
36 assert(ia[2] == 3); in test()
37 assert(ia[3] == 4); in test()
38 assert(ia[4] == 3); in test()
39 assert(ia[5] == 4); in test()
56 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>()); in test1()
58 assert(*ia[0] == 0); in test1()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
H A Dequal.pass.cpp28 int ia[] = {0, 1, 2, 3, 4, 5}; in main() local
29 const unsigned s = sizeof(ia)/sizeof(ia[0]); in main()
31 assert(std::equal(input_iterator<const int*>(ia), in main()
32 input_iterator<const int*>(ia+s), in main()
33 input_iterator<const int*>(ia))); in main()
35 assert(std::equal(input_iterator<const int*>(ia), in main()
36 input_iterator<const int*>(ia+s), in main()
37 input_iterator<const int*>(ia), in main()
44 assert(!std::equal(input_iterator<const int*>(ia), in main()
48 assert(!std::equal(input_iterator<const int*>(ia), in main()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.nonmodifying/alg.equal/
H A Dequal.pass.cpp28 int ia[] = {0, 1, 2, 3, 4, 5}; in main() local
29 const unsigned s = sizeof(ia)/sizeof(ia[0]); in main()
31 assert(std::equal(input_iterator<const int*>(ia), in main()
32 input_iterator<const int*>(ia+s), in main()
33 input_iterator<const int*>(ia))); in main()
35 assert(std::equal(input_iterator<const int*>(ia), in main()
36 input_iterator<const int*>(ia+s), in main()
37 input_iterator<const int*>(ia), in main()
44 assert(!std::equal(input_iterator<const int*>(ia), in main()
48 assert(!std::equal(input_iterator<const int*>(ia), in main()
[all …]
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/
H A Dmake_heap_comp.pass.cpp41 std::random_shuffle(ia, ia+N); in test()
42 std::make_heap(ia, ia+N, std::greater<int>()); in test()
51 std::make_heap(ia, ia+N, std::ref(pred)); in test()
53 assert(std::is_heap(ia, ia+N, pred)); in test()
61 std::make_heap(ia, ia+N, std::ref(pred)); in test()
63 assert(std::is_heap(ia, ia+N, pred)); in test()
69 std::random_shuffle(ia, ia+N); in test()
70 std::make_heap(ia, ia+N, std::ref(pred)); in test()
72 assert(std::is_heap(ia, ia+N, pred)); in test()
95 std::random_shuffle(ia, ia+N); in main()
[all …]

12345678910>>...13