Replace string16 with base::string16.

chrome/browser/bookmarks/bookmark_index.h

 // Copyright (c) 2010 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_BOOKMARKS_BOOKMARK_INDEX_H_
 #define CHROME_BROWSER_BOOKMARKS_BOOKMARK_INDEX_H_
 
 #include <map>
 #include <set>
 #include <vector>
@@ skipping 27 matching lines @@
   ~BookmarkIndex();
 
   // Invoked when a bookmark has been added to the model.
   void Add(const BookmarkNode* node);
 
   // Invoked when a bookmark has been removed from the model.
   void Remove(const BookmarkNode* node);
 
   // Returns up to |max_count| of bookmarks containing the text |query|.
   void GetBookmarksWithTitlesMatching(
-      const string16& query,
+      const base::string16& query,
       size_t max_count,
       std::vector<BookmarkTitleMatch>* results);
 
  private:
   typedef std::set<const BookmarkNode*> NodeSet;
   typedef std::map<string16, NodeSet> Index;
 
   struct Match;
   typedef std::vector<Match> Matches;
 
@@ skipping 24 matching lines @@
 
   // Add |node| to |results| if the node matches the query.
   void AddMatchToResults(const BookmarkNode* node,
                          QueryParser* parser,
                          const std::vector<QueryNode*>& query_nodes,
                          std::vector<BookmarkTitleMatch>* 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
   // matching the term.
-  bool GetBookmarksWithTitleMatchingTerm(const string16& term,
+  bool GetBookmarksWithTitleMatchingTerm(const base::string16& term,
                                          bool first_term,
                                          Matches* matches);
 
   // Iterates over |matches| updating each Match's nodes to contain the
   // intersection of the Match's current nodes and the nodes at |index_i|.
   // If the intersection is empty, the Match is removed.
   //
   // This is invoked from GetBookmarksWithTitleMatchingTerm.
   void CombineMatchesInPlace(const Index::const_iterator& index_i,
                              Matches* matches);
 
   // Iterates over |current_matches| calculating the intersection between the
   // Match's nodes and the nodes at |index_i|. If the intersection between the
   // two is non-empty, a new match is added to |result|.
   //
   // This differs from CombineMatchesInPlace in that if the intersection is
   // non-empty the result is added to result, not combined in place. This
   // variant is used for prefix matching.
   //
   // This is invoked from GetBookmarksWithTitleMatchingTerm.
   void CombineMatches(const Index::const_iterator& index_i,
                       const Matches& current_matches,
                       Matches* result);
 
   // Returns the set of query words from |query|.
-  std::vector<string16> ExtractQueryWords(const string16& query);
+  std::vector<string16> ExtractQueryWords(const base::string16& query);
 
   // Adds |node| to |index_|.
-  void RegisterNode(const string16& term, const BookmarkNode* node);
+  void RegisterNode(const base::string16& term, const BookmarkNode* node);
 
   // Removes |node| from |index_|.
-  void UnregisterNode(const string16& term, const BookmarkNode* node);
+  void UnregisterNode(const base::string16& term, const BookmarkNode* node);
 
   Index index_;
 
   content::BrowserContext* browser_context_;
 
   DISALLOW_COPY_AND_ASSIGN(BookmarkIndex);
 };
 
 #endif  // CHROME_BROWSER_BOOKMARKS_BOOKMARK_INDEX_H_