| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate_copy.pass.cpp | 27 int ib[sa] = {0}; in test() local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib)); in test()
30 assert(base(r) == ib); in test()
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib)); in test()
33 assert(base(r) == ib+1); in test()
34 assert(ib[0] == 0); in test()
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib)); in test()
37 assert(base(r) == ib+1); in test()
38 assert(ib[0] == 0); in test()
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib)); in test()
[all …]
|
| D | rotate.pass.cpp | 40 int ib[] = {0, 1}; in test() local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
42 r = std::rotate(Iter(ib), Iter(ib), Iter(ib+sb)); in test()
43 assert(base(r) == ib+sb); in test()
44 assert(ib[0] == 0); in test()
45 assert(ib[1] == 1); in test()
46 r = std::rotate(Iter(ib), Iter(ib+1), Iter(ib+sb)); in test()
47 assert(base(r) == ib+1); in test()
48 assert(ib[0] == 1); in test()
49 assert(ib[1] == 0); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 30 const int ib[] = {0}; in main() local
34 forward_iterator<const int*>(ib)) == true); in main()
38 forward_iterator<const int*>(ib), in main()
39 forward_iterator<const int*>(ib + 0)) == true); in main()
43 forward_iterator<const int*>(ib)) == true); in main()
47 forward_iterator<const int*>(ib), in main()
48 forward_iterator<const int*>(ib + sa)) == true); in main()
51 forward_iterator<const int*>(ib), in main()
52 forward_iterator<const int*>(ib + sa - 1)) == false); in main()
57 const int ib[] = {1}; in main() local
[all …]
|
| D | is_permutation_pred.pass.cpp | 39 const int ib[] = {0}; in main() local
43 forward_iterator<const int*>(ib), in main()
47 forward_iterator<const int*>(ib), in main()
52 forward_iterator<const int*>(ib), in main()
53 forward_iterator<const int*>(ib + sa), in main()
57 forward_iterator<const int*>(ib), in main()
58 forward_iterator<const int*>(ib + sa - 1), in main()
64 const int ib[] = {1}; in main() local
68 forward_iterator<const int*>(ib), in main()
73 forward_iterator<const int*>(ib), in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 26 const char ib[] = "123"; in main() local
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()
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -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()
39 const wchar_t ib[] = L"123"; in main() local
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 41 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
42 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
43 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); in test()
44 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); in test()
45 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0)); in test()
46 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb)); in test()
47 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb)); in test()
48 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib)); in test()
49 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2)); in test()
50 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2)); in test()
[all …]
|
| D | search_n_pred.pass.cpp | 76 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
77 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
78 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); in test()
81 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); in test()
84 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0)); in test()
87 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb)); in test()
90 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0, count_equal()) == Iter(ib+sb)); in test()
93 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib)); in test()
96 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2)); in test()
99 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2)); in test()
[all …]
|
| D | search.pass.cpp | 40 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
43 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); in test()
45 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); in test()
47 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4)); in test()
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); in test()
|
| D | search_pred.pass.cpp | 75 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
76 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
78 …assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1)); in test()
82 …assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), count_equal()) == Iter1(ib+1)); in test()
86 …assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), count_equal()) == Iter1(ib+4)); in test()
90 …assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), count_equal()) == Iter1(ib+8)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch_pred.pass.cpp | 33 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
36 input_iterator<const int*>(ib), in main()
41 input_iterator<const int*>(ib+3)))); in main()
45 input_iterator<const int*>(ib), in main()
46 input_iterator<const int*>(ib + sa), in main()
51 input_iterator<const int*>(ib+3)))); in main()
54 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) == in main()
55 (std::pair<int*,int*>(ia+3,ib+3))); in main()
57 assert(std::mismatch(ia, ia + sa, ib, ib + sa, std::equal_to<int>()) == in main()
58 (std::pair<int*,int*>(ia+3,ib+3))); in main()
[all …]
|
| D | mismatch.pass.cpp | 30 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
33 input_iterator<const int*>(ib)) == in main()
37 input_iterator<const int*>(ib+3)))); in main()
42 input_iterator<const int*>(ib), in main()
43 input_iterator<const int*>(ib + sa)) == in main()
47 input_iterator<const int*>(ib+3)))); in main()
51 input_iterator<const int*>(ib), in main()
52 input_iterator<const int*>(ib + 2)) == in main()
56 input_iterator<const int*>(ib+2)))); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 29 int ib[] = {1, 2, 3}; in test() local
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); in test()
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); in test()
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); in test()
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3))); in test()
35 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
|
| D | lexicographical_compare_comp.pass.cpp | 31 int ib[] = {1, 2, 3}; in test() local
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); in test()
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); in test()
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); in test()
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c)); in test()
39 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | includes.pass.cpp | 29 int ib[] = {2, 4}; in test() local
30 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))); in test()
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1))); in test()
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib))); in test()
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb))); in test()
42 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa))); in test()
45 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2))); in test()
|
| D | includes_comp.pass.cpp | 30 int ib[] = {2, 4}; in test() local
31 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())); in test()
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>())); in test()
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>())); in test()
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>())); in test()
43 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>())); in test()
46 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>())); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| D | remove_copy.pass.cpp | 28 int ib[sa]; in test() local
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2); in test()
30 assert(base(r) == ib + sa-3); in test()
31 assert(ib[0] == 0); in test()
32 assert(ib[1] == 1); in test()
33 assert(ib[2] == 3); in test()
34 assert(ib[3] == 4); in test()
35 assert(ib[4] == 3); in test()
36 assert(ib[5] == 4); in test()
|
| D | remove_copy_if.pass.cpp | 30 int ib[sa]; in test() local
31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib), in test()
33 assert(base(r) == ib + sa-3); in test()
34 assert(ib[0] == 0); in test()
35 assert(ib[1] == 1); in test()
36 assert(ib[2] == 3); in test()
37 assert(ib[3] == 4); in test()
38 assert(ib[4] == 3); in test()
39 assert(ib[5] == 4); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
| D | replace_copy.pass.cpp | 31 int ib[sa] = {0}; in test() local
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5); in test()
33 assert(base(r) == ib + sa); in test()
34 assert(ib[0] == 0); in test()
35 assert(ib[1] == 1); in test()
36 assert(ib[2] == 5); in test()
37 assert(ib[3] == 3); in test()
38 assert(ib[4] == 4); in test()
|
| D | replace_copy_if.pass.cpp | 32 int ib[sa] = {0}; in test() local
33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib), in test()
35 assert(base(r) == ib + sa); in test()
36 assert(ib[0] == 0); in test()
37 assert(ib[1] == 1); in test()
38 assert(ib[2] == 5); in test()
39 assert(ib[3] == 3); in test()
40 assert(ib[4] == 4); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| D | reverse.pass.cpp | 33 int ib[] = {0, 1}; in test() local
34 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
35 std::reverse(Iter(ib), Iter(ib+sb)); in test()
36 assert(ib[0] == 1); in test()
37 assert(ib[1] == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.transform/ |
| D | unary_transform.pass.cpp | 30 int ib[sa] = {0}; in test() local
31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib), in test()
33 assert(base(r) == ib + sa); in test()
34 assert(ib[0] == 1); in test()
35 assert(ib[1] == 2); in test()
36 assert(ib[2] == 3); in test()
37 assert(ib[3] == 4); in test()
38 assert(ib[4] == 5); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| D | unique.pass.cpp | 36 int ib[] = {0, 1}; in test() local
37 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
38 r = std::unique(Iter(ib), Iter(ib+sb)); in test()
39 assert(base(r) == ib + sb); in test()
40 assert(ib[0] == 0); in test()
41 assert(ib[1] == 1); in test()
108 Ptr ib[2]; in test1() local
109 ib[1].reset(&one); in test1()
110 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test1()
111 r = std::unique(Iter(ib), Iter(ib+sb)); in test1()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.move/ |
| D | move_backward.pass.cpp | 33 int ib[N] = {0}; in test() local
35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); in test()
36 assert(base(r) == ib); in test()
38 assert(ia[i] == ib[i]); in test()
51 std::unique_ptr<int> ib[N]; in test1() local
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); in test1()
54 assert(base(r) == ib); in test1()
56 assert(*ib[i] == i); in test1()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 26 int ib[] = {1, 3, 5, 7}; in main() local
27 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in main()
30 forward_iterator<const int*>(ib), in main()
31 forward_iterator<const int*>(ib + sb)) == in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.equal/ |
| D | equal.pass.cpp | 30 int ib[s] = {0, 1, 2, 5, 4, 5}; in main() local
46 input_iterator<const int*>(ib))); in main()
50 input_iterator<const int*>(ib), in main()
51 input_iterator<const int*>(ib+s))); in main()
54 random_access_iterator<const int*>(ib), in main()
55 random_access_iterator<const int*>(ib+s))); in main()
|