| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_iter_db4.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with a bad range
29 std::unordered_map<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db1.pass.cpp | 12 // Call erase(const_iterator position) with end()
28 l1.erase(i);
|
| erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container
31 l1.erase(i);
|
| erase_iter_iter_db4.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with a bad range
29 std::unordered_multimap<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
| erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container
30 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with first iterator from another container
29 std::unordered_multiset<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
29 std::unordered_multiset<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
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
| erase_iter_db2.pass.cpp | 12 // Call erase(const_iterator position) with iterator from another container
30 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 12 // Call erase(const_iterator first, const_iterator last); with first iterator from another container
29 std::unordered_set<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
29 std::unordered_set<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
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 12 // iterator erase(const_iterator first, const_iterator last);
42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
82 outer.erase(outer.begin(), outer.begin());
94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
103 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
113 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
123 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3))
[all...] |
| /external/llvm/unittests/ADT/ |
| SparseSetTest.cpp | 66 // Erase non-existent element.
67 EXPECT_FALSE(Set.erase(1));
71 // Erase iterator.
74 I = Set.erase(I);
110 // Erase last element by key.
111 EXPECT_TRUE(Set.erase(4));
114 EXPECT_FALSE(Set.erase(4));
118 // Erase first element by key.
121 EXPECT_TRUE(Set.erase(5));
124 EXPECT_FALSE(Set.erase(5))
[all...] |
| TinyPtrVectorTest.cpp | 293 this->V.erase(this->V.begin());
298 this->V.erase(this->V.begin());
299 this->TestPtrs.erase(this->TestPtrs.begin());
301 this->V.erase(std::next(this->V.begin(), 1));
302 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1));
304 this->V.erase(std::next(this->V.begin(), 2));
305 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2));
307 this->V.erase(std::next(this->V.begin(), 5));
308 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 5));
310 this->V.erase(std::next(this->V.begin(), 13))
[all...] |
| /external/perfetto/src/traced/probes/filesystem/ |
| lru_inode_cache.cc | 45 list_.erase(list_it);
54 map_.erase(list_last_it->first);
55 list_.erase(list_last_it);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 12 // iterator erase(const_iterator first, const_iterator last);
42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
82 outer.erase(outer.begin(), outer.begin());
94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
103 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
113 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
123 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3))
[all...] |
| /system/extras/latencytop/ |
| latencytop.c | 44 static struct latency_entry *read_global_stats(struct latency_entry *list, int erase);
45 static struct latency_entry *read_process_stats(struct latency_entry *list, int erase, int pid);
46 static struct latency_entry *read_thread_stats(struct latency_entry *list, int erase, int pid, int tid, int fatal);
71 int count, erase; local
137 erase = 1;
146 e = read_thread_stats(e, erase, pid, tid, 1);
148 e = read_process_stats(e, erase, pid);
151 e = read_global_stats(e, erase);
153 erase = 0;
173 static struct latency_entry *read_global_stats(struct latency_entry *list, int erase) {
[all...] |
| /external/libxcam/xcore/ |
| safe_list.h | 51 inline bool erase (const ObjPtr &obj);
110 _obj_list.erase (_obj_list.begin ());
126 SafeList<OBj>::erase (const SafeList<OBj>::ObjPtr &obj) function in class:XCam::SafeList
133 _obj_list.erase (i_obj);
157 _obj_list.erase (i_obj++);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 44 erase(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
49 erase(it);
56 erase(iterator it) function in class:PB_DS_CLASS_C_DEC
71 erase(reverse_iterator it) function in class:PB_DS_CLASS_C_DEC
97 it = erase(it);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 44 erase(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
49 erase(it);
56 erase(iterator it) function in class:PB_DS_CLASS_C_DEC
71 erase(reverse_iterator it) function in class:PB_DS_CLASS_C_DEC
97 it = erase(it);
|
| /frameworks/rs/script_api/ |
| Utilities.cpp | 66 s->erase();
69 s->erase(end + 1);
73 s->erase(0, start);
83 s.erase(p, match.size());
92 s->erase(p, 1);
184 s.erase(std::remove(s.begin(), s.end(), '@'), s.end());
216 mIndent.erase(0, TAB_SIZE);
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| erase_key.pass.cpp | 14 // size_type erase(const key_type& k);
40 R s = m.erase(9);
60 s = m.erase(4);
78 s = m.erase(1);
94 s = m.erase(8);
108 s = m.erase(3);
120 s = m.erase(6);
130 s = m.erase(7);
138 s = m.erase(2);
144 s = m.erase(5)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.modifiers/ |
| erase_key.pass.cpp | 14 // size_type erase(const key_type& k);
40 R s = m.erase(9);
60 s = m.erase(4);
78 s = m.erase(1);
94 s = m.erase(8);
108 s = m.erase(3);
120 s = m.erase(6);
130 s = m.erase(7);
138 s = m.erase(2);
144 s = m.erase(5)
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| erase_iter_iter.pass.cpp | 14 // iterator erase(const_iterator first, const_iterator last);
40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4));
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5));
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2));
77 i = m.erase(m.cbegin(), m.cend());
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
111 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4));
122 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5));
130 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2))
[all...] |
