/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
iterators.fail.cpp | 20 // const_iterator cbegin() const {return __table_.begin();} 46 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 67 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
iterators.fail.cpp | 20 // const_iterator cbegin() const {return __table_.begin();} 44 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); 66 i = m.erase(next(m.cbegin(), 0)); 82 i = m.erase(next(m.cbegin(), 5)); 96 i = m.erase(next(m.cbegin(), 1)); 108 i = m.erase(next(m.cbegin(), 2)); 118 i = m.erase(next(m.cbegin(), 2)); 126 i = m.erase(next(m.cbegin(), 0)); 132 i = m.erase(m.cbegin()); 155 I i = m.erase(next(m.cbegin(), 3)); 173 i = m.erase(next(m.cbegin(), 0)) [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
assign_init.pass.cpp | 31 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n) 42 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 | 31 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n) 42 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_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, (void) ++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)
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
emplace.pass.cpp | 26 C::iterator i = c.emplace(c.cbegin()); 37 i = c.emplace(c.cbegin()+1, true); 48 C::iterator i = c.emplace(c.cbegin()); 59 i = c.emplace(c.cbegin()+1, true);
|
insert_iter_size_value.pass.cpp | 25 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 40 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 56 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 70 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 5, 1);
|
insert_iter_value.pass.cpp | 25 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); 39 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); 54 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); 67 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 1);
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.modifiers/ |
erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); 66 i = m.erase(next(m.cbegin(), 0)); 82 i = m.erase(next(m.cbegin(), 5)); 96 i = m.erase(next(m.cbegin(), 1)); 108 i = m.erase(next(m.cbegin(), 2)); 118 i = m.erase(next(m.cbegin(), 2)); 126 i = m.erase(next(m.cbegin(), 0)); 132 i = m.erase(m.cbegin()); 155 I i = m.erase(next(m.cbegin(), 3)); 173 i = m.erase(next(m.cbegin(), 0)) [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
assign_init.pass.cpp | 31 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n) 42 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 | 31 for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n) 42 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_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, (void) ++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)
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector.bool/ |
emplace.pass.cpp | 26 C::iterator i = c.emplace(c.cbegin()); 37 i = c.emplace(c.cbegin()+1, true); 48 C::iterator i = c.emplace(c.cbegin()); 59 i = c.emplace(c.cbegin()+1, true);
|
insert_iter_size_value.pass.cpp | 25 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 40 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 56 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 70 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 5, 1);
|
insert_iter_value.pass.cpp | 25 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); 39 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); 54 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); 67 std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 1);
|
/external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/ |
erase_iter_iter_db1.pass.cpp | 29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
erase_iter_iter_db2.pass.cpp | 29 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
erase_iter_iter_db3.pass.cpp | 29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
erase_iter_iter_db4.pass.cpp | 28 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
/external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
insert_iter_iter_iter.pass.cpp | 31 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a), 48 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a), 67 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a), 85 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a), 101 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a), 118 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a), 136 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a), 153 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a),
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
erase_iter_iter_db1.pass.cpp | 30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
erase_iter_iter_db2.pass.cpp | 30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|