/external/llvm/include/llvm/Support/ |
H A D | ThreadLocal.h | 57 // erase - Removes the pointer associated with the current thread. 58 void erase() { removeInstance(); } function in class:llvm::sys::ThreadLocal
|
/external/llvm/include/llvm/ADT/ |
H A D | SmallSet.h | 96 bool erase(const T &V) { function in class:llvm::SmallSet 98 return Set.erase(V); 101 Vector.erase(I);
|
H A D | TinyPtrVector.h | 234 iterator erase(iterator I) { function in class:llvm::TinyPtrVector 235 assert(I >= begin() && "Iterator to erase is out of bounds."); 243 // multiple items in a vector; just do the erase, there is no 245 return Vec->erase(I); 250 iterator erase(iterator S, iterator E) { function in namespace:llvm 251 assert(S >= begin() && "Range to erase is out of bounds."); 252 assert(S <= E && "Trying to erase invalid range."); 253 assert(E <= end() && "Trying to erase past the end."); 259 return Vec->erase(S, E);
|
H A D | DenseSet.h | 69 bool erase(const ValueT &V) { function in class:llvm::DenseSet 70 return TheMap.erase(V); 144 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::DenseSet 145 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::DenseSet
|
H A D | 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); 175 Map.erase(I->first); 187 Vector.erase(O, Vector.end());
|
H A D | IntervalMap.h | 16 // individual keys, and insert and erase operations use key intervals as well. 94 // void erase(); 259 /// erase - Erase elements [i;j). 260 /// @param i Beginning of the range to erase. 263 void erase(unsigned i, unsigned j, unsigned Size) { function in class:llvm::IntervalMapImpl::NodeBase 267 /// erase - Erase element at i. 268 /// @param i Index of element to erase. 270 void erase(unsigned i, unsigned Size) { function in class:llvm::IntervalMapImpl::NodeBase 271 erase(i, i+1, Size); 289 erase( [all...] |
H A D | StringMap.h | 354 /// erase it. This aborts if the key is not in the map. 359 void erase(iterator I) { function in class:llvm::StringMap 365 bool erase(StringRef Key) { function in class:llvm::StringMap 368 erase(I);
|
/external/llvm/include/llvm/IR/ |
H A D | TypeFinder.h | 57 iterator erase(iterator I, iterator E) { return StructTypes.erase(I, E); } function in class:llvm::TypeFinder
|
H A D | ValueMap.h | 168 bool erase(const KeyT &Val) { function in class:llvm::ValueMap 173 Map.erase(I); 176 void erase(iterator I) { function in class:llvm::ValueMap 177 return Map.erase(I.base()); 244 Copy.Map->Map.erase(Copy); // Definitely destroys *this. 265 Copy.Map->Map.erase(I); // Definitely destroys *this.
|
/external/clang/include/clang/AST/ |
H A D | ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
H A D | UnresolvedSet.h | 103 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl 105 void erase(iterator I) { *I.I = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
|
H A D | ExternalASTSource.h | 540 void erase(iterator From, iterator To) { function in class:clang::LazyVector 542 Loaded.erase(&*From, &*To); 547 Loaded.erase(&*From, Loaded.end()); 551 Local.erase(&*From, &*To);
|
/external/llvm/include/llvm/Analysis/ |
H A D | 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/clang/include/clang/Rewrite/Core/ |
H A D | 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/libcxx/test/support/ |
H A D | nasty_containers.hpp | 116 iterator erase(const_iterator pos) { return v_.erase(pos); } function in class:nasty_vector 117 iterator erase(const_iterator first, const_iterator last) { return v_.erase(first, last); } function in class:nasty_vector 237 iterator erase(const_iterator pos) { return l_.erase(pos); } function in class:nasty_list 238 iterator erase(const_iterator pos, const_iterator last) { return l_.erase(pos, last); } function in class:nasty_list
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_util.cpp | 37 DLList::Iterator::erase() function in class:nv50_ir::DLList::Iterator
|
H A D | nv50_ir_util.h | 103 virtual void erase() = 0; 198 // caution: if you're at end-2 and erase it, then do next, you're at end 199 virtual void erase(); 213 inline void erase(Iterator& pos) function in class:nv50_ir::DLList 215 pos.erase();
|
/external/regex-re2/util/ |
H A D | sparse_array.h | 88 // array through a call to erase(), erase_existing() or resize(). They 193 // m.erase(i->index()); 204 inline void erase(int i); 389 void SparseArray<Value>::erase(int i) { function in class:re2::SparseArray
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ArrayTable.java | 50 * #erase} and {@link #eraseAll} methods may be used instead. 499 * Not supported. Use {@link #erase} instead. 502 * @deprecated Use {@link #erase} 522 public V erase(@Nullable Object rowKey, @Nullable Object columnKey) { method in class:ArrayTable
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ArrayTable.java | 48 * #erase} and {@link #eraseAll} methods may be used instead. 475 * Not supported. Use {@link #erase} instead. 478 * @deprecated Use {@link #erase} 498 public V erase(@Nullable Object rowKey, @Nullable Object columnKey) { method in class:ArrayTable
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SROA.cpp | 241 void erase(iterator Start, iterator Stop) { Slices.erase(Start, Stop); } function in class:__anon11083::AllocaSlices 382 P.SplitTails.erase( 1016 Slices.erase(std::remove_if(Slices.begin(), Slices.end(), 1602 Indices.erase(Indices.end() - NumLayers, Indices.end()); 2044 CandidateTys.erase(std::remove_if(CandidateTys.begin(), CandidateTys.end(), 2066 CandidateTys.erase( 3625 Stores.erase( 3667 Stores.erase(std::remove_if(Stores.begin(), Stores.end(), 3676 Loads.erase(st [all...] |
/external/vixl/src/vixl/ |
H A D | invalset.h | 99 void erase(const ElementType& element); 312 void InvalSet<TEMPLATE_INVALSET_P_DEF>::erase(const ElementType& element) { function in class:vixl::InvalSet 520 vector_->erase(vector_->begin() + (first_invalid - start), vector_->end()); 556 vector_->erase(it.base(), vector_->end());
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 418 bool erase(ExplodedNode *N) { return Impl.erase(N); } function in class:clang::ento::ExplodedNodeSet
|
/external/skia/samplecode/ |
H A D | SampleFatBits.cpp | 35 static void erase(SkSurface* surface) { function 162 erase(fMaxSurface); 271 erase(fMinSurface); 306 erase(fMinSurface); 352 erase(fMinSurface);
|
/external/clang/include/clang/Sema/ |
H A D | Lookup.h | 588 void erase() { function in class:clang::LookupResult::Filter 589 Results.Decls.erase(--I); 730 void erase(NamedDecl *D) { function in class:clang::ADLResult 731 Decls.erase(cast<NamedDecl>(D->getCanonicalDecl()));
|