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

third_party/WebKit/Source/core/dom/TreeScope.cpp

 /*
  * Copyright (C) 2011 Google Inc. All Rights Reserved.
  * Copyright (C) 2012 Apple 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 297 matching lines @@
       continue;
 
     if (node && node->isElementNode()) {
       elements.append(toElement(node));
       lastNode = node;
     }
   }
 
   if (rootNode().isDocumentNode()) {
     if (Element* rootElement = toDocument(rootNode()).documentElement()) {
-      if (elements.isEmpty() || elements.last() != rootElement)
+      if (elements.isEmpty() || elements.back() != rootElement)
         elements.append(rootElement);
     }
   }
 
   return elements;
 }
 
 HeapVector<Member<Element>> TreeScope::elementsFromPoint(int x, int y) const {
   Document& document = rootNode().document();
   IntPoint hitPoint(x, y);
@@ skipping 167 matching lines @@
 
   HeapVector<Member<const TreeScope>, 16> otherChain;
   for (const TreeScope* tree = &other; tree; tree = tree->parentTreeScope())
     otherChain.append(tree);
 
   // Keep popping out the last elements of these chains until a mismatched pair
   // is found. If |this| and |other| belong to different documents, null will be
   // returned.
   const TreeScope* lastAncestor = nullptr;
   while (!thisChain.isEmpty() && !otherChain.isEmpty() &&
-         thisChain.last() == otherChain.last()) {
-    lastAncestor = thisChain.last();
+         thisChain.back() == otherChain.back()) {
+    lastAncestor = thisChain.back();
     thisChain.pop_back();
     otherChain.pop_back();
   }
   return lastAncestor;
 }
 
 TreeScope* TreeScope::commonAncestorTreeScope(TreeScope& other) {
   return const_cast<TreeScope*>(
       static_cast<const TreeScope&>(*this).commonAncestorTreeScope(other));
 }
@@ skipping 44 matching lines @@
   visitor->trace(m_parentTreeScope);
   visitor->trace(m_idTargetObserverRegistry);
   visitor->trace(m_selection);
   visitor->trace(m_elementsById);
   visitor->trace(m_imageMapsByName);
   visitor->trace(m_scopedStyleResolver);
   visitor->trace(m_radioButtonGroupScope);
 }
 
 }  // namespace blink