Migrate WTF::LinkedHashSet/ListHashSet::removeLast() to ::pop_back()

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 151 matching lines @@
     return makeConstReverseIterator(m_tail);
   }
   const_reverse_iterator rend() const { return makeConstReverseIterator(0); }
 
   ValueType& front();
   const ValueType& front() const;
   void removeFirst();
 
   ValueType& back();
   const ValueType& back() const;
-  void removeLast();
+  void pop_back();
 
   iterator find(ValuePeekInType);
   const_iterator find(ValuePeekInType) const;
   bool contains(ValuePeekInType) const;
 
   // An alternate version of find() that finds the object by hashing and
   // comparing with some other type, to avoid the cost of type conversion.
   // The HashTranslator interface is defined in HashSet.
   template <typename HashTranslator, typename T>
   iterator find(const T&);
@@ skipping 650 matching lines @@
   return m_tail->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline const T& ListHashSet<T, inlineCapacity, U, V>::back() const {
   DCHECK(!isEmpty());
   return m_tail->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
-inline void ListHashSet<T, inlineCapacity, U, V>::removeLast() {
+inline void ListHashSet<T, inlineCapacity, U, V>::pop_back() {
   DCHECK(!isEmpty());
   m_impl.remove(m_tail);
   unlinkAndDelete(m_tail);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline typename ListHashSet<T, inlineCapacity, U, V>::iterator
 ListHashSet<T, inlineCapacity, U, V>::find(ValuePeekInType value) {
   ImplTypeIterator it = m_impl.template find<BaseTranslator>(value);
   if (it == m_impl.end())
@@ skipping 272 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