Migrate WTF::Deque::first() to ::front()

third_party/WebKit/Source/wtf/Deque.h

 /*
  * Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
  * Copyright (C) 2009 Google 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.
@@ skipping 71 matching lines @@
   const_iterator end() const { return const_iterator(this, m_end); }
   reverse_iterator rbegin() { return reverse_iterator(end()); }
   reverse_iterator rend() { return reverse_iterator(begin()); }
   const_reverse_iterator rbegin() const {
     return const_reverse_iterator(end());
   }
   const_reverse_iterator rend() const {
     return const_reverse_iterator(begin());
   }
 
-  T& first() {
+  T& front() {
     DCHECK_NE(m_start, m_end);
     return m_buffer.buffer()[m_start];
   }
-  const T& first() const {
+  const T& front() const {
     DCHECK_NE(m_start, m_end);
     return m_buffer.buffer()[m_start];
   }
   T takeFirst();
 
   T& last() {
     DCHECK_NE(m_start, m_end);
     return *(--end());
   }
   const T& last() const {
@@ skipping 26 matching lines @@
   // STL compatibility.
   template <typename U>
   void push_back(U&&);
   template <typename U>
   void push_front(U&& u) {
     prepend(std::forward<U>(u));
   }
   void pop_back();
   void pop_front();
   bool empty() const { return isEmpty(); }
-  T& front() { return first(); }
-  const T& front() const { return first(); }
   T& back() { return last(); }
   const T& back() const { return last(); }
   template <typename... Args>
   void emplace_back(Args&&...);
   template <typename... Args>
   void emplace_front(Args&&...);
 
   void clear();
 
   template <typename VisitorDispatcher>
@@ skipping 322 matching lines @@
     TypeOperations::move(oldBuffer + m_start, oldBuffer + oldCapacity,
                          m_buffer.buffer() + newStart);
     m_buffer.clearUnusedSlots(oldBuffer + m_start, oldBuffer + oldCapacity);
     m_start = newStart;
   }
   m_buffer.deallocateBuffer(oldBuffer);
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 inline T Deque<T, inlineCapacity, Allocator>::takeFirst() {
-  T oldFirst = std::move(first());
+  T oldFirst = std::move(front());
   pop_front();
   return oldFirst;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 inline T Deque<T, inlineCapacity, Allocator>::takeLast() {
   T oldLast = std::move(last());
   pop_back();
   return oldLast;
 }
@@ skipping 207 matching lines @@
 inline void swap(Deque<T, inlineCapacity, Allocator>& a,
                  Deque<T, inlineCapacity, Allocator>& b) {
   a.swap(b);
 }
 
 }  // namespace WTF
 
 using WTF::Deque;
 
 #endif  // WTF_Deque_h