Searched refs:erase (Results 251 - 275 of 2763) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/components/content_settings/core/browser/
H A Dcontent_settings_origin_identifier_value_map.cc167 entries_[key].erase(patterns);
169 entries_.erase(key);
177 entries_.erase(key);
/external/chromium_org/components/sync_driver/
H A Ddata_type_status_table.cc82 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 Dappcache_storage.cc39 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 Dindexed_db_active_blob_registry.cc68 single_db.erase(blob_pair);
70 use_tracker_.erase(db_pair);
74 deleted_dbs_.erase(db_to_delete);
H A Dindexed_db_transaction_coordinator.cc35 queued_transactions_.erase(transaction);
38 started_transactions_.erase(transaction);
115 queued_transactions_.erase(transaction);
H A Dlist_set.h40 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 Dquota_service.cc83 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 Daudio_output_dispatcher_impl.cc88 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 Dcdm_helpers.cc100 free_buffers_.erase(found);
120 allocated_buffers_.erase(found);
136 free_buffers_.erase(free_buffers_.begin());
/external/chromium_org/net/socket/
H A Dwebsocket_endpoint_lock_manager.cc67 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 Durl_request_throttler_manager.cc131 url_entries_.erase(url_id);
182 url_entries_.erase(i++);
190 url_entries_.erase(url_entries_.begin());
/external/chromium_org/net/websockets/
H A Dwebsocket_throttle.cc78 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 DSkDrawBitmap.cpp41 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 Dvie_render_manager.cc79 render_list_.erase(iter);
148 stream_to_vie_renderer_.erase(it);
158 render_list_.erase(iter);
/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/clang/lib/Rewrite/Core/
H A DRewriteRope.cpp116 /// 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 DSparseSet.h88 /// 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 DPassRegistry.cpp25 // 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 DMCAtom.cpp71 Data.erase(I, Data.end());
94 Insts.erase(I, Insts.end());
111 Insts.erase(I, Insts.end());
/external/skia/src/animator/
H A DSkDrawBitmap.cpp41 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.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/chromium_org/chrome/browser/chromeos/system/
H A Dsyslogs_provider.cc59 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 Derase_range.pass.cpp16 // 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 DRegAllocSolver.h219 OptimallyReducibleNodes.erase(NId);
225 ConservativelyAllocatableNodes.erase(NId);
231 NotProvablyAllocatableNodes.erase(NId);
286 OptimallyReducibleNodes.erase(NItr);
308 ConservativelyAllocatableNodes.erase(NItr);
318 NotProvablyAllocatableNodes.erase(NItr);

Completed in 340 milliseconds

<<11121314151617181920>>