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

third_party/WebKit/Source/platform/PODRedBlackTreeTest.cpp

 /*
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
@@ skipping 152 matching lines @@
 void InsertionAndDeletionTest(const int32_t seed, const int treeSize) {
   initRandom(seed);
   const int maximumValue = treeSize;
   // Build the tree.
   PODRedBlackTree<int> tree;
   Vector<int> values;
   for (int i = 0; i < treeSize; i++) {
     int value = nextRandom(maximumValue);
     tree.add(value);
     ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
-    values.append(value);
+    values.push_back(value);
   }
   // Churn the tree's contents.
   for (int i = 0; i < treeSize; i++) {
     // Pick a random value to remove.
     int index = nextRandom(treeSize);
     int value = values[index];
     // Remove this value.
     tree.remove(value);
     ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
     // Replace it with a new one.
     value = nextRandom(maximumValue);
     values[index] = value;
     tree.add(value);
     ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
   }
 }
 }  // anonymous namespace
 
 TEST(PODRedBlackTreeTest, RandomDeletionAndInsertionRegressionTest1) {
   InsertionAndDeletionTest(12311, 100);
 }
 
 }  // namespace blink