WTF/std normalization: replace WTF::Vector::removeLast with ::pop_back

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 268 matching lines @@
   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>());
   };
   auto pop = [&list, &pointers]() {
-    pointers.removeLast();
+    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;
     ASSERT_EQ(list.size(), pointers.size());
     ASSERT_TRUE(EqualPointers(list.begin(), list.end(), pointers.begin()));
     ASSERT_TRUE(EqualPointers(constList.begin(), constList.end(),
@@ skipping 233 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