| /external/chromium_org/components/history/core/browser/ |
| keyword_search_term.cc | 9 KeywordSearchTermVisit::KeywordSearchTermVisit() : visits(0) {}
|
| keyword_search_term.h | 22 int visits; // The visit count. member in struct:history::KeywordSearchTermVisit
|
| /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
69 VisitVector* visits);
71 // Fills the vector with all visits with times in the given list.
75 // |visits| may have duplicate visits.
77 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 | 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) << "visit vector has to exist in order to populate it"
167 VisitVector visits; local
[all...] |
| typed_url_syncable_service_unittest.cc | 31 // Constants used to limit size of visits processed.
34 // Visits with this timestamp are treated as expired.
51 VisitVector* visits) OVERRIDE {
55 visits->insert(visits->end(),
62 void SetVisitsForUrl(URLID id, VisitVector* visits) {
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 chronologica
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...] |
| 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_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...] |
| 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;
68 // that we don't remove any URLs or favicons that are bookmarked (visits are
88 // Removes all visits to restrict_urls (or all URLs if empty) in the given
93 // Removes all visits to all URLs with the given times, updating the
98 // Removes the given list of visits, updating the URLs accordingly (similar to
99 // ExpireHistoryBetween(), but affecting a specific set of visits).
100 void ExpireVisits(const VisitVector& visits);
102 // Expires all visits before and including the given time, updating the URL
[all...] |
| 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 = CreateVisitInfoVector(8, 3, now) local
267 VisitInfoVector visits; local
[all...] |
| scored_history_match.h | 27 // The maximum number of recent visits to examine in GetFrequency().
28 // Public so url_index_private_data.cc knows how many visits it is
35 // given in |row| with recent visits as indicated in |visits|. First
50 const VisitInfoVector& visits,
121 // better) based the rate of visits, whether the page is bookmarked, and
122 // how often those visits are typed navigations (i.e., explicitly
127 const VisitInfoVector& visits);
180 // Untyped visits to bookmarked pages score this, compared to 1 for
181 // untyped visits to non-bookmarked pages and 20 for typed visits
[all...] |
| typed_url_syncable_service.h | 100 const VisitVector& visits,
107 const VisitVector& visits,
110 // Fetches visits from the history DB corresponding to the passed URL. This
112 // integrity (duplicate visits, visit timestamps that don't match the
114 // etc) by modifying the passed |url| object and |visits| vector.
115 // Returns false if we could not fetch the visits for the passed URL, and
118 VisitVector* visits);
|
| history_backend_unittest.cc | 287 VisitVector visits; local
288 EXPECT_TRUE(backend_->db()->GetVisitsForURL(id, &visits));
289 return visits[0].transition;
529 // Get the two visits for the URLs we just added.
530 VisitVector visits; local
531 backend_->db_->GetVisitsForURL(row1_id, &visits);
532 ASSERT_EQ(1U, visits.size());
534 visits.clear();
535 backend_->db_->GetVisitsForURL(row2_id, &visits);
536 ASSERT_EQ(1U, visits.size())
717 VisitVector visits; local
791 VisitVector visits; local
1114 VisitVector visits; local
1144 VisitVector visits; local
1198 VisitVector visits; local
1284 VisitVector visits; local
1323 VisitVector visits; local
1363 VisitVector visits; local
1396 VisitVector visits; local
1451 VisitVector visits; local
2862 VisitVector visits; local
2866 backend_->db()->GetAllVisitsInRange(base::Time(), base::Time(), 0, &visits); local
2875 backend_->db()->GetAllVisitsInRange(base::Time(), base::Time(), 0, &visits); local
2882 backend_->db()->GetAllVisitsInRange(base::Time(), base::Time(), 0, &visits); local
2899 backend_->db()->GetAllVisitsInRange(base::Time(), base::Time(), 0, &visits); local
[all...] |
| 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.size() * summed_visit_points / kMaxVisitsToScore
[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 | 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) {
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)) {
244 history::VisitVector& visits = visit_vectors[ix->id()]; local
[all...] |
| 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[c])
321 history::VisitVector visits; local
342 history::VisitVector visits; local
366 history::VisitVector visits; local
391 history::VisitVector visits; local
[all...] |
| typed_url_model_associator.h | 85 // local history DB and generates a list of visits to add to the
88 // visits to add to/remove from the history DB, and adds a new entry to either
97 // Given a TypedUrlSpecifics object, removes all visits that are older than
98 // the current expiration time. Note that this can result in having no visits
114 // history database in |url| and |visits|, and returns a bitmask with the
116 // DIFF_UPDATE_NODE - changes have been made to |new_url| and |visits| which
120 // DIFF_LOCAL_VISITS_ADDED - |new_visits| contains a list of visits that
122 // written to the DB - each client is left to age out visits on their own.
125 history::VisitVector* visits,
129 const history::VisitVector& visits,
[all...] |
| /external/chromium_org/chrome/browser/sync/test/integration/ |
| 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,
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) {
[all...] |
| typed_urls_helper.h | 26 // Gets the visits for a URL from a specific sync profile.
29 // Removes the passed |visits| from a specific sync profile.
30 void RemoveVisitsFromClient(int index, const history::VisitVector& visits);
75 // Returns true if two sets of visits are equivalent.
80 bool AreVisitsUnique(const history::VisitVector& visits);
82 // Returns a unique timestamp to use when generating page visits
|
| /external/chromium_org/chrome/android/javatests/src/org/chromium/chrome/browser/test/ |
| ProviderBookmarksUriTest.java | 40 private Uri addBookmark(String url, String title, long lastVisitTime, long created, int visits,
48 values.put(BookmarkColumns.VISITS, visits);
63 final int visits = 2; local
71 values.put(BookmarkColumns.VISITS, visits);
93 index = cursor.getColumnIndex(BookmarkColumns.VISITS);
95 assertEquals(visits, cursor.getInt(index));
109 final int visits[] = { 2, 20 }; local
115 uris[i] = addBookmark(url[i], title[i], lastUpdateTime[i], createdTime[i], visits[i]
188 final int visits[] = { 2, 20 }; local
243 final int visits[] = { 2, 20 }; local
[all...] |
| /bionic/linker/tests/ |
| linked_list_test.cpp | 188 int visits = 0; local
191 ++visits;
197 ASSERT_EQ(4, visits);
200 visits = 0;
204 if (++visits == 3) {
213 ASSERT_EQ(3, visits);
|
| /external/chromium_org/chrome/browser/ui/webui/ntp/ |
| suggestions_source_top_sites.cc | 105 page_value->SetInteger("extended_info.total visits",
108 if (suggested_url.extended_info.visits) {
109 page_value->SetInteger("extended_info.visits",
110 suggested_url.extended_info.visits);
|
| /external/chromium_org/chrome/browser/ |
| custom_home_pages_table_model.h | 76 const history::VisitVector& visits);
|
