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

third_party/WebKit/Source/core/input/BoundaryEventDispatcher.cpp

 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "core/input/BoundaryEventDispatcher.h"
 
 #include "core/dom/Node.h"
 #include "core/dom/shadow/FlatTreeTraversal.h"
 
 namespace blink {
 
 namespace {
 
 bool isInDocument(EventTarget* target) {
   return target && target->toNode() && target->toNode()->isConnected();
 }
 
 void buildAncestorChain(EventTarget* target,
                         HeapVector<Member<Node>, 20>* ancestors) {
   if (!isInDocument(target))
     return;
   Node* targetNode = target->toNode();
   DCHECK(targetNode);
   targetNode->updateDistribution();
   // Index 0 element in the ancestors arrays will be the corresponding
   // target. So the root of their document will be their last element.
   for (Node* node = targetNode; node; node = FlatTreeTraversal::parent(*node))
-    ancestors->append(node);
+    ancestors->push_back(node);
 }
 
 void buildAncestorChainsAndFindCommonAncestors(
     EventTarget* exitedTarget,
     EventTarget* enteredTarget,
     HeapVector<Member<Node>, 20>* exitedAncestorsOut,
     HeapVector<Member<Node>, 20>* enteredAncestorsOut,
     size_t* exitedAncestorsCommonParentIndexOut,
     size_t* enteredAncestorsCommonParentIndexOut) {
   DCHECK(exitedAncestorsOut);
@@ skipping 87 matching lines @@
     }
   }
 
   // Dispatch enter events, in parent-to-child order.
   for (size_t i = enteredAncestorsCommonParentIndex; i > 0; i--)
     dispatchEnter(enteredAncestors[i - 1], exitedTarget,
                   !enteredNodeHasCapturingAncestor);
 }
 
 }  // namespace blink