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

net/disk_cache/blockfile/rankings.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 "net/disk_cache/blockfile/rankings.h"
 
 #include <stdint.h>
 
 #include <limits>
 
@@ skipping 184 matching lines @@
 
 }  // namespace
 
 namespace disk_cache {
 
 Rankings::ScopedRankingsBlock::ScopedRankingsBlock() : rankings_(NULL) {}
 
 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings)
     : rankings_(rankings) {}
 
-Rankings::ScopedRankingsBlock::ScopedRankingsBlock(
-    Rankings* rankings, CacheRankingsBlock* node)
-    : scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
+Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings,
+                                                   CacheRankingsBlock* node)
+    : std::unique_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
 
 Rankings::Iterator::Iterator() {
   memset(this, 0, sizeof(Iterator));
 }
 
 void Rankings::Iterator::Reset() {
   if (my_rankings) {
     for (int i = 0; i < 3; i++)
       ScopedRankingsBlock(my_rankings, nodes[i]);
   }
@@ skipping 602 matching lines @@
                                Addr* last, Addr* second_last, int* num_items) {
   Addr current = forward ? heads_[list] : tails_[list];
   *last = *second_last = current;
   *num_items = 0;
   if (!current.is_initialized())
     return ERR_NO_ERROR;
 
   if (!current.SanityCheckForRankings())
     return ERR_INVALID_HEAD;
 
-  scoped_ptr<CacheRankingsBlock> node;
+  std::unique_ptr<CacheRankingsBlock> node;
   Addr prev_addr(current);
   do {
     node.reset(new CacheRankingsBlock(backend_->File(current), current));
     node->Load();
     if (!SanityCheck(node.get(), true))
       return ERR_INVALID_ENTRY;
 
     CacheAddr next = forward ? node->Data()->next : node->Data()->prev;
     CacheAddr prev = forward ? node->Data()->prev : node->Data()->next;
 
@@ skipping 79 matching lines @@
 void Rankings::DecrementCounter(List list) {
   if (!count_lists_)
     return;
 
   DCHECK(control_data_->sizes[list] > 0);
   if (control_data_->sizes[list] > 0)
     control_data_->sizes[list]--;
 }
 
 }  // namespace disk_cache