| /external/chromium/net/ftp/ |
| ftp_auth_cache.cc | 30 for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {
47 entries_.push_front(Entry(origin, username, password));
50 if (entries_.size() > kMaxEntries)
51 entries_.pop_back();
57 for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {
60 entries_.erase(it);
|
| ftp_auth_cache.h | 61 EntryList entries_; member in class:net::FtpAuthCache
|
| /external/chromium/chrome/browser/ |
| custom_home_pages_table_model.cc | 57 entries_.resize(urls.size());
59 entries_[i].url = urls[i];
60 entries_[i].title.erase();
61 entries_[i].icon.reset();
62 LoadTitleAndFavicon(&(entries_[i]));
71 entries_.insert(entries_.begin() + static_cast<size_t>(index), Entry());
72 entries_[index].url = url;
73 LoadTitleAndFavicon(&(entries_[index]));
80 Entry* entry = &(entries_[index])
[all...] |
| custom_home_pages_table_model.h | 86 std::vector<Entry> entries_; member in class:CustomHomePagesTableModel
|
| /external/chromium/net/base/ |
| host_cache.cc | 42 EntryMap::const_iterator it = entries_.find(key);
43 if (it == entries_.end())
64 scoped_refptr<Entry>& entry = entries_[key];
72 if (entries_.size() > max_entries_)
86 entries_.clear();
91 return entries_.size();
112 return entries_;
122 for (EntryMap::iterator it = entries_.begin(); it != entries_.end(); ) {
125 entries_.erase(it++)
[all...] |
| capturing_net_log.cc | 30 *entry_list = entries_;
35 entries_.clear();
50 if (entries_.size() + 1 < max_num_entries_)
51 entries_.push_back(entry);
|
| host_cache_unittest.cc | 202 EXPECT_TRUE(ContainsKey(cache.entries_, Key("valid0")));
203 EXPECT_TRUE(ContainsKey(cache.entries_, Key("valid1")));
204 EXPECT_TRUE(ContainsKey(cache.entries_, Key("valid2")));
205 EXPECT_TRUE(ContainsKey(cache.entries_, Key("valid3")));
206 EXPECT_TRUE(ContainsKey(cache.entries_, Key("valid4")));
207 EXPECT_TRUE(ContainsKey(cache.entries_, Key("expired0")));
208 EXPECT_TRUE(ContainsKey(cache.entries_, Key("expired1")));
209 EXPECT_TRUE(ContainsKey(cache.entries_, Key("expired2")));
210 EXPECT_TRUE(ContainsKey(cache.entries_, Key("negative0")));
211 EXPECT_TRUE(ContainsKey(cache.entries_, Key("negative1")))
[all...] |
| capturing_net_log.h | 74 EntryList entries_; member in class:net::CapturingNetLog
|
| /external/chromium/chrome/browser/ui/search_engines/ |
| template_url_table_model.cc | 133 STLDeleteElements(&entries_);
134 entries_.clear();
138 STLDeleteElements(&entries_);
139 entries_.clear();
150 entries_.push_back(new ModelEntry(this, template_url));
153 last_search_engine_index_ = static_cast<int>(entries_.size());
163 entries_.push_back(new ModelEntry(this, *template_url));
172 return static_cast<int>(entries_.size());
177 const TemplateURL& url = entries_[row]->template_url();
203 return entries_[row]->GetIcon()
[all...] |
| template_url_table_model.h | 104 std::vector<ModelEntry*> entries_; member in class:TemplateURLTableModel
109 // Index of the last search engine in entries_. This is used to determine the
|
| /external/chromium/chrome/browser/geolocation/ |
| geolocation_exceptions_table_model.cc | 80 const Entry& entry = entries_[*i];
84 (j < entries_.size()) && (entries_[j].origin == entry.origin); ++j) {
96 Entry* entry = &entries_[row];
99 bool next_has_same_origin = ((row + 1) < entries_.size()) &&
100 (entries_[row + 1].origin == entry_origin);
112 entries_.erase(entries_.begin() + row); // Note: |entry| is now garbage.
122 entry = &entries_[--row];
131 entries_.clear()
[all...] |
| geolocation_exceptions_table_model.h | 55 EntriesVector entries_; member in class:GeolocationExceptionsTableModel
|
| /external/chromium/chrome/browser/extensions/ |
| extension_pref_value_map.cc | 27 STLDeleteValues(&entries_);
28 entries_.clear();
53 ExtensionEntryMap::const_iterator ext = entries_.find(extension_id);
54 if (ext == entries_.end()) {
61 if (winner == entries_.end())
73 if (winner == entries_.end())
81 if (entries_.find(ext_id) != entries_.end())
83 entries_[ext_id] = new ExtensionEntry;
84 entries_[ext_id]->install_time = install_time
[all...] |
| /external/chromium/chrome/browser/notifications/ |
| notification_exceptions_table_model.cc | 48 Entry* entry = &entries_[row];
55 entries_.erase(entries_.begin() + row); // Note: |entry| is now garbage.
63 entries_.clear();
70 return static_cast<int>(entries_.size());
75 const Entry& entry = entries_[row];
106 entries_.clear();
117 entries_.reserve(allowed.size() + blocked.size());
119 entries_.push_back(Entry(allowed[i], CONTENT_SETTING_ALLOW));
121 entries_.push_back(Entry(blocked[i], CONTENT_SETTING_BLOCK))
[all...] |
| notification_exceptions_table_model.h | 45 EntriesVector entries_; member in class:NotificationExceptionsTableModel
|
| /external/chromium/net/disk_cache/ |
| mem_backend_impl.cc | 35 EntryMap::iterator it = entries_.begin();
36 while (it != entries_.end()) {
38 it = entries_.begin();
98 EntryMap::iterator it = entries_.find(entry->GetKey());
99 if (it != entries_.end())
100 entries_.erase(it);
131 return static_cast<int32>(entries_.size());
195 EntryMap::iterator it = entries_.find(key);
196 if (it == entries_.end())
206 EntryMap::iterator it = entries_.find(key)
[all...] |
| /external/chromium/net/http/ |
| http_auth_cache.cc | 75 for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {
100 for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it) {
125 if (entries_.size() >= kMaxNumRealmEntries) {
127 entries_.pop_back();
130 entries_.push_front(Entry());
131 entry = &entries_.front();
204 for (EntryList::iterator it = entries_.begin(); it != entries_.end(); ++it)
[all...] |
| /external/regex-re2/re2/ |
| prefilter_tree.cc | 25 for (int i = 0; i < entries_.size(); i++)
26 delete entries_[i].parents;
104 for (int i = 0; i < entries_.size(); i++) {
105 IntMap* parents = entries_[i].parents;
114 (entries_[it->index()].propagate_up_at_count > 1);
119 entries_[it->index()].propagate_up_at_count -= 1;
209 entries_.resize(node_map_.size());
220 Entry* entry = &entries_[prefilter->unique_id()];
233 Entry* entry = &entries_[prefilter->unique_id()];
259 Entry* child_entry = &entries_[child_id]
[all...] |
| prefilter_tree.h | 107 vector<Entry> entries_; member in class:re2::PrefilterTree
|
| /external/chromium/chrome/browser/sessions/ |
| tab_restore_service.cc | 203 STLDeleteElements(&entries_);
277 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i)
289 STLDeleteElements(&entries_);
294 return entries_;
299 if (entries_.empty())
302 RestoreEntryById(delegate, entries_.front()->id, false);
309 if (i == entries_.end()) {
315 for (Entries::iterator j = entries_.begin(); j != i && j != entries_.end()
[all...] |
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| relayport.cc | 197 entries_.push_back(
207 for (size_t i = 0; i < entries_.size(); ++i)
208 delete entries_[i];
263 ASSERT(entries_.size() == 1);
264 entries_[0]->Connect();
301 for (size_t i = 0; i < entries_.size(); ++i) {
302 if (entries_[i]->address().IsAny() && payload) {
303 entry = entries_[i];
306 } else if (entries_[i]->address() == addr) {
307 entry = entries_[i]
[all...] |
| /external/chromium/chrome/browser/resources/net_internals/ |
| sourceentry.js | 14 this.entries_ = [];
69 this.entries_.length == 0)
75 logEntry.type == this.entries_[0].type)
79 this.entries_.push(logEntry);
126 var entryText = PrintSourceEntriesAsText(this.entries_).toLowerCase();
266 if (this.entries_.length < 1)
268 if (this.entries_.length >= 2) {
269 if (this.entries_[0].type == LogEventType.REQUEST_ALIVE ||
270 this.entries_[0].type == LogEventType.SOCKET_POOL_CONNECT_JOB)
271 return this.entries_[1]
[all...] |
| /external/v8/src/ |
| unicode-inl.h | 36 CacheEntry entry = entries_[code_point & kMask];
44 entries_[code_point & kMask] = CacheEntry(code_point, result);
50 CacheEntry entry = entries_[c & kMask];
69 entries_[c & kMask] = CacheEntry(c, result[0] - c);
72 entries_[c & kMask] = CacheEntry(c, 0);
|
| profile-generator.cc | 2966 HeapEntriesMap* entries_; member in class:v8::internal::SnapshotCounter
3040 HeapEntriesMap* entries_; member in class:v8::internal::SnapshotFiller
[all...] |
| safepoint-table.h | 122 uint8_t* bits = &Memory::uint8_at(entries_ + (index * entry_size_));
160 Address entries_;
|
