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

third_party/WebKit/Source/core/layout/compositing/CompositingRequirementsUpdater.cpp

 /*
  * Copyright (C) 2009, 2010 Apple Inc. All rights reserved.
  * Copyright (C) 2014 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.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 88 matching lines @@
     // contribute to overlap as soon as they have been recursively processed
     // and popped off the stack.
     DCHECK_GE(m_overlapStack.size(), 2ul);
     if (isClipped)
       m_overlapStack[m_overlapStack.size() - 2].clipped.add(bounds);
     else
       m_overlapStack[m_overlapStack.size() - 2].unclipped.add(bounds);
   }
 
   bool overlapsLayers(const IntRect& bounds, bool isClipped) const {
-    bool clippedOverlap = m_overlapStack.last().clipped.overlapsLayers(bounds);
+    bool clippedOverlap = m_overlapStack.back().clipped.overlapsLayers(bounds);
     if (isClipped)
       return clippedOverlap;
     // Unclipped is allowed to overlap clipped, but not vice-versa.
     return clippedOverlap ||
-           m_overlapStack.last().unclipped.overlapsLayers(bounds);
+           m_overlapStack.back().unclipped.overlapsLayers(bounds);
   }
 
   void beginNewOverlapTestingContext() {
     // This effectively creates a new "clean slate" for overlap state.
     // This is used when we know that a subtree or remaining set of
     // siblings does not need to check overlap with things behind it.
     m_overlapStack.grow(m_overlapStack.size() + 1);
   }
 
   void finishCurrentOverlapTestingContext() {
     // The overlap information on the top of the stack is still necessary
     // for checking overlap of any layers outside this context that may
     // overlap things from inside this context. Therefore, we must merge
     // the information from the top of the stack before popping the stack.
     //
     // FIXME: we may be able to avoid this deep copy by rearranging how
     //        overlapMap state is managed.
     m_overlapStack[m_overlapStack.size() - 2].clipped.unite(
-        m_overlapStack.last().clipped);
+        m_overlapStack.back().clipped);
     m_overlapStack[m_overlapStack.size() - 2].unclipped.unite(
-        m_overlapStack.last().unclipped);
+        m_overlapStack.back().unclipped);
     m_overlapStack.pop_back();
   }
 
  private:
   Vector<OverlapMapContainers> m_overlapStack;
 };
 
 class CompositingRequirementsUpdater::RecursionData {
  public:
   explicit RecursionData(PaintLayer* compositingAncestor)
@@ skipping 392 matching lines @@
     descendantHas3DTransform |=
         anyDescendantHas3DTransform || layer->has3DTransform();
   }
 
   // At this point we have finished collecting all reasons to composite this
   // layer.
   layer->setCompositingReasons(reasonsToComposite);
 }
 
 }  // namespace blink