| /ndk/tests/device/test-stlport/unit/ |
| D | ptrspec_test.cpp | 121 vector<int*> pint_vect_from_list(pint_list.begin(), pint_list.end()); in ptr_specialization_test()
123 pint_vect.insert(pint_vect.end(), pint_vect2.begin(), pint_vect2.end()); in ptr_specialization_test()
124 pint_vect.insert(pint_vect.end(), int_array, int_array + 3); in ptr_specialization_test()
125 pint_vect2.insert(pint_vect2.end(), int_array, int_array + 3); in ptr_specialization_test()
126 pcint_vect.insert(pcint_vect.end(), int_array, int_array + 3); in ptr_specialization_test()
127 pcint_vect.insert(pcint_vect.end(), cint_array, cint_array + 3); in ptr_specialization_test()
129 pcint_vect.insert(pcint_vect.end(), pint_vect2.begin(), pint_vect2.end()); in ptr_specialization_test()
131 pcint_vect.insert(pcint_vect.end(), int_array, int_array + 3); in ptr_specialization_test()
133 pint_vect.insert(pint_vect.end(), pint_list.begin(), pint_list.end()); in ptr_specialization_test()
134 pcint_vect.insert(pcint_vect.end(), pint_list.begin(), pint_list.end()); in ptr_specialization_test()
[all …]
|
| D | perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); in prevprm1()
56 prev_permutation(v1.begin(), v1.end()); in prevprm1()
60 prev_permutation(v1.begin(), v1.end()); in prevprm1()
64 prev_permutation(v1.begin(), v1.end()); in prevprm1()
68 prev_permutation(v1.begin(), v1.end()); in prevprm1()
72 prev_permutation(v1.begin(), v1.end()); in prevprm1()
76 prev_permutation(v1.begin(), v1.end()); in prevprm1()
80 prev_permutation(v1.begin(), v1.end()); in prevprm1()
84 prev_permutation(v1.begin(), v1.end()); in prevprm1()
88 prev_permutation(v1.begin(), v1.end()); in prevprm1()
[all …]
|
| D | uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin()); in copy_test()
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end()); in copy_test() local
96 for (; it != end; ++it) { in copy_test()
108 TrivialCopyStruct* end = src + count; in copy_test() local
109 for (; it != end; ++it) { in copy_test()
114 for (it = dst+0, end = dst+count; it != end; ++it) { in copy_test()
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end()); in copy_test() local
133 for (; it != end; ++it) { in copy_test()
137 uninitialized_copy(src.begin(), src.end(), dst.begin()); in copy_test()
139 for (it = dst.begin(); it != end; ++it) { in copy_test()
[all …]
|
| D | alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2); in count_test()
85 count(i.begin(), i.end(), 2, n); in count_test()
99 sort(years.begin(), years.end()); in sort_test()
111 sort(years.begin(), years.end()); // <-- changed! in sort_test()
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2); in search_n_test()
131 CPPUNIT_ASSERT( slit != slint.end() ); in search_n_test()
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3); in search_n_test()
141 CPPUNIT_ASSERT( lit != lint.end() ); in search_n_test()
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4); in search_n_test()
151 CPPUNIT_ASSERT( dit != dint.end() ); in search_n_test()
[all …]
|
| D | rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0); in rndshuf2()
61 random_shuffle(v1.begin(), v1.end(), r); in rndshuf2()
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1); in rndshuf2()
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1); in rndshuf2()
64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1); in rndshuf2()
65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1); in rndshuf2()
66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1); in rndshuf2()
67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1); in rndshuf2()
68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1); in rndshuf2()
69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1); in rndshuf2()
[all …]
|
| D | set_test.cpp | 79 CPPUNIT_ASSERT (distance(s.begin(), s.end()) == 5); in set2()
83 CPPUNIT_ASSERT (distance(s2.begin(), s2.end()) == 5); in set2()
84 CPPUNIT_ASSERT (distance(s.begin(), s.end()) == 0); in set2()
89 CPPUNIT_ASSERT (distance(s.begin(), s.end()) == 0); in set2()
90 CPPUNIT_ASSERT (distance(s2.begin(), s2.end()) == 0); in set2()
91 CPPUNIT_ASSERT (distance(s3.begin(), s3.end()) == 5); in set2()
108 set<int>::iterator i = s.insert( s.end(), 0 ); in insert()
116 CPPUNIT_ASSERT( s.find(0) == s.end() ); in find()
120 CPPUNIT_ASSERT( crs.find(0) == crs.end() ); in find()
136 CPPUNIT_ASSERT( sit != s.end() ); in bounds()
[all …]
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | ptrspec_test.cpp | 121 vector<int*> pint_vect_from_list(pint_list.begin(), pint_list.end()); in ptr_specialization_test()
123 pint_vect.insert(pint_vect.end(), pint_vect2.begin(), pint_vect2.end()); in ptr_specialization_test()
124 pint_vect.insert(pint_vect.end(), int_array, int_array + 3); in ptr_specialization_test()
125 pint_vect2.insert(pint_vect2.end(), int_array, int_array + 3); in ptr_specialization_test()
126 pcint_vect.insert(pcint_vect.end(), int_array, int_array + 3); in ptr_specialization_test()
127 pcint_vect.insert(pcint_vect.end(), cint_array, cint_array + 3); in ptr_specialization_test()
129 pcint_vect.insert(pcint_vect.end(), pint_vect2.begin(), pint_vect2.end()); in ptr_specialization_test()
131 pcint_vect.insert(pcint_vect.end(), int_array, int_array + 3); in ptr_specialization_test()
133 pint_vect.insert(pint_vect.end(), pint_list.begin(), pint_list.end()); in ptr_specialization_test()
134 pcint_vect.insert(pcint_vect.end(), pint_list.begin(), pint_list.end()); in ptr_specialization_test()
[all …]
|
| D | perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); in prevprm1()
56 prev_permutation(v1.begin(), v1.end()); in prevprm1()
60 prev_permutation(v1.begin(), v1.end()); in prevprm1()
64 prev_permutation(v1.begin(), v1.end()); in prevprm1()
68 prev_permutation(v1.begin(), v1.end()); in prevprm1()
72 prev_permutation(v1.begin(), v1.end()); in prevprm1()
76 prev_permutation(v1.begin(), v1.end()); in prevprm1()
80 prev_permutation(v1.begin(), v1.end()); in prevprm1()
84 prev_permutation(v1.begin(), v1.end()); in prevprm1()
88 prev_permutation(v1.begin(), v1.end()); in prevprm1()
[all …]
|
| D | uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin()); in copy_test()
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end()); in copy_test() local
96 for (; it != end; ++it) { in copy_test()
108 TrivialCopyStruct* end = src + count; in copy_test() local
109 for (; it != end; ++it) { in copy_test()
114 for (it = dst+0, end = dst+count; it != end; ++it) { in copy_test()
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end()); in copy_test() local
133 for (; it != end; ++it) { in copy_test()
137 uninitialized_copy(src.begin(), src.end(), dst.begin()); in copy_test()
139 for (it = dst.begin(); it != end; ++it) { in copy_test()
[all …]
|
| D | alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2); in count_test()
85 count(i.begin(), i.end(), 2, n); in count_test()
99 sort(years.begin(), years.end()); in sort_test()
111 sort(years.begin(), years.end()); // <-- changed! in sort_test()
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2); in search_n_test()
131 CPPUNIT_ASSERT( slit != slint.end() ); in search_n_test()
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3); in search_n_test()
141 CPPUNIT_ASSERT( lit != lint.end() ); in search_n_test()
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4); in search_n_test()
151 CPPUNIT_ASSERT( dit != dint.end() ); in search_n_test()
[all …]
|
| D | rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0); in rndshuf2()
61 random_shuffle(v1.begin(), v1.end(), r); in rndshuf2()
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1); in rndshuf2()
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1); in rndshuf2()
64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1); in rndshuf2()
65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1); in rndshuf2()
66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1); in rndshuf2()
67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1); in rndshuf2()
68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1); in rndshuf2()
69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1); in rndshuf2()
[all …]
|
| D | set_test.cpp | 79 CPPUNIT_ASSERT (distance(s.begin(), s.end()) == 5); in set2()
83 CPPUNIT_ASSERT (distance(s2.begin(), s2.end()) == 5); in set2()
84 CPPUNIT_ASSERT (distance(s.begin(), s.end()) == 0); in set2()
89 CPPUNIT_ASSERT (distance(s.begin(), s.end()) == 0); in set2()
90 CPPUNIT_ASSERT (distance(s2.begin(), s2.end()) == 0); in set2()
91 CPPUNIT_ASSERT (distance(s3.begin(), s3.end()) == 5); in set2()
108 set<int>::iterator i = s.insert( s.end(), 0 ); in insert()
116 CPPUNIT_ASSERT( s.find(0) == s.end() ); in find()
120 CPPUNIT_ASSERT( crs.find(0) == crs.end() ); in find()
136 CPPUNIT_ASSERT( sit != s.end() ); in bounds()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.traits/ |
| D | isctype.pass.cpp | 25 assert( t.isctype('_', t.lookup_classname(s.begin(), s.end()))); in main()
26 assert( t.isctype('a', t.lookup_classname(s.begin(), s.end()))); in main()
27 assert( t.isctype('Z', t.lookup_classname(s.begin(), s.end()))); in main()
28 assert( t.isctype('5', t.lookup_classname(s.begin(), s.end()))); in main()
29 assert(!t.isctype(' ', t.lookup_classname(s.begin(), s.end()))); in main()
30 assert(!t.isctype('-', t.lookup_classname(s.begin(), s.end()))); in main()
31 assert(!t.isctype('@', t.lookup_classname(s.begin(), s.end()))); in main()
34 assert(!t.isctype('_', t.lookup_classname(s.begin(), s.end()))); in main()
35 assert( t.isctype('a', t.lookup_classname(s.begin(), s.end()))); in main()
36 assert( t.isctype('Z', t.lookup_classname(s.begin(), s.end()))); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.regex/re.regex.construct/ |
| D | iter_iter_flg.pass.cpp | 40 test(F(s1.begin()), F(s1.end()), std::regex_constants::basic, 1); in main()
41 test(F(s2.begin()), F(s2.end()), std::regex_constants::basic, 1); in main()
42 test(F(s3.begin()), F(s3.end()), std::regex_constants::basic, 2); in main()
43 test(F(s4.begin()), F(s4.end()), std::regex_constants::basic, 0); in main()
45 test(F(s1.begin()), F(s1.end()), std::regex_constants::extended, 0); in main()
46 test(F(s2.begin()), F(s2.end()), std::regex_constants::extended, 0); in main()
47 test(F(s3.begin()), F(s3.end()), std::regex_constants::extended, 0); in main()
48 test(F(s4.begin()), F(s4.end()), std::regex_constants::extended, 2); in main()
50 test(F(s1.begin()), F(s1.end()), std::regex_constants::ECMAScript, 0); in main()
51 test(F(s2.begin()), F(s2.end()), std::regex_constants::ECMAScript, 0); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| D | splice_pos_list.pass.cpp | 30 l1.splice(l1.end(), l2); in main()
32 assert(distance(l1.begin(), l1.end()) == 0); in main()
34 assert(distance(l2.begin(), l2.end()) == 0); in main()
39 l1.splice(l1.end(), l2); in main()
41 assert(distance(l1.begin(), l1.end()) == 1); in main()
43 assert(distance(l2.begin(), l2.end()) == 0); in main()
50 l1.splice(l1.end(), l2); in main()
52 assert(distance(l1.begin(), l1.end()) == 2); in main()
54 assert(distance(l2.begin(), l2.end()) == 0); in main()
63 l1.splice(l1.end(), l2); in main()
[all …]
|
| D | splice_pos_list_iter.pass.cpp | 30 l1.splice(l1.end(), l2, l2.begin()); in main()
32 assert(distance(l1.begin(), l1.end()) == 1); in main()
34 assert(distance(l2.begin(), l2.end()) == 0); in main()
41 l1.splice(l1.end(), l2, l2.begin()); in main()
43 assert(distance(l1.begin(), l1.end()) == 1); in main()
45 assert(distance(l2.begin(), l2.end()) == 1); in main()
54 l1.splice(l1.end(), l2, next(l2.begin())); in main()
56 assert(distance(l1.begin(), l1.end()) == 1); in main()
58 assert(distance(l2.begin(), l2.end()) == 1); in main()
67 l1.splice(l1.end(), l2, l2.begin()); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| D | resize_size.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 0); in main()
29 assert(distance(c.begin(), c.end()) == 10); in main()
31 assert(distance(c.begin(), c.end()) == 20); in main()
33 assert(distance(c.begin(), c.end()) == 5); in main()
35 assert(distance(c.begin(), c.end()) == 0); in main()
41 C c(std::begin(t), std::end(t)); in main()
44 assert(distance(c.begin(), c.end()) == 3); in main()
50 assert(distance(c.begin(), c.end()) == 6); in main()
59 assert(distance(c.begin(), c.end()) == 6); in main()
73 assert(distance(c.begin(), c.end()) == 0); in main()
[all …]
|
| D | erase_after_one.pass.cpp | 25 C c(std::begin(t), std::end(t)); in main()
28 assert(i == c.end()); in main()
29 assert(distance(c.begin(), c.end()) == 4); in main()
37 assert(distance(c.begin(), c.end()) == 3); in main()
44 assert(distance(c.begin(), c.end()) == 2); in main()
49 assert(i == c.end()); in main()
50 assert(distance(c.begin(), c.end()) == 1); in main()
55 assert(i == c.end()); in main()
56 assert(distance(c.begin(), c.end()) == 0); in main()
63 C c(std::begin(t), std::end(t)); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/ |
| D | non_member_swap.pass.cpp | 28 C c1(std::begin(t1), std::end(t1), A(1)); in main()
30 C c2(std::begin(t2), std::end(t2), A(2)); in main()
33 assert(distance(c1.begin(), c1.end()) == 3); in main()
39 assert(distance(c2.begin(), c2.end()) == 6); in main()
53 C c1(std::begin(t1), std::end(t1), A(1)); in main()
57 assert(distance(c1.begin(), c1.end()) == 0); in main()
60 assert(distance(c2.begin(), c2.end()) == 6); in main()
75 C c2(std::begin(t2), std::end(t2), A(2)); in main()
78 assert(distance(c1.begin(), c1.end()) == 3); in main()
84 assert(distance(c2.begin(), c2.end()) == 0); in main()
[all …]
|
| D | member_swap.pass.cpp | 27 C c1(std::begin(t1), std::end(t1), A(1)); in main()
29 C c2(std::begin(t2), std::end(t2), A(2)); in main()
32 assert(distance(c1.begin(), c1.end()) == 3); in main()
38 assert(distance(c2.begin(), c2.end()) == 6); in main()
52 C c1(std::begin(t1), std::end(t1), A(1)); in main()
56 assert(distance(c1.begin(), c1.end()) == 0); in main()
59 assert(distance(c2.begin(), c2.end()) == 6); in main()
74 C c2(std::begin(t2), std::end(t2), A(2)); in main()
77 assert(distance(c1.begin(), c1.end()) == 3); in main()
83 assert(distance(c2.begin(), c2.end()) == 0); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| D | assign_copy.pass.cpp | 29 C c0(std::begin(t0), std::end(t0), A(10)); in main()
30 C c1(std::begin(t1), std::end(t1), A(10)); in main()
41 C c0(std::begin(t0), std::end(t0), A(10)); in main()
42 C c1(std::begin(t1), std::end(t1), A(11)); in main()
53 C c0(std::begin(t0), std::end(t0), A(10)); in main()
54 C c1(std::begin(t1), std::end(t1), A(10)); in main()
65 C c0(std::begin(t0), std::end(t0), A(10)); in main()
66 C c1(std::begin(t1), std::end(t1), A(11)); in main()
78 C c0(std::begin(t0), std::end(t0), A(10)); in main()
79 C c1(std::begin(t1), std::end(t1), A(10)); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| D | unique.pass.cpp | 27 C c1(std::begin(t1), std::end(t1)); in main()
28 C c2(std::begin(t2), std::end(t2)); in main()
37 C c1(std::begin(t1), std::end(t1)); in main()
38 C c2(std::begin(t2), std::end(t2)); in main()
47 C c1(std::begin(t1), std::end(t1)); in main()
48 C c2(std::begin(t2), std::end(t2)); in main()
65 C c1(std::begin(t1), std::end(t1)); in main()
66 C c2(std::begin(t2), std::end(t2)); in main()
76 C c1(std::begin(t1), std::end(t1)); in main()
77 C c2(std::begin(t2), std::end(t2)); in main()
[all …]
|
| D | unique_pred.pass.cpp | 32 C c1(std::begin(t1), std::end(t1)); in main()
33 C c2(std::begin(t2), std::end(t2)); in main()
42 C c1(std::begin(t1), std::end(t1)); in main()
43 C c2(std::begin(t2), std::end(t2)); in main()
52 C c1(std::begin(t1), std::end(t1)); in main()
53 C c2(std::begin(t2), std::end(t2)); in main()
70 C c1(std::begin(t1), std::end(t1)); in main()
71 C c2(std::begin(t2), std::end(t2)); in main()
81 C c1(std::begin(t1), std::end(t1)); in main()
82 C c2(std::begin(t2), std::end(t2)); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| D | insert_iter_cv.pass.cpp | 27 R r = m.insert(m.end(), M::value_type(2, 2.5)); in main()
33 r = m.insert(m.end(), M::value_type(1, 1.5)); in main()
39 r = m.insert(m.end(), M::value_type(3, 3.5)); in main()
40 assert(r == prev(m.end())); in main()
45 r = m.insert(m.end(), M::value_type(3, 3.5)); in main()
46 assert(r == prev(m.end())); in main()
56 R r = m.insert(m.end(), M::value_type(2, 2.5)); in main()
62 r = m.insert(m.end(), M::value_type(1, 1.5)); in main()
68 r = m.insert(m.end(), M::value_type(3, 3.5)); in main()
69 assert(r == prev(m.end())); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| D | insert_iter_cv.pass.cpp | 27 R r = m.insert(m.end(), M::value_type(2, 2.5)); in main()
33 r = m.insert(m.end(), M::value_type(1, 1.5)); in main()
39 r = m.insert(m.end(), M::value_type(3, 3.5)); in main()
40 assert(r == prev(m.end())); in main()
45 r = m.insert(prev(m.end()), M::value_type(3, 4.5)); in main()
46 assert(r == prev(m.end(), 2)); in main()
56 R r = m.insert(m.end(), M::value_type(2, 2.5)); in main()
62 r = m.insert(m.end(), M::value_type(1, 1.5)); in main()
68 r = m.insert(m.end(), M::value_type(3, 3.5)); in main()
69 assert(r == prev(m.end())); in main()
[all …]
|