Safe-browsing SBAddPrefix from vector to deque.

chrome/browser/safe_browsing/safe_browsing_store_unittest_helper.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_unittest_helper.h"
 
 #include "base/file_util.h"
 
 namespace {
 
@@ skipping 27 matching lines @@
   EXPECT_FALSE(store->CheckAddChunk(0));
   EXPECT_FALSE(store->CheckAddChunk(1));
   EXPECT_FALSE(store->CheckAddChunk(-1));
 
   EXPECT_FALSE(store->CheckSubChunk(0));
   EXPECT_FALSE(store->CheckSubChunk(1));
   EXPECT_FALSE(store->CheckSubChunk(-1));
 
   std::vector<SBAddFullHash> pending_adds;
   std::set<SBPrefix> prefix_misses;
-  std::vector<SBAddPrefix> add_prefixes_result;
+  SBAddPrefixContainer add_prefixes_result;
   std::vector<SBAddFullHash> add_full_hashes_result;
 
   EXPECT_TRUE(store->FinishUpdate(pending_adds,
                                   prefix_misses,
                                   &add_prefixes_result,
                                   &add_full_hashes_result));
   EXPECT_TRUE(add_prefixes_result.empty());
   EXPECT_TRUE(add_full_hashes_result.empty());
 }
 
@@ skipping 24 matching lines @@
   store->GetAddChunks(&chunks);
   ASSERT_EQ(1U, chunks.size());
   EXPECT_EQ(kAddChunk1, chunks[0]);
 
   store->GetSubChunks(&chunks);
   ASSERT_EQ(1U, chunks.size());
   EXPECT_EQ(kSubChunk1, chunks[0]);
 
   std::vector<SBAddFullHash> pending_adds;
   std::set<SBPrefix> prefix_misses;
-  std::vector<SBAddPrefix> add_prefixes_result;
+  SBAddPrefixContainer add_prefixes_result;
   std::vector<SBAddFullHash> add_full_hashes_result;
 
   EXPECT_TRUE(store->FinishUpdate(pending_adds,
                                   prefix_misses,
                                   &add_prefixes_result,
                                   &add_full_hashes_result));
 
   ASSERT_EQ(2U, add_prefixes_result.size());
   EXPECT_EQ(kAddChunk1, add_prefixes_result[0].chunk_id);
   EXPECT_EQ(kHash1.prefix, add_prefixes_result[0].prefix);
@@ skipping 52 matching lines @@
   EXPECT_TRUE(store->WriteAddPrefix(kAddChunk1, kHash2.prefix));
   EXPECT_TRUE(store->WriteAddHash(kAddChunk1, now, kHash2));
 
   store->SetSubChunk(kSubChunk1);
   EXPECT_TRUE(store->WriteSubPrefix(kSubChunk1, kAddChunk3, kHash3.prefix));
   EXPECT_TRUE(store->WriteSubPrefix(kSubChunk1, kAddChunk1, kHash2.prefix));
   EXPECT_TRUE(store->FinishChunk());
 
   std::vector<SBAddFullHash> pending_adds;
   std::set<SBPrefix> prefix_misses;
-  std::vector<SBAddPrefix> add_prefixes_result;
+  SBAddPrefixContainer add_prefixes_result;
   std::vector<SBAddFullHash> add_full_hashes_result;
 
   EXPECT_TRUE(store->FinishUpdate(pending_adds,
                                   prefix_misses,
                                   &add_prefixes_result,
                                   &add_full_hashes_result));
 
   // Knocked out the chunk expected.
   ASSERT_EQ(1U, add_prefixes_result.size());
   EXPECT_EQ(kAddChunk1, add_prefixes_result[0].chunk_id);
@@ skipping 83 matching lines @@
   store->DeleteSubChunk(kSubChunk1);
 
   // Not actually deleted until finish.
   EXPECT_TRUE(store->CheckAddChunk(kAddChunk1));
   EXPECT_TRUE(store->CheckAddChunk(kAddChunk2));
   EXPECT_TRUE(store->CheckSubChunk(kSubChunk1));
   EXPECT_TRUE(store->CheckSubChunk(kSubChunk2));
 
   std::vector<SBAddFullHash> pending_adds;
   std::set<SBPrefix> prefix_misses;
-  std::vector<SBAddPrefix> add_prefixes_result;
+  SBAddPrefixContainer add_prefixes_result;
   std::vector<SBAddFullHash> add_full_hashes_result;
 
   EXPECT_TRUE(store->FinishUpdate(pending_adds,
                                   prefix_misses,
                                   &add_prefixes_result,
                                   &add_full_hashes_result));
 
   EXPECT_EQ(1U, add_prefixes_result.size());
   EXPECT_EQ(kAddChunk2, add_prefixes_result[0].chunk_id);
   EXPECT_EQ(kHash3.prefix, add_prefixes_result[0].prefix);
@@ skipping 49 matching lines @@
   store->SetAddChunk(kAddChunk1);
   EXPECT_TRUE(store->WriteAddPrefix(kAddChunk1, kHash1.prefix));
   EXPECT_TRUE(store->WriteAddPrefix(kAddChunk1, kHash2.prefix));
 
   store->SetSubChunk(kSubChunk1);
   EXPECT_TRUE(store->WriteSubPrefix(kSubChunk1, kAddChunk3, kHash3.prefix));
   EXPECT_TRUE(store->FinishChunk());
 
   std::vector<SBAddFullHash> pending_adds;
   std::set<SBPrefix> prefix_misses;
-  std::vector<SBAddPrefix> add_prefixes_result;
+  SBAddPrefixContainer add_prefixes_result;
   std::vector<SBAddFullHash> add_full_hashes_result;
 
   EXPECT_TRUE(store->FinishUpdate(pending_adds,
                                   prefix_misses,
                                   &add_prefixes_result,
                                   &add_full_hashes_result));
 
   EXPECT_TRUE(file_util::PathExists(filename));
   EXPECT_TRUE(store->Delete());
   EXPECT_FALSE(file_util::PathExists(filename));
 }