HomeSort by relevance Sort by last modified time
    Searched defs:erase (Results 276 - 300 of 741) sorted by null

<<11121314151617181920>>

  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/debug/
set.h 220 erase(iterator __position) function in class:std::__debug::set
224 _Base::erase(__position.base());
228 erase(const key_type& __x) function in class:std::__debug::set
236 _Base::erase(__victim.base());
242 erase(iterator __first, iterator __last) function in class:std::__debug::set
249 this->erase(__first++);
265 { this->erase(begin(), end()); }
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_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(__it); function in class:hash_multimap
405 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function in class:hash_multimap
    [all...]
_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(__it); function in class:hash_multiset
396 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function in class:hash_multiset
    [all...]
_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
_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(const key_type& __x) { return _M_t.erase(__x); function in class:multimap
380 void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last); } function in class:multimap
    [all...]
_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(const key_type& __x) { return _M_t.erase(__x); function in class:multiset
356 void erase(iterator __first, iterator __last) { _M_t.erase( __first, __last ); } function in class:multiset
    [all...]
_string_workaround.h 291 _Base::erase(__cur, this->_M_Finish());
454 public: // Erase.
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.)
_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(__it); 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...]
_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(__it); 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...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/
_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);
_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);
_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);
_string.h 490 // Erase.
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.)
_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++);
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/pointers/
_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); }
_slist.h 347 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); }
_vector.h 210 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),
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_map.h 566 erase(iterator __position) function in class:map
567 { _M_t.erase(__position); }
581 erase(const key_type& __x) function in class:map
582 { return _M_t.erase(__x); }
596 erase(iterator __first, iterator __last) function in class:map
597 { _M_t.erase(__first, __last); }
stl_multimap.h 502 erase(iterator __position) function in class:multimap
503 { _M_t.erase(__position); }
517 erase(const key_type& __x) function in class:multimap
518 { return _M_t.erase(__x); }
532 erase(iterator __first, iterator __last) function in class:multimap
533 { _M_t.erase(__first, __last); }
stl_multiset.h 386 // insert/erase
463 erase(iterator __position) function in class:multiset
464 { _M_t.erase(__position); }
478 erase(const key_type& __x) function in class:multiset
479 { return _M_t.erase(__x); }
493 erase(iterator __first, iterator __last) function in class:multiset
494 { _M_t.erase(__first, __last); }
stl_set.h 393 // insert/erase
475 erase(iterator __position) function in class:set
476 { _M_t.erase(__position); }
490 erase(const key_type& __x) function in class:set
491 { return _M_t.erase(__x); }
505 erase(iterator __first, iterator __last) function in class:set
506 { _M_t.erase(__first, __last); }
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/debug/
map.h 231 erase(iterator __position) function in class:std::__debug::map
235 _Base::erase(__position.base());
239 erase(const key_type& __x) function in class:std::__debug::map
247 _Base::erase(__victim.base());
253 erase(iterator __first, iterator __last) function in class:std::__debug::map
259 this->erase(__first++);
275 { this->erase(begin(), end()); }
multimap.h 218 erase(iterator __position) function in class:std::__debug::multimap
222 _Base::erase(__position.base());
226 erase(const key_type& __x) function in class:std::__debug::multimap
234 _Base::erase(__victim.base());
241 erase(iterator __first, iterator __last) function in class:std::__debug::multimap
247 this->erase(__first++);
263 { this->erase(begin(), end()); }
multiset.h 215 erase(iterator __position) function in class:std::__debug::multiset
219 _Base::erase(__position.base());
223 erase(const key_type& __x) function in class:std::__debug::multiset
231 _Base::erase(__victim.base());
238 erase(iterator __first, iterator __last) function in class:std::__debug::multiset
244 this->erase(__first++);
260 { this->erase(begin(), end()); }
set.h 220 erase(iterator __position) function in class:std::__debug::set
224 _Base::erase(__position.base());
228 erase(const key_type& __x) function in class:std::__debug::set
236 _Base::erase(__victim.base());
242 erase(iterator __first, iterator __last) function in class:std::__debug::set
249 this->erase(__first++);
265 { this->erase(begin(), end()); }

Completed in 415 milliseconds

<<11121314151617181920>>