Lines Matching refs:Matches
84 Matches matches;
86 if (!GetBookmarksWithTitleMatchingTerm(terms[i], i == 0, &matches))
91 SortMatches(matches, &node_typed_counts);
95 // matches and so this shouldn't be performance critical.
101 // so that the best matches will always be included in the results. The loop
104 // best matches.
110 void BookmarkIndex::SortMatches(const Matches& matches,
118 for (Matches::const_iterator i = matches.begin(); i != matches.end(); ++i)
146 // Check that the result matches the query. The previous search
160 Matches* matches) {
173 matches->push_back(match);
176 CombineMatchesInPlace(i, matches);
179 // index adding all entries that start with term to matches.
185 matches->push_back(match);
190 // current matches in matches with term, placing result in result.
191 Matches result;
195 CombineMatches(i, *matches, &result);
198 matches->swap(result);
200 return !matches->empty();
204 Matches* matches) {
205 for (size_t i = 0; i < matches->size(); ) {
206 Match* match = &((*matches)[i]);
212 matches->erase(matches->begin() + i);
222 const Matches& current_matches,
223 Matches* result) {
