Searched defs:erase (Results 26 - 50 of 97) sorted by last modified time

1234

/external/stlport/stlport/stl/pointers/
H A D_set.h227 // insert/erase
253 void erase(iterator __pos) function in class:set
254 { _M_t.erase(_S_to_storage_ite(__pos)); }
255 size_type erase(const key_type& __x) function in class:set
257 void erase(iterator __first, iterator __last) function in class:set
258 { _M_t.erase(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); }
480 // insert/erase
507 void erase(iterator __pos) function in class:multiset
508 { _M_t.erase(_S_to_storage_ite(__pos)); }
509 size_type erase(cons function in class:multiset
511 void erase(iterator __first, iterator __last) function in class:multiset
[all...]
H A D_slist.h347 iterator erase(iterator __pos) function in class:slist
348 { return iterator(_M_impl.erase(_BaseIte(__pos._M_node))._M_node); }
349 iterator erase(iterator __first, iterator __last) function in class:slist
350 { return iterator(_M_impl.erase(_BaseIte(__first._M_node), _BaseIte(__last._M_node))._M_node); }
H A D_vector.h210 iterator erase(iterator __pos) function in class:vector
211 {return cast_traits::to_value_type_ptr(_M_impl.erase(cast_traits::to_storage_type_ptr(__pos)));}
212 iterator erase(iterator __first, iterator __last) { function in class:vector
213 return cast_traits::to_value_type_ptr(_M_impl.erase(cast_traits::to_storage_type_ptr(__first),
/external/stlport/test/unit/
H A Ddeque_test.cpp26 CPPUNIT_TEST(erase);
38 void erase();
278 void DequeTest::erase() function in class:DequeTest
292 dint.erase(dint.begin());
298 dint.erase(dint.end() - 1);
307 dint.erase(dint.begin(), dint.begin() + 2);
313 dint.erase(dint.end() - 2, dint.end());
H A Dlist_test.cpp25 CPPUNIT_TEST(erase);
40 void erase();
174 void ListTest::erase() function in class:ListTest
178 l.erase(l.begin());
184 lit = l.erase(l.begin());
187 lit = l.erase(l.begin(), --l.end());
H A Dset_test.cpp22 CPPUNIT_TEST(erase);
39 void erase();
64 size_t count = s.erase(42);
94 void SetTest::erase() function in class:SetTest
98 s.erase(s.begin());
101 size_t nb = s.erase(1);
H A Dslist_test.cpp38 CPPUNIT_TEST(erase);
46 void erase();
123 void SlistTest::erase() function in class:SlistTest
130 slit = sl.erase(sl.begin());
134 slit = sl.erase(sl.begin(), slit);
H A Dstring_test.cpp54 CPPUNIT_TEST(erase);
113 void erase();
325 void StringTest::erase() function in class:StringTest
331 str.erase(str.begin() + 1, str.end() - 1); // Erase all but first and last.
348 str.erase(str.begin()); // Erase first element.
349 str.erase(str.end() - 1); // Erase last element.
357 str.erase(1, str.size() - 1); // Erase all but first and last.
371 str.erase(1);
/external/skia/samplecode/
H A DSampleFatBits.cpp34 static void erase(SkSurface* surface) { function
173 erase(fMaxSurface);
282 erase(fMinSurface);
317 erase(fMinSurface);
363 erase(fMinSurface);
/external/regex-re2/util/
H A Dsparse_array.h88 // 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/owasp/sanitizer/distrib/lib/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/owasp/sanitizer/lib/guava-libraries/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/mksh/src/
H A Dedit.c48 int erase; member in struct:__anon28011
3292 edchars.erase = tty_state.c_cc[VERASE];
3303 if (edchars.erase == _POSIX_VDISABLE)
3304 edchars.erase = -1;
3317 if (edchars.erase >= 0) {
3318 bind_if_not_bound(0, edchars.erase, XFUNC_del_back);
3319 bind_if_not_bound(1, edchars.erase, XFUNC_del_bword);
3748 } else if (ch == edchars.erase || ch == CTRL('h')) {
3918 if (ch == edchars.erase || ch == CTRL('h')) {
5464 edchars.erase
[all...]
/external/mesa3d/include/GL/
H A Dvms_x_fix.h1103 #define sys$erase SYS$ERASE
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_util.cpp37 DLList::Iterator::erase() function in class:nv50_ir::DLList::Iterator
H A Dnv50_ir_util.h103 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/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...]

Completed in 412 milliseconds

1234