/external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
H A D | erase_iter_iter_db4.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with a bad range 30 std::vector<int>::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin()); 37 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin());
|
H A D | erase_iter_iter.pass.cpp | 12 // iterator erase(const_iterator first, const_iterator last); 24 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 39 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 47 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); 54 outer.erase(outer.begin(), outer.begin()); 62 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 69 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 77 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 85 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l [all...] |
/external/libcxx/test/strings/basic.string/string.modifiers/string_erase/ |
H A D | erase_iter_db1.pass.cpp | 12 // Call erase(const_iterator position) with end() 30 l1.erase(i); 38 l1.erase(i);
|
H A D | erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container 31 l1.erase(i); 40 l1.erase(i);
|
H A D | erase_iter_iter_db1.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with first iterator from another container 30 std::string::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1); 38 S::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
H A D | erase_iter_iter_db2.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with second iterator from another container 30 std::string::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1); 38 S::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
H A D | erase_iter_iter_db3.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with both iterators from another container 30 std::string::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1); 38 S::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
H A D | erase_iter_iter_db4.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with a bad range 29 std::string::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin()); 36 S::iterator i = l1.erase(l1.cbegin()+1, l1.cbegin());
|
/external/openfst/src/include/fst/ |
H A D | slist.h | 48 using list<T>::erase; 52 erase(++npos);
|
/external/libcxx/test/containers/associative/multiset/ |
H A D | erase_iter.pass.cpp | 14 // iterator erase(const_iterator position); 40 I i = m.erase(next(m.cbegin(), 3)); 51 i = m.erase(next(m.cbegin(), 0)); 61 i = m.erase(next(m.cbegin(), 5)); 70 i = m.erase(next(m.cbegin(), 1)); 78 i = m.erase(next(m.cbegin(), 2)); 85 i = m.erase(next(m.cbegin(), 2)); 91 i = m.erase(next(m.cbegin(), 0)); 96 i = m.erase(m.cbegin()); 119 I i = m.erase(nex [all...] |
H A D | erase_key.pass.cpp | 14 // size_type erase(const key_type& k); 41 I i = m.erase(6); 54 i = m.erase(5); 64 i = m.erase(3); 71 i = m.erase(7); 94 I i = m.erase(6); 107 i = m.erase(5); 117 i = m.erase(3); 124 i = m.erase(7);
|
/external/libcxx/test/containers/associative/set/ |
H A D | erase_iter.pass.cpp | 14 // iterator erase(const_iterator position); 40 I i = m.erase(next(m.cbegin(), 3)); 51 i = m.erase(next(m.cbegin(), 0)); 61 i = m.erase(next(m.cbegin(), 5)); 70 i = m.erase(next(m.cbegin(), 1)); 78 i = m.erase(next(m.cbegin(), 2)); 85 i = m.erase(next(m.cbegin(), 2)); 91 i = m.erase(next(m.cbegin(), 0)); 96 i = m.erase(m.cbegin()); 119 I i = m.erase(nex [all...] |
/external/libcxx/test/containers/unord/unord.multiset/ |
H A D | erase_iter_db1.pass.cpp | 12 // Call erase(const_iterator position) with end() 27 l1.erase(i);
|
H A D | erase_iter_iter_db4.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with a bad range 28 std::unordered_multiset<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
H A D | erase_range.pass.cpp | 16 // iterator erase(const_iterator first, const_iterator last) 40 C::iterator k = c.erase(i, i); 48 k = c.erase(i, j); 54 k = c.erase(c.cbegin(), c.cend()); 75 C::iterator k = c.erase(i, i); 83 k = c.erase(i, j); 89 k = c.erase(c.cbegin(), c.cend());
|
/external/libcxx/test/containers/unord/unord.set/ |
H A D | erase_iter_db1.pass.cpp | 12 // Call erase(const_iterator position) with end() 27 l1.erase(i);
|
H A D | erase_iter_iter_db4.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with a bad range 28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
H A D | erase_range.pass.cpp | 16 // iterator erase(const_iterator first, const_iterator last) 40 C::iterator k = c.erase(i, i); 48 k = c.erase(i, j); 54 k = c.erase(c.cbegin(), c.cend()); 74 C::iterator k = c.erase(i, i); 82 k = c.erase(i, j); 88 k = c.erase(c.cbegin(), c.cend());
|
/external/llvm/unittests/Support/ |
H A D | ThreadLocalTest.cpp | 34 x.erase();
|
/external/chromium_org/content/browser/appcache/ |
H A D | appcache_working_set.cc | 42 caches_.erase(cache->cache_id()); 56 groups_.erase(url); 61 groups_in_origin->erase(url); 63 groups_by_origin_.erase(origin_url); 77 response_infos_.erase(info->response_id());
|
/external/chromium_org/content/browser/indexed_db/ |
H A D | list_set_unittest.cc | 64 set.erase(3); 68 set.erase(2); 83 set.erase(1); 84 set.erase(4); 85 set.erase(5); 137 set.erase(Wrapped<int>(0)); 138 set.erase(Wrapped<int>(1)); 139 set.erase(Wrapped<int>(2)); 177 set.erase(w0.get()); 178 set.erase(w [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | graph.h | 74 vertices_.erase(vertex); 75 vertex_weights_.erase(vertex); 80 edge_weights_.erase(make_pair(vertex, *it)); 82 edge_weights_.erase(make_pair(*it, vertex)); 84 edges_[*it].erase(vertex); 87 edges_.erase(vertex);
|
/external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
H A D | erase_range.pass.cpp | 16 // iterator erase(const_iterator first, const_iterator last) 41 C::iterator k = c.erase(i, i); 49 k = c.erase(i, j); 56 k = c.erase(c.cbegin(), c.cend()); 78 C::iterator k = c.erase(i, i); 86 k = c.erase(i, j); 93 k = c.erase(c.cbegin(), c.cend());
|
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container 32 l1.erase(i); 41 l1.erase(i);
|
H A D | erase_iter_iter.pass.cpp | 12 // iterator erase(const_iterator first, const_iterator last); 24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 39 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 47 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); 55 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 62 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 70 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 78 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|