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

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

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved.
  * 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
@@ skipping 51 matching lines @@
   // E.g., there is no need to build a set of all "foo" nodes to evaluate
   // "foo[@bar]", we can check the predicate while enumerating.
   // This optimization can be applied to predicates that are not context node
   // list sensitive, or to first predicate that is only context position
   // sensitive, e.g. foo[position() mod 2 = 0].
   HeapVector<Member<Predicate>> remainingPredicates;
   for (const auto& predicate : m_predicates) {
     if ((!predicate->isContextPositionSensitive() ||
          nodeTest().mergedPredicates().isEmpty()) &&
         !predicate->isContextSizeSensitive() && remainingPredicates.isEmpty()) {
-      nodeTest().mergedPredicates().append(predicate);
+      nodeTest().mergedPredicates().push_back(predicate);
     } else {
-      remainingPredicates.append(predicate);
+      remainingPredicates.push_back(predicate);
     }
   }
   swap(remainingPredicates, m_predicates);
 }
 
 bool optimizeStepPair(Step* first, Step* second) {
   if (first->m_axis == Step::DescendantOrSelfAxis &&
       first->nodeTest().getKind() == Step::NodeTest::AnyNodeTest &&
       !first->m_predicates.size() &&
       !first->nodeTest().mergedPredicates().size()) {
@@ skipping 353 matching lines @@
       nodes.markSorted(false);
       return;
     }
   }
   NOTREACHED();
 }
 
 }  // namespace XPath
 
 }  // namespace blink