cc: Replace Pass() with std::move() in some subdirs.

cc/output/bsp_tree_unittest.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 <deque>
 
 #include "base/macros.h"
 #include "base/memory/scoped_ptr.h"
 #include "cc/output/bsp_tree.h"
 #include "cc/output/bsp_walk_action.h"
@@ skipping 96 matching lines @@
   vertices_c.push_back(gfx::Point3F(10.0f, 10.0f, 5.0f));
 
   scoped_ptr<DrawPolygon> polygon_a(
       CREATE_DRAW_POLYGON(vertices_a, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 0));
   scoped_ptr<DrawPolygon> polygon_b(
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 1));
   scoped_ptr<DrawPolygon> polygon_c(
       CREATE_DRAW_POLYGON(vertices_c, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 2));
 
   std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-  polygon_list.push_back(polygon_a.Pass());
-  polygon_list.push_back(polygon_b.Pass());
-  polygon_list.push_back(polygon_c.Pass());
+  polygon_list.push_back(std::move(polygon_a));
+  polygon_list.push_back(std::move(polygon_b));
+  polygon_list.push_back(std::move(polygon_c));
 
   int compare_ids[] = {1, 0, 2};
   std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
   BspTreeTest::RunTest(&polygon_list, compare_list);
 }
 
 // Basic two polygon split, can be viewed as a + from above.
 TEST(BspTreeTest, BasicSplit) {
   std::vector<gfx::Point3F> vertices_a;
   vertices_a.push_back(gfx::Point3F(-5.0f, -5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(-5.0f, 5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(5.0f, 5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(5.0f, -5.0f, 0.0f));
   std::vector<gfx::Point3F> vertices_b;
   vertices_b.push_back(gfx::Point3F(0.0f, -5.0f, -5.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, 5.0f, -5.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, 5.0f, 5.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, -5.0f, 5.0f));
 
   scoped_ptr<DrawPolygon> polygon_a(
       CREATE_DRAW_POLYGON(vertices_a, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 0));
   scoped_ptr<DrawPolygon> polygon_b(
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(-1.0f, 0.0f, 0.0f), 1));
 
   std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-  polygon_list.push_back(polygon_a.Pass());
-  polygon_list.push_back(polygon_b.Pass());
+  polygon_list.push_back(std::move(polygon_a));
+  polygon_list.push_back(std::move(polygon_b));
 
   int compare_ids[] = {1, 0, 1};
   std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
   BspTreeTest::RunTest(&polygon_list, compare_list);
 }
 
 // Same as above with the second quad offset so it doesn't intersect. One quad
 // should be very clearly on one side of the other, and no splitting should
 // occur.
 TEST(BspTreeTest, QuadOffset) {
   std::vector<gfx::Point3F> vertices_a;
   vertices_a.push_back(gfx::Point3F(-5.0f, -5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(-5.0f, 5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(5.0f, 5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(5.0f, -5.0f, 0.0f));
   std::vector<gfx::Point3F> vertices_b;
   vertices_b.push_back(gfx::Point3F(0.0f, 5.0f, -15.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, -5.0f, -15.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, -5.0f, -10.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, 5.0f, -10.0f));
 
   scoped_ptr<DrawPolygon> polygon_a(
       CREATE_DRAW_POLYGON(vertices_a, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 0));
   scoped_ptr<DrawPolygon> polygon_b(
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(-1.0f, 0.0f, 0.0f), 1));
 
   std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-  polygon_list.push_back(polygon_a.Pass());
-  polygon_list.push_back(polygon_b.Pass());
+  polygon_list.push_back(std::move(polygon_a));
+  polygon_list.push_back(std::move(polygon_b));
 
   int compare_ids[] = {1, 0};
   std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
   BspTreeTest::RunTest(&polygon_list, compare_list);
 }
 
 // Same as above, but this time we change the order in which the quads are
 // inserted into the tree, causing one to actually cross the plane of the other
 // and cause a split.
 TEST(BspTreeTest, QuadOffsetSplit) {
   std::vector<gfx::Point3F> vertices_a;
   vertices_a.push_back(gfx::Point3F(-5.0f, -5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(-5.0f, 5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(5.0f, 5.0f, 0.0f));
   vertices_a.push_back(gfx::Point3F(5.0f, -5.0f, 0.0f));
   std::vector<gfx::Point3F> vertices_b;
   vertices_b.push_back(gfx::Point3F(0.0f, -5.0f, -15.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, 5.0f, -15.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, 5.0f, -10.0f));
   vertices_b.push_back(gfx::Point3F(0.0f, -5.0f, -10.0f));
 
   scoped_ptr<DrawPolygon> polygon_a(
       CREATE_DRAW_POLYGON(vertices_a, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 0));
   scoped_ptr<DrawPolygon> polygon_b(
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(-1.0f, 0.0f, 0.0f), 1));
 
   std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-  polygon_list.push_back(polygon_b.Pass());
-  polygon_list.push_back(polygon_a.Pass());
+  polygon_list.push_back(std::move(polygon_b));
+  polygon_list.push_back(std::move(polygon_a));
 
   int compare_ids[] = {0, 1, 0};
   std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
   BspTreeTest::RunTest(&polygon_list, compare_list);
 }
 
 // In addition to what can be viewed as a + from above, another piece of
 // geometry is inserted to cut these pieces right in the middle, viewed as
 // a quad from overhead.
 TEST(BspTreeTest, ThreeWaySplit) {
@@ skipping 14 matching lines @@
   vertices_c.push_back(gfx::Point3F(5.0f, 0.0f, -5.0f));
 
   scoped_ptr<DrawPolygon> polygon_a(
       CREATE_DRAW_POLYGON(vertices_a, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 0));
   scoped_ptr<DrawPolygon> polygon_b(
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(-1.0f, 0.0f, 0.0f), 1));
   scoped_ptr<DrawPolygon> polygon_c(
       CREATE_DRAW_POLYGON(vertices_c, gfx::Vector3dF(0.0f, 1.0f, 0.0f), 2));
 
   std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-  polygon_list.push_back(polygon_a.Pass());
-  polygon_list.push_back(polygon_b.Pass());
-  polygon_list.push_back(polygon_c.Pass());
+  polygon_list.push_back(std::move(polygon_a));
+  polygon_list.push_back(std::move(polygon_b));
+  polygon_list.push_back(std::move(polygon_c));
 
   int compare_ids[] = {2, 1, 2, 0, 2, 1, 2};
   std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
   BspTreeTest::RunTest(&polygon_list, compare_list);
 }
 
 // This test checks whether coplanar geometry, when inserted into the tree in
 // order, comes back in the same order as it should.
 TEST(BspTreeTest, Coplanar) {
   std::vector<gfx::Point3F> vertices_a;
@@ skipping 18 matching lines @@
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 1));
   scoped_ptr<DrawPolygon> polygon_c(
       CREATE_DRAW_POLYGON(vertices_c, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 2));
 
   scoped_ptr<DrawPolygon> polygon_d = polygon_a->CreateCopy();
   scoped_ptr<DrawPolygon> polygon_e = polygon_b->CreateCopy();
   scoped_ptr<DrawPolygon> polygon_f = polygon_c->CreateCopy();
 
   {
     std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-    polygon_list.push_back(polygon_a.Pass());
-    polygon_list.push_back(polygon_b.Pass());
-    polygon_list.push_back(polygon_c.Pass());
+    polygon_list.push_back(std::move(polygon_a));
+    polygon_list.push_back(std::move(polygon_b));
+    polygon_list.push_back(std::move(polygon_c));
 
     int compare_ids[] = {0, 1, 2};
     std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
     BspTreeTest::RunTest(&polygon_list, compare_list);
   }
 
   // Now check a different order and ensure we get that back as well
   {
     std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-    polygon_list.push_back(polygon_f.Pass());
-    polygon_list.push_back(polygon_d.Pass());
-    polygon_list.push_back(polygon_e.Pass());
+    polygon_list.push_back(std::move(polygon_f));
+    polygon_list.push_back(std::move(polygon_d));
+    polygon_list.push_back(std::move(polygon_e));
 
     int compare_ids[] = {0, 1, 2};
     std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
     BspTreeTest::RunTest(&polygon_list, compare_list);
   }
 }
 
 // A bunch of coplanar geometry should end up sharing a single node, and
 // result in the final piece of geometry splitting into just two pieces on
 // either side of the shared plane.
@@ skipping 22 matching lines @@
   scoped_ptr<DrawPolygon> polygon_a(
       CREATE_DRAW_POLYGON(vertices_a, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 0));
   scoped_ptr<DrawPolygon> polygon_b(
       CREATE_DRAW_POLYGON(vertices_b, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 1));
   scoped_ptr<DrawPolygon> polygon_c(
       CREATE_DRAW_POLYGON(vertices_c, gfx::Vector3dF(0.0f, 0.0f, 1.0f), 2));
   scoped_ptr<DrawPolygon> polygon_d(
       CREATE_DRAW_POLYGON(vertices_d, gfx::Vector3dF(-1.0f, 0.0f, 0.0f), 3));
 
   std::deque<scoped_ptr<DrawPolygon>> polygon_list;
-  polygon_list.push_back(polygon_a.Pass());
-  polygon_list.push_back(polygon_b.Pass());
-  polygon_list.push_back(polygon_c.Pass());
-  polygon_list.push_back(polygon_d.Pass());
+  polygon_list.push_back(std::move(polygon_a));
+  polygon_list.push_back(std::move(polygon_b));
+  polygon_list.push_back(std::move(polygon_c));
+  polygon_list.push_back(std::move(polygon_d));
 
   int compare_ids[] = {3, 0, 1, 2, 3};
   std::vector<int> compare_list = INT_VECTOR_FROM_ARRAY(compare_ids);
   BspTreeTest::RunTest(&polygon_list, compare_list);
 }
 
 }  // namespace
 }  // namespace cc