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

third_party/WebKit/Source/wtf/ListHashSet.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 145 matching lines @@
   const_iterator begin() const { return makeConstIterator(m_head); }
   const_iterator end() const { return makeConstIterator(0); }
 
   reverse_iterator rbegin() { return makeReverseIterator(m_tail); }
   reverse_iterator rend() { return makeReverseIterator(0); }
   const_reverse_iterator rbegin() const {
     return makeConstReverseIterator(m_tail);
   }
   const_reverse_iterator rend() const { return makeConstReverseIterator(0); }
 
-  ValueType& first();
-  const ValueType& first() const;
+  ValueType& front();
+  const ValueType& front() const;
   void removeFirst();
 
   ValueType& last();
   const ValueType& last() const;
   void removeLast();
 
   iterator find(ValuePeekInType);
   const_iterator find(ValuePeekInType) const;
   bool contains(ValuePeekInType) const;
 
@@ skipping 624 matching lines @@
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline void ListHashSet<T, inlineCapacity, U, V>::finalize() {
   static_assert(!Allocator::isGarbageCollected,
                 "heap allocated ListHashSet should never call finalize()");
   deleteAllNodes();
   m_allocatorProvider.releaseAllocator();
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
-inline T& ListHashSet<T, inlineCapacity, U, V>::first() {
+inline T& ListHashSet<T, inlineCapacity, U, V>::front() {
   DCHECK(!isEmpty());
   return m_head->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline void ListHashSet<T, inlineCapacity, U, V>::removeFirst() {
   DCHECK(!isEmpty());
   m_impl.remove(m_head);
   unlinkAndDelete(m_head);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
-inline const T& ListHashSet<T, inlineCapacity, U, V>::first() const {
+inline const T& ListHashSet<T, inlineCapacity, U, V>::front() const {
   DCHECK(!isEmpty());
   return m_head->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline T& ListHashSet<T, inlineCapacity, U, V>::last() {
   DCHECK(!isEmpty());
   return m_tail->m_value;
 }
 
@@ skipping 290 matching lines @@
   // through the HashTable. That includes m_head and m_tail so we do not have
   // to explicitly trace them here.
   m_impl.trace(visitor);
 }
 
 }  // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif  // WTF_ListHashSet_h