| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| insert_iter_value.pass.cpp | 24 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1);
37 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 1);
|
| construct_size.pass.cpp | 28 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
|
| construct_size_value.pass.cpp | 27 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
|
| insert_iter_iter_iter.pass.cpp | 27 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const bool*>(a),
43 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a),
60 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const bool*>(a),
76 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a),
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| assign_init.pass.cpp | 30 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
41 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
53 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
64 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
|
| assign_op_init.pass.cpp | 30 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
41 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
53 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
64 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
|
| assign_size_value.pass.cpp | 29 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
40 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
52 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
63 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
|
| assign_range.pass.cpp | 33 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
46 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
60 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
73 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| emplace.pass.cpp | 43 c.emplace(c.cbegin(), 2, 3.5);
58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
67 c.emplace(c.cbegin(), 2, 3.5);
82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| insert_iter_size_value.pass.cpp | 48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
78 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.iterators/ |
| cbegin.pass.cpp | 12 // const_iterator cbegin() const;
23 typename S::const_iterator cb = s.cbegin();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 20 // const_local_iterator cbegin(size_type n) const;
162 I i = c.cbegin(b);
167 i = c.cbegin(b);
175 i = c.cbegin(b);
183 i = c.cbegin(b);
189 i = c.cbegin(b);
195 i = c.cbegin(b);
200 i = c.cbegin(b);
220 I i = c.cbegin(b);
225 i = c.cbegin(b)
[all...] |
| local_iterators.fail.cpp | 20 // const_local_iterator cbegin(size_type n) const;
161 I i = c.cbegin(b);
166 i = c.cbegin(b);
174 i = c.cbegin(b);
182 i = c.cbegin(b);
188 i = c.cbegin(b);
194 i = c.cbegin(b);
199 i = c.cbegin(b);
219 I i = c.cbegin(b);
224 i = c.cbegin(b)
[all...] |
| iterators.pass.cpp | 20 // const_iterator cbegin() const;
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
106 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| local_iterators.fail.cpp | 20 // const_local_iterator cbegin(size_type n) const;
161 I i = c.cbegin(b);
166 i = c.cbegin(b);
174 i = c.cbegin(b);
182 i = c.cbegin(b);
188 i = c.cbegin(b);
194 i = c.cbegin(b);
199 i = c.cbegin(b);
219 I i = c.cbegin(b);
224 i = c.cbegin(b)
[all...] |
| iterators.pass.cpp | 20 // const_iterator cbegin() const {return __table_.begin();}
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
106 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 34 i = c.emplace_after(c.cbegin(), 1, 2.5);
40 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
47 i = c.emplace_after(c.cbegin(), 3, 4.5);
66 i = c.emplace_after(c.cbegin(), 1, 2.5);
72 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
79 i = c.emplace_after(c.cbegin(), 3, 4.5);
|
| insert_after_const.pass.cpp | 32 i = c.insert_after(c.cbegin(), 1);
38 i = c.insert_after(next(c.cbegin()), 2);
45 i = c.insert_after(c.cbegin(), 3);
65 i = c.insert_after(c.cbegin(), 1);
71 i = c.insert_after(next(c.cbegin()), 2);
78 i = c.insert_after(c.cbegin(), 3);
|
| insert_after_rv.pass.cpp | 34 i = c.insert_after(c.cbegin(), 1);
40 i = c.insert_after(next(c.cbegin()), 2);
47 i = c.insert_after(c.cbegin(), 3);
67 i = c.insert_after(c.cbegin(), 1);
73 i = c.insert_after(next(c.cbegin()), 2);
80 i = c.insert_after(c.cbegin(), 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| insert_iter_rvalue.pass.cpp | 29 std::vector<MoveOnly>::iterator i = v.insert(v.cbegin() + 10, MoveOnly(3));
41 std::vector<MoveOnly, stack_allocator<MoveOnly, 300> >::iterator i = v.insert(v.cbegin() + 10, MoveOnly(3));
62 std::vector<MoveOnly, min_allocator<MoveOnly>>::iterator i = v.insert(v.cbegin() + 10, MoveOnly(3));
|
| insert_iter_value.pass.cpp | 27 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, 1);
39 std::vector<int, stack_allocator<int, 300> >::iterator i = v.insert(v.cbegin() + 10, 1);
61 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
58 i = m.erase(next(m.cbegin(), 0));
74 i = m.erase(next(m.cbegin(), 5));
88 i = m.erase(next(m.cbegin(), 1));
100 i = m.erase(next(m.cbegin(), 2));
110 i = m.erase(next(m.cbegin(), 2));
118 i = m.erase(next(m.cbegin(), 0));
124 i = m.erase(m.cbegin());
147 I i = m.erase(next(m.cbegin(), 3));
165 i = m.erase(next(m.cbegin(), 0))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| initializer_list_compare.pass.cpp | 29 C::const_iterator i = m.cbegin();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| initializer_list_compare.pass.cpp | 29 C::const_iterator i = m.cbegin();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
| construct_size_value.pass.cpp | 27 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
|
