HomeSort by relevance Sort by last modified time
    Searched defs:visits (Results 1 - 25 of 39) sorted by null

1 2

  /external/chromium_org/chrome/browser/history/android/
visit_sql_handler.cc 33 // a. Remove all visits.
35 // c. Insert the number of visits according the visit count in urls table.
39 // table, all existent visits will be removed. The new visits will be
46 VisitVector visits; local
47 if (!history_db_->GetVisitsForURL(id->url_id, &visits))
49 int visit_count_in_table = visits.size();
135 VisitVector visits; local
136 if (!history_db_->GetVisitsForURL(url_id, &visits))
139 for (VisitVector::const_iterator v = visits.begin(); v != visits.end(); ++v)
    [all...]
visit_sql_handler_unittest.cc 66 VisitVector visits; local
67 ASSERT_TRUE(history_db_.GetVisitsForURL(row.url_id(), &visits));
68 EXPECT_EQ(0u, visits.size());
84 VisitVector visits; local
85 ASSERT_TRUE(history_db_.GetVisitsForURL(row.url_id(), &visits));
86 EXPECT_EQ(1u, visits.size());
87 EXPECT_EQ(row.last_visit_time(), visits[0].visit_time);
104 VisitVector visits; local
105 ASSERT_TRUE(history_db_.GetVisitsForURL(row.url_id(), &visits));
106 EXPECT_EQ(1u, visits.size())
123 VisitVector visits; local
145 VisitVector visits; local
181 VisitVector visits; local
215 VisitVector visits; local
244 VisitVector visits; local
    [all...]
  /external/chromium_org/chrome/browser/sync/test/integration/
two_client_typed_urls_sync_test.cc 37 // Now check the visits.
51 history::VisitVector visits = GetVisitsFromClient(i, urls[j].id()); local
52 if (!AreVisitsUnique(visits))
301 // we properly merge both sets of visits together to end up with the same
302 // set of visits on both ends.
339 // visits in the verifier.
395 // Both clients should have this URL as typed and have two visits synced up.
typed_urls_helper.cc 95 history::VisitVector* visits,
97 : id_(id), visits_(visits), wait_event_(event) {}
101 // Fetch the visits.
119 RemoveVisitsTask(const history::VisitVector& visits,
121 : visits_(visits), wait_event_(event) {}
125 // Fetch the visits.
196 history::VisitVector visits; local
197 service->ScheduleDBTask(new GetVisitsTask(id, &visits, &wait_event),
200 return visits;
204 const history::VisitVector& visits) {
    [all...]
  /external/chromium/chrome/browser/sync/glue/
typed_url_change_processor.cc 67 // Get all the visits.
75 "Could not get the url's visits.");
96 history::VisitVector& visits = visit_vectors[url->id()]; local
98 DCHECK(!visits.empty());
100 DCHECK(static_cast<size_t>(url->visit_count()) == visits.size());
101 if (static_cast<size_t>(url->visit_count()) != visits.size()) {
109 model_associator_->WriteToSyncNode(*url, visits, &update_node);
120 model_associator_->WriteToSyncNode(*url, visits, &create_node);
161 history::VisitVector visits; local
162 if (!history_backend_->GetVisitsForURL(details->row.id(), &visits) ||
269 history::VisitVector visits; local
    [all...]
typed_url_model_associator_unittest.cc 23 history::VisitVector* visits) {
31 visits->push_back(history::VisitRow(
33 history_url.set_visit_count(visits->size());
146 const int64 visits[] = { 1024, 2065, 65534, 1237684 }; local
148 for (size_t c = 0; c < arraysize(visits); ++c) {
150 0, base::Time::FromInternalValue(visits[c]), 0, 0, 0));
151 new_url.add_visit(visits[c]);
typed_url_model_associator.cc 43 // Get all the visits.
49 LOG(ERROR) << "Could not get the url's visits.";
74 history::VisitVector& visits = visit_vectors[ix->id()]; local
75 DCHECK(visits.size() == static_cast<size_t>(ix->visit_count()));
76 if (visits.size() != static_cast<size_t>(ix->visit_count())) {
90 int difference = MergeUrls(typed_url, *ix, &visits, &new_url,
98 WriteToSyncNode(new_url, visits, &write_node);
124 WriteToSyncNode(*ix, visits, &node);
147 std::vector<base::Time>& visits = new_visits.back().second; local
154 // incremented as visits are added
    [all...]
  /external/chromium_org/chrome/browser/history/
in_memory_url_index_types.h 167 VisitInfoVector visits; member in struct:history::HistoryInfoMapValue
typed_url_syncable_service.cc 22 // There's no limit on how many visits the history DB could have for a given
25 // from kMaxTypedUrlVisits, as some of the visits fetched from the DB may be
26 // RELOAD visits, which will be stripped.
43 static bool CheckVisitOrdering(const VisitVector& visits) {
45 for (VisitVector::const_iterator visit = visits.begin();
46 visit != visits.end(); ++visit) {
47 if (visit != visits.begin()) {
48 // We allow duplicate visits here - they shouldn't really be allowed, but
201 VisitVector visits; local
204 row, visits, url->spec(), &changes)
215 VisitVector visits; local
    [all...]
scored_history_match_unittest.cc 21 VisitInfoVector visits; local
23 visits.push_back(
27 return visits;
181 VisitInfoVector visits; local
185 ScoredHistoryMatch scored_a(row, visits, std::string(),
190 ScoredHistoryMatch scored_b(row, visits, std::string(),
195 ScoredHistoryMatch scored_c(row, visits, std::string(),
200 ScoredHistoryMatch scored_d(row, visits, std::string(),
209 ScoredHistoryMatch scored_a(row, visits, std::string(),
214 ScoredHistoryMatch scored_b(row, visits, std::string()
    [all...]
typed_url_syncable_service_unittest.cc 29 // Constants used to limit size of visits processed.
33 // Visits with this timestamp are treated as expired.
76 VisitVector* visits) OVERRIDE {
80 visits->insert(visits->end(),
87 void SetVisitsForUrl(URLID id, VisitVector* visits) {
93 visits->begin(),
94 visits->end());
116 // Create a new row object and add a typed visit to the |visits| vector.
117 // Note that the real history db returns visits in reverse chronologica
303 VisitVector visits = visit_vectors.front(); local
344 VisitVector visits = visit_vectors.front(); local
398 VisitVector visits = visit_vectors.front(); local
424 VisitVector visits = visit_vectors.front(); local
493 VisitVector visits; local
582 VisitVector visits; local
636 VisitVector visits; local
    [all...]
expire_history_backend.cc 45 // Reads all types of visits starting from beginning of time to the given end
50 VisitVector* visits, int max_visits) const OVERRIDE {
52 DCHECK(visits) << "visit vector has to exist in order to populate it";
54 db->GetAllVisitsInRange(Time(), end_time, max_visits, visits); variable
55 // When we got the maximum number of visits we asked for, we say there could
57 return static_cast<int>(visits->size()) == max_visits;
61 // Reads only AUTO_SUBFRAME visits, within a computed range. The range is
64 // there are no more additional visits to expire by this reader.
70 VisitVector* visits, int max_visits) const OVERRIDE {
72 DCHECK(visits) << "visit vector has to exist in order to populate it"
216 VisitVector visits; local
    [all...]
expire_history_backend_unittest.cc 69 // Add visits with source information.
176 // The example data consists of 4 visits. The middle two visits are to the
186 // The IDs of the added URLs, and the times of the four added visits will be
237 // Four visits.
322 // There should be no visits.
323 VisitVector visits; local
324 main_db_->GetVisitsForURL(row.id(), &visits);
325 EXPECT_EQ(0U, visits.size());
414 VisitVector visits; local
442 VisitVector visits; local
478 VisitVector visits; local
543 VisitVector visits; local
588 VisitVector visits; local
637 VisitVector visits; local
782 VisitVector visits; local
835 VisitVector visits; local
    [all...]
in_memory_url_index_unittest.cc 254 // Update the visit_time table column in the "visits" table
257 "SELECT" HISTORY_VISIT_ROW_FIELDS "FROM visits;"));
378 const VisitInfoVector& expected_visits(expected_info->second.visits);
379 const VisitInfoVector& actual_visits(actual_info->second.visits);
967 const VisitInfoVector& visits = entry->second.visits; local
978 const VisitInfoVector& visits = entry->second.visits; local
989 const VisitInfoVector& visits = entry->second.visits; local
    [all...]
  /external/chromium_org/chrome/browser/sync/glue/
typed_url_model_associator_unittest.cc 31 history::VisitVector* visits) {
39 visits->push_back(history::VisitRow(
42 history_url.set_visit_count(visits->size());
161 EXPECT_EQ(specs4.visits(0), new_visits4[0].first.ToInternalValue());
190 // First, create a history row that has two visits, with timestamps 2 and 3.
198 // Now, create a sync node with visits at timestamps 1, 2, 3, 4.
230 const int64 visits[] = { 1024, 2065, 65534, 1237684 }; local
232 for (size_t c = 0; c < arraysize(visits); ++c) {
234 0, base::Time::FromInternalValue(visits[c]), 0,
236 new_url.add_visits(visits[c])
328 history::VisitVector visits; local
349 history::VisitVector visits; local
373 history::VisitVector visits; local
398 history::VisitVector visits; local
    [all...]
typed_url_model_associator.cc 32 // There's no limit on how many visits the history DB could have for a given
35 // from kMaxTypedUrlVisits, as some of the visits fetched from the DB may be
36 // RELOAD visits, which will be stripped.
41 static bool CheckVisitOrdering(const history::VisitVector& visits) {
43 for (history::VisitVector::const_iterator visit = visits.begin();
44 visit != visits.end(); ++visit) {
45 if (visit != visits.begin()) {
46 // We allow duplicate visits here - they shouldn't really be allowed, but
82 history::VisitVector* visits) {
86 url->id(), kMaxVisitsToFetch, visits)) {
237 history::VisitVector& visits = visit_vectors[ix->id()]; local
    [all...]
  /external/chromium/chrome/browser/history/
text_database_manager.cc 284 VisitVector visits; local
285 visit_database_->GetVisitsForURL(url_id, &visits);
286 size_t our_visit_row_index = visits.size();
287 for (size_t i = 0; i < visits.size(); i++) {
288 // While we're going trough all the visits, also find our row so we can
290 if (visits[i].visit_id == visit_id) {
292 } else if (visits[i].is_indexed) {
293 visits[i].is_indexed = false;
294 visit_database_->UpdateVisitRow(visits[i]);
295 DeletePageData(visits[i].visit_time, url, NULL)
    [all...]
history_backend_unittest.cc 124 VisitVector visits; local
125 EXPECT_TRUE(backend_->db()->GetVisitsForURL(id, &visits));
126 return visits[0].transition;
253 // Get the two visits for the URLs we just added.
254 VisitVector visits; local
255 backend_->db_->GetVisitsForURL(row1_id, &visits);
256 ASSERT_EQ(1U, visits.size());
257 VisitID visit1_id = visits[0].visit_id;
259 visits.clear();
260 backend_->db_->GetVisitsForURL(row2_id, &visits);
397 VisitVector visits; local
473 VisitVector visits; local
480 &visits); local
602 VisitVector visits; local
629 VisitVector visits; local
684 VisitVector visits; local
717 VisitVector visits; local
757 VisitVector visits; local
    [all...]
expire_history_backend.cc 33 // Reads all types of visits starting from beginning of time to the given end
38 VisitVector* visits, int max_visits) const {
40 DCHECK(visits) << "visit vector has to exist in order to populate it";
42 db->GetAllVisitsInRange(Time(), end_time, max_visits, visits); local
43 // When we got the maximum number of visits we asked for, we say there could
45 return static_cast<int>(visits->size()) == max_visits;
49 // Reads only AUTO_SUBFRAME visits, within a computed range. The range is
52 // there are no more additional visits to expire by this reader.
58 VisitVector* visits, int max_visits) const {
60 DCHECK(visits) << "visit vector has to exist in order to populate it"
235 VisitVector visits; local
    [all...]
expire_history_backend_unittest.cc 64 // Add visits with source information.
179 // The example data consists of 4 visits. The middle two visits are to the
189 // The IDs of the added URLs, and the times of the four added visits will be
239 // Four visits.
368 // There should be no visits.
369 VisitVector visits; local
370 main_db_->GetVisitsForURL(row.id(), &visits);
371 EXPECT_EQ(0U, visits.size());
468 VisitVector visits; local
532 VisitVector visits; local
572 VisitVector visits; local
602 VisitVector visits; local
660 VisitVector visits; local
814 VisitVector visits; local
867 VisitVector visits; local
    [all...]
  /external/chromium/chrome/browser/sync/
profile_sync_service_typed_url_unittest.cc 80 history::VisitVector* visits));
83 const std::vector<base::Time>& visits,
85 MOCK_METHOD1(RemoveVisits, bool(const history::VisitVector& visits));
201 const history::VisitVector& visits) {
211 TypedUrlModelAssociator::WriteToSyncNode(url, visits, &node);
264 history::VisitVector* visits) {
272 visits->push_back(history::VisitRow(
274 history_url.set_visit_count(visits->size());
300 history::VisitVector visits; local
301 visits.push_back(history::VisitRow
325 history::VisitVector visits; local
    [all...]
  /external/chromium_org/chrome/browser/sync/
profile_sync_service_typed_url_unittest.cc 69 // Visits with this timestamp are treated as expired.
81 history::VisitVector* visits));
84 const std::vector<history::VisitInfo>& visits,
86 MOCK_METHOD1(RemoveVisits, bool(const history::VisitVector& visits));
166 const history::VisitVector& visits) {
177 TypedUrlModelAssociator::WriteToSyncNode(url, visits, &node);
276 typed_url.visits(typed_url.visits_size() - 1)));
306 history::VisitVector* visits) {
316 visits->push_back(history::VisitRow(
319 history_url.set_visit_count(visits->size())
335 history::VisitVector visits; local
360 history::VisitVector visits; local
381 history::VisitVector visits; local
408 history::VisitVector visits; local
    [all...]
  /packages/apps/Browser/src/com/android/browser/
BrowserBackupAgent.java 113 mark.visits = in.readInt();
177 public int visits; field in class:BrowserBackupAgent.Bookmark
  /external/chromium_org/chrome/android/javatests/src/org/chromium/chrome/browser/test/
ProviderBookmarksUriTest.java 42 private Uri addBookmark(String url, String title, long lastVisitTime, long created, int visits,
50 values.put(BookmarkColumns.VISITS, visits);
65 final int visits = 2; local
73 values.put(BookmarkColumns.VISITS, visits);
95 index = cursor.getColumnIndex(BookmarkColumns.VISITS);
97 assertEquals(visits, cursor.getInt(index));
111 final int visits[] = { 2, 20 }; local
117 uris[i] = addBookmark(url[i], title[i], lastUpdateTime[i], createdTime[i], visits[i]
190 final int visits[] = { 2, 20 }; local
245 final int visits[] = { 2, 20 }; local
    [all...]
  /external/chromium/chrome/browser/search_engines/
template_url_model_unittest.cc 884 history::VisitVector visits; member in struct:QueryHistoryCallbackImpl
    [all...]

Completed in 432 milliseconds

1 2