Migrate WTF::Vector::append() to ::push_back() [part 4 of N]

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 290 matching lines @@
     if (node->isPseudoElement() || node->isTextNode())
       node = node->parentOrShadowHostNode();
     node = ancestorInThisScope(node);
 
     // Prune duplicate entries. A pseduo ::before content above its parent
     // node should only result in a single entry.
     if (node == lastNode)
       continue;
 
     if (node && node->isElementNode()) {
-      elements.append(toElement(node));
+      elements.push_back(toElement(node));
       lastNode = node;
     }
   }
 
   if (rootNode().isDocumentNode()) {
     if (Element* rootElement = toDocument(rootNode()).documentElement()) {
       if (elements.isEmpty() || elements.back() != rootElement)
-        elements.append(rootElement);
+        elements.push_back(rootElement);
     }
   }
 
   return elements;
 }
 
 HeapVector<Member<Element>> TreeScope::elementsFromPoint(int x, int y) const {
   Document& document = rootNode().document();
   IntPoint hitPoint(x, y);
   if (!pointWithScrollAndZoomIfPossible(document, hitPoint))
@@ skipping 111 matching lines @@
 }
 
 unsigned short TreeScope::comparePosition(const TreeScope& otherScope) const {
   if (otherScope == this)
     return Node::kDocumentPositionEquivalent;
 
   HeapVector<Member<const TreeScope>, 16> chain1;
   HeapVector<Member<const TreeScope>, 16> chain2;
   const TreeScope* current;
   for (current = this; current; current = current->parentTreeScope())
-    chain1.append(current);
+    chain1.push_back(current);
   for (current = &otherScope; current; current = current->parentTreeScope())
-    chain2.append(current);
+    chain2.push_back(current);
 
   unsigned index1 = chain1.size();
   unsigned index2 = chain2.size();
   if (chain1[index1 - 1] != chain2[index2 - 1])
     return Node::kDocumentPositionDisconnected |
            Node::kDocumentPositionImplementationSpecific;
 
   for (unsigned i = std::min(index1, index2); i; --i) {
     const TreeScope* child1 = chain1[--index1];
     const TreeScope* child2 = chain2[--index2];
@@ skipping 21 matching lines @@
              ? Node::kDocumentPositionFollowing |
                    Node::kDocumentPositionContainedBy
              : Node::kDocumentPositionPreceding |
                    Node::kDocumentPositionContains;
 }
 
 const TreeScope* TreeScope::commonAncestorTreeScope(
     const TreeScope& other) const {
   HeapVector<Member<const TreeScope>, 16> thisChain;
   for (const TreeScope* tree = this; tree; tree = tree->parentTreeScope())
-    thisChain.append(tree);
+    thisChain.push_back(tree);
 
   HeapVector<Member<const TreeScope>, 16> otherChain;
   for (const TreeScope* tree = &other; tree; tree = tree->parentTreeScope())
-    otherChain.append(tree);
+    otherChain.push_back(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.back() == otherChain.back()) {
     lastAncestor = thisChain.back();
     thisChain.pop_back();
     otherChain.pop_back();
@@ skipping 52 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