Remove ScopedVector from ios/.

ios/chrome/browser/ui/bookmarks/bookmark_utils_ios_unittest.mm

 // Copyright 2013 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 <memory>
+#include <vector>
+
 #include "base/strings/sys_string_conversions.h"
 #include "base/strings/utf_string_conversions.h"
 #include "base/time/time.h"
 #include "components/bookmarks/browser/bookmark_model.h"
 #include "ios/chrome/browser/experimental_flags.h"
 #include "ios/chrome/browser/ui/bookmarks/bookmark_ios_unittest.h"
 #import "ios/chrome/browser/ui/bookmarks/bookmark_menu_item.h"
 #import "ios/chrome/browser/ui/bookmarks/bookmark_utils_ios.h"
 #include "testing/gtest_mac.h"
 
@@ skipping 40 matching lines @@
   _bookmarkModel->SetDateAdded(f2b, timeFromEpoch(10, 5));
 
   std::vector<const BookmarkNode*> toSort;
   toSort.push_back(a);
   toSort.push_back(b);
   toSort.push_back(f1a);
   toSort.push_back(f1b);
   toSort.push_back(f2a);
   toSort.push_back(f2b);
 
-  ScopedVector<NodesSection> nodesSectionVector;
+  std::vector<std::unique_ptr<NodesSection>> nodesSectionVector;
   bookmark_utils_ios::segregateNodes(toSort, nodesSectionVector);
 
   // Expect the nodes to be sorted in reverse chronological order, grouped by
   // month.
   ASSERT_EQ(nodesSectionVector.size(), 4u);
-  NodesSection* section = nodesSectionVector[0];
+  NodesSection* section = nodesSectionVector[0].get();
   ASSERT_EQ(section->vector.size(), 1u);
   EXPECT_EQ(section->vector[0], f2a);
 
-  section = nodesSectionVector[1];
+  section = nodesSectionVector[1].get();
   ASSERT_EQ(section->vector.size(), 2u);
   EXPECT_EQ(section->vector[0], b);
   EXPECT_EQ(section->vector[1], a);
 
-  section = nodesSectionVector[2];
+  section = nodesSectionVector[2].get();
   ASSERT_EQ(section->vector.size(), 2u);
   EXPECT_EQ(section->vector[0], f1b);
   EXPECT_EQ(section->vector[1], f1a);
 
-  section = nodesSectionVector[3];
+  section = nodesSectionVector[3].get();
   ASSERT_EQ(section->vector.size(), 1u);
   EXPECT_EQ(section->vector[0], f2b);
 }
 
 TEST_F(BookmarkIOSUtilsUnitTest, DeleteNodes) {
   const BookmarkNode* mobileNode = _bookmarkModel->mobile_node();
   const BookmarkNode* f1 = AddFolder(mobileNode, @"f1");
   const BookmarkNode* a = AddBookmark(mobileNode, @"a");
   const BookmarkNode* b = AddBookmark(mobileNode, @"b");
   const BookmarkNode* f2 = AddFolder(mobileNode, @"f2");
@@ skipping 300 matching lines @@
   vector1.push_back(bookmark1);
   vector2.insert(vector2.begin(), bookmark1);
   missingNodesIndices =
       bookmark_utils_ios::MissingNodesIndices(vector1, vector2);
   EXPECT_EQ(2u, missingNodesIndices.size());
   EXPECT_EQ(2u, missingNodesIndices[0]);
   EXPECT_EQ(3u, missingNodesIndices[1]);
 }
 
 }  // namespace