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

cc/output/bsp_tree.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/output/bsp_tree.h"
 
 #include <memory>
 #include <vector>
 
 #include "base/memory/ptr_util.h"
 #include "cc/base/container_util.h"
 #include "cc/output/bsp_compare_result.h"
 #include "cc/quads/draw_polygon.h"
 
 namespace cc {
 
 BspNode::BspNode(std::unique_ptr<DrawPolygon> data)
     : node_data(std::move(data)) {}
 
 BspNode::~BspNode() {
 }
 
 BspTree::BspTree(std::deque<std::unique_ptr<DrawPolygon>>* list) {
   if (list->size() == 0)
     return;
 
-  root_ = base::WrapUnique(new BspNode(PopFront(list)));
+  root_ = base::MakeUnique<BspNode>(PopFront(list));
   BuildTree(root_.get(), list);
 }
 
 // The idea behind using a deque for BuildTree's input is that we want to be
 // able to place polygons that we've decided aren't splitting plane candidates
 // at the back of the queue while moving the candidate splitting planes to the
 // front when the heuristic decides that they're a better choice. This way we
 // can always simply just take from the front of the deque for our node's
 // data.
 void BspTree::BuildTree(
@@ skipping 22 matching lines @@
     } else {
       if (new_front)
         front_list.push_back(std::move(new_front));
       if (new_back)
         back_list.push_back(std::move(new_back));
     }
   }
 
   // Build the back subtree using the front of the back_list as our splitter.
   if (back_list.size() > 0) {
-    node->back_child = base::WrapUnique(new BspNode(PopFront(&back_list)));
+    node->back_child = base::MakeUnique<BspNode>(PopFront(&back_list));
     BuildTree(node->back_child.get(), &back_list);
   }
 
   // Build the front subtree using the front of the front_list as our splitter.
   if (front_list.size() > 0) {
-    node->front_child = base::WrapUnique(new BspNode(PopFront(&front_list)));
+    node->front_child = base::MakeUnique<BspNode>(PopFront(&front_list));
     BuildTree(node->front_child.get(), &front_list);
   }
 }
 
 // The base comparer with 0,0,0 as camera position facing forward
 BspCompareResult BspTree::GetCameraPositionRelative(const DrawPolygon& node) {
   if (node.normal().z() > 0.0f) {
     return BSP_FRONT;
   }
   return BSP_BACK;
 }
 
 BspTree::~BspTree() {
 }
 
 }  // namespace cc