Optimizing HQP using vectors manually. This is just a CL to be able

components/omnibox/browser/url_index_private_data.h

 // Copyright (c) 2012 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 COMPONENTS_OMNIBOX_BROWSER_URL_INDEX_PRIVATE_DATA_H_
 #define COMPONENTS_OMNIBOX_BROWSER_URL_INDEX_PRIVATE_DATA_H_
 
 #include <stddef.h>
 
 #include <set>
@@ skipping 154 matching lines @@
   // no longer needed.
   //
   // Items stored in the search term cache. If a search term exactly matches one
   // in the cache then we can quickly supply the proper |history_id_set_| (and
   // marking the cache item as being |used_|. If we find a prefix for a search
   // term in the cache (which is very likely to occur as the user types each
   // term into the omnibox) then we can short-circuit the index search for those
   // characters in the prefix by returning the |word_id_set|. In that case we do
   // not mark the item as being |used_|.
   struct SearchTermCacheItem {
-    SearchTermCacheItem(const WordIDSet& word_id_set,
-                        const HistoryIDSet& history_id_set);
+    SearchTermCacheItem(WordIDVector word_id_set, HistoryIDVector history_ids);
     // Creates a cache item for a term which has no results.
     SearchTermCacheItem();
     SearchTermCacheItem(const SearchTermCacheItem& other);
 
     ~SearchTermCacheItem();
 
-    WordIDSet word_id_set_;
-    HistoryIDSet history_id_set_;
+    WordIDVector word_id_set_;
+    HistoryIDVector history_id_set_;
     bool used_;  // True if this item has been used for the current term search.
   };
   typedef std::map<base::string16, SearchTermCacheItem> SearchTermCacheMap;
 
   // A helper class which performs the final filter on each candidate
   // history URL match, inserting accepted matches into |scored_matches_|.
   class AddHistoryMatch {
    public:
     AddHistoryMatch(bookmarks::BookmarkModel* bookmark_model,
                     TemplateURLService* template_url_service,
@@ skipping 35 matching lines @@
   };
 
   // URL History indexing support functions.
 
   // Composes a set of history item IDs by intersecting the set for each word
   // in |unsorted_words|.
   HistoryIDSet HistoryIDSetFromWords(const String16Vector& unsorted_words);
 
   // Helper function to HistoryIDSetFromWords which composes a set of history
   // ids for the given term given in |term|.
-  HistoryIDSet HistoryIDsForTerm(const base::string16& term);
+  HistoryIDVector HistoryIDsForTerm(const base::string16& term);
 
   // Given a set of Char16s, finds words containing those characters.
-  WordIDSet WordIDSetForTermChars(const Char16Set& term_chars);
+  WordIDVector WordIDSetForTermChars(const Char16Set& term_chars);
 
   // Indexes one URL history item as described by |row|. Returns true if the
   // row was actually indexed. |scheme_whitelist| is used to filter
   // non-qualifying schemes.  If |history_db| is not NULL then this function
   // uses the history database synchronously to get the URL's recent visits
   // information.  This mode should/ only be used on the historyDB thread.
   // If |history_db| is NULL, then this function uses |history_service| to
   // schedule a task on the historyDB thread to fetch and update the recent
   // visits information.
   bool IndexRow(history::HistoryDatabase* history_db,
@@ skipping 133 matching lines @@
   int saved_cache_version_;
 
   // Used for unit testing only. Records the number of candidate history items
   // at three stages in the index searching process.
   size_t pre_filter_item_count_;    // After word index is queried.
   size_t post_filter_item_count_;   // After trimming large result set.
   size_t post_scoring_item_count_;  // After performing final filter/scoring.
 };
 
 #endif  // COMPONENTS_OMNIBOX_BROWSER_URL_INDEX_PRIVATE_DATA_H_