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

cc/tiles/eviction_tile_priority_queue.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 "cc/tiles/eviction_tile_priority_queue.h"
 
 #include "base/memory/ptr_util.h"
 
 namespace cc {
 
@@ skipping 53 matching lines @@
   TreePriority tree_priority_;
 };
 
 void CreateTilingSetEvictionQueues(
     const std::vector<PictureLayerImpl*>& layers,
     TreePriority tree_priority,
     std::vector<std::unique_ptr<TilingSetEvictionQueue>>* queues) {
   DCHECK(queues->empty());
 
   for (auto* layer : layers) {
-    std::unique_ptr<TilingSetEvictionQueue> tiling_set_queue = base::WrapUnique(
-        new TilingSetEvictionQueue(layer->picture_layer_tiling_set()));
+    std::unique_ptr<TilingSetEvictionQueue> tiling_set_queue =
+        base::MakeUnique<TilingSetEvictionQueue>(
+            layer->picture_layer_tiling_set());
     // Queues will only contain non empty tiling sets.
     if (!tiling_set_queue->IsEmpty())
       queues->push_back(std::move(tiling_set_queue));
   }
   std::make_heap(queues->begin(), queues->end(),
                  EvictionOrderComparator(tree_priority));
 }
 
 }  // namespace
 
@@ skipping 76 matching lines @@
                                                          : active_queues_;
   }
 
   // Return tile with a lower priority.
   if (pending_priority.IsHigherPriorityThan(active_priority))
     return active_queues_;
   return pending_queues_;
 }
 
 }  // namespace cc