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

1234

/external/stlport/stlport/stl/
H A D_string.h406 erase(begin() + __n, end());
585 erase(__cur, this->end());
788 _Self& erase(size_type __pos = 0, size_type __n = npos) { function in class:basic_string
791 erase(begin() + __pos, begin() + __pos + (min) (__n, size() - __pos));
795 iterator erase(iterator __pos) { function in class:basic_string
802 iterator erase(iterator __first, iterator __last) { function in class:basic_string
812 // to erase followed by insert.)
H A D_string_sum.h164 //erase
165 _BString& erase(size_type __pos = 0, size_type __n =_BString::npos) {return _M_get_storage().erase(__pos, __n);} function in class:__bstr_sum
H A D_string_workaround.h291 _Base::erase(__cur, this->_M_Finish());
455 _Self& erase(size_type __pos = 0, size_type __n = npos) { function in class:basic_string
456 _Base::erase(__pos, __n);
460 iterator erase(iterator __pos) { function in class:basic_string
462 return _Base::erase(__pos);
465 iterator erase(iterator __first, iterator __last) { function in class:basic_string
467 return _Base::erase(__first, __last);
471 // to erase followed by insert.)
H A D_tree.h457 // insert/erase
492 void erase(iterator __pos) { function in class:_Rb_tree
502 size_type erase(const key_type& __x) { function in class:_Rb_tree
505 erase(__p.first, __p.second);
512 erase(__i);
518 void erase(iterator __first, iterator __last) { function in class:_Rb_tree
523 while (__first != __last) erase(__first++);
526 void erase(const key_type* __first, const key_type* __last) { function in class:_Rb_tree
527 while (__first != __last) erase(*__first++);
H A D_unordered_map.h170 size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function in class:unordered_map
171 void erase(const_iterator __it) { _M_ht.erase(__it); } function in class:unordered_map
172 void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); } function in class:unordered_map
330 size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function in class:unordered_multimap
331 void erase(const_iterator __it) { _M_ht.erase(__i function in class:unordered_multimap
332 void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); } function in class:unordered_multimap
[all...]
H A D_unordered_set.h156 size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function in class:unordered_set
157 void erase(const_iterator __it) { _M_ht.erase(__it); } function in class:unordered_set
158 void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); } function in class:unordered_set
306 size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function in class:unordered_multiset
307 void erase(const_iterator __it) { _M_ht.erase(__i function in class:unordered_multiset
308 void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); } function in class:unordered_multiset
[all...]
H A D_vector.h353 erase(__cur, end());
596 //There is more elements to erase than element to move:
601 //There is more element to move than element to erase:
620 iterator erase(iterator __pos) { function in class:vector
626 iterator erase(iterator __first, iterator __last) { function in class:vector
641 erase(begin() + __new_size, end());
651 erase(begin(), end());
/external/stlport/stlport/stl/debug/
H A D_hashtable.h284 size_type erase(const key_type& __key) { function in class:hashtable
288 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator);
292 void erase(const const_iterator& __it) { function in class:hashtable
296 _M_non_dbg_impl.erase(__it._M_iterator);
298 void erase(const_iterator __first, const_iterator __last) { function in class:hashtable
302 _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator);
H A D_list.h276 iterator erase(iterator __pos) { function in class:list
280 return iterator(&_M_iter_list,_M_non_dbg_impl.erase(__pos._M_iterator));
282 iterator erase(iterator __first, iterator __last) { function in class:list
285 return iterator (&_M_iter_list, _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator));
298 erase(iterator(&_M_iter_list, __i), end());
346 _M_non_dbg_impl.erase(__first);
422 _M_non_dbg_impl.erase(__next);
442 _M_non_dbg_impl.erase(__first);
456 _M_non_dbg_impl.erase(__next);
H A D_slist.h368 iterator erase(iterator __pos) { function in class:slist
373 return iterator(&_M_iter_list, _M_non_dbg_impl.erase(__pos._M_iterator));
375 iterator erase(iterator __first, iterator __last) { function in class:slist
378 return iterator(&_M_iter_list, _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator));
509 _M_non_dbg_impl.erase(__first);
521 _M_non_dbg_impl.erase(__next);
558 _M_non_dbg_impl.erase(__first);
572 _M_non_dbg_impl.erase(__next);
H A D_string.h491 _Self& erase(size_type __pos = 0, size_type __n = npos) { function in class:basic_string
495 _M_non_dbg_impl.erase(__pos, __n);
498 iterator erase(iterator __pos) { function in class:basic_string
502 return iterator(&_M_iter_list, _M_non_dbg_impl.erase(__pos._M_iterator));
504 iterator erase(iterator __f, iterator __l) { function in class:basic_string
507 return iterator(&_M_iter_list, _M_non_dbg_impl.erase(__f._M_iterator, __l._M_iterator));
514 // Replace. (Conceptually equivalent to erase followed by insert.)
H A D_tree.h269 void erase(iterator __pos) { function in class:_Rb_tree
273 _M_non_dbg_impl.erase(__pos._M_iterator);
275 size_type erase(const key_type& __x) { function in class:_Rb_tree
279 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator);
286 _M_non_dbg_impl.erase(__i);
292 void erase(iterator __first, iterator __last) { function in class:_Rb_tree
295 _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator);
297 void erase(const key_type* __first, const key_type* __last) { function in class:_Rb_tree
298 while (__first != __last) erase(*__first++);
/external/stlport/stlport/stl/pointers/
H A D_deque.h362 iterator erase(iterator __pos) function in class:deque
363 { return ite_cast_traits::to_value_type_ite(_M_impl.erase(ite_cast_traits::to_storage_type_ite(__pos))); }
365 iterator erase(iterator __first, iterator __last) function in class:deque
366 { return ite_cast_traits::to_value_type_ite(_M_impl.erase(ite_cast_traits::to_storage_type_ite(__first),
H A D_list.h237 iterator erase(iterator __pos) function in class:list
238 { return iterator(_M_impl.erase(_BaseIte(__pos._M_node))._M_node); }
239 iterator erase(iterator __first, iterator __last) function in class:list
240 { return iterator(_M_impl.erase(_BaseIte(__first._M_node), _BaseIte(__last._M_node))._M_node); }
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);

Completed in 377 milliseconds

1234