Use std::unique_ptr for base::DictionaryValue and base::ListValue's internal store.

components/url_matcher/url_matcher_factory.cc

 // Copyright 2013 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 "components/url_matcher/url_matcher_factory.h"
 
 #include <algorithm>
 #include <cctype>
 #include <utility>
 
@@ skipping 230 matching lines @@
 std::unique_ptr<URLMatcherPortFilter> URLMatcherFactory::CreateURLMatcherPorts(
     const base::Value* value,
     std::string* error) {
   std::vector<URLMatcherPortFilter::Range> ranges;
   const base::ListValue* value_list = NULL;
   if (!value->GetAsList(&value_list)) {
     *error = kInvalidPortRanges;
     return nullptr;
   }
 
-  for (base::ListValue::const_iterator i = value_list->begin();
-       i != value_list->end(); ++i) {
-    base::Value* entry = *i;
+  for (const auto& entry : *value_list) {
     int port = 0;
     base::ListValue* range = NULL;
     if (entry->GetAsInteger(&port)) {
       ranges.push_back(URLMatcherPortFilter::CreateRange(port));
     } else if (entry->GetAsList(&range)) {
       int from = 0, to = 0;
       if (range->GetSize() != 2u ||
           !range->GetInteger(0, &from) ||
           !range->GetInteger(1, &to)) {
         *error = kInvalidPortRanges;
         return nullptr;
       }
       ranges.push_back(URLMatcherPortFilter::CreateRange(from, to));
     } else {
       *error = kInvalidPortRanges;
       return nullptr;
     }
   }
 
   return base::WrapUnique(new URLMatcherPortFilter(ranges));
 }
 
 }  // namespace url_matcher