/external/chromium_org/chrome/browser/sync_file_system/ |
H A D | subtree_set.cc | 70 bool SubtreeSet::erase(const base::FilePath& subtree_root) { function in class:sync_file_system::SubtreeSet 82 inclusive_ancestors_of_subtree_roots_.erase(found); 98 inclusive_ancestors_of_subtree_roots_.erase(found);
|
/external/llvm/include/llvm/Support/ |
H A D | ThreadLocal.h | 57 // erase - Removes the pointer associated with the current thread. 58 void erase() { removeInstance(); } function in class:llvm::sys::ThreadLocal
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
H A D | __init__.py | 52 erase = _singleton_method('erase') variable
|
H A D | data.py | 93 def erase(self): member in class:CoverageData
|
H A D | control.py | 392 def erase(self): member in class:coverage 400 self.data.erase()
|
/external/llvm/include/llvm/ADT/ |
H A D | SmallSet.h | 90 bool erase(const T &V) { function in class:llvm::SmallSet 92 return Set.erase(V); 95 Vector.erase(I);
|
H A D | MapVector.h | 123 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 D | TinyPtrVector.h | 214 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);
|
/external/llvm/include/llvm/IR/ |
H A D | TypeFinder.h | 56 iterator erase(iterator I, iterator E) { return StructTypes.erase(I, E); } function in class:llvm::TypeFinder
|
/external/stlport/test/unit/ |
H A D | slist_test.cpp | 38 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 D | deque_test.cpp | 26 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 D | list_test.cpp | 25 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());
|
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | InfoSink.h | 94 void erase() { sink.clear(); } function in class:TInfoSinkBase
|
/external/chromium_org/base/containers/ |
H A D | scoped_ptr_hash_map.h | 62 void erase(iterator it) { function in class:base::ScopedPtrHashMap 64 data_.erase(it); 67 size_t erase(const Key& k) { function in class:base::ScopedPtrHashMap 71 erase(it); 99 data_.erase(it);
|
/external/chromium_org/content/browser/indexed_db/ |
H A D | list_set.h | 40 void erase(const T& elem) { function in class:list_set 43 set_.erase(elem); 47 list_.erase(it);
|
/external/chromium_org/net/base/ |
H A D | linked_hash_map.h | 117 size_type erase(const Key& key) { function in class:linked_hash_map 121 list_.erase(found->second); 122 map_.erase(found); 130 void erase(iterator position) { function in class:linked_hash_map 135 list_.erase(position); 136 map_.erase(found); 140 void erase(iterator first, iterator last) { function in class:linked_hash_map 142 erase(first++);
|
/external/clang/include/clang/AST/ |
H A D | ASTUnresolvedSet.h | 67 void erase(unsigned I) { Decls[I] = Decls.pop_back_val(); } function in class:clang::ASTUnresolvedSet
|
/external/llvm/include/llvm/Analysis/ |
H A D | Trace.h | 104 iterator erase(iterator q) { return BasicBlocks.erase (q); } function in class:llvm::Trace 105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } function in class:llvm::Trace
|
/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/chromium_org/base/memory/ |
H A D | scoped_vector.h | 113 iterator erase(iterator position) { function in class:ScopedVector 115 return v_.erase(position); 118 iterator erase(iterator first, iterator last) { function in class:ScopedVector 120 return v_.erase(first, last); 123 // Like |erase()|, but doesn't delete the element at |position|. 125 return v_.erase(position); 128 // Like |erase()|, but doesn't delete the elements in [first, last). 130 return v_.erase(first, last);
|
/external/chromium_org/chrome/browser/password_manager/ |
H A D | password_store_x_unittest.cc | 122 erase(i--); 133 erase(i--); 148 erase(i--); 177 void erase(size_t index) { function in class:__anon4384::MockBackend
|
/external/chromium_org/extensions/browser/api/ |
H A D | api_resource_manager.h | 249 it->second.erase(api_resource_id); 250 api_resource_map_.erase(api_resource_id); 359 bool erase = false; local 361 erase = true; 365 erase = (resource && !resource->IsPersistent()); 368 if (erase) { 369 api_resource_map_.erase(*it); 370 resource_ids.erase(it++); 378 extension_resource_map_.erase(extension_id);
|
/external/chromium_org/extensions/common/permissions/ |
H A D | base_set_operators.h | 257 size_t erase(ElementIDType id) { function in class:extensions::BaseSetOperators 258 return map().erase(id);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_util.cpp | 37 DLList::Iterator::erase() function in class:nv50_ir::DLList::Iterator
|
/external/chromium_org/third_party/re2/util/ |
H A D | sparse_array.h | 88 // array through a call to erase(), erase_existing() or resize(). They 193 // m.erase(i->index()); 204 inline void erase(int i); 390 void SparseArray<Value>::erase(int i) { function in class:re2::SparseArray
|