Omnibox: Make URLs of Bookmarks Searchable

chrome/browser/history/query_parser.h

 // Copyright (c) 2011 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef CHROME_BROWSER_HISTORY_QUERY_PARSER_H_
 #define CHROME_BROWSER_HISTORY_QUERY_PARSER_H_
 
 #include <vector>
 
 #include "base/basictypes.h"
@@ skipping 83 matching lines @@
 
   // Returns true if all of the |words| match the query |nodes| created by a
   // call to ParseQuery.
   bool DoesQueryMatch(const std::vector<QueryWord>& words,
                       const std::vector<QueryNode*>& nodes);
 
   // Extracts the words from |text|, placing each word into |words|.
   void ExtractQueryWords(const base::string16& text,
                          std::vector<QueryWord>* words);
 
+  // Sorts the match positions in |matches| by their first index, then
+  // coalesces any match positions that intersect each other.
+  static void CoalesceAndSortMatchPositions(Snippet::MatchPositions* matches);

[Peter Kasting, 2014/04/16 23:44:25]

Nit: If it sorts and then coalesces, name it SortAndCoalesceMatchPositions().

[Mark P, 2014/04/17 20:24:18]

Done.

+
  private:
   // Does the work of parsing |query|; creates nodes in |root| as appropriate.
   // This is invoked from both of the ParseQuery methods.
   bool ParseQueryImpl(const base::string16& query, QueryNodeList* root);
 
   DISALLOW_COPY_AND_ASSIGN(QueryParser);
 };
 
 #endif  // CHROME_BROWSER_HISTORY_QUERY_PARSER_H_