Change scoped_ptr to std::unique_ptr in //net/disk_cache.

net/disk_cache/blockfile/index_table_v3_unittest.cc

 // Copyright 2014 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 "net/disk_cache/blockfile/index_table_v3.h"
 
 #include <stdint.h>
 #include <utility>
 
 #include "base/logging.h"
@@ skipping 45 matching lines @@
   // |num_entries| is the capacity of the main table. The extra table is half
   // the size of the main table.
   explicit TestCacheTables(int num_entries);
   ~TestCacheTables() {}
 
   void GetInitData(IndexTableInitData* result);
   void CopyFrom(const TestCacheTables& other);
   base::Time start_time() const { return start_time_; }
 
  private:
-  scoped_ptr<uint64_t[]> main_bitmap_;
-  scoped_ptr<disk_cache::IndexBucket[]> main_table_;
-  scoped_ptr<disk_cache::IndexBucket[]> extra_table_;
+  std::unique_ptr<uint64_t[]> main_bitmap_;
+  std::unique_ptr<disk_cache::IndexBucket[]> main_table_;
+  std::unique_ptr<disk_cache::IndexBucket[]> extra_table_;
   base::Time start_time_;
   int num_bitmap_bytes_;
 
   DISALLOW_COPY_AND_ASSIGN(TestCacheTables);
 };
 
 TestCacheTables::TestCacheTables(int num_entries) {
   DCHECK_GE(num_entries, 1024);
   DCHECK_EQ(num_entries, num_entries / 1024 * 1024);
   main_table_.reset(new disk_cache::IndexBucket[num_entries]);
@@ skipping 494 matching lines @@
   ASSERT_EQ(3u, iterator.cells.size());
   EXPECT_EQ(entries[41].hash, iterator.cells[0].hash);
   EXPECT_EQ(entries[42].hash, iterator.cells[1].hash);
   EXPECT_EQ(entries[43].hash, iterator.cells[2].hash);
 }
 
 // Tests doubling of the table.
 TEST(DiskCacheIndexTable, Doubling) {
   IndexTable index(NULL);
   int size = 1024;
-  scoped_ptr<TestCacheTables> cache(new TestCacheTables(size));
+  std::unique_ptr<TestCacheTables> cache(new TestCacheTables(size));
   int entry_id = 0;
   disk_cache::CellList entries;
 
   // Go from 1024 to 256k cells.
   for (int resizes = 0; resizes <= 8; resizes++) {
-    scoped_ptr<TestCacheTables> old_cache(std::move(cache));
+    std::unique_ptr<TestCacheTables> old_cache(std::move(cache));
     cache.reset(new TestCacheTables(size));
     cache.get()->CopyFrom(*old_cache.get());
 
     IndexTableInitData init_data;
     cache.get()->GetInitData(&init_data);
     index.Init(&init_data);
 
     // Write some entries.
     for (int i = 0; i < 250; i++, entry_id++) {
       SCOPED_TRACE(entry_id);
@@ skipping 14 matching lines @@
     disk_cache::EntrySet found_entries = index.LookupEntries(entries[i].hash);
     ASSERT_EQ(1u, found_entries.cells.size());
     EXPECT_TRUE(found_entries.cells[0].IsValid());
   }
 }
 
 // Tests bucket chaining when growing the index.
 TEST(DiskCacheIndexTable, BucketChains) {
   IndexTable index(NULL);
   int size = 1024;
-  scoped_ptr<TestCacheTables> cache(new TestCacheTables(size));
+  std::unique_ptr<TestCacheTables> cache(new TestCacheTables(size));
   disk_cache::CellList entries;
 
   IndexTableInitData init_data;
   cache.get()->GetInitData(&init_data);
   index.Init(&init_data);
 
   // Write some entries.
   for (int i = 0; i < 8; i++) {
     SCOPED_TRACE(i);
     uint32_t hash = i * 256;
     disk_cache::Addr addr(disk_cache::BLOCK_ENTRIES, 1, 5, i * 7 + 1);
     EntryCell entry = index.CreateEntryCell(hash, addr);
     EXPECT_TRUE(entry.IsValid());
 
     disk_cache::CellInfo info = { hash, addr };
     entries.push_back(info);
   }
 
   // Double the size.
-  scoped_ptr<TestCacheTables> old_cache(std::move(cache));
+  std::unique_ptr<TestCacheTables> old_cache(std::move(cache));
   cache.reset(new TestCacheTables(size * 2));
   cache.get()->CopyFrom(*old_cache.get());
 
   cache.get()->GetInitData(&init_data);
   index.Init(&init_data);
 
   // Write more entries, starting with the upper half of the table.
   for (int i = 9; i < 11; i++) {
     SCOPED_TRACE(i);
     uint32_t hash = i * 256;
@@ skipping 47 matching lines @@
 
   uint32_t hash = 0;
   disk_cache::Addr addr(disk_cache::BLOCK_ENTRIES, 1, 5, 6);
   EntryCell entry = index.CreateEntryCell(hash, addr);
   EXPECT_TRUE(entry.IsValid());
 
   index.OnBackupTimer();
   int expected = (1024 + 512) / 8 + sizeof(disk_cache::IndexHeaderV3);
   EXPECT_EQ(expected, backend.buffer_len());
 }