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

third_party/WebKit/Source/wtf/LinkedHashSet.h

Index: third_party/WebKit/Source/wtf/LinkedHashSet.h
diff --git a/third_party/WebKit/Source/wtf/LinkedHashSet.h b/third_party/WebKit/Source/wtf/LinkedHashSet.h
index 1a380b432e5fea800cbbbd8c533d40918261208a..566ab0e840e1edb2517a86c0cb42799cd4737670 100644
--- a/third_party/WebKit/Source/wtf/LinkedHashSet.h
+++ b/third_party/WebKit/Source/wtf/LinkedHashSet.h
@@ -235,8 +235,8 @@ class LinkedHashSet {
     return makeConstReverseIterator(anchor());
   }
 
-  Value& first();
-  const Value& first() const;
+  Value& front();
+  const Value& front() const;
   void removeFirst();
 
   Value& last();
@@ -700,13 +700,13 @@ inline LinkedHashSet<T, U, V, Allocator>::~LinkedHashSet() {
 }
 
 template <typename T, typename U, typename V, typename W>
-inline T& LinkedHashSet<T, U, V, W>::first() {
+inline T& LinkedHashSet<T, U, V, W>::front() {
   DCHECK(!isEmpty());
   return firstNode()->m_value;
 }
 
 template <typename T, typename U, typename V, typename W>
-inline const T& LinkedHashSet<T, U, V, W>::first() const {
+inline const T& LinkedHashSet<T, U, V, W>::front() const {
   DCHECK(!isEmpty());
   return firstNode()->m_value;
 }