Migrate WTF::Deque::removeFirst() to ::pop_front()

third_party/WebKit/Source/wtf/DequeTest.cpp

 /*
  * Copyright (C) 2011 Apple 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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 186 matching lines @@
   auto it = deque.begin();
   for (index = 0; index < deque.size(); ++index) {
     std::unique_ptr<DestructCounter>& refCounter = *it;
     EXPECT_EQ(index, static_cast<size_t>(refCounter->get()));
     index++;
     ++it;
   }
   EXPECT_EQ(0, destructNumber);
 
   EXPECT_EQ(0, deque.first()->get());
-  deque.removeFirst();
+  deque.pop_front();
   EXPECT_EQ(1, deque.first()->get());
   EXPECT_EQ(1u, deque.size());
   EXPECT_EQ(1, destructNumber);
 
   std::unique_ptr<DestructCounter> ownCounter1 = std::move(deque.first());
-  deque.removeFirst();
+  deque.pop_front();
   EXPECT_EQ(counter1, ownCounter1->get());
   EXPECT_EQ(0u, deque.size());
   EXPECT_EQ(1, destructNumber);
 
   ownCounter1.reset();
   EXPECT_EQ(2, destructNumber);
 
   size_t count = 1025;
   destructNumber = 0;
   for (size_t i = 0; i < count; ++i)
@@ skipping 180 matching lines @@
       if (!interestingNumber(j))
         continue;
       deque.clear();
       deque2.clear();
       EXPECT_EQ(0u, LivenessCounter::s_live);
       for (unsigned k = 0; k < j; k++)
         deque.push_back(&counter);
       EXPECT_EQ(j, LivenessCounter::s_live);
       EXPECT_EQ(j, deque.size());
       for (unsigned k = 0; k < i; k++)
-        deque.removeFirst();
+        deque.pop_front();
 
       EXPECT_EQ(j - i, LivenessCounter::s_live);
       EXPECT_EQ(j - i, deque.size());
       deque.swap(deque2);
       EXPECT_EQ(j - i, LivenessCounter::s_live);
       EXPECT_EQ(0u, deque.size());
       EXPECT_EQ(j - i, deque2.size());
       deque.swap(deque2);
       EXPECT_EQ(j - i, LivenessCounter::s_live);
 
       deque2.push_back(&counter);
       deque2.push_back(&counter);
       deque2.push_back(&counter);
 
       for (unsigned k = 0; k < 12; k++) {
         EXPECT_EQ(3 + j - i, LivenessCounter::s_live);
         EXPECT_EQ(j - i, deque.size());
         EXPECT_EQ(3u, deque2.size());
         deque.swap(deque2);
         EXPECT_EQ(3 + j - i, LivenessCounter::s_live);
         EXPECT_EQ(j - i, deque2.size());
         EXPECT_EQ(3u, deque.size());
         deque.swap(deque2);
         EXPECT_EQ(3 + j - i, LivenessCounter::s_live);
         EXPECT_EQ(j - i, deque.size());
         EXPECT_EQ(3u, deque2.size());
 
-        deque2.removeFirst();
+        deque2.pop_front();
         deque2.push_back(&counter);
       }
     }
   }
 }
 
 TEST(DequeTest, SwapWithConstructorsAndDestructors) {
   testDestructorAndConstructorCallsWhenSwappingWithInlineCapacity<0>();
   testDestructorAndConstructorCallsWhenSwappingWithInlineCapacity<4>();
   testDestructorAndConstructorCallsWhenSwappingWithInlineCapacity<9>();
@@ skipping 66 matching lines @@
   EXPECT_EQ(-1, *deque[1]);
   EXPECT_EQ(1, *deque[2]);
   EXPECT_EQ(2, *deque[3]);
 
   Pointer first(deque.takeFirst());
   EXPECT_EQ(-2, *first);
   Pointer last(deque.takeLast());
   EXPECT_EQ(2, *last);
 
   EXPECT_EQ(2u, deque.size());
-  deque.removeFirst();
+  deque.pop_front();
   deque.pop_back();
   EXPECT_EQ(0u, deque.size());
 
   deque.push_back(Pointer(new int(42)));
   deque[0] = Pointer(new int(24));
   ASSERT_EQ(1u, deque.size());
   EXPECT_EQ(24, *deque[0]);
 
   deque.clear();
 }
@@ skipping 89 matching lines @@
   EXPECT_EQ(2u, deque.size());
   EXPECT_EQ(3, deque[0].value1);
   EXPECT_EQ(4, deque[0].value2);
   EXPECT_EQ(1, deque[1].value1);
   EXPECT_EQ(2, deque[1].value2);
 }
 
 }  // anonymous namespace
 
 }  // namespace WTF