Safe-browsing SBAddPrefix from vector to deque.

chrome/browser/safe_browsing/safe_browsing_store_unittest.cc

 // 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.
 
 #include "chrome/browser/safe_browsing/safe_browsing_store.h"
 #include "chrome/browser/safe_browsing/safe_browsing_store_unittest_helper.h"
 
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace {
@@ skipping 94 matching lines @@
                                    SBSubFullHash(9, 10, one)));
 
   // Equal is not less-than.
   EXPECT_FALSE(SBAddPrefixHashLess(SBSubFullHash(12, 10, one),
                                    SBSubFullHash(9, 10, one)));
 }
 
 // SBProcessSubs does a lot of iteration, run through empty just to
 // make sure degenerate cases work.
 TEST(SafeBrowsingStoreTest, SBProcessSubsEmpty) {
-  std::vector<SBAddPrefix> add_prefixes;
+  SBAddPrefixes add_prefixes;
   std::vector<SBAddFullHash> add_hashes;
   std::vector<SBSubPrefix> sub_prefixes;
   std::vector<SBSubFullHash> sub_hashes;
 
   const base::hash_set<int32> no_deletions;
   SBProcessSubs(&add_prefixes, &sub_prefixes, &add_hashes, &sub_hashes,
                 no_deletions, no_deletions);
   EXPECT_TRUE(add_prefixes.empty());
   EXPECT_TRUE(sub_prefixes.empty());
   EXPECT_TRUE(add_hashes.empty());
@@ skipping 10 matching lines @@
   const int kSubChunk1 = 2;
 
   // Construct some full hashes which share prefix with another.
   SBFullHash kHash1mod1 = kHash1;
   kHash1mod1.full_hash[sizeof(kHash1mod1.full_hash) - 1] ++;
   SBFullHash kHash1mod2 = kHash1mod1;
   kHash1mod2.full_hash[sizeof(kHash1mod2.full_hash) - 1] ++;
   SBFullHash kHash1mod3 = kHash1mod2;
   kHash1mod3.full_hash[sizeof(kHash1mod3.full_hash) - 1] ++;
 
-  std::vector<SBAddPrefix> add_prefixes;
+  SBAddPrefixes add_prefixes;
   std::vector<SBAddFullHash> add_hashes;
   std::vector<SBSubPrefix> sub_prefixes;
   std::vector<SBSubFullHash> sub_hashes;
 
   // An add with prefix and a couple hashes, plus a sub for the prefix
   // and a couple sub hashes.  The sub should knock all of them out.
   add_prefixes.push_back(SBAddPrefix(kAddChunk1, kHash1.prefix));
   add_hashes.push_back(SBAddFullHash(kAddChunk1, kNow, kHash1));
   add_hashes.push_back(SBAddFullHash(kAddChunk1, kNow, kHash1mod1));
   sub_prefixes.push_back(SBSubPrefix(kSubChunk1, kAddChunk1, kHash1.prefix));
@@ skipping 42 matching lines @@
   const int kSubChunk1 = 2;
 
   // Construct some full hashes which share prefix with another.
   SBFullHash kHash1mod1 = kHash1;
   kHash1mod1.full_hash[sizeof(kHash1mod1.full_hash) - 1] ++;
   SBFullHash kHash1mod2 = kHash1mod1;
   kHash1mod2.full_hash[sizeof(kHash1mod2.full_hash) - 1] ++;
   SBFullHash kHash1mod3 = kHash1mod2;
   kHash1mod3.full_hash[sizeof(kHash1mod3.full_hash) - 1] ++;
 
-  std::vector<SBAddPrefix> add_prefixes;
+  SBAddPrefixes add_prefixes;
   std::vector<SBAddFullHash> add_hashes;
   std::vector<SBSubPrefix> sub_prefixes;
   std::vector<SBSubFullHash> sub_hashes;
 
   // An add with prefix and a couple hashes, plus a sub for the prefix
   // and a couple sub hashes.  The sub should knock all of them out.
   add_prefixes.push_back(SBAddPrefix(kAddChunk1, kHash1.prefix));
   add_hashes.push_back(SBAddFullHash(kAddChunk1, kNow, kHash1));
   add_hashes.push_back(SBAddFullHash(kAddChunk1, kNow, kHash1mod1));
   sub_prefixes.push_back(SBSubPrefix(kSubChunk1, kAddChunk1, kHash1.prefix));
@@ skipping 41 matching lines @@
 TEST(SafeBrowsingStoreTest, Y2K38) {
   const base::Time now = base::Time::Now();
   const base::Time future = now + base::TimeDelta::FromDays(3*365);
 
   // TODO: Fix file format before 2035.
   EXPECT_GT(static_cast<int32>(future.ToTimeT()), 0)
     << " (int32)time_t is running out.";
 }
 
 }  // namespace