| /libcore/luni/src/main/native/ |
| realpath.cpp | 68 left.erase(0, nextSlash + 1);
79 resolved.erase(resolved.rfind('/'));
108 resolved.erase(resolved.rfind('/'));
122 resolved.erase(resolved.size() - 1, 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| 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(next(m.cbegin(), 3))
[all...] |
| 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);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| 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(next(m.cbegin(), 3))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| 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(l1.cbegin(), next(l1.cbegin(), 3))
[all...] |
| erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container
32 l1.erase(i);
41 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with first iterator from another container
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with second iterator from another container
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| erase_iter_iter_db3.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with both iterators from another container
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| /external/chromium_org/webkit/browser/appcache/ |
| 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/ceres-solver/internal/ceres/ |
| 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/chromium/base/memory/ |
| scoped_vector.h | 71 iterator erase(iterator position) { function in class:ScopedVector
73 return v.erase(position);
76 iterator erase(iterator first, iterator last) { function in class:ScopedVector
78 return v.erase(first, last);
81 // Like |erase()|, but doesn't delete the element at |position|.
83 return v.erase(position);
86 // Like |erase()|, but doesn't delete the elements in [first, last).
88 return v.erase(first, last);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| 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());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| 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());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| 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/chromium/chrome/browser/automation/ |
| automation_provider_list.cc | 21 iter = automation_providers_.erase(iter);
37 automation_providers_.erase(remove_provider);
|
| /external/chromium_org/content/browser/renderer_host/ |
| renderer_frame_manager.cc | 27 visible_frames_.erase(frame);
37 visible_frames_.erase(frame);
|
| /external/chromium_org/net/base/ |
| linked_hash_map.h | 95 size_type erase(const Key& key) { function in class:linked_hash_map
99 list_.erase(found->second);
100 map_.erase(found);
108 void erase(iterator position) { function in class:linked_hash_map
113 list_.erase(position);
114 map_.erase(found);
118 void erase(iterator first, iterator last) { function in class:linked_hash_map
120 erase(first++);
|
| /external/chromium_org/net/quic/ |
| quic_ack_notifier.cc | 40 sequence_numbers_.erase(sequence_number);
53 sequence_numbers_.erase(old_sequence_number);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container
32 l1.erase(i);
41 l1.erase(i);
|
| 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));
|
| erase_iter_iter_db1.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with first iterator from another container
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with second iterator from another container
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with both iterators from another container
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| erase_iter_iter.pass.cpp | 13 // iterator erase(const_iterator first, const_iterator last);
25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
40 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
48 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
56 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
63 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
71 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
79 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|
