/external/stlport/src/ |
H A D | messages.cpp | 54 void _Catalog_locale_map::erase(nl_catd_type key) { function in class:_Catalog_locale_map 56 M->erase(key); 89 void _Catalog_nl_catd_map::erase(messages_base::catalog cat) { function in class:_Catalog_nl_catd_map 92 Mr.erase((*mit).second); 93 M.erase(mit); 180 if (_M_map) _M_map->erase(_STLP_MUTABLE(_Messages_impl, _M_cat)[thecat]); 181 _STLP_MUTABLE(_Messages_impl, _M_cat).erase( thecat );
|
/external/stlport/stlport/stl/ |
H A D | _bvector.h | 603 erase(begin() + __n, end()); 631 erase(__cur, end()); 641 erase(_STLP_STD::copy(__first, __last, begin()), end()); 790 iterator erase(iterator __position) { function in class:__BVECTOR_QUALIFIED 796 iterator erase(iterator __first, iterator __last) { function in class:__BVECTOR_QUALIFIED 802 erase(begin() + difference_type(__new_size), end()); 811 void clear() { erase(begin(), end()); }
|
H A D | _deque.h | 593 erase(begin() + __n, end()); 628 erase(__cur, end()); 646 erase(_STLP_STD::copy(__first, __last, begin()), end()); 660 erase(_STLP_STD::copy(__first, __last, begin()), end()); 818 erase(this->_M_start + __new_size, this->_M_finish); 835 iterator erase(iterator __pos) { function in class:deque 841 iterator erase(iterator __first, iterator __last) { function in class:deque
|
H A D | _hash_map.h | 218 size_type erase(const _KT& __key) {return _M_ht.erase(__key); } function in class:hash_map 219 void erase(iterator __it) { _M_ht.erase(__it); } function in class:hash_map 220 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function in class:hash_map 403 size_type erase(const _KT& __key) {return _M_ht.erase(__key); } function in class:hash_multimap 404 void erase(iterator __it) { _M_ht.erase(__i function in class:hash_multimap 405 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function in class:hash_multimap [all...] |
H A D | _hash_set.h | 212 size_type erase(const _KT& __key) {return _M_ht.erase(__key); } function in class:hash_set 213 void erase(iterator __it) { _M_ht.erase(__it); } function in class:hash_set 214 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function in class:hash_set 394 size_type erase(const _KT& __key) {return _M_ht.erase(__key); } function in class:hash_multiset 395 void erase(iterator __it) { _M_ht.erase(__i function in class:hash_multiset 396 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function in class:hash_multiset [all...] |
H A D | _hashtable.c | 263 ::erase(const key_type& __key) { function in class:_All 303 ::erase(const_iterator __it) { function in class:_All 334 ::erase(const_iterator __first, const_iterator __last) { function in class:_All
|
H A D | _list.h | 518 iterator erase(iterator __pos) { function in class:list 529 iterator erase(iterator __first, iterator __last) { function in class:list 531 erase(__first++); 543 void pop_front() { erase(begin()); } 546 erase(--__tmp); 582 erase(__first1, __last1); 593 erase(__first1, __last1); 619 __x.erase(__i); 629 __x.erase(__first, __last); 640 if (__val == *__first) erase(__firs [all...] |
H A D | _map.h | 187 // insert/erase 203 void erase(iterator __pos) { _M_t.erase(__pos); } function in class:map 204 size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); } function in class:map 205 void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last); } function in class:map 365 // insert/erase 378 void erase(iterator __pos) { _M_t.erase(__pos); } function in class:multimap 379 size_type erase(cons function in class:multimap 380 void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last); } function in class:multimap [all...] |
H A D | _rope.h | 1859 void erase(size_t __p, size_t __n) { function in class:rope 1865 void erase(size_t __p) { function in class:rope 1866 erase(__p, __p + 1); 1931 // Iterator and range variants of erase 1932 iterator erase(const iterator& __p, const iterator& __q) { function in class:rope 1934 erase(__p_index, __q.index() - __p_index); 1937 iterator erase(const iterator& __p) { function in class:rope 1939 erase(__p_index, 1);
|
H A D | _set.h | 167 // insert/erase 182 void erase(iterator __pos) { _M_t.erase( __pos ); } function in class:set 183 size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); } function in class:set 184 void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last ); } function in class:set 338 // insert/erase 354 void erase(iterator __pos) { _M_t.erase( __pos ); } function in class:multiset 355 size_type erase(cons function in class:multiset 356 void erase(iterator __first, iterator __last) { _M_t.erase( __first, __last ); } function in class:multiset [all...] |
H A D | _slist.h | 676 iterator erase(iterator __pos) function in class:slist 678 iterator erase(iterator __first, iterator __last) function in class:slist 760 __x.erase(__i); 775 __x.erase(__first, __last);
|
H A D | _string.h | 406 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.h | 164 //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.h | 291 _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.h | 457 // 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.h | 170 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.h | 156 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.h | 353 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.h | 284 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.h | 276 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.h | 368 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.h | 491 _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.h | 269 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.h | 362 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.h | 237 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); }
|