Replace FTS in the history_service with a brute force text search.

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 28 matching lines @@
   // Returns true if this node matches |word|. If |exact| is true, the string
   // must exactly match. Otherwise, this uses a starts with comparison.
   virtual bool Matches(const string16& word, bool exact) const = 0;
 
   // Returns true if this node matches at least one of the words in |words|. An
   // entry is added to |match_positions| for all matching words giving the
   // matching regions.
   virtual bool HasMatchIn(const std::vector<QueryWord>& words,
                           Snippet::MatchPositions* match_positions) const = 0;
 
+  // Returns true if this node matches at least one of the words in |words|.
+  virtual bool HasMatchIn(const std::vector<QueryWord>& words) const = 0;
+
   // Appends the words that make up this node in |words|.
   virtual void AppendWords(std::vector<string16>* words) const = 0;
 };
 
 // This class is used to parse queries entered into the history search into more
 // normalized queries that can be passed to the SQLite backend.
 class QueryParser {
  public:
   QueryParser();
 
@@ skipping 21 matching lines @@
   // the nodes passes to the caller.
   void ParseQueryNodes(const string16& query, std::vector<QueryNode*>* nodes);
 
   // Returns true if the string text matches the query nodes created by a call
   // to ParseQuery. If the query does match, each of the matching positions in
   // the text is added to |match_positions|.
   bool DoesQueryMatch(const string16& text,
                       const std::vector<QueryNode*>& nodes,
                       Snippet::MatchPositions* match_positions);
 
+  // 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 string16& text, std::vector<QueryWord>* words);
+
  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 string16& query, QueryNodeList* root);
 
-  // Extracts the words from |text|, placing each word into |words|.
-  void ExtractQueryWords(const string16& text, std::vector<QueryWord>* words);
-
   DISALLOW_COPY_AND_ASSIGN(QueryParser);
 };
 
 #endif  // CHROME_BROWSER_HISTORY_QUERY_PARSER_H_