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

base/containers/mru_cache_unittest.cc

 // Copyright (c) 2011 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 "base/containers/mru_cache.h"
 
 #include <stddef.h>
 
 #include <memory>
 
@@ skipping 227 matching lines @@
 TEST(MRUCacheTest, AutoEvict) {
   using Cache = base::MRUCache<int, std::unique_ptr<CachedItem>>;
   static const Cache::size_type kMaxSize = 3;
 
   int initial_count = cached_item_live_count;
 
   {
     Cache cache(kMaxSize);
 
     static const int kItem1Key = 1, kItem2Key = 2, kItem3Key = 3, kItem4Key = 4;
-    cache.Put(kItem1Key, WrapUnique(new CachedItem(20)));
-    cache.Put(kItem2Key, WrapUnique(new CachedItem(21)));
-    cache.Put(kItem3Key, WrapUnique(new CachedItem(22)));
-    cache.Put(kItem4Key, WrapUnique(new CachedItem(23)));
+    cache.Put(kItem1Key, MakeUnique<CachedItem>(20));
+    cache.Put(kItem2Key, MakeUnique<CachedItem>(21));
+    cache.Put(kItem3Key, MakeUnique<CachedItem>(22));
+    cache.Put(kItem4Key, MakeUnique<CachedItem>(23));
 
     // The cache should only have kMaxSize items in it even though we inserted
     // more.
     EXPECT_EQ(kMaxSize, cache.size());
   }
 
   // There should be no objects leaked.
   EXPECT_EQ(initial_count, cached_item_live_count);
 }
 
@@ skipping 113 matching lines @@
     EXPECT_EQ(item2.value, iter->second.value);
 
     ++iter;
     ASSERT_TRUE(iter != cache2.end());
     EXPECT_EQ(kItem1Key, iter->first);
     EXPECT_EQ(item1.value, iter->second.value);
   }
 }
 
 }  // namespace base