| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_match.cc | 13 relevance(0),
25 int relevance,
29 relevance(relevance),
84 // For equal-relevance matches, we sort alphabetically, so that providers
87 if (elem1.relevance == elem2.relevance)
90 return elem1.relevance > elem2.relevance;
|
| history_contents_provider.cc | 32 MatchReference(const history::URLResult* result, int relevance)
34 relevance(relevance) {
38 int relevance; // Score of relevance computed by CalculateRelevance. member in struct:__anon3808::MatchReference
43 if (a.relevance != b.relevance)
44 return a.relevance > b.relevance;
175 // Reset the relevance counters so that result relevance won't vary o
[all...] |
| autocomplete_result_unittest.cc | 22 // Relevance score.
23 int relevance; member in struct:AutocompleteResultTest::TestData
60 match->relevance = data.relevance;
85 EXPECT_EQ(expected_match.relevance, match.relevance) << i;
143 // Tests that if the new results have a lower max relevance score than last,
144 // any copied results have their relevance shifted down.
|
| autocomplete_match.h | 87 int relevance,
133 // The relevance of this match. See table in autocomplete.h for scores
136 // supply matches with appropriate relevance.
140 int relevance; member in struct:AutocompleteMatch
|
| extension_app_provider.cc | 75 match.relevance = CalculateRelevance(input.type(),
169 int relevance = 575 + static_cast<int>(type_count_boost) + local
171 DCHECK_LE(relevance, kMaxRelevance);
172 return relevance;
|
| keyword_provider.h | 111 // Determines the relevance for some input, given its type, whether the user
114 // If |allow_exact_keyword_match| is false, the relevance for complete
123 // If |relevance| is negative, calculate a relevance based on heuristics.
130 int relevance);
|
| 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...] |
| history_url_provider.cc | 361 // promoted relevance, but a different match from the input ("foo") does, and
405 match->relevance = CalculateRelevance(input.type(), type, 0);
[all...] |
| /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 | |
| org.eclipse.jface.text_3.6.1.r361_v20100825-0800.jar | |
