/external/chromium_org/components/content_settings/core/browser/ |
H A D | content_settings_origin_identifier_value_map.cc | 167 entries_[key].erase(patterns); 169 entries_.erase(key); 177 entries_.erase(key);
|
/external/chromium_org/components/sync_driver/ |
H A D | data_type_status_table.cc | 82 persistence_errors_.erase(iter.Get()); 87 return data_type_errors_.erase(type) > 0; 91 return unready_errors_.erase(type) > 0;
|
/external/chromium_org/content/browser/appcache/ |
H A D | appcache_storage.cc | 39 storage->delegate_references_.erase(delegate); 70 storage_->pending_info_loads_.erase(response_id_); 105 usage_map_.erase(origin);
|
/external/chromium_org/content/browser/indexed_db/ |
H A D | indexed_db_active_blob_registry.cc | 68 single_db.erase(blob_pair); 70 use_tracker_.erase(db_pair); 74 deleted_dbs_.erase(db_to_delete);
|
H A D | indexed_db_transaction_coordinator.cc | 35 queued_transactions_.erase(transaction); 38 started_transactions_.erase(transaction); 115 queued_transactions_.erase(transaction);
|
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/extensions/browser/ |
H A D | quota_service.cc | 83 function_heuristics_.erase(extension_id); 92 map->erase(heuristics++); 100 for (; it != function_heuristics_.end(); function_heuristics_.erase(it++))
|
/external/chromium_org/media/audio/ |
H A D | audio_output_dispatcher_impl.cc | 88 proxy_to_physical_map_.erase(it); 170 audio_stream_ids_.erase(it); 172 idle_streams_.erase(idle_streams_.begin() + keep_alive, idle_streams_.end());
|
/external/chromium_org/media/cdm/ppapi/ |
H A D | cdm_helpers.cc | 100 free_buffers_.erase(found); 120 allocated_buffers_.erase(found); 136 free_buffers_.erase(free_buffers_.begin());
|
/external/chromium_org/net/socket/ |
H A D | websocket_endpoint_lock_manager.cc | 67 socket_lock_info_map_.erase(socket_it); 110 lock_info_map_.erase(lock_info_it); 127 size_t erased = socket_lock_info_map_.erase(lock_info_it->second.socket);
|
/external/chromium_org/net/url_request/ |
H A D | url_request_throttler_manager.cc | 131 url_entries_.erase(url_id); 182 url_entries_.erase(i++); 190 url_entries_.erase(url_entries_.begin());
|
/external/chromium_org/net/websockets/ |
H A D | websocket_throttle.cc | 78 queue_.erase(queue_iter); 103 per_address_queue.erase(per_address_queue_iter); 106 addr_map_.erase(map_iter);
|
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkDrawBitmap.cpp | 41 SK_PROPERTY(erase) 48 SK_MEMBER_PROPERTY(erase, ARGB), 71 SkDebugf("erase=\"argb(%d,%d,%d,%d)\" ", SkColorGetA(fColor)/255, SkColorGetR(fColor), 101 case SK_PROPERTY(erase):
|
/external/chromium_org/third_party/webrtc/video_engine/ |
H A D | vie_render_manager.cc | 79 render_list_.erase(iter); 148 stream_to_vie_renderer_.erase(it); 158 render_list_.erase(iter);
|
/external/clang/include/clang/Rewrite/Core/ |
H A D | RewriteRope.h | 179 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/clang/lib/Rewrite/Core/ |
H A D | RewriteRope.cpp | 116 /// erase - Remove NumBytes from this node at the specified offset. We are 118 void erase(unsigned Offset, unsigned NumBytes); 218 /// erase - Remove NumBytes from this node at the specified offset. We are 220 void erase(unsigned Offset, unsigned NumBytes); 334 /// erase - Remove NumBytes from this node at the specified offset. We are 336 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) { 343 assert(PieceOffs == Offset && "Split didn't occur before erase!"); 356 // If we completely cover some RopePieces, erase them now. 454 /// erase - Remove NumBytes from this node at the specified offset. We are 456 void erase(unsigne [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | SparseSet.h | 88 /// erase() operations are all constant time, and typically faster than a hash 90 /// depends on the order of insert() and erase() operations. When no elements 266 /// erase - Erases an existing element identified by a valid iterator. 268 /// This invalidates all iterators, but erase() returns an iterator pointing 269 /// to the next element. This makes it possible to erase selected elements 274 /// I = Set.erase(I); 280 iterator erase(iterator I) { 294 /// erase - Erases an element identified by Key, if it exists. 296 /// @param Key The key identifying the element to erase. 299 bool erase(cons [all...] |
/external/llvm/lib/IR/ |
H A D | PassRegistry.cpp | 25 // FIXME: We use ManagedStatic to erase the pass registrar on shutdown. 80 PassInfoMap.erase(I); 81 PassInfoStringMap.erase(PI.getPassArgument()); 145 Listeners.erase(I);
|
/external/llvm/lib/MC/MCAnalysis/ |
H A D | MCAtom.cpp | 71 Data.erase(I, Data.end()); 94 Insts.erase(I, Insts.end()); 111 Insts.erase(I, Insts.end());
|
/external/skia/src/animator/ |
H A D | SkDrawBitmap.cpp | 41 SK_PROPERTY(erase) 48 SK_MEMBER_PROPERTY(erase, ARGB), 71 SkDebugf("erase=\"argb(%d,%d,%d,%d)\" ", SkColorGetA(fColor)/255, SkColorGetR(fColor), 101 case SK_PROPERTY(erase):
|
/external/stlport/stlport/stl/ |
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...] |
/external/chromium_org/chrome/browser/chromeos/system/ |
H A D | syslogs_provider.cc | 59 data->erase(0, equal_sign); 62 // erase the equal to sign also 63 data->erase(0, 1); 86 data->erase(0, strlen(kMultilineQuote)); 90 data->erase(); 94 data->erase(0, next_multi + 3); 101 data->erase(0, endl_pos);
|
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | erase_range.pass.cpp | 16 // iterator erase(const_iterator first, const_iterator last) 41 C::iterator k = c.erase(i, i); 74 k = c.erase(i, j); 97 k = c.erase(c.cbegin(), c.cend()); 118 C::iterator k = c.erase(i, i); 151 k = c.erase(i, j); 174 k = c.erase(c.cbegin(), c.cend());
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | RegAllocSolver.h | 219 OptimallyReducibleNodes.erase(NId); 225 ConservativelyAllocatableNodes.erase(NId); 231 NotProvablyAllocatableNodes.erase(NId); 286 OptimallyReducibleNodes.erase(NItr); 308 ConservativelyAllocatableNodes.erase(NItr); 318 NotProvablyAllocatableNodes.erase(NItr);
|