| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate.pass.cpp | 55 int ic[] = {0, 1, 2}; in test() local
56 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
57 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
58 assert(base(r) == ic+sc); in test()
59 assert(ic[0] == 0); in test()
60 assert(ic[1] == 1); in test()
61 assert(ic[2] == 2); in test()
62 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
63 assert(base(r) == ic+2); in test()
64 assert(ic[0] == 1); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| D | reverse.pass.cpp | 39 int ic[] = {0, 1, 2}; in test() local
40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
41 std::reverse(Iter(ic), Iter(ic+sc)); in test()
42 assert(ic[0] == 2); in test()
43 assert(ic[1] == 1); in test()
44 assert(ic[2] == 0); in test()
|
| D | reverse_copy.pass.cpp | 42 const int ic[] = {0, 1, 2}; in test() local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 33 int ic[] = {7}; in main() local
36 forward_iterator<const int*>(ic), in main()
37 forward_iterator<const int*>(ic + 1)) == in main()
41 forward_iterator<const int*>(ic), in main()
42 forward_iterator<const int*>(ic)) == in main()
46 forward_iterator<const int*>(ic), in main()
47 forward_iterator<const int*>(ic+1)) == in main()
|
| D | find_first_of_pred.pass.cpp | 36 int ic[] = {7}; in main() local
39 forward_iterator<const int*>(ic), in main()
40 forward_iterator<const int*>(ic + 1), in main()
45 forward_iterator<const int*>(ic), in main()
46 forward_iterator<const int*>(ic), in main()
51 forward_iterator<const int*>(ic), in main()
52 forward_iterator<const int*>(ic+1), in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 59 int ic[] = {0, 0, 0}; in test() local
60 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
61 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); in test()
62 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); in test()
63 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); in test()
64 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); in test()
65 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); in test()
|
| D | search_n_pred.pass.cpp | 124 int ic[] = {0, 0, 0}; in test() local
125 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
126 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic)); in test()
129 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic)); in test()
132 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic)); in test()
135 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic)); in test()
138 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc)); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| D | merge.pass.cpp | 32 int* ic = new int[2*N]; in test() local
38 InIter2(ib), InIter2(ib+N), OutIter(ic)); in test()
39 assert(base(r) == ic+2*N); in test()
40 assert(ic[0] == 0); in test()
41 assert(ic[2*N-1] == 2*N-1); in test()
42 assert(std::is_sorted(ic, ic+2*N)); in test()
43 delete [] ic; in test()
51 int* ic = new int[2*N]; in test() local
53 ic[i] = i; in test()
54 std::random_shuffle(ic, ic+2*N); in test()
[all …]
|
| D | merge_comp.pass.cpp | 35 int* ic = new int[2*N]; in test() local
43 InIter2(ib), InIter2(ib+N), OutIter(ic), std::greater<int>()); in test()
44 assert(base(r) == ic+2*N); in test()
45 assert(ic[0] == 2*N-1); in test()
46 assert(ic[2*N-1] == 0); in test()
47 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
48 delete [] ic; in test()
56 int* ic = new int[2*N]; in test() local
58 ic[i] = i; in test()
59 std::random_shuffle(ic, ic+2*N); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| D | unique.pass.cpp | 43 int ic[] = {0, 0}; in test() local
44 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
45 r = std::unique(Iter(ic), Iter(ic+sc)); in test()
46 assert(base(r) == ic + 1); in test()
47 assert(ic[0] == 0); in test()
116 Ptr ic[2]; in test1() local
117 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1()
118 r = std::unique(Iter(ic), Iter(ic+sc)); in test1()
119 assert(base(r) == ic + 1); in test1()
120 assert(ic[0] == 0); in test1()
|
| D | unique_pred.pass.cpp | 57 int ic[] = {0, 0}; in test() local
58 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
60 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test()
61 assert(base(r) == ic + 1); in test()
62 assert(ic[0] == 0); in test()
146 Ptr ic[2]; in test1() local
147 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1()
149 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test1()
150 assert(base(r) == ic + 1); in test1()
151 assert(ic[0] == 0); in test1()
|
| D | unique_copy.pass.cpp | 44 const int ic[] = {0, 0}; in test() local
45 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
47 r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc)); in test()
|
| D | unique_copy_pred.pass.cpp | 59 const int ic[] = {0, 0}; in test() local
60 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
63 r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc), count_equal()); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | includes.pass.cpp | 31 int ic[] = {1, 2}; in test() local
32 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2))); in test()
|
| D | includes_comp.pass.cpp | 32 int ic[] = {1, 2}; in test() local
33 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>())); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| D | set_intersection.pass.cpp | 34 int ic[20]; in test() local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic)); in test()
39 assert(base(ce) - ic == sr); in test()
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
42 Iter2(ia), Iter2(ia+sa), OutIter(ic)); in test()
43 assert(base(ce) - ic == sr); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_intersection_comp.pass.cpp | 36 int ic[20]; in test() local
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>()); in test()
41 assert(base(ce) - ic == sr); in test()
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>()); in test()
45 assert(base(ce) - ic == sr); in test()
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| D | set_union.pass.cpp | 34 int ic[20]; in test() local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic)); in test()
39 assert(base(ce) - ic == sr); in test()
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
42 Iter2(ia), Iter2(ia+sa), OutIter(ic)); in test()
43 assert(base(ce) - ic == sr); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| D | set_symmetric_difference.pass.cpp | 35 int ic[20]; in test() local
39 Iter2(ib), Iter2(ib+sb), OutIter(ic)); in test()
40 assert(base(ce) - ic == sr); in test()
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
43 Iter2(ia), Iter2(ia+sa), OutIter(ic)); in test()
44 assert(base(ce) - ic == sr); in test()
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_symmetric_difference_comp.pass.cpp | 37 int ic[20]; in test() local
42 OutIter(ic), std::less<int>()); in test()
43 assert(base(ce) - ic == sr); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
47 OutIter(ic), std::less<int>()); in test()
48 assert(base(ce) - ic == sr); in test()
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/complex.number/complex.member.ops/ |
| D | minus_equal_complex.pass.cpp | 35 std::complex<int> ic (1,1); in test() local
36 c3 -= ic; in test()
|
| D | plus_equal_complex.pass.cpp | 35 std::complex<int> ic (1,1); in test() local
36 c3 += ic; in test()
|
| D | times_equal_complex.pass.cpp | 35 std::complex<int> ic (1,1); in test() local
36 c3 *= ic; in test()
|
| D | divide_equal_complex.pass.cpp | 35 std::complex<int> ic (1,1); in test() local
36 c3 /= ic; in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| D | set_difference.pass.cpp | 34 int ic[20]; in test() local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic)); in test()
39 assert(base(ce) - ic == sr); in test()
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
44 Iter2(ia), Iter2(ia+sa), OutIter(ic)); in test()
45 assert(base(ce) - ic == srr); in test()
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0); in test()
|