HomeSort by relevance Sort by last modified time
    Searched refs:TermMatches (Results 1 - 16 of 16) sorted by null

  /external/chromium_org/chrome/browser/history/
scored_history_match.h 63 const TermMatches& url_matches() const { return url_matches_; }
64 const TermMatches& title_matches() const { return title_matches_; }
72 static TermMatches FilterTermMatchesByWordStarts(
73 const TermMatches& term_matches,
138 // Both these TermMatches contain the set of matches that are considered
145 TermMatches url_matches_;
147 TermMatches title_matches_;
in_memory_url_index_types.h 39 typedef std::vector<TermMatch> TermMatches;
56 // Returns a TermMatches which has an entry for each occurrence of the
60 // with |term_num| so that the resulting TermMatches can be merged
61 // with other TermMatches for other terms. Note that only the first
64 TermMatches MatchTermInString(const base::string16& term,
70 TermMatches SortAndDeoverlapMatches(const TermMatches& matches);
73 std::vector<size_t> OffsetsFromTermMatches(const TermMatches& matches);
77 TermMatches ReplaceOffsetsInTermMatches(const TermMatches& matches
    [all...]
in_memory_url_index_types.cc 56 TermMatches MatchTermInString(const base::string16& term,
63 TermMatches matches;
71 // Comparison function for sorting TermMatches by their offsets.
76 TermMatches SortAndDeoverlapMatches(const TermMatches& matches) {
79 TermMatches sorted_matches = matches;
81 TermMatches clean_matches;
83 for (TermMatches::const_iterator iter = sorted_matches.begin();
93 std::vector<size_t> OffsetsFromTermMatches(const TermMatches& matches) {
95 for (TermMatches::const_iterator i = matches.begin(); i != matches.end(); ++i
    [all...]
in_memory_url_index_types_unittest.cc 90 TermMatches matches_e;
95 TermMatches matches_f = SortAndDeoverlapMatches(matches_e);
115 TermMatches matches_g = MatchTermInString(
125 history::TermMatches matches_a;
139 history::TermMatches matches_b =
scored_history_match.cc 74 TermMatches url_term_matches = MatchTermInString(term, url, term_num);
75 TermMatches title_term_matches = MatchTermInString(term, title, term_num);
251 TermMatches ScoredHistoryMatch::FilterTermMatchesByWordStarts(
252 const TermMatches& term_matches,
259 TermMatches filtered_matches;
262 for (TermMatches::const_iterator iter = term_matches.begin();
340 for (TermMatches::const_iterator iter = url_matches_.begin();
389 for (TermMatches::const_iterator iter = title_matches_.begin();
  /external/chromium/chrome/browser/autocomplete/
history_quick_provider.h 17 class TermMatches;
68 const history::TermMatches& matches,
history_quick_provider.cc 167 history::TermMatches new_matches =
217 const history::TermMatches& matches,
history_quick_provider_unittest.cc 291 history::TermMatches matches_a;
323 history::TermMatches matches_b;
  /external/chromium_org/chrome/browser/autocomplete/
history_provider.h 41 const history::TermMatches& matches,
history_provider.cc 75 const history::TermMatches& matches,
history_quick_provider.cc 273 history::TermMatches new_matches =
history_quick_provider_unittest.cc 409 history::TermMatches matches_a;
441 history::TermMatches matches_b;
history_url_provider.cc     [all...]
  /external/chromium/chrome/browser/history/
in_memory_url_index.h 57 typedef std::vector<TermMatch> TermMatches;
71 TermMatches url_matches; // Term matches within the URL.
72 TermMatches title_matches; // Term matches within the page title.
169 static std::vector<size_t> OffsetsFromTermMatches(const TermMatches& matches);
173 static TermMatches ReplaceOffsetsInTermMatches(
174 const TermMatches& matches,
275 // Creates a TermMatches which has an entry for each occurrence of the string
277 // that the resulting TermMatches can be merged with other TermMatches for
279 static TermMatches MatchTermInString(const string16& term
    [all...]
in_memory_url_index.cc 95 // Comparison function for sorting TermMatches by their offsets.
100 // std::accumulate helper function to add up TermMatches' lengths.
644 TermMatches InMemoryURLIndex::MatchTermInString(const string16& term,
647 TermMatches matches;
655 TermMatches InMemoryURLIndex::SortAndDeoverlap(const TermMatches& matches) {
658 TermMatches sorted_matches = matches;
661 TermMatches clean_matches;
664 for (TermMatches::const_iterator iter = sorted_matches.begin() + 1;
676 const TermMatches& matches)
    [all...]
in_memory_url_index_unittest.cc 337 TermMatches matches_a;
342 TermMatches matches_b = InMemoryURLIndex::SortAndDeoverlap(matches_a);
362 TermMatches matches_c = InMemoryURLIndex::MatchTermInString(
372 history::TermMatches matches_a;
387 history::TermMatches matches_b =

Completed in 491 milliseconds