Index: components/bookmarks/browser/bookmark_index.h |
diff --git a/components/bookmarks/browser/bookmark_index.h b/components/bookmarks/browser/bookmark_index.h |
index a5f9bbfe519f34af426e0c4fc0cd545d025b475d..1e00c8d5224aba12ac0064db289bc5c67131839d 100644 |
--- a/components/bookmarks/browser/bookmark_index.h |
+++ b/components/bookmarks/browser/bookmark_index.h |
@@ -58,11 +58,10 @@ class BookmarkIndex { |
void SortMatches(const NodeSet& matches, Nodes* sorted_nodes) const; |
// Add |node| to |results| if the node matches the query. |
- void AddMatchToResults( |
- const BookmarkNode* node, |
- query_parser::QueryParser* parser, |
- const query_parser::QueryNodeStarVector& query_nodes, |
- std::vector<BookmarkMatch>* results); |
+ void AddMatchToResults(const BookmarkNode* node, |
+ query_parser::QueryParser* parser, |
+ const query_parser::QueryNodeVector& query_nodes, |
+ std::vector<BookmarkMatch>* results); |
// Populates |matches| for the specified term. If |first_term| is true, this |
// is the first term in the query. Returns true if there is at least one node |