Migrate WTF::Deque::last() to ::back()

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 81 matching lines @@
   T& front() {
     DCHECK_NE(m_start, m_end);
     return m_buffer.buffer()[m_start];
   }
   const T& front() const {
     DCHECK_NE(m_start, m_end);
     return m_buffer.buffer()[m_start];
   }
   T takeFirst();
 
-  T& last() {
+  T& back() {
     DCHECK_NE(m_start, m_end);
     return *(--end());
   }
-  const T& last() const {
+  const T& back() const {
     DCHECK_NE(m_start, m_end);
     return *(--end());
   }
   T takeLast();
 
   T& at(size_t i) {
     RELEASE_ASSERT(i < size());
     size_t right = m_buffer.capacity() - m_start;
     return i < right ? m_buffer.buffer()[m_start + i]
                      : m_buffer.buffer()[i - right];
@@ skipping 16 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& 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>
   void trace(VisitorDispatcher);
 
@@ skipping 327 matching lines @@
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 inline T Deque<T, inlineCapacity, Allocator>::takeFirst() {
   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());
+  T oldLast = std::move(back());
   pop_back();
   return oldLast;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
 inline void Deque<T, inlineCapacity, Allocator>::push_back(U&& value) {
   expandCapacityIfNeeded();
   T* newElement = &m_buffer.buffer()[m_end];
   if (m_end == m_buffer.capacity() - 1)
@@ skipping 200 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