OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:TermMatches
(Results
1 - 15
of
15
) sorted by null
/external/chromium_org/chrome/browser/history/
scored_history_match.h
62
const
TermMatches
& url_matches,
63
const
TermMatches
& title_matches,
99
TermMatches
url_matches; // Term matches within the URL.
100
TermMatches
title_matches; // Term matches within the page title.
in_memory_url_index_types.h
39
typedef std::vector<TermMatch>
TermMatches
;
55
// Returns a
TermMatches
which has an entry for each occurrence of the
59
// with |term_num| so that the resulting
TermMatches
can be merged
60
// with other
TermMatches
for other terms. Note that only the first
63
TermMatches
MatchTermInString(const string16& term,
69
TermMatches
SortAndDeoverlapMatches(const
TermMatches
& matches);
72
std::vector<size_t> OffsetsFromTermMatches(const
TermMatches
& matches);
76
TermMatches
ReplaceOffsetsInTermMatches(const
TermMatches
& matches
[
all
...]
in_memory_url_index_types.cc
46
TermMatches
MatchTermInString(const string16& term,
52
TermMatches
matches;
59
// Comparison function for sorting
TermMatches
by their offsets.
64
TermMatches
SortAndDeoverlapMatches(const
TermMatches
& matches) {
67
TermMatches
sorted_matches = matches;
69
TermMatches
clean_matches;
71
for (
TermMatches
::const_iterator iter = sorted_matches.begin();
81
std::vector<size_t> OffsetsFromTermMatches(const
TermMatches
& matches) {
83
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
70
TermMatches
url_term_matches = MatchTermInString(term, url, term_num);
71
TermMatches
title_term_matches = MatchTermInString(term, title, term_num);
250
const
TermMatches
& url_matches,
251
const
TermMatches
& title_matches,
293
for (
TermMatches
::const_iterator iter = url_matches.begin();
328
for (
TermMatches
::const_iterator iter = title_matches.begin();
scored_history_match_unittest.cc
98
TermMatches
url_matches = MatchTermInString(term, url, 0);
99
TermMatches
title_matches = MatchTermInString(term, title, 0);
/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_quick_provider.h
19
class
TermMatches
;
70
const history::
TermMatches
& matches,
history_quick_provider.cc
271
history::
TermMatches
new_matches =
320
const history::
TermMatches
& matches,
history_quick_provider_unittest.cc
417
history::
TermMatches
matches_a;
449
history::
TermMatches
matches_b;
/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 52 milliseconds