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

third_party/WebKit/Source/core/xml/XPathNodeSet.cpp

 /*
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * 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 158 matching lines @@
     traversalSort();
     return;
   }
 
   bool containsAttributeNodes = false;
 
   HeapVector<NodeSetVector> parentMatrix(nodeCount);
   for (unsigned i = 0; i < nodeCount; ++i) {
     NodeSetVector& parentsVector = parentMatrix[i];
     Node* n = m_nodes[i].get();
-    parentsVector.append(n);
+    parentsVector.push_back(n);
     if (n->isAttributeNode()) {
       n = toAttr(n)->ownerElement();
-      parentsVector.append(n);
+      parentsVector.push_back(n);
       containsAttributeNodes = true;
     }
     for (n = n->parentNode(); n; n = n->parentNode())
-      parentsVector.append(n);
+      parentsVector.push_back(n);
   }
   sortBlock(0, nodeCount, parentMatrix, containsAttributeNodes);
 
   // It is not possible to just assign the result to m_nodes, because some
   // nodes may get dereferenced and destroyed.
   HeapVector<Member<Node>> sortedNodes;
   sortedNodes.reserveInitialCapacity(nodeCount);
   for (unsigned i = 0; i < nodeCount; ++i)
-    sortedNodes.append(parentMatrix[i][0]);
+    sortedNodes.push_back(parentMatrix[i][0]);
 
   const_cast<HeapVector<Member<Node>>&>(m_nodes).swap(sortedNodes);
 }
 
 static Node* findRootNode(Node* node) {
   if (node->isAttributeNode())
     node = toAttr(node)->ownerElement();
   if (node->isConnected()) {
     node = &node->document();
   } else {
@@ skipping 14 matching lines @@
     nodes.add(node);
     if (node->isAttributeNode())
       containsAttributeNodes = true;
   }
 
   HeapVector<Member<Node>> sortedNodes;
   sortedNodes.reserveInitialCapacity(nodeCount);
 
   for (Node& n : NodeTraversal::startsAt(*findRootNode(m_nodes.front()))) {
     if (nodes.contains(&n))
-      sortedNodes.append(&n);
+      sortedNodes.push_back(&n);
 
     if (!containsAttributeNodes || !n.isElementNode())
       continue;
 
     Element* element = toElement(&n);
     AttributeCollection attributes = element->attributes();
     for (auto& attribute : attributes) {
       Attr* attr = element->attrIfExists(attribute.name());
       if (attr && nodes.contains(attr))
-        sortedNodes.append(attr);
+        sortedNodes.push_back(attr);
     }
   }
 
   DCHECK_EQ(sortedNodes.size(), nodeCount);
   const_cast<HeapVector<Member<Node>>&>(m_nodes).swap(sortedNodes);
 }
 
 void NodeSet::reverse() {
   if (m_nodes.isEmpty())
     return;
@@ skipping 19 matching lines @@
 
 Node* NodeSet::anyNode() const {
   if (isEmpty())
     return nullptr;
 
   return m_nodes.at(0).get();
 }
 
 }  // namespace XPath
 }  // namespace blink