Implement Bookmark Autocomplete Provider

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 44 matching lines @@
   typedef std::map<string16, NodeSet> Index;
 
   struct Match;
   typedef std::vector<Match> Matches;
 
   // Pairs BookmarkNodes and the number of times the nodes' URLs were typed.
   // Used to sort Matches in decreasing order of typed count.
   typedef std::pair<const BookmarkNode*, int> NodeTypedCountPair;
   typedef std::vector<NodeTypedCountPair> NodeTypedCountPairs;
 
-  // Extracts |matches.nodes| into NodeTypedCountPairs and sorts the pairs in
-  // decreasing order of typed count.
+  // Extracts |matches.nodes| into NodeTypedCountPairs, sorts the pairs in
+  // decreasing order of typed count, and then de-dupes the matches.
   void SortMatches(const Matches& matches,
                    NodeTypedCountPairs* node_typed_counts) const;
 
   // Extracts BookmarkNodes from |match| and retrieves typed counts for each
   // node from the in-memory database. Inserts pairs containing the node and
   // typed count into the vector |node_typed_counts|. |node_typed_counts| is
   // sorted in decreasing order of typed count.
   void ExtractBookmarkNodePairs(history::URLDatabase* url_db,
                                 const Match& match,
                                 NodeTypedCountPairs* node_typed_counts) const;
@@ skipping 49 matching lines @@
   void UnregisterNode(const string16& term, const BookmarkNode* node);
 
   Index index_;
 
   Profile* profile_;
 
   DISALLOW_COPY_AND_ASSIGN(BookmarkIndex);
 };
 
 #endif  // CHROME_BROWSER_BOOKMARKS_BOOKMARK_INDEX_H_