| /external/chromium_org/chrome/common/ |
| instant_types.h | 101 // The relevance score of this match, same as AutocompleteMatch::relevance.
102 int relevance; member in struct:InstantAutocompleteResult
|
| /external/chromium_org/chrome/browser/autocomplete/ |
| shortcuts_provider.cc | 165 // Don't return shortcuts with zero relevance.
166 int relevance = CalculateScore(term_string, it->second, max_relevance); local
167 if (relevance)
168 matches_.push_back(ShortcutToACMatch(relevance, term_string, it->second));
178 // Reset relevance scores to guarantee no match is given a score that may
192 max_relevance = std::min(max_relevance, it->relevance);
193 it->relevance = max_relevance;
201 int relevance,
205 AutocompleteMatch match(this, relevance, true,
|
| history_url_provider.cc | 456 what_you_typed_match.relevance = CalculateRelevance(WHAT_YOU_TYPED, 0);
531 int relevance = -1; local
534 relevance = std::max(relevance, it->relevance);
556 relevance = (relevance > 0) ? (relevance - 1) :
559 NORMAL, relevance);
636 what_you_typed.relevance = CalculateRelevance(WHAT_YOU_TYPED, 0)
[all...] |
| autocomplete_match.h | 86 int relevance,
236 // The relevance of this match. See table in autocomplete.h for scores
239 // supply matches with appropriate relevance.
243 int relevance; member in struct:AutocompleteMatch
|
| zero_suggest_provider.h | 104 // |navigation_results|, and the verbatim relevance score into
117 // Creates an AutocompleteMatch with the provided |relevance| and |type| to
122 // has lower relevance is eliminated.
123 void AddMatchToMap(int relevance,
174 // The relevance score for the URL of the current page.
|
| keyword_provider.cc | 346 // suggestions from last time. We need to readjust the relevance to
347 // ensure it is less than the main match's relevance.
350 matches_.back().relevance = matches_[0].relevance - (i + 1);
429 int relevance) {
439 if (relevance < 0) {
440 relevance =
448 AutocompleteMatch match(this, relevance, false,
575 // the relevance of the first result (added synchronously in Start()),
577 // We recompute the first match's relevance; we know that |complete
[all...] |
| history_url_provider.h | 181 // NOTE: This does not set the relevance of the returned match, as different
223 // Determines the relevance for a match, given its type. If
225 // kMaxSuggestions) indicating the relevance of the match (higher ==
308 int relevance);
|
| builtin_provider.cc | 112 matches_[i].relevance = kRelevance + matches_.size() - (i + 1);
|
| contact_provider_chromeos_unittest.cc | 239 TEST_F(ContactProviderTest, Relevance) {
277 EXPECT_LE(matches[i].relevance, previous_relevance)
278 << "Match " << i << " has greater relevance than previous match";
281 previous_relevance = matches[i].relevance;
|
| autocomplete_provider_unittest.cc | 47 TestProvider(int relevance, const string16& prefix,
51 relevance_(relevance),
237 // don't rely on kResultsPerProvided and default relevance ordering
349 match.relevance = 1000; // Arbitrary non-zero value.
450 // Make sure the default match gets set to the highest relevance match. The
451 // highest relevance matches should come from the second provider.
|
| contact_provider_chromeos.cc | 27 // Base match relevance assigned to a contact with an affinity of 0.0.
30 // Maximum boost to relevance for a contact with an affinity of 1.0.
136 // the only signal used for computing relevance, we can stop after we've found
232 match.relevance = kBaseRelevance +
|
| /external/chromium/chrome/browser/autocomplete/ |
| keyword_provider.cc | 234 // suggestions from last time. We need to readjust the relevance to
235 // ensure it is less than the main match's relevance.
238 matches_.back().relevance = matches_[0].relevance - (i + 1);
388 int relevance) {
400 if (relevance < 0) {
401 relevance =
409 AutocompleteMatch result(this, relevance, false,
496 // the relevance of the first result (added synchronously in Start()),
|
| search_provider_unittest.cc | 261 EXPECT_GT(term1_match.relevance, what_you_typed_match.relevance);
391 EXPECT_GT(instant_match.relevance, what_you_typed_match.relevance);
493 EXPECT_GT(what_you_typed_match.relevance, term_match.relevance);
|
| search_provider.h | 232 // Determines the relevance for a particular match. We use different scoring
254 // the supplied relevance. Adds this match to |map|; if such a match already
255 // exists, whichever one has lower relevance is eliminated.
258 int relevance,
267 int relevance,
|
| builtin_provider.cc | 53 matches_[i].relevance = kRelevance + matches_.size() - (i + 1);
|
| search_provider.cc | 611 // History returns results sorted for us. We force the relevance to decrease
613 // match having a relevance greater than the previous, but they might be
614 // equal. If we didn't force the relevance to decrease and we ended up in a
615 // situation where the relevance was equal, then which was shown first would
618 // relevance.
639 int relevance = CalculateRelevanceForHistory(i->time, term_looks_like_url, local
641 if (i != results.begin() && relevance >= last_relevance)
642 relevance = last_relevance - 1;
643 last_relevance = relevance;
646 relevance,
[all...] |
| autocomplete_unittest.cc | 37 TestProvider(int relevance, const string16& prefix)
39 relevance_(relevance),
245 // Make sure the default match gets set to the highest relevance match. The
246 // highest relevance matches should come from the second provider.
393 // Test comparing matches relevance.
412 m1.relevance = cases[i].r1;
413 m2.relevance = cases[i].r2;
|
| history_url_provider_unittest.cc | 472 int pandora_relevance = matches_[0].relevance;
480 EXPECT_EQ(pandora_relevance, matches_[0].relevance);
|
| autocomplete.cc | 608 // clamp globally. This way, old high-relevance matches will starve new
609 // low-relevance matches, under the assumption that the new matches will
611 // new low-relevance match appear and then quickly get pushed off the bottom;
754 matches_.front().relevance : new_matches[0].relevance) - 1;
756 // the highest-relevance matches, we copy in the lowest-relevance matches
765 match.relevance = std::min(max_relevance, match.relevance);
[all...] |
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| mixer.cc | 119 DCHECK_GE((*result_it)->relevance(), 0.0);
120 DCHECK_LE((*result_it)->relevance(), 1.0);
147 SortData(*result_it, (*result_it)->relevance() + boost));
|
| app_result.cc | 66 set_relevance(match.relevance());
|
| omnibox_provider.cc | 71 // Derive relevance from omnibox relevance and normalize it to [0, 1].
74 set_relevance(match.relevance / 1500.0);
|
| /external/chromium_org/chrome/browser/ui/webui/omnibox/ |
| omnibox_ui_handler.cc | 55 // 'relevance': 1410,
123 output->SetInteger(item_prefix + ".relevance", it->relevance);
|
| /external/chromium/chrome/browser/metrics/ |
| metrics_log.cc | 487 WriteIntAttribute("relevance", i->relevance);
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.jdt.core_3.6.2.v_A76_R36x.jar | |
