Searched defs:relevance (Results 1 - 10 of 10) sorted by relevance

/external/chromium/chrome/browser/autocomplete/
H A Dautocomplete_match.cc13 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;
24 AutocompleteMatch(AutocompleteProvider* provider, int relevance, bool deletable, Type type) argument
H A Dautocomplete_match.h87 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
H A Dautocomplete_result_unittest.cc23 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.
H A Dhistory_contents_provider.cc32 MatchReference(const history::URLResult* result, int relevance) argument
34 relevance(relevance) {
38 int relevance; // Score of relevance computed by CalculateRelevance. member in struct:__anon1288::MatchReference
43 if (a.relevance != b.relevance)
44 return a.relevance > b.relevance;
175 // Reset the relevance counter
[all...]
H A Dautocomplete_unittest.cc37 TestProvider(int relevance, const string16& prefix) argument
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;
H A Dextension_app_provider.cc75 match.relevance = CalculateRelevance(input.type(),
169 int relevance = 575 + static_cast<int>(type_count_boost) + local
171 DCHECK_LE(relevance, kMaxRelevance);
172 return relevance;
H A Dkeyword_provider.cc234 // 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()),
382 CreateAutocompleteMatch( TemplateURLModel* model, const string16& keyword, const AutocompleteInput& input, size_t prefix_length, const string16& remaining_input, int relevance) argument
H A Dsearch_provider.cc611 // 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,
852 NavigationToMatch( const NavigationResult& navigation, int relevance, bool is_keyword) argument
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.jdt.core_3.6.2.v_A76_R36x.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.jface.text_3.6.1.r361_v20100825-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 121 milliseconds