Convert //extensions/{common,shell} from scoped_ptr to std::unique_ptr

extensions/common/features/base_feature_provider.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 "extensions/common/features/base_feature_provider.h"
 
 #include <stddef.h>
 
 #include <stack>
 #include <utility>
@@ skipping 35 matching lines @@
 BaseFeatureProvider::BaseFeatureProvider(const base::DictionaryValue& root,
                                          FeatureFactory factory)
     : factory_(factory) {
   for (base::DictionaryValue::Iterator iter(root); !iter.IsAtEnd();
        iter.Advance()) {
     if (IsNocompile(iter.value())) {
       continue;
     }
 
     if (iter.value().GetType() == base::Value::TYPE_DICTIONARY) {
-      scoped_ptr<SimpleFeature> feature((*factory_)());
+      std::unique_ptr<SimpleFeature> feature((*factory_)());
 
       std::vector<std::string> split = base::SplitString(
           iter.key(), ".", base::TRIM_WHITESPACE, base::SPLIT_WANT_ALL);
 
       // Push parent features on the stack, starting with the current feature.
       // If one of the features has "noparent" set, stop pushing features on
       // the stack. The features will then be parsed in order, starting with
       // the farthest parent that is either top level or has "noparent" set.
       std::stack<std::pair<std::string, const base::DictionaryValue*> >
           parse_stack;
@@ skipping 40 matching lines @@
       if (parse_error)
         continue;
 
       features_[iter.key()] = std::move(feature);
     } else if (iter.value().GetType() == base::Value::TYPE_LIST) {
       // This is a complex feature.
       const base::ListValue* list =
           static_cast<const base::ListValue*>(&iter.value());
       CHECK_GT(list->GetSize(), 0UL);
 
-      scoped_ptr<ComplexFeature::FeatureList> features(
+      std::unique_ptr<ComplexFeature::FeatureList> features(
           new ComplexFeature::FeatureList());
 
       // Parse and add all SimpleFeatures from the list.
       for (base::ListValue::const_iterator list_iter = list->begin();
            list_iter != list->end(); ++list_iter) {
         if ((*list_iter)->GetType() != base::Value::TYPE_DICTIONARY) {
           LOG(ERROR) << iter.key() << ": Feature rules must be dictionaries.";
           continue;
         }
 
-        scoped_ptr<SimpleFeature> feature((*factory_)());
+        std::unique_ptr<SimpleFeature> feature((*factory_)());
         if (!ParseFeature(static_cast<const base::DictionaryValue*>(*list_iter),
                           iter.key(),
                           feature.get()))
           continue;
 
         features->push_back(std::move(feature));
       }
 
-      scoped_ptr<ComplexFeature> feature(
+      std::unique_ptr<ComplexFeature> feature(
           new ComplexFeature(std::move(features)));
       feature->set_name(iter.key());
 
       features_[iter.key()] = std::move(feature);
     } else {
       LOG(ERROR) << iter.key() << ": Feature description must be dictionary or"
                  << " list of dictionaries.";
     }
   }
 }
@@ skipping 41 matching lines @@
   std::vector<Feature*> result;
   result.reserve(std::distance(first_child, after_children));
   for (FeatureMap::const_iterator it = first_child; it != after_children;
        ++it) {
     result.push_back(it->second.get());
   }
   return result;
 }
 
 }  // namespace extensions