Searched defs:erase (Results 26 - 50 of 97) sorted by path

1234

/external/chromium_org/third_party/skia/samplecode/
H A DSampleFatBits.cpp34 static void erase(SkSurface* surface) { function
172 erase(fMaxSurface);
281 erase(fMinSurface);
316 erase(fMinSurface);
362 erase(fMinSurface);
/external/chromium_org/third_party/webrtc/system_wrappers/interface/
H A Dscoped_vector.h123 iterator erase(iterator position) { function in class:webrtc::ScopedVector
125 return v_.erase(position);
128 iterator erase(iterator first, iterator last) { function in class:webrtc::ScopedVector
130 return v_.erase(first, last);
133 // Like |erase()|, but doesn't delete the element at |position|.
135 return v_.erase(position);
138 // Like |erase()|, but doesn't delete the elements in [first, last).
140 return v_.erase(first, last);
/external/clang/include/clang/AST/
H A DASTUnresolvedSet.h67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
H A DExternalASTSource.h623 void erase(iterator From, iterator To) { function in class:clang::LazyVector
625 Loaded.erase(Loaded.end() + From.Position, Loaded.end() + To.Position);
630 Loaded.erase(Loaded.end() + From.Position, Loaded.end());
634 Local.erase(Local.begin() + From.Position, Local.begin() + To.Position);
H A DUnresolvedSet.h143 void erase(unsigned I) { decls()[I] = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
145 void erase(iterator I) { *I.ir = decls().pop_back_val(); } function in class:clang::UnresolvedSetImpl
/external/clang/include/clang/Rewrite/Core/
H A DRewriteRope.h179 void erase(unsigned Offset, unsigned NumBytes);
232 void erase(unsigned Offset, unsigned NumBytes) { function in class:clang::RewriteRope
233 assert(Offset+NumBytes <= size() && "Invalid region to erase!");
235 Chunks.erase(Offset, NumBytes);
/external/clang/include/clang/Sema/
H A DLookup.h584 void erase() { function in class:clang::LookupResult::Filter
585 Results.Decls.erase(--I);
726 void erase(NamedDecl *D) { function in class:clang::ADLResult
727 Decls.erase(cast<NamedDecl>(D->getCanonicalDecl()));
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h419 bool erase(ExplodedNode *N) { return Impl.erase(N); } function in class:clang::ento::ExplodedNodeSet
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.jface_3.6.1.M20100825-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.ui.workbench_3.6.1.M20101117-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/guava/guava/src/com/google/common/collect/
H A DArrayTable.java50 * #erase} and {@link #eraseAll} methods may be used instead.
392 * Not supported. Use {@link #erase} instead.
395 * @deprecated Use {@link #erase}
415 public V erase(@Nullable Object rowKey, @Nullable Object columnKey) { method in class:ArrayTable
/external/libcxx/test/support/
H A Dnasty_containers.hpp116 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/libvterm/include/
H A Dvterm.h183 int (*erase)(VTermRect rect, int selective, void *user); member in struct:__anon25014
/external/libvterm/src/
H A Dscreen.c288 static int erase(VTermRect rect, int selective, void *user) function
432 * erase that sends a damage anyway
575 .erase = &erase,
H A Dstate.c48 static void erase(VTermState *state, VTermRect rect, int selective) function
50 if(state->callbacks && state->callbacks->erase)
51 if((*state->callbacks->erase)(rect, selective, state->cbdata))
91 state->callbacks->moverect, state->callbacks->erase, state->cbdata);
949 erase(state, rect, selective);
954 erase(state, rect, selective);
961 erase(state, rect, selective);
966 erase(state, rect, selective);
972 erase(state, rect, selective);
996 erase(stat
[all...]
/external/llvm/include/llvm/ADT/
H A DDenseMap.h189 bool erase(const KeyT &Val) { function in class:llvm::DenseMapBase
200 void erase(iterator I) { function in class:llvm::DenseMapBase
H A DDenseSet.h53 bool erase(const ValueT &V) { function in class:llvm::DenseSet
54 return TheMap.erase(V);
113 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::DenseSet
114 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::DenseSet
H A DIntervalMap.h16 // individual keys, and insert and erase operations use key intervals as well.
94 // void erase();
258 /// erase - Erase elements [i;j).
259 /// @param i Beginning of the range to erase.
262 void erase(unsigned i, unsigned j, unsigned Size) { function in class:llvm::IntervalMapImpl::NodeBase
266 /// erase - Erase element at i.
267 /// @param i Index of element to erase.
269 void erase(unsigned i, unsigned Size) { function in class:llvm::IntervalMapImpl::NodeBase
270 erase(i, i+1, Size);
288 erase(
[all...]
H A DMapVector.h123 Map.erase(Pos);
130 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { function in class:llvm::MapVector
132 Map.erase(MapIterator);
133 return Vector.erase(Iterator);
H A DSmallSet.h90 bool erase(const T &V) { function in class:llvm::SmallSet
92 return Set.erase(V);
95 Vector.erase(I);
H A DSmallVector.h450 iterator erase(iterator I) { function in class:llvm::SmallVectorImpl
451 assert(I >= this->begin() && "Iterator to erase is out of bounds.");
462 iterator erase(iterator S, iterator E) { function in class:llvm::SmallVectorImpl
463 assert(S >= this->begin() && "Range to erase is out of bounds.");
464 assert(S <= E && "Trying to erase invalid range.");
465 assert(E <= this->end() && "Trying to erase past the end.");
H A DStringMap.h379 /// erase it. This aborts if the key is not in the map.
384 void erase(iterator I) { function in class:llvm::StringMap
390 bool erase(StringRef Key) { function in class:llvm::StringMap
393 erase(I);
H A DTinyPtrVector.h214 iterator erase(iterator I) { function in class:llvm::TinyPtrVector
215 assert(I >= begin() && "Iterator to erase is out of bounds.");
223 // multiple items in a vector; just do the erase, there is no
225 return Vec->erase(I);
230 iterator erase(iterator S, iterator E) { function in namespace:llvm
231 assert(S >= begin() && "Range to erase is out of bounds.");
232 assert(S <= E && "Trying to erase invalid range.");
233 assert(E <= end() && "Trying to erase past the end.");
239 return Vec->erase(S, E);
H A Dilist.h464 // erase - remove a node from the controlled sequence... and delete it.
465 iterator erase(iterator where) { function in class:llvm::iplist
544 iterator erase(iterator first, iterator last) { function in class:llvm::iplist
546 first = erase(first);
550 void clear() { if (Head) erase(begin(), end()); }
557 erase(begin());
561 iterator t = end(); erase(--t);
590 // they actually do the job of erase, rename them accordingly.
592 void erase(const NodeTy &val) { function in class:llvm::iplist
595 if (*I == val) erase(
[all...]
/external/llvm/include/llvm/Analysis/
H A DTrace.h104 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

Completed in 541 milliseconds

1234