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

third_party/WebKit/Source/wtf/LinkedHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights
  * reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
@@ skipping 217 matching lines @@
 
   reverse_iterator rbegin() { return makeReverseIterator(lastNode()); }
   reverse_iterator rend() { return makeReverseIterator(anchor()); }
   const_reverse_iterator rbegin() const {
     return makeConstReverseIterator(lastNode());
   }
   const_reverse_iterator rend() const {
     return makeConstReverseIterator(anchor());
   }
 
-  Value& first();
-  const Value& first() const;
+  Value& front();
+  const Value& front() const;
   void removeFirst();
 
   Value& last();
   const Value& last() const;
   void removeLast();
 
   iterator find(ValuePeekInType);
   const_iterator find(ValuePeekInType) const;
   bool contains(ValuePeekInType) const;
 
@@ skipping 443 matching lines @@
   swapAnchor(m_anchor, other.m_anchor);
 }
 
 template <typename T, typename U, typename V, typename Allocator>
 inline LinkedHashSet<T, U, V, Allocator>::~LinkedHashSet() {
   // The destructor of m_anchor will implicitly be called here, which will
   // unlink the anchor from the collection.
 }
 
 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;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline void LinkedHashSet<T, U, V, W>::removeFirst() {
   DCHECK(!isEmpty());
   m_impl.remove(static_cast<Node*>(m_anchor.m_next));
 }
 
@@ skipping 209 matching lines @@
   swap(static_cast<Base&>(a), static_cast<Base&>(b));
   swap(a.m_value, b.m_value);
   Allocator::leaveGCForbiddenScope();
 }
 
 }  // namespace WTF
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */