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

1234

/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 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/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/llvm/include/llvm/ADT/
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...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_util.cpp37 DLList::Iterator::erase() function in class:nv50_ir::DLList::Iterator
/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/stlport/stlport/stl/
H A D_map.h187 // 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_set.h167 // 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_hash_map.h218 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.h212 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.c263 ::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_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_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...]
/external/stlport/stlport/stl/debug/
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_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++);
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_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);
/external/stlport/stlport/stl/pointers/
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 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);
/external/chromium_org/base/containers/
H A Dsmall_map.h98 // on any call to erase(), insert() and operator[].
513 void erase(const iterator& position) { function in class:base::SmallMap
523 map_->erase(position.hash_iter_);
527 size_t erase(const key_type& key) { function in class:base::SmallMap
530 erase(iter);
/external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_manager/
H A Dpopup.js39 setProperty('.erase', 'title', 'eraseTitle');
226 item.getElement('erase').onclick = function() {
227 item.erase();
329 item.getElement('erase').hidden = in_progress;
475 DownloadItem.prototype.erase = function() {
476 chrome.downloads.erase({id: this.id});
657 item.erase();
/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

Completed in 399 milliseconds

1234