| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| Trace.h | 104 iterator erase(iterator q) { return BasicBlocks.erase (q); } function in class:llvm::Trace
105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } function in class:llvm::Trace
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| PriorityWorklist.h | 149 M.erase(back());
161 /// Erase an item from the worklist.
164 bool erase(const T& X) { function in class:llvm::PriorityWorklist
177 M.erase(I);
181 /// Erase items from the set vector based on a predicate function.
187 /// V.erase(remove_if(V, P), V.end());
203 V.erase(E, V.end());
222 /// call M.erase(x) on each element which is slated for removal. This just
240 M.erase(Arg);
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| Trace.h | 104 iterator erase(iterator q) { return BasicBlocks.erase (q); } function in class:llvm::Trace
105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } function in class:llvm::Trace
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| PriorityWorklist.h | 149 M.erase(back());
161 /// Erase an item from the worklist.
164 bool erase(const T& X) { function in class:llvm::PriorityWorklist
177 M.erase(I);
181 /// Erase items from the set vector based on a predicate function.
187 /// V.erase(remove_if(V, P), V.end());
203 V.erase(E, V.end());
222 /// call M.erase(x) on each element which is slated for removal. This just
240 M.erase(Arg);
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| PriorityWorklist.h | 149 M.erase(back());
161 /// Erase an item from the worklist.
164 bool erase(const T& X) { function in class:llvm::PriorityWorklist
177 M.erase(I);
181 /// Erase items from the set vector based on a predicate function.
187 /// V.erase(remove_if(V, P), V.end());
203 V.erase(E, V.end());
222 /// call M.erase(x) on each element which is slated for removal. This just
240 M.erase(Arg);
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| PriorityWorklist.h | 149 M.erase(back());
161 /// Erase an item from the worklist.
164 bool erase(const T& X) { function in class:llvm::PriorityWorklist
177 M.erase(I);
181 /// Erase items from the set vector based on a predicate function.
187 /// V.erase(remove_if(V, P), V.end());
203 V.erase(E, V.end());
222 /// call M.erase(x) on each element which is slated for removal. This just
240 M.erase(Arg);
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| PriorityWorklist.h | 149 M.erase(back());
161 /// Erase an item from the worklist.
164 bool erase(const T& X) { function in class:llvm::PriorityWorklist
177 M.erase(I);
181 /// Erase items from the set vector based on a predicate function.
187 /// V.erase(remove_if(V, P), V.end());
203 V.erase(E, V.end());
222 /// call M.erase(x) on each element which is slated for removal. This just
240 M.erase(Arg);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/ |
| erase_fn_imps.hpp | 192 erase(point_iterator it) function in class:PB_DS_CLASS_C_DEC
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/thin_heap_/ |
| erase_fn_imps.hpp | 192 erase(point_iterator it) function in class:PB_DS_CLASS_C_DEC
|
| /external/clang/include/clang/AST/ |
| UnresolvedSet.h | 108 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
110 void erase(iterator I) { *I.I = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
|
| /external/clang/include/clang/Rewrite/Core/ |
| RewriteRope.h | 155 void erase(unsigned Offset, unsigned NumBytes);
202 void erase(unsigned Offset, unsigned NumBytes) { function in class:clang::RewriteRope
203 assert(Offset+NumBytes <= size() && "Invalid region to erase!");
205 Chunks.erase(Offset, NumBytes);
|
| /external/libchrome/base/memory/ |
| scoped_vector.h | 126 iterator erase(iterator position) { function in class:ScopedVector
128 return v_.erase(position);
131 iterator erase(iterator first, iterator last) { function in class:ScopedVector
134 return v_.erase(first, last);
137 // Like |erase()|, but doesn't delete the element at |position|.
139 return v_.erase(position);
142 // Like |erase()|, but doesn't delete the elements in [first, last).
144 return v_.erase(first, last);
|
| /external/llvm/include/llvm/ADT/ |
| MapVector.h | 123 Map.erase(Pos);
134 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { function in class:llvm::MapVector
135 Map.erase(Iterator->first);
136 auto Next = Vector.erase(Iterator);
153 size_type erase(const KeyT &Key) { function in class:llvm::MapVector
157 erase(Iterator);
163 /// Erase all elements that match \c Pred in a single pass. Takes linear
174 // Erase from the map.
175 Map.erase(I->first);
186 // Erase trailing entries in the vector
[all...] |
| PriorityWorklist.h | 112 M.erase(back());
124 /// Erase an item from the worklist.
127 bool erase(const T& X) { function in class:llvm::PriorityWorklist
140 M.erase(I);
144 /// Erase items from the set vector based on a predicate function.
150 /// V.erase(std::remove_if(V.begin(), V.end(), P), V.end());
166 V.erase(E, V.end());
180 /// call M.erase(x) on each element which is slated for removal. This just
198 M.erase(Arg);
|
| TinyPtrVector.h | 261 iterator erase(iterator I) { function in class:llvm::TinyPtrVector
262 assert(I >= begin() && "Iterator to erase is out of bounds.");
270 // multiple items in a vector; just do the erase, there is no
272 return Vec->erase(I);
277 iterator erase(iterator S, iterator E) { function in namespace:llvm
278 assert(S >= begin() && "Range to erase is out of bounds.");
279 assert(S <= E && "Trying to erase invalid range.");
280 assert(E <= end() && "Trying to erase past the end.");
286 return Vec->erase(S, E);
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.cpp | 37 DLList::Iterator::erase() function in class:nv50_ir::DLList::Iterator
|
| /external/parameter-framework/asio-1.10.6/include/asio/detail/ |
| hash_map.hpp | 167 // Erase an entry from the map.
168 void erase(iterator it) function in class:asio::detail::hash_map
187 // Erase a key from the map.
188 void erase(const K& k) function in class:asio::detail::hash_map
192 erase(it);
283 // Erase an element from the values list by splicing it to the spares list.
|
| /external/skia/include/core/ |
| SkPixmap.h | 693 bool erase(SkColor color, const SkIRect& subset) const;
702 bool erase(SkColor color) const { return this->erase(color, this->bounds()); } function in class:SkPixmap
713 bool erase(const SkColor4f& color, const SkIRect* subset = nullptr) const;
|
| /external/skqp/include/core/ |
| SkPixmap.h | 700 bool erase(SkColor color, const SkIRect& subset) const;
709 bool erase(SkColor color) const { return this->erase(color, this->bounds()); } function in class:SkPixmap
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| DenseSet.h | 47 bool erase(const ValueT &V) { function in class:llvm::DenseSet
48 return TheMap.erase(V);
112 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::DenseSet
113 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::DenseSet
|
