/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which 46 /// \li \c L.erase(L.begin()); 151 void pop_front() { erase(begin()); } 154 void pop_back() { erase(--end()); } 182 /// \see \a erase() for removing by iterator. 197 iterator erase(iterator I) { function in class:llvm::simple_ilist 206 iterator erase(iterator First, iterator Last) { function in class:llvm::simple_ilist 215 erase(I);
|
/prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/AST/ |
UnresolvedSet.h | 109 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl 111 void erase(iterator I) { *I.I = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
|
/prebuilts/clang/host/darwin-x86/clang-4579689/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);
|
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
AllocatorList.h | 205 iterator erase(iterator I) { function in class:llvm::AllocatorList 209 iterator erase(iterator First, iterator Last) { function in class:llvm::AllocatorList
|
DenseSet.h | 95 bool erase(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 96 return TheMap.erase(V); 184 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::detail::DenseSetImpl 185 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::detail::DenseSetImpl
|
MapVector.h | 152 Map.erase(Pos); 163 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { function in class:llvm::MapVector 164 Map.erase(Iterator->first); 165 auto Next = Vector.erase(Iterator); 182 size_type erase(const KeyT &Key) { function in class:llvm::MapVector 186 erase(Iterator); 192 /// Erase all elements that match \c Pred in a single pass. Takes linear 203 // Erase from the map. 204 Map.erase(I->first); 215 // Erase trailing entries in the vector [all...] |
TinyPtrVector.h | 272 iterator erase(iterator I) { function in class:llvm::TinyPtrVector 273 assert(I >= begin() && "Iterator to erase is out of bounds."); 281 // multiple items in a vector; just do the erase, there is no 283 return Vec->erase(I); 288 iterator erase(iterator S, iterator E) { function in namespace:llvm 289 assert(S >= begin() && "Range to erase is out of bounds."); 290 assert(S <= E && "Trying to erase invalid range."); 291 assert(E <= end() && "Trying to erase past the end."); 297 return Vec->erase(S, E);
|
simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which 46 /// \li \c L.erase(L.begin()); 151 void pop_front() { erase(begin()); } 154 void pop_back() { erase(--end()); } 182 /// \see \a erase() for removing by iterator. 197 iterator erase(iterator I) { function in class:llvm::simple_ilist 206 iterator erase(iterator First, iterator Last) { function in class:llvm::simple_ilist 215 erase(I);
|
/prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/AST/ |
UnresolvedSet.h | 109 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl 111 void erase(iterator I) { *I.I = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
|
/prebuilts/clang/host/darwin-x86/clang-4630689/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);
|
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
AllocatorList.h | 205 iterator erase(iterator I) { function in class:llvm::AllocatorList 209 iterator erase(iterator First, iterator Last) { function in class:llvm::AllocatorList
|
DenseSet.h | 95 bool erase(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 96 return TheMap.erase(V); 184 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::detail::DenseSetImpl 185 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::detail::DenseSetImpl
|
MapVector.h | 152 Map.erase(Pos); 163 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { function in class:llvm::MapVector 164 Map.erase(Iterator->first); 165 auto Next = Vector.erase(Iterator); 182 size_type erase(const KeyT &Key) { function in class:llvm::MapVector 186 erase(Iterator); 192 /// Erase all elements that match \c Pred in a single pass. Takes linear 203 // Erase from the map. 204 Map.erase(I->first); 215 // Erase trailing entries in the vector [all...] |
TinyPtrVector.h | 272 iterator erase(iterator I) { function in class:llvm::TinyPtrVector 273 assert(I >= begin() && "Iterator to erase is out of bounds."); 281 // multiple items in a vector; just do the erase, there is no 283 return Vec->erase(I); 288 iterator erase(iterator S, iterator E) { function in namespace:llvm 289 assert(S >= begin() && "Range to erase is out of bounds."); 290 assert(S <= E && "Trying to erase invalid range."); 291 assert(E <= end() && "Trying to erase past the end."); 297 return Vec->erase(S, E);
|
simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which 46 /// \li \c L.erase(L.begin()); 151 void pop_front() { erase(begin()); } 154 void pop_back() { erase(--end()); } 182 /// \see \a erase() for removing by iterator. 197 iterator erase(iterator I) { function in class:llvm::simple_ilist 206 iterator erase(iterator First, iterator Last) { function in class:llvm::simple_ilist 215 erase(I);
|
/prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/AST/ |
UnresolvedSet.h | 109 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl 111 void erase(iterator I) { *I.I = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
|
/prebuilts/clang/host/darwin-x86/clang-4639204/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);
|
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
AllocatorList.h | 205 iterator erase(iterator I) { function in class:llvm::AllocatorList 209 iterator erase(iterator First, iterator Last) { function in class:llvm::AllocatorList
|
DenseSet.h | 95 bool erase(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 96 return TheMap.erase(V); 184 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::detail::DenseSetImpl 185 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::detail::DenseSetImpl
|
MapVector.h | 152 Map.erase(Pos); 163 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { function in class:llvm::MapVector 164 Map.erase(Iterator->first); 165 auto Next = Vector.erase(Iterator); 182 size_type erase(const KeyT &Key) { function in class:llvm::MapVector 186 erase(Iterator); 192 /// Erase all elements that match \c Pred in a single pass. Takes linear 203 // Erase from the map. 204 Map.erase(I->first); 215 // Erase trailing entries in the vector [all...] |
TinyPtrVector.h | 272 iterator erase(iterator I) { function in class:llvm::TinyPtrVector 273 assert(I >= begin() && "Iterator to erase is out of bounds."); 281 // multiple items in a vector; just do the erase, there is no 283 return Vec->erase(I); 288 iterator erase(iterator S, iterator E) { function in namespace:llvm 289 assert(S >= begin() && "Range to erase is out of bounds."); 290 assert(S <= E && "Trying to erase invalid range."); 291 assert(E <= end() && "Trying to erase past the end."); 297 return Vec->erase(S, E);
|
simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which 46 /// \li \c L.erase(L.begin()); 151 void pop_front() { erase(begin()); } 154 void pop_back() { erase(--end()); } 182 /// \see \a erase() for removing by iterator. 197 iterator erase(iterator I) { function in class:llvm::simple_ilist 206 iterator erase(iterator First, iterator Last) { function in class:llvm::simple_ilist 215 erase(I);
|
/prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/AST/ |
UnresolvedSet.h | 109 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl 111 void erase(iterator I) { *I.I = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
|
/prebuilts/clang/host/darwin-x86/clang-4691093/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);
|
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
AllocatorList.h | 205 iterator erase(iterator I) { function in class:llvm::AllocatorList 209 iterator erase(iterator First, iterator Last) { function in class:llvm::AllocatorList
|