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

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

 /*
  * 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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 42 matching lines @@
     m_nodes.reserveCapacity(newCapacity);
   }
   void clear() { m_nodes.clear(); }
   void swap(NodeSet& other) {
     std::swap(m_isSorted, other.m_isSorted);
     std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint);
     m_nodes.swap(other.m_nodes);
   }
 
   // NodeSet itself does not verify that nodes in it are unique.
-  void append(Node* node) { m_nodes.append(node); }
+  void append(Node* node) { m_nodes.push_back(node); }
   void append(const NodeSet& nodeSet) { m_nodes.appendVector(nodeSet.m_nodes); }
 
   // Returns the set's first node in document order, or 0 if the set is empty.
   Node* firstNode() const;
 
   // Returns 0 if the set is empty.
   Node* anyNode() const;
 
   // NodeSet itself doesn't check if it contains nodes in document order - the
   // caller should tell it if it does not.
@@ skipping 17 matching lines @@
 
   bool m_isSorted;
   bool m_subtreesAreDisjoint;
   HeapVector<Member<Node>> m_nodes;
 };
 
 }  // namespace XPath
 
 }  // namespace blink
 #endif  // XPathNodeSet_h