/external/chromium_org/chrome/browser/history/ |
visit_database.h | 21 // A visit database is one which stores visits for URLs, that is, times and 33 // Deletes the visit table. Used for rapidly clearing all visits. In this 56 // Fills in the given vector with all of the visits for the given page ID, 59 bool GetVisitsForURL(URLID url_id, VisitVector* visits); 61 // Fills in the given vector with the visits for the given page ID which 68 VisitVector* visits); 70 // Fills the vector with all visits with times in the given list. 74 // |visits| may have duplicate visits. 76 VisitVector* visits); [all...] |
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...] |
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...] |
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...] |
visit_database.cc | 29 if (!GetDB().DoesTableExist("visits")) { 30 if (!GetDB().Execute("CREATE TABLE visits(" 43 // Visit source table contains the source information for all the visits. To 44 // save space, we do not record those user browsed visits which would be the 46 // Due to the tight relationship between visit_source and visits table, they 54 // Index over url so we can quickly find visits for a page. 56 "CREATE INDEX IF NOT EXISTS visits_url_index ON visits (url)")) 59 // Create an index over from visits so that we can efficiently find 63 "visits (from_visit)")) 66 // Create an index over time so that we can efficiently find the visits in [all...] |
expire_history_backend.h | 47 // Encapsulates visit expiration criteria and type of visits to expire. 51 // Populates |visits| from |db|, using provided |end_time| and |max_visits| 54 VisitVector* visits, int max_visits) const = 0; 70 // (visits are removed though). 90 // Removes all visits to restrict_urls (or all URLs if empty) in the given 95 // Removes all visits to all URLs with the given times, updating the 100 // Removes the given list of visits, updating the URLs accordingly (similar to 101 // ExpireHistoryBetween(), but affecting a specific set of visits). 102 void ExpireVisits(const VisitVector& visits); 104 // Archives all visits before and including the given time, updating the URL [all...] |
scored_history_match.h | 27 // item given in |row| with recent visits as indicated in |visits|. 37 const VisitInfoVector& visits, 79 // better) based the rate of visits and how often those visits are 83 const VisitInfoVector& visits); 126 // The maximum number of recent visits to examine in GetFrecency().
|
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...] |
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...] |
/external/chromium/chrome/browser/history/ |
visit_database.h | 18 // A visit database is one which stores visits for URLs, that is, times and 30 // Deletes the visit table. Used for rapidly clearing all visits. In this 53 // Fills in the given vector with all of the visits for the given page ID, 56 bool GetVisitsForURL(URLID url_id, VisitVector* visits); 58 // Fills all visits in the time range [begin, end) to the given vector. Either 68 int max_results, VisitVector* visits); 70 // Fills all visits with specified transition in the time range [begin, end) 83 VisitVector* visits); 85 // Fills all visits in the given time range into the given vector that should 90 // Up to |max_count| visits will be returned. If there are more visits tha [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...] |
visit_database.cc | 32 if (!GetDB().DoesTableExist("visits")) { 33 if (!GetDB().Execute("CREATE TABLE visits(" 43 } else if (!GetDB().DoesColumnExist("visits", "is_indexed")) { 50 if (!GetDB().Execute("ALTER TABLE visits ADD COLUMN is_indexed BOOLEAN")) 54 // Visit source table contains the source information for all the visits. To 55 // save space, we do not record those user browsed visits which would be the 57 // Due to the tight relationship between visit_source and visits table, they 65 // Index over url so we can quickly find visits for a page. This will just 67 GetDB().Execute("CREATE INDEX visits_url_index ON visits (url)"); 69 // Create an index over from visits so that we can efficiently fin [all...] |
expire_history_backend.h | 45 // Encapsulates visit expiration criteria and type of visits to expire. 49 // Populates |visits| from |db|, using provided |end_time| and |max_visits| 52 VisitVector* visits, int max_visits) const = 0; 68 // (visits are removed though). 86 // Removes all visits to restrict_urls (or all URLs if empty) in the given 91 // Archives all visits before and including the given time, updating the URLs 115 // string/ID pair. If |update_visits| is set, the visits that reference the 118 // knows that the visits will be deleted after the call. 125 // Deletes the visit-related stuff for all the visits in the given list, and 129 // Deleted information is the visits themselves and the full-text inde [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...] |
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...] |
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...] |
/external/chromium_org/chrome/browser/history/android/ |
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...] |
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...] |
/external/chromium_org/chrome/browser/sync/glue/ |
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...] |
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.h | 89 // local history DB and generates a list of visits to add to the 92 // visits to add to/remove from the history DB, and adds a new entry to either 101 // Given a TypedUrlSpecifics object, removes all visits that are older than 102 // the current expiration time. Note that this can result in having no visits 118 // history database in |url| and |visits|, and returns a bitmask with the 120 // DIFF_UPDATE_NODE - changes have been made to |new_url| and |visits| which 124 // DIFF_LOCAL_VISITS_ADDED - |new_visits| contains a list of visits that 126 // written to the DB - each client is left to age out visits on their own. 129 history::VisitVector* visits, 133 const history::VisitVector& visits, [all...] |