IndexedDB: WrapUnique(new T(args..)) -> MakeUnique<T>(args...)

content/browser/indexed_db/list_set_unittest.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 "content/browser/indexed_db/list_set.h"
 
 #include <memory>
 
+#include "base/memory/ptr_util.h"
 #include "base/memory/ref_counted.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace content {
 
 TEST(ListSetTest, ListSetIterator) {
   list_set<int> set;
   for (int i = 3; i > 0; --i)
     set.insert(i);
 
@@ skipping 122 matching lines @@
   set.erase(Wrapped<int>(2));
 
   EXPECT_EQ(0u, set.size());
   {
     list_set<Wrapped<int> >::iterator it = set.begin();
     EXPECT_EQ(set.end(), it);
   }
 }
 
 TEST(ListSetTest, ListSetPointer) {
-  std::unique_ptr<Wrapped<int>> w0(new Wrapped<int>(0));
-  std::unique_ptr<Wrapped<int>> w1(new Wrapped<int>(1));
-  std::unique_ptr<Wrapped<int>> w2(new Wrapped<int>(2));
+  std::unique_ptr<Wrapped<int>> w0 = base::MakeUnique<Wrapped<int>>(0);
+  std::unique_ptr<Wrapped<int>> w1 = base::MakeUnique<Wrapped<int>>(1);
+  std::unique_ptr<Wrapped<int>> w2 = base::MakeUnique<Wrapped<int>>(2);
 
   list_set<Wrapped<int>*> set;
   EXPECT_EQ(0u, set.size());
   {
     list_set<Wrapped<int>*>::iterator it = set.begin();
     EXPECT_EQ(set.end(), it);
   }
 
   set.insert(w0.get());
   set.insert(w1.get());
@@ skipping 69 matching lines @@
   set.erase(r2);
 
   EXPECT_EQ(0u, set.size());
   {
     list_set<scoped_refptr<RefCounted<int> > >::iterator it = set.begin();
     EXPECT_EQ(set.end(), it);
   }
 }
 
 }  // namespace content