Cleaning up url_index_private_data and in_memory_url_index_types.

components/omnibox/browser/in_memory_url_index_unittest.cc

 // 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.
 
 #include <stddef.h>
 #include <stdint.h>
 
 #include <algorithm>
 #include <fstream>
+#include <numeric>
 
 #include "base/auto_reset.h"
 #include "base/files/file_path.h"
 #include "base/files/file_util.h"
 #include "base/files/scoped_temp_dir.h"
 #include "base/i18n/case_conversion.h"
 #include "base/macros.h"
 #include "base/memory/ptr_util.h"
 #include "base/message_loop/message_loop.h"
 #include "base/path_service.h"
@@ skipping 711 matching lines @@
 
   struct ItemGroup {
     history::URLID min_id;
     history::URLID max_id;
     int typed_count;
     int visit_count;
     base::TimeDelta days_ago;
   };
 
   auto GetHistoryIdsUpTo = [&](HistoryID max) {
-    HistoryIDSet res;
-    // All ids are inserted in the end so the implicit hint would work.
-    for (HistoryID id = kMinRowId; id < max; ++id)
-      res.insert(id);
+    HistoryIDVector res(max - kMinRowId);
+    std::iota(res.begin(), res.end(), kMinRowId);
     return res;
   };
 
   auto CountGroupElementsInIds = [](const ItemGroup& group,
-                                    const HistoryIDSet& ids) {
+                                    const HistoryIDVector& ids) {
     return std::count_if(ids.begin(), ids.end(), [&](history::URLID id) {
       return group.min_id <= id && id < group.max_id;
     });
   };
 
   // Test body --------------------------------------------------------------
 
   // Groups of items ordered by increasing priority.
   ItemGroup item_groups[] = {
       {0, 0, kLowTypedCount, kLowVisitCount, kOld},
@@ skipping 682 matching lines @@
   ASSERT_TRUE(GetCacheFilePath(&full_file_path));
   std::vector<base::FilePath::StringType> actual_parts;
   full_file_path.GetComponents(&actual_parts);
   ASSERT_EQ(expected_parts.size(), actual_parts.size());
   size_t count = expected_parts.size();
   for (size_t i = 0; i < count; ++i)
     EXPECT_EQ(expected_parts[i], actual_parts[i]);
   // Must clear the history_dir_ to satisfy the dtor's DCHECK.
   set_history_dir(base::FilePath());
 }