OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef COMPONENTS_OMNIBOX_BROWSER_SCORED_HISTORY_MATCH_H_ | 5 #ifndef COMPONENTS_OMNIBOX_BROWSER_SCORED_HISTORY_MATCH_H_ |
6 #define COMPONENTS_OMNIBOX_BROWSER_SCORED_HISTORY_MATCH_H_ | 6 #define COMPONENTS_OMNIBOX_BROWSER_SCORED_HISTORY_MATCH_H_ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 | 9 |
10 #include <string> | 10 #include <string> |
(...skipping 150 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
161 std::vector<ScoreMaxRelevance>* hqp_buckets); | 161 std::vector<ScoreMaxRelevance>* hqp_buckets); |
162 | 162 |
163 // If true, assign raw scores to be max(whatever it normally would be, a | 163 // If true, assign raw scores to be max(whatever it normally would be, a |
164 // score that's similar to the score HistoryURL provider would assign). | 164 // score that's similar to the score HistoryURL provider would assign). |
165 static bool also_do_hup_like_scoring_; | 165 static bool also_do_hup_like_scoring_; |
166 | 166 |
167 // Untyped visits to bookmarked pages score this, compared to 1 for | 167 // Untyped visits to bookmarked pages score this, compared to 1 for |
168 // untyped visits to non-bookmarked pages and 20 for typed visits. | 168 // untyped visits to non-bookmarked pages and 20 for typed visits. |
169 static int bookmark_value_; | 169 static int bookmark_value_; |
170 | 170 |
171 // True if we should fix certain bugs in frequency scoring. | 171 // True if we should fix a bug in frequency scoring relating to how we |
172 static bool fix_typed_visit_bug_; | 172 // extrapolate frecency when the URL has been visited few times. |
173 static bool fix_few_visits_bug_; | 173 static bool fix_few_visits_bug_; |
174 | 174 |
175 // If true, we allow input terms to match in the TLD (e.g., ".com"). | 175 // If true, we allow input terms to match in the TLD (e.g., ".com"). |
176 static bool allow_tld_matches_; | 176 static bool allow_tld_matches_; |
177 | 177 |
178 // If true, we allow input terms to match in the scheme (e.g., "http://"). | 178 // If true, we allow input terms to match in the scheme (e.g., "http://"). |
179 static bool allow_scheme_matches_; | 179 static bool allow_scheme_matches_; |
180 | 180 |
181 // The number of title words examined when computing topicality scores. | 181 // The number of title words examined when computing topicality scores. |
182 // Words beyond this number are ignored. | 182 // Words beyond this number are ignored. |
(...skipping 12 matching lines...) Expand all Loading... |
195 static char hqp_relevance_buckets_str_[]; | 195 static char hqp_relevance_buckets_str_[]; |
196 | 196 |
197 // |hqp_relevance_buckets_| gives mapping from (topicality*frequency) | 197 // |hqp_relevance_buckets_| gives mapping from (topicality*frequency) |
198 // to the final relevance scoring. Please see GetFinalRelevancyScore() | 198 // to the final relevance scoring. Please see GetFinalRelevancyScore() |
199 // for more details and scoring method. | 199 // for more details and scoring method. |
200 static std::vector<ScoreMaxRelevance>* hqp_relevance_buckets_; | 200 static std::vector<ScoreMaxRelevance>* hqp_relevance_buckets_; |
201 }; | 201 }; |
202 typedef std::vector<ScoredHistoryMatch> ScoredHistoryMatches; | 202 typedef std::vector<ScoredHistoryMatch> ScoredHistoryMatches; |
203 | 203 |
204 #endif // COMPONENTS_OMNIBOX_BROWSER_SCORED_HISTORY_MATCH_H_ | 204 #endif // COMPONENTS_OMNIBOX_BROWSER_SCORED_HISTORY_MATCH_H_ |
OLD | NEW |