/external/chromium_org/components/history/core/browser/ |
H A D | keyword_search_term.h | 22 int visits; // The visit count. member in struct:history::KeywordSearchTermVisit
|
/external/chromium_org/chrome/browser/history/android/ |
H A D | 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 123 VisitVector visits; local 145 VisitVector visits; local 181 VisitVector visits; local 215 VisitVector visits; local 244 VisitVector visits; local [all...] |
H A D | 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 [all...] |
H A D | android_provider_backend_unittest.cc | 837 VisitVector visits; local 838 ASSERT_TRUE(history_db_.GetVisitsForURL(url_id1, &visits)); 839 ASSERT_EQ(10u, visits.size()); 840 visits.clear(); 841 ASSERT_TRUE(history_db_.GetVisitsForURL(url_id2, &visits)); 842 ASSERT_EQ(1u, visits.size()); 882 visits.clear(); 883 EXPECT_TRUE(history_db_.GetVisitsForURL(url_id1, &visits)); 884 EXPECT_EQ(0u, visits.size()); 891 visits 1030 VisitVector visits; local 1111 VisitVector visits; local [all...] |
/external/chromium_org/chrome/browser/sync/test/integration/ |
H A D | two_client_typed_urls_sync_test.cc | 41 // Now check the visits. 55 history::VisitVector visits = GetVisitsFromClient(i, urls[j].id()); local 56 if (!AreVisitsUnique(visits)) 280 // we properly merge both sets of visits together to end up with the same 281 // set of visits on both ends. 318 // visits in the verifier. 371 // Both clients should have this URL as typed and have two visits synced up.
|
H A D | typed_urls_helper.cc | 96 history::VisitVector* visits, 98 : id_(id), visits_(visits), wait_event_(event) {} 102 // Fetch the visits. 120 RemoveVisitsTask(const history::VisitVector& visits, argument 122 : visits_(visits), wait_event_(event) {} 126 // Fetch the visits. 203 history::VisitVector visits; local 206 new GetVisitsTask(id, &visits, &wait_event)), 209 return visits; 213 const history::VisitVector& visits) { 95 GetVisitsTask(history::URLID id, history::VisitVector* visits, base::WaitableEvent* event) argument 212 RemoveVisitsFromHistoryService(HistoryService* service, const history::VisitVector& visits) argument 247 RemoveVisitsFromClient(int index, const history::VisitVector& visits) argument 357 AreVisitsUnique(const history::VisitVector& visits) argument [all...] |
/external/chromium_org/chrome/android/javatests/src/org/chromium/chrome/browser/test/ |
H A D | ProviderBookmarksUriTest.java | 40 private Uri addBookmark(String url, String title, long lastVisitTime, long created, int visits, argument 48 values.put(BookmarkColumns.VISITS, visits); 63 final int visits = 2; 71 values.put(BookmarkColumns.VISITS, visits); 95 assertEquals(visits, cursor.getInt(index)); 109 final int visits[] = { 2, 20 }; 115 uris[i] = addBookmark(url[i], title[i], lastUpdateTime[i], createdTime[i], visits[i], 122 String.valueOf(visits[0]), String.valueOf(isBookmark[0]) }; 124 "url = ? AND date = ? AND visits = ? AND bookmark = ? AND favicon IS NOT NULL", 146 assertEquals(visits[ [all...] |
/external/chromium_org/chrome/browser/history/ |
H A D | in_memory_url_index_types.h | 158 VisitInfoVector visits; member in struct:history::HistoryInfoMapValue
|
H A D | scored_history_match_unittest.cc | 24 VisitInfoVector visits; local 26 visits.push_back( 30 return visits; 195 VisitInfoVector visits = CreateVisitInfoVector(8, 3, now); local 196 ScoredHistoryMatch scored(row, visits, std::string(), 204 row, visits, std::string(), ASCIIToUTF16("abc"), Make1Term("abc"), 221 VisitInfoVector visits = CreateVisitInfoVector(8, 3, now); local 222 ScoredHistoryMatch scored(row, visits, std::string(), 230 row, visits, std::string(), ASCIIToUTF16("fed com"), 247 VisitInfoVector visits local 267 VisitInfoVector visits; local [all...] |
H A D | 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) { argument 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, ur 215 VisitVector visits; local 302 AddTypedUrlToChangeList( syncer::SyncChange::SyncChangeType change_type, const URLRow& row, const VisitVector& visits, std::string title, syncer::SyncChangeList* change_list) argument 323 WriteToTypedUrlSpecifics( const URLRow& url, const VisitVector& visits, sync_pb::TypedUrlSpecifics* typed_url) argument 410 FixupURLAndGetVisits( URLRow* url, VisitVector* visits) argument [all...] |
H A D | typed_url_syncable_service_unittest.cc | 31 // Constants used to limit size of visits processed. 51 VisitVector* visits) OVERRIDE { 55 visits->insert(visits->end(), 62 void SetVisitsForUrl(URLID id, VisitVector* visits) { argument 68 visits->begin(), 69 visits->end()); 91 // Create a new row object and add a typed visit to the |visits| vector. 92 // Note that the real history db returns visits in reverse chronological 93 // order, so |visits| i 144 MakeTypedUrlRow( const char* url, const char* title, int typed_count, int64 last_visit, bool hidden, VisitVector* visits) argument 181 AddNewestVisit( URLRow* url, VisitVector* visits, ui::PageTransition transition, int64 visit_time) argument 198 AddOldestVisit( URLRow* url, VisitVector* visits, ui::PageTransition transition, int64 visit_time) argument 271 VisitVector visits = visit_vectors.front(); local 311 VisitVector visits = visit_vectors.front(); local 363 VisitVector visits = visit_vectors.front(); local 387 VisitVector visits = visit_vectors.front(); local 454 VisitVector visits; local 538 VisitVector visits; local 590 VisitVector visits; local [all...] |
H A D | 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 i 97 FillVisitVector(sql::Statement& statement, VisitVector* visits) argument 112 FillVisitVectorWithOptions(sql::Statement& statement, const QueryOptions& options, VisitVector* visits) argument 246 GetVisitsForURL(URLID url_id, VisitVector* visits) argument 258 GetVisibleVisitsForURL(URLID url_id, const QueryOptions& options, VisitVector* visits) argument 283 GetVisitsForTimes(const std::vector<base::Time>& times, VisitVector* visits) argument 301 GetAllVisitsInRange(base::Time begin_time, base::Time end_time, int max_results, VisitVector* visits) argument 322 GetVisitsInRangeForTransition( base::Time begin_time, base::Time end_time, int max_results, ui::PageTransition transition, VisitVector* visits) argument 349 GetVisibleVisitsInRange(const QueryOptions& options, VisitVector* visits) argument 373 GetDirectVisitsDuringTimes(const VisitFilter& time_filter, int max_results, VisitVector* visits) argument 426 GetMostRecentVisitsForURL(URLID url_id, int max_results, VisitVector* visits) argument 550 GetVisitsSource(const VisitVector& visits, VisitSourceMap* sources) argument [all...] |
H A D | expire_history_backend.cc | 43 // Reads all types of visits starting from beginning of time to the given end 49 VisitVector* visits, 52 DCHECK(visits) << "visit vector has to exist in order to populate it"; 54 db->GetAllVisitsInRange(base::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. 71 VisitVector* visits, 74 DCHECK(visits) << "visi 167 VisitVector visits; local 231 ExpireVisits(const VisitVector& visits) argument 340 DeleteVisitRelatedInfo(const VisitVector& visits, DeleteEffects* effects) argument 391 ExpireURLsForVisits(const VisitVector& visits, DeleteEffects* effects) argument [all...] |
H A D | expire_history_backend_unittest.cc | 63 // Add visits with source information. 164 // The example data consists of 4 visits. The middle two visits are to the 174 // The IDs of the added URLs, and the times of the four added visits will be 225 // Four visits. 315 // There should be no visits. 316 VisitVector visits; local 317 main_db_->GetVisitsForURL(row.id(), &visits); 318 EXPECT_EQ(0U, visits.size()); 432 VisitVector visits; local 461 VisitVector visits; local 498 VisitVector visits; local 564 VisitVector visits; local 612 VisitVector visits; local 664 VisitVector visits; local 773 VisitVector visits; local 810 VisitVector visits; local 857 VisitVector visits; local [all...] |
H A D | scored_history_match.cc | 51 const VisitInfoVector& visits, 156 now, (history_client && history_client->IsBookmarked(gurl)), visits); 524 const VisitInfoVector& visits) { 526 // most kMaxVisitsToScore visits, where each visit is weighted using 529 // how many visits there were in order to penalize a match that has 530 // fewer visits than kMaxVisitsToScore. 532 for (size_t i = 0; i < std::min(visits.size(), kMaxVisitsToScore); ++i) { 534 (visits[i].second == ui::PAGE_TRANSITION_TYPED) ? 20 : 1; 538 GetRecencyScore((now - visits[i].first).InDays()); 541 return visits 49 ScoredHistoryMatch( const URLRow& row, const VisitInfoVector& visits, const std::string& languages, const base::string16& lower_string, const String16Vector& terms, const WordStarts& terms_to_word_starts_offsets, const RowWordStarts& word_starts, const base::Time now, HistoryClient* history_client) argument 522 GetFrequency(const base::Time& now, const bool bookmarked, const VisitInfoVector& visits) argument [all...] |
H A D | history_unittest.cc | 1051 const VisitVector& visits) { 1055 query_url_visits_ = visits; 1231 // Add more visits on the same host. None of these should be promoted since 1049 SaveURLAndQuit(bool success, const URLRow& url_row, const VisitVector& visits) argument
|
H A D | in_memory_url_index_unittest.cc | 270 // Update the visit_time table column in the "visits" table 273 "SELECT" HISTORY_VISIT_ROW_FIELDS "FROM visits;")); 395 const VisitInfoVector& expected_visits(expected_info->second.visits); 396 const VisitInfoVector& actual_visits(actual_info->second.visits); 994 // Check (for URL with id 1) that the number of visits and their 1004 const VisitInfoVector& visits = entry->second.visits; local 1005 EXPECT_EQ(3u, visits.size()); 1006 EXPECT_EQ(0u, visits[0].second); 1007 EXPECT_EQ(1u, visits[ 1015 const VisitInfoVector& visits = entry->second.visits; local 1026 const VisitInfoVector& visits = entry->second.visits; local [all...] |
/external/chromium_org/chrome/browser/ |
H A D | custom_home_pages_table_model.cc | 239 const history::VisitVector& visits) { 236 OnGotTitle(const GURL& entry_url, bool found_url, const history::URLRow& row, const history::VisitVector& visits) argument
|
/external/chromium_org/chrome/browser/sync/glue/ |
H A D | typed_url_model_associator_unittest.cc | 32 history::VisitVector* visits) { 40 visits->push_back(history::VisitRow( 43 history_url.set_visit_count(visits->size()); 154 EXPECT_EQ(specs4.visits(0), new_visits4[0].first.ToInternalValue()); 183 // First, create a history row that has two visits, with timestamps 2 and 3. 191 // Now, create a sync node with visits at timestamps 1, 2, 3, 4. 223 const int64 visits[] = { 1024, 2065, 65534, 1237684 }; local 225 for (size_t c = 0; c < arraysize(visits); ++c) { 227 0, base::Time::FromInternalValue(visits[c]), 0, 229 new_url.add_visits(visits[ 27 MakeTypedUrlRow(const char* url, const char* title, int typed_count, int64 last_visit, bool hidden, history::VisitVector* visits) argument 321 history::VisitVector visits; local 342 history::VisitVector visits; local 366 history::VisitVector visits; local 391 history::VisitVector visits; local [all...] |
H A D | typed_url_model_associator.cc | 33 // There's no limit on how many visits the history DB could have for a given 36 // from kMaxTypedUrlVisits, as some of the visits fetched from the DB may be 37 // RELOAD visits, which will be stripped. 40 static bool CheckVisitOrdering(const history::VisitVector& visits) { argument 42 for (history::VisitVector::const_iterator visit = visits.begin(); 43 visit != visits.end(); ++visit) { 44 if (visit != visits.begin()) { 45 // We allow duplicate visits here - they shouldn't really be allowed, but 81 history::VisitVector* visits) { 85 url->id(), kMaxVisitsToFetch, visits)) { 79 FixupURLAndGetVisits( history::URLRow* url, history::VisitVector* visits) argument 140 ShouldIgnoreVisits( const history::VisitVector& visits) argument 244 history::VisitVector& visits = visit_vectors[ix->id()]; local 557 MergeUrls( const sync_pb::TypedUrlSpecifics& node, const history::URLRow& url, history::VisitVector* visits, history::URLRow* new_url, std::vector<history::VisitInfo>* new_visits) argument 673 WriteToSyncNode( const history::URLRow& url, const history::VisitVector& visits, syncer::WriteNode* node) argument 682 WriteToTypedUrlSpecifics( const history::URLRow& url, const history::VisitVector& visits, sync_pb::TypedUrlSpecifics* typed_url) argument [all...] |
/external/chromium_org/chrome/browser/extensions/api/history/ |
H A D | history_api.cc | 313 const history::VisitVector& visits) { 315 if (success && !visits.empty()) { 316 for (history::VisitVector::const_iterator iterator = visits.begin(); 317 iterator != visits.end(); 310 QueryComplete( bool success, const history::URLRow& url_row, const history::VisitVector& visits) argument
|
/external/chromium_org/chrome/browser/safe_browsing/ |
H A D | browser_feature_extractor.cc | 326 const history::VisitVector& visits) { 345 for (history::VisitVector::const_iterator it = visits.begin(); 346 it != visits.end(); 372 // Issue next history lookup for host visits. 321 QueryUrlHistoryDone( scoped_ptr<ClientPhishingRequest> request, const DoneCallback& callback, bool success, const history::URLRow& row, const history::VisitVector& visits) argument
|
/external/chromium_org/chrome/browser/download/ |
H A D | download_target_determiner.cc | 52 // single bool. A host is considered visited before if prior visible visits were 579 // Checking if there are prior visits to the referrer is only necessary if the 590 // if there are prior visits and is considered dangerous otherwise. 806 bool DownloadTargetDeterminer::IsDangerousFile(PriorVisitsToReferrer visits) { argument 855 return !download_->HasUserGesture() || visits == NO_VISITS_TO_REFERRER;
|
/external/chromium_org/chrome/browser/sync/ |
H A D | profile_sync_service_typed_url_unittest.cc | 97 history::VisitVector* visits)); 100 const std::vector<history::VisitInfo>& visits, 102 MOCK_METHOD1(RemoveVisits, bool(const history::VisitVector& visits)); 203 const history::VisitVector& visits) { 214 TypedUrlModelAssociator::WriteToSyncNode(url, visits, &node); 313 typed_url.visits(typed_url.visits_size() - 1))); 343 history::VisitVector* visits) { 353 visits->push_back(history::VisitRow( 356 history_url.set_visit_count(visits->size()); 372 history::VisitVector visits; local 202 AddTypedUrlSyncNode(const history::URLRow& url, const history::VisitVector& visits) argument 338 MakeTypedUrlEntry(const char* url, const char* title, int typed_count, int64 last_visit, bool hidden, history::VisitVector* visits) argument 397 history::VisitVector visits; local 418 history::VisitVector visits; local 445 history::VisitVector visits; local [all...] |
/external/chromium_org/components/search_engines/ |
H A D | template_url_service_unittest.cc | 46 const history::VisitVector& visits) { 50 this->visits = visits; 56 history::VisitVector visits; member in struct:__anon6807::QueryHistoryCallbackImpl 981 // KEYWORD visits. 1021 ASSERT_EQ(1U, callback.visits.size()); 1023 ui::PageTransitionStripQualifier(callback.visits[0].transition)); 44 Callback(bool success, const history::URLRow& row, const history::VisitVector& visits) argument
|