/external/chromium_org/chrome/browser/ui/app_list/search/ |
chrome_search_result.h | 50 double relevance() { return relevance_; } function in class:app_list::ChromeSearchResult 54 void set_relevance(double relevance) { relevance_ = relevance; }
|
tokenized_string_match.h | 20 // calculates a relevance score between [0, 1] and marks the matched portions 21 // of text. A relevance of zero means the two are completely different to each 22 // other. The higher the relevance score, the better the two strings are 31 // Calculates the relevance and hits. Returns true if the two strings are 32 // somewhat matched, i.e. relevance score is not zero. 38 double relevance() const { return relevance_; } function in class:app_list::TokenizedStringMatch
|
mixer_unittest.cc | 23 TestSearchResult(const std::string& id, double relevance) { 26 set_relevance(relevance); 36 new TestSearchResult(id(), relevance())).Pass(); 58 const double relevance = 1.0 - i / 10.0; variable 60 new TestSearchResult(id, relevance)).Pass());
|
tokenized_string_match_unittest.cc | 79 TEST(TokenizedStringMatchTest, Relevance) { 106 EXPECT_LT(match_low.relevance(), match_high.relevance())
|
/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:__anon4271::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);
|
/external/chromium_org/chrome/browser/autocomplete/ |
history_url_provider_unittest.cc | 328 EXPECT_LT(matches_.front().relevance, 1200); 335 EXPECT_GE(matches_.front().relevance, 1410); 556 int pandora_relevance = matches_[0].relevance; 564 EXPECT_EQ(pandora_relevance, matches_[0].relevance); 610 EXPECT_LE(1200, matches_[0].relevance); 611 EXPECT_LT(matches_[0].relevance, 1210); 617 int relevance; member in struct:TestCase 630 if (test_cases[i].relevance == 0) { 639 // Actual relevance should be at least what test_cases expects and 641 EXPECT_LE(test_cases[i].relevance, matches_[0].relevance) 650 int relevance; member in struct:TestCase [all...] |
autocomplete_result_unittest.cc | 35 // Relevance score. 36 int relevance; member in struct:AutocompleteResultTest::TestData 98 match->relevance = data.relevance; 124 EXPECT_EQ(expected_match.relevance, match.relevance) << i; 167 match.relevance = 1; 186 // Tests that if the new results have a lower max relevance score than last, 187 // any copied results have their relevance shifted down. 257 // lower-relevance one should be dropped. All of the results with empty URL [all...] |
search_provider.h | 64 // |relevance|, and |type|, which represents a search via |template_url| for 82 int relevance, 161 // simply containing relevance-ranked search and navigation suggestions. 170 int relevance, 176 int relevance() const { return relevance_; } function in class:SearchProvider::Result 177 void set_relevance(int relevance) { relevance_ = relevance; } 188 // Returns the default relevance value for this result (which may 199 // The relevance score. 203 // Whether this result's relevance score was fully or partly calculate [all...] |
autocomplete_match.cc | 43 relevance(0), 55 int relevance, 59 relevance(relevance), 72 relevance(match.relevance), 107 relevance = match.relevance; 168 // For equal-relevance matches, we sort alphabetically, so that providers 171 return (elem1.relevance == elem2.relevance) [all...] |
zero_suggest_provider.cc | 69 // The maximum relevance of the top match from this provider. 72 // Relevance value to use if it was not set explicitly by the server. 251 // Reset suggested relevance information from the provider. 285 int relevance = kDefaultZeroSuggestRelevance; local 287 // Apply valid suggested relevance scores; discard invalid lists. 288 if (relevances != NULL && !relevances->GetInteger(index, &relevance)) 297 *this, url, title, false, relevance, relevances != NULL)); 301 result, false, relevance, relevances != NULL)); 311 AddMatchToMap(results[i].relevance(), AutocompleteMatchType::SEARCH_SUGGEST, 316 void ZeroSuggestProvider::AddMatchToMap(int relevance, [all...] |
autocomplete_match_unittest.cc | 30 m1.relevance = cases[i].r1; 31 m2.relevance = cases[i].r2;
|
search_provider.cc | 123 int relevance, 126 relevance_(relevance), 138 int relevance, 140 : Result(from_keyword_provider, relevance, relevance_from_server), 167 int relevance, 169 : Result(from_keyword_provider, relevance, relevance_from_server), 197 // Sort in descending relevance order. 198 return a.relevance() > b.relevance(); 262 int relevance, 912 int relevance = -1; local 1261 int relevance = CalculateRelevanceForHistory( local [all...] |
search_provider_unittest.cc | 405 EXPECT_GT(term1_match.relevance, wyt_match.relevance); 545 EXPECT_GT(wyt_match.relevance, term_match.relevance); 563 EXPECT_GT(wyt_match.relevance, term_match.relevance); 571 EXPECT_GT(term_match.relevance, wyt_match.relevance); 588 EXPECT_GT(term_match.relevance, wyt_match.relevance); 2322 const int relevance; member in struct:__anon6634::__anon6635 [all...] |
bookmark_provider.cc | 107 if (match.relevance > 0) 184 // Summary on how a relevance score is determined for the match: 240 match.relevance = std::min(kMaxBookmarkScore, 245 if (match.relevance >= kMaxBookmarkScore) 252 match.relevance += 254 match.relevance = std::min(kMaxBookmarkScore, match.relevance);
|
autocomplete_result.cc | 27 // Returns the relevance score of |match| demoted appropriately by 50 match.relevance : (match.relevance * demotion_it->second); 55 // Compute demoted relevance scores for each match. 58 // For equal-relevance matches, we sort alphabetically, so that providers 112 // clamp globally. This way, old high-relevance matches will starve new 113 // low-relevance matches, under the assumption that the new matches will 115 // new low-relevance match appear and then quickly get pushed off the bottom; 173 // In the process of trimming, drop all matches with a demoted relevance 339 matches_.front().relevance : new_matches[0].relevance) - 1 [all...] |
history_quick_provider_unittest.cc | 276 int best_score = ac_matches_.begin()->relevance + 1; 285 EXPECT_LT(actual->relevance, best_score) 288 best_score = actual->relevance; 309 EXPECT_LT(ac_matches_[0].relevance, 491 EXPECT_LT(ac_matches_[0].relevance, 498 EXPECT_GE(ac_matches_[0].relevance, 509 EXPECT_LT(ac_matches_[0].relevance, 516 EXPECT_LT(ac_matches_[0].relevance, 523 EXPECT_GE(ac_matches_[0].relevance, 531 EXPECT_GE(ac_matches_[0].relevance, [all...] |
extension_app_provider.cc | 93 match.relevance = CalculateRelevance( 221 int relevance = 575 + static_cast<int>(type_count_boost) + local 223 DCHECK_LE(relevance, kMaxRelevance); 224 return relevance;
|
keyword_provider.h | 113 // Determines the relevance for some input, given its type, whether the user 116 // If |allow_exact_keyword_match| is false, the relevance for complete 125 // If |relevance| is negative, calculate a relevance based on heuristics. 131 int relevance);
|
shortcuts_provider.h | 55 int relevance,
|
/external/chromium_org/chrome/common/ |
instant_types.cc | 30 relevance(0) {
|