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

components/sync_sessions/revisit/bookmarks_page_revisit_observer_unittest.cc

 // Copyright 2015 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 "components/sync_sessions/revisit/bookmarks_page_revisit_observer.h"
 
 #include <memory>
 #include <vector>
 
 #include "base/memory/ptr_util.h"
@@ skipping 21 matching lines @@
   }
 
  private:
   const std::vector<const bookmarks::BookmarkNode*>& nodes_;
 };
 
 }  // namespace
 
 void RunObserver(const std::vector<const bookmarks::BookmarkNode*>& nodes) {
   BookmarksPageRevisitObserver observer(
-      base::WrapUnique(new TestBookmarksByUrlProvider(nodes)));
+      base::MakeUnique<TestBookmarksByUrlProvider>(nodes));
   observer.OnPageVisit(kExampleGurl, PageVisitObserver::kTransitionPage);
 }
 
 void ExpectMiss(const std::vector<const bookmarks::BookmarkNode*>& nodes) {
   base::HistogramTester histogram_tester;
   RunObserver(nodes);
   histogram_tester.ExpectUniqueSample("Sync.PageRevisitBookmarksMissTransition",
                                       PageVisitObserver::kTransitionPage, 1);
   histogram_tester.ExpectTotalCount("Sync.PageRevisitBookmarksDuration", 1);
 }
@@ skipping 23 matching lines @@
 TEST(BookmarksPageRevisitObserver, MultipleMatchingBookmarks) {
   bookmarks::BookmarkNode node1(kExampleGurl);
   bookmarks::BookmarkNode node2(kExampleGurl);
   std::vector<const bookmarks::BookmarkNode*> nodes;
   nodes.push_back(&node1);
   nodes.push_back(&node2);
   ExpectMatch(nodes);
 }
 
 }  // namespace sync_sessions