/external/chromium_org/ui/app_list/search/ |
H A D | tokenized_string_match.cc | 40 // A relevance score that represents no match. 80 double relevance() const { return current_relevance_; } function in class:app_list::__anon16543::PrefixMatcher 86 State() : relevance(kNoMatchScore) {} 87 State(double relevance, argument 92 : relevance(relevance), 99 double relevance; member in struct:app_list::__anon16543::PrefixMatcher::State 114 // calculate relevance and matching ranges. And the current stats is 168 current_relevance_ = last_match.relevance; 203 relevance_ = matcher.relevance(); [all...] |
H A D | tokenized_string_match.h | 21 // calculates a relevance score between [0, 1] and marks the matched portions 22 // of text. A relevance of zero means the two are completely different to each 23 // other. The higher the relevance score, the better the two strings are 32 // Calculates the relevance and hits. Returns true if the two strings are 33 // somewhat matched, i.e. relevance score is not zero. 39 double relevance() const { return relevance_; } function in class:app_list::TokenizedStringMatch
|
H A D | tokenized_string_match_unittest.cc | 114 EXPECT_LT(match_low.relevance(), match_high.relevance())
|
/external/chromium_org/chrome/browser/autocomplete/ |
H A D | history_url_provider_unittest.cc | 352 EXPECT_LT(matches_.front().relevance, 1200); 359 EXPECT_GE(matches_.front().relevance, 1410); 587 int pandora_relevance = matches_[0].relevance; 595 EXPECT_EQ(pandora_relevance, matches_[0].relevance); 644 EXPECT_LE(1200, matches_[0].relevance); 645 EXPECT_LT(matches_[0].relevance, 1210); 651 int relevance; member in struct:TestCase 664 if (test_cases[i].relevance == 0) { 674 // Actual relevance should be at least what test_cases expects and 676 EXPECT_LE(test_cases[i].relevance, matches 685 int relevance; member in struct:TestCase [all...] |
H A D | bookmark_provider.cc | 120 if (match.relevance > 0) 225 // Summary on how a relevance score is determined for the match: 297 match.relevance = static_cast<int>(normalized_sum * kBookmarkScoreRange) + 301 if (match.relevance >= kMaxBookmarkScore) 308 match.relevance += 310 match.relevance = std::min(kMaxBookmarkScore, match.relevance);
|
H A D | search_provider_unittest.cc | 616 EXPECT_GT(term1_match.relevance, wyt_match.relevance); 756 EXPECT_GT(wyt_match.relevance, term_match.relevance); 768 // Without suggested relevance scores. 774 // With suggested relevance scores in a situation where navsuggest would 782 // With suggested relevance scores in a situation where navsuggest 790 // With suggested relevance scores in a situation where navsuggest 822 EXPECT_GT(wyt_match.relevance, term_match.relevance); [all...] |
H A D | shortcuts_provider.cc | 152 // Don't return shortcuts with zero relevance. 153 int relevance = CalculateScore(term_string, it->second, max_relevance); local 154 if (relevance) { 155 matches_.push_back(ShortcutToACMatch(it->second, relevance, input, 177 max_relevance = std::min(max_relevance, it->relevance); 178 it->relevance = max_relevance; 186 int relevance, 192 match.relevance = relevance; 184 ShortcutToACMatch( const history::ShortcutsDatabase::Shortcut& shortcut, int relevance, const AutocompleteInput& input, const base::string16& fixed_up_input_text) argument
|
H A D | shortcuts_provider.h | 52 // |relevance| score in the process, and highlights the description and 58 int relevance, 104 // The default max relevance unless overridden by a field trial.
|
H A D | history_quick_provider_unittest.cc | 319 int best_score = ac_matches_.begin()->relevance + 1; 328 EXPECT_LT(actual->relevance, best_score) 331 best_score = actual->relevance; 602 EXPECT_LT(ac_matches_[0].relevance, 610 EXPECT_GE(ac_matches_[0].relevance, 623 EXPECT_LT(ac_matches_[0].relevance, 631 EXPECT_LT(ac_matches_[0].relevance, 639 EXPECT_GE(ac_matches_[0].relevance, 649 EXPECT_GE(ac_matches_[0].relevance, 659 EXPECT_LT(ac_matches_[0].relevance, [all...] |
H A D | history_url_provider.cc | 115 // Calculates a new relevance score applying half-life time decaying to |count| 124 // Back off if above relevance cap. 146 // Returns a new relevance score for the given |match| based on the 147 // |old_relevance| score and |scoring_params|. The new relevance score is 161 int relevance = CalculateRelevanceUsingScoreBuckets( local 168 relevance = CalculateRelevanceUsingScoreBuckets( 169 scoring_params.visited_count_buckets, time_since_last_visit, relevance, 173 DCHECK_LE(relevance, old_relevance); 174 return relevance; 520 what_you_typed_match.relevance 866 int relevance = matches_.empty() ? local 1131 HistoryMatchToACMatch( const HistoryURLProviderParams& params, size_t match_number, MatchType match_type, int relevance) argument [all...] |
H A D | keyword_extensions_delegate_impl.cc | 82 // suggestions from last time. We need to readjust the relevance to 83 // ensure it is less than the main match's relevance. 86 matches()->back().relevance = matches()->front().relevance - (i + 1); 173 // the relevance of the first result (added synchronously in Start()), 175 // We recompute the first match's relevance; we know that |complete|
|
/external/chromium_org/ui/app_list/ |
H A D | search_result.h | 98 double relevance() const { return relevance_; } function in class:app_list::SearchResult 134 void set_relevance(double relevance) { relevance_ = relevance; } argument
|
/external/chromium_org/components/omnibox/ |
H A D | search_suggestion_parser.h | 33 // simply containing relevance-ranked search and navigation suggestions. 42 int relevance, 56 int relevance() const { return relevance_; } function in class:SearchSuggestionParser::Result 57 void set_relevance(int relevance) { relevance_ = relevance; } argument 73 // Returns the default relevance value for this result (which may 90 // The relevance score. 94 // Whether this result's relevance score was fully or partly calculated 124 int relevance, 192 int relevance, [all...] |
H A D | autocomplete_match.cc | 41 relevance(0), 52 int relevance, 56 relevance(relevance), 68 relevance(match.relevance), 105 relevance = match.relevance; 164 // For equal-relevance matches, we sort alphabetically, so that providers 167 return (elem1.relevance 51 AutocompleteMatch(AutocompleteProvider* provider, int relevance, bool deletable, Type type) argument [all...] |
H A D | autocomplete_match_unittest.cc | 30 m1.relevance = cases[i].r1; 31 m2.relevance = cases[i].r2;
|
H A D | autocomplete_result_unittest.cc | 56 match.relevance = 57 matches->empty() ? 1300 : (matches->back().relevance - 100); 77 int relevance; member in struct:AutocompleteResultTest::TestData 138 match->relevance = data.relevance; 165 EXPECT_EQ(expected_match.relevance, match.relevance) << i; 211 match.relevance = 1; 231 // Tests that if the new results have a lower max relevance score than last, 232 // any copied results have their relevance shifte [all...] |
H A D | base_search_provider_unittest.cc | 157 EXPECT_EQ(1300, match.relevance); 162 EXPECT_EQ(850, duplicate.relevance); 185 EXPECT_EQ(1300, match.relevance); 190 EXPECT_EQ(850, duplicate.relevance);
|
H A D | search_suggestion_parser.cc | 45 int relevance, 51 relevance_(relevance), 71 int relevance, 76 relevance, 177 int relevance, 181 : Result(from_keyword_provider, relevance, relevance_from_server, type, 351 // Reset suggested relevance information. 397 int relevance = default_result_relevance; local 409 // Apply valid suggested relevance scores; discard invalid lists. 410 if (relevances != NULL && !relevances->GetInteger(index, &relevance)) 44 Result(bool from_keyword_provider, int relevance, bool relevance_from_server, AutocompleteMatchType::Type type, const std::string& deletion_url) argument 60 SuggestResult( const base::string16& suggestion, AutocompleteMatchType::Type type, const base::string16& match_contents, const base::string16& match_contents_prefix, const base::string16& annotation, const base::string16& answer_contents, const base::string16& answer_type, const std::string& suggest_query_params, const std::string& deletion_url, bool from_keyword_provider, int relevance, bool relevance_from_server, bool should_prefetch, const base::string16& input_text) argument 170 NavigationResult( const AutocompleteSchemeClassifier& scheme_classifier, const GURL& url, AutocompleteMatchType::Type type, const base::string16& description, const std::string& deletion_url, bool from_keyword_provider, int relevance, bool relevance_from_server, const base::string16& input_text, const std::string& languages) argument 475 suggest_query_params, deletion_url, is_keyword_result, relevance, local [all...] |
H A D | autocomplete_result.cc | 33 // Returns the relevance score of |match| demoted appropriately by 56 match.relevance : (match.relevance * demotion_it->second); 61 // Compute demoted relevance scores for each match. 64 // For equal-relevance matches, we sort alphabetically, so that providers 158 // clamp globally. This way, old high-relevance matches will starve new 159 // low-relevance matches, under the assumption that the new matches will 161 // new low-relevance match appear and then quickly get pushed off the bottom; 235 // In the process of trimming, drop all matches with a demoted relevance 449 matches_.front().relevance [all...] |
H A D | autocomplete_match.h | 90 int relevance, 266 // The relevance of this match. See table in autocomplete.h for scores 269 // supply matches with appropriate relevance. 273 int relevance; member in struct:AutocompleteMatch
|
H A D | keyword_provider.h | 117 // Determines the relevance for some input, given its type, whether the user 120 // If |allow_exact_keyword_match| is false, the relevance for complete 129 // If |relevance| is negative, calculate a relevance based on heuristics. 136 int relevance);
|
/external/chromium_org/chrome/browser/ui/app_list/search/ |
H A D | app_search_provider_unittest.cc | 28 return result1->relevance() > result2->relevance(); 46 // Sort results by relevance. 74 // because the test only considers textual relevance and the two apps end
|
H A D | mixer_unittest.cc | 23 TestSearchResult(const std::string& id, double relevance) argument 27 set_relevance(relevance); 36 new TestSearchResult(id(), relevance())).Pass(); 71 const double relevance = 1.0 - i / 10.0; variable 72 Add(scoped_ptr<SearchResult>(new TestSearchResult(id, relevance)).Pass());
|
/external/chromium_org/chrome/android/java/src/org/chromium/chrome/browser/omnibox/ |
H A D | AutocompleteController.java | 215 private static OmniboxSuggestion buildOmniboxSuggestion(int nativeType, int relevance, argument 219 return new OmniboxSuggestion(nativeType, relevance, transition, text, description,
|
H A D | OmniboxSuggestion.java | 92 public OmniboxSuggestion(int nativeType, int relevance, int transition, argument 97 mRelevance = relevance; 178 * @return The relevance score of this suggestion. 186 return mType + " relevance=" + mRelevance + " \"" + mDisplayText + "\" -> " + mUrl;
|