| /external/llvm/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
|
| /external/llvm/lib/Target/Hexagon/ |
| RDFDeadCode.cpp | 37 Set.erase(V);
165 // Erase the nodes given in the Nodes set from DFG. In addition to removing
168 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { function in class:DeadCodeElimination
|
| /external/swiftshader/src/OpenGL/compiler/ |
| InfoSink.h | 101 void erase() { sink.clear(); } function in class:TInfoSinkBase
|
| /external/swiftshader/third_party/LLVM/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
|
| /libcore/ojluni/src/lambda/java/java/lang/invoke/ |
| MethodType.java | 79 public MethodType erase() { return null; } method in class:MethodType
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/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/darwin-x86/clang-4393122/include/clang/AST/ |
| ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/darwin-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/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/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-4053586/prebuilt_include/llvm/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-4393122/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-4393122/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);
|
