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

components/omnibox/browser/in_memory_url_index_types.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_IN_MEMORY_URL_INDEX_TYPES_H_
 #define COMPONENTS_OMNIBOX_BROWSER_IN_MEMORY_URL_INDEX_TYPES_H_
 
 #include <stddef.h>
 
 #include <map>
@@ skipping 114 matching lines @@
 // Support for InMemoryURLIndex Private Data -----------------------------------
 
 // An index into a list of all of the words we have indexed.
 typedef size_t WordID;
 
 // A map allowing a WordID to be determined given a word.
 typedef std::map<base::string16, WordID> WordMap;
 
 // A map from character to the word_ids of words containing that character.
 typedef std::set<WordID> WordIDSet;  // An index into the WordList.
+typedef std::vector<WordID> WordIDVector;
 typedef std::map<base::char16, WordIDSet> CharWordIDMap;
 
 // A map from word (by word_id) to history items containing that word.
 typedef history::URLID HistoryID;
 typedef std::set<HistoryID> HistoryIDSet;
 typedef std::vector<HistoryID> HistoryIDVector;
 typedef std::map<WordID, HistoryIDSet> WordIDHistoryMap;
 typedef std::map<HistoryID, WordIDSet> HistoryIDWordMap;
 
 
@@ skipping 25 matching lines @@
 
   // Clears both url_word_starts_ and title_word_starts_.
   void Clear();
 
   WordStarts url_word_starts_;
   WordStarts title_word_starts_;
 };
 typedef std::map<HistoryID, RowWordStarts> WordStartsMap;
 
 #endif  // COMPONENTS_OMNIBOX_BROWSER_IN_MEMORY_URL_INDEX_TYPES_H_