Migrate WTF::LinkedHashSet/ListHashSet::first() to ::front()

third_party/WebKit/Source/wtf/ListHashSetTest.cpp

 /*
  * Copyright (C) 2012 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 36 matching lines @@
 
 TYPED_TEST(ListOrLinkedHashSetTest, RemoveFirst) {
   using Set = TypeParam;
   Set list;
   list.insert(-1);
   list.insert(0);
   list.insert(1);
   list.insert(2);
   list.insert(3);
 
-  EXPECT_EQ(-1, list.first());
+  EXPECT_EQ(-1, list.front());
   EXPECT_EQ(3, list.last());
 
   list.removeFirst();
-  EXPECT_EQ(0, list.first());
+  EXPECT_EQ(0, list.front());
 
   list.removeLast();
   EXPECT_EQ(2, list.last());
 
   list.removeFirst();
-  EXPECT_EQ(1, list.first());
+  EXPECT_EQ(1, list.front());
 
   list.removeFirst();
-  EXPECT_EQ(2, list.first());
+  EXPECT_EQ(2, list.front());
 
   list.removeFirst();
   EXPECT_TRUE(list.isEmpty());
 }
 
 TYPED_TEST(ListOrLinkedHashSetTest, AppendOrMoveToLastNewItems) {
   using Set = TypeParam;
   Set list;
   typename Set::AddResult result = list.appendOrMoveToLast(1);
   EXPECT_TRUE(result.isNewEntry);
@@ skipping 84 matching lines @@
   EXPECT_TRUE(result.isNewEntry);
   result = list.prependOrMoveToFirst(1);
   EXPECT_FALSE(result.isNewEntry);
   EXPECT_EQ(1UL, list.size());
 
   list.insert(2);
   list.insert(3);
   EXPECT_EQ(3UL, list.size());
 
   // Prepending 2 move it to the beginning.
-  EXPECT_EQ(1, list.first());
+  EXPECT_EQ(1, list.front());
   result = list.prependOrMoveToFirst(2);
   EXPECT_FALSE(result.isNewEntry);
-  EXPECT_EQ(2, list.first());
+  EXPECT_EQ(2, list.front());
 
   // Inverse the list by moving each element to the first position.
   result = list.prependOrMoveToFirst(1);
   EXPECT_FALSE(result.isNewEntry);
   result = list.prependOrMoveToFirst(2);
   EXPECT_FALSE(result.isNewEntry);
   result = list.prependOrMoveToFirst(3);
   EXPECT_FALSE(result.isNewEntry);
   EXPECT_EQ(3UL, list.size());
 
@@ skipping 68 matching lines @@
     EXPECT_EQ(it, set.end());
     --it;
     EXPECT_EQ(1, *it);
     set.insertBefore(it, -1);
     set.insertBefore(it, 0);
     set.insert(2);
     set.insert(3);
   }
   set.insertBefore(2, 42);
   set.insertBefore(-1, 103);
-  EXPECT_EQ(103, set.first());
+  EXPECT_EQ(103, set.front());
   if (!canModifyWhileIterating)
     it = set.find(1);
   ++it;
   EXPECT_EQ(42, *it);
   EXPECT_EQ(7u, set.size());
 }
 
 TYPED_TEST(ListOrLinkedHashSetTest, AddReturnIterator) {
   using Set = TypeParam;
   bool canModifyWhileIterating = !std::is_same<Set, LinkedHashSet<int>>::value;
@@ skipping 123 matching lines @@
   using Set = TypeParam;
   bool isDeleted = false;
   DummyRefCounted::m_refInvokesCount = 0;
   RefPtr<DummyRefCounted> ptr = adoptRef(new DummyRefCounted(isDeleted));
   EXPECT_EQ(0, DummyRefCounted::m_refInvokesCount);
 
   Set set;
   set.insert(ptr);
   // Referenced only once (to store a copy in the container).
   EXPECT_EQ(1, DummyRefCounted::m_refInvokesCount);
-  EXPECT_EQ(ptr, set.first());
+  EXPECT_EQ(ptr, set.front());
   EXPECT_EQ(1, DummyRefCounted::m_refInvokesCount);
 
   DummyRefCounted* rawPtr = ptr.get();
 
   EXPECT_TRUE(set.contains(ptr));
   EXPECT_TRUE(set.contains(rawPtr));
   EXPECT_EQ(1, DummyRefCounted::m_refInvokesCount);
 
   ptr.clear();
   EXPECT_FALSE(isDeleted);
@@ skipping 391 matching lines @@
 
   // ... but they don't have any pass-out (like take()) methods.
 
   set.remove(MoveOnly(3));
   set.clear();
 }
 
 }  // anonymous namespace
 
 }  // namespace WTF