WTF/std normalization: replace WTF::Vector::last with ::back

third_party/WebKit/Source/platform/graphics/ContiguousContainer.cpp

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "platform/graphics/ContiguousContainer.h"
 
 #include "wtf/Allocator.h"
 #include "wtf/ContainerAnnotations.h"
 #include "wtf/PtrUtil.h"
 #include "wtf/allocator/PartitionAlloc.h"
@@ skipping 102 matching lines @@
     Buffer* endBuffer = m_buffers[m_endIndex].get();
     if (endBuffer->unusedCapacity() >= objectSize)
       bufferForAlloc = endBuffer;
     else if (m_endIndex + 1 < m_buffers.size())
       bufferForAlloc = m_buffers[++m_endIndex].get();
   }
 
   if (!bufferForAlloc) {
     size_t newBufferSize = m_buffers.isEmpty()
                                ? kDefaultInitialBufferSize * m_maxObjectSize
-                               : 2 * m_buffers.last()->capacity();
+                               : 2 * m_buffers.back()->capacity();
     bufferForAlloc =
         allocateNewBufferForNextAllocation(newBufferSize, typeName);
   }
 
   void* element = bufferForAlloc->allocate(objectSize);
   m_elements.append(element);
   return element;
 }
 
 void ContiguousContainerBase::removeLast() {
-  void* object = m_elements.last();
+  void* object = m_elements.back();
   m_elements.pop_back();
 
   Buffer* endBuffer = m_buffers[m_endIndex].get();
   endBuffer->deallocateLastObject(object);
 
   if (endBuffer->isEmpty()) {
     if (m_endIndex > 0)
       m_endIndex--;
     if (m_endIndex + 2 < m_buffers.size())
       m_buffers.pop_back();
   }
 }
 
 void ContiguousContainerBase::clear() {
   m_elements.clear();
   m_buffers.clear();
   m_endIndex = 0;
 }
 
 void ContiguousContainerBase::swap(ContiguousContainerBase& other) {
   m_elements.swap(other.m_elements);
   m_buffers.swap(other.m_buffers);
   std::swap(m_endIndex, other.m_endIndex);
   std::swap(m_maxObjectSize, other.m_maxObjectSize);
 }
 
 void ContiguousContainerBase::shrinkToFit() {
   while (m_endIndex < m_buffers.size() - 1) {
-    DCHECK(m_buffers.last()->isEmpty());
+    DCHECK(m_buffers.back()->isEmpty());
     m_buffers.pop_back();
   }
 }
 
 ContiguousContainerBase::Buffer*
 ContiguousContainerBase::allocateNewBufferForNextAllocation(
     size_t bufferSize,
     const char* typeName) {
   ASSERT(m_buffers.isEmpty() || m_endIndex == m_buffers.size() - 1);
   std::unique_ptr<Buffer> newBuffer = makeUnique<Buffer>(bufferSize, typeName);
   Buffer* bufferToReturn = newBuffer.get();
   m_buffers.append(std::move(newBuffer));
   m_endIndex = m_buffers.size() - 1;
   return bufferToReturn;
 }
 
 }  // namespace blink