Re-write many calls to WrapUnique() with MakeUnique()

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 216 matching lines @@
     *error = base::StringPrintf(kVectorOfStringsExpected, keys::kSchemesKey);
     return nullptr;
   }
   for (std::vector<std::string>::const_iterator it = schemas.begin();
        it != schemas.end(); ++it) {
     if (ContainsUpperCase(*it)) {
       *error = base::StringPrintf(kLowerCaseExpected, "Scheme");
       return nullptr;
     }
   }
-  return base::WrapUnique(new URLMatcherSchemeFilter(schemas));
+  return base::MakeUnique<URLMatcherSchemeFilter>(schemas);
 }
 
 // static
 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;
@@ skipping 13 matching lines @@
         *error = kInvalidPortRanges;
         return nullptr;
       }
       ranges.push_back(URLMatcherPortFilter::CreateRange(from, to));
     } else {
       *error = kInvalidPortRanges;
       return nullptr;
     }
   }
 
-  return base::WrapUnique(new URLMatcherPortFilter(ranges));
+  return base::MakeUnique<URLMatcherPortFilter>(ranges);
 }
 
 }  // namespace url_matcher