Migrate WTF::Vector::append() to ::push_back() [part 14 of N]

third_party/WebKit/Source/platform/graphics/ContiguousContainerTest.cpp

 // 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 "platform/graphics/ContiguousContainer.h"
 
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "wtf/TypeTraits.h"
 
@@ skipping 185 matching lines @@
 
   list.allocateAndConstruct<Point2D>();
   EXPECT_FALSE(list.isEmpty());
   EXPECT_EQ(1u, list.size());
 }
 
 TEST(ContiguousContainerTest, ElementAddressesAreStable) {
   ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize);
   Vector<Point2D*> pointers;
   for (int i = 0; i < (int)kNumElements; i++)
-    pointers.append(&list.allocateAndConstruct<Point2D>());
+    pointers.push_back(&list.allocateAndConstruct<Point2D>());
   EXPECT_EQ(kNumElements, list.size());
   EXPECT_EQ(kNumElements, pointers.size());
 
   auto listIt = list.begin();
   auto vectorIt = pointers.begin();
   for (; listIt != list.end(); ++listIt, ++vectorIt)
     EXPECT_EQ(&*listIt, *vectorIt);
 }
 
 TEST(ContiguousContainerTest, ForwardIteration) {
@@ skipping 59 matching lines @@
   struct SmallStruct {
     char dummy[16];
   };
   ContiguousContainer<SmallStruct> list(sizeof(SmallStruct),
                                         1 * sizeof(SmallStruct));
   Vector<SmallStruct*> pointers;
 
   // Utilities which keep these two lists in sync and check that their
   // iteration order matches.
   auto push = [&list, &pointers]() {
-    pointers.append(&list.allocateAndConstruct<SmallStruct>());
+    pointers.push_back(&list.allocateAndConstruct<SmallStruct>());
   };
   auto pop = [&list, &pointers]() {
     pointers.pop_back();
     list.removeLast();
   };
   auto check_equal = [&list, &pointers]() {
     // They should be of the same size, and compare equal with all four
     // kinds of iteration.
     const auto& constList = list;
     const auto& constPointers = pointers;
@@ skipping 236 matching lines @@
   list.appendByMoving(list[2], sizeof(Point3D));
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (maxAlign - 1));
   list.appendByMoving(list[3], sizeof(Point3D));
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (maxAlign - 1));
   list.appendByMoving(list[4], sizeof(Point2D));
   EXPECT_EQ(0u, reinterpret_cast<intptr_t>(&list.last()) & (maxAlign - 1));
 }
 
 }  // namespace
 }  // namespace blink