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

base/task_scheduler/sequence_unittest.cc

 // Copyright 2016 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/task_scheduler/sequence.h"
 
 #include <utility>
 
 #include "base/bind.h"
 #include "base/macros.h"
@@ skipping 198 matching lines @@
 
   // Pop task D. The highest priority is now from task E (BACKGROUND). The
   // task in front of the sequence is now task E.
   sequence->PopTask();
   EXPECT_EQ(SequenceSortKey(TaskPriority::BACKGROUND, task_e_->sequenced_time),
             sequence->GetSortKey());
 }
 
 TEST_F(TaskSchedulerSequenceTest, CanPushTaskInTaskDestructor) {
   scoped_refptr<Sequence> sequence(new Sequence);
-  sequence->PushTask(WrapUnique(
-      new Task(FROM_HERE, Bind(&DoNothing, PushTaskInDestructor(sequence)),
-               TaskTraits(), TimeDelta())));
+  sequence->PushTask(MakeUnique<Task>(
+      FROM_HERE, Bind(&DoNothing, PushTaskInDestructor(sequence)), TaskTraits(),
+      TimeDelta()));
 
   // PushTask() is invoked on |sequence| when the popped Task is destroyed. If
   // PopTask() destroys the Task outside the scope of its lock as expected, no
   // deadlock will occur when PushTask() tries to acquire the Sequence's lock.
   sequence->PopTask();
 
   // Verify that |sequence| contains exactly one Task.
   EXPECT_TRUE(sequence->PeekTask());
   EXPECT_TRUE(sequence->PopTask());
 }
 
 }  // namespace internal
 }  // namespace base