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

third_party/WebKit/Source/core/dom/Range.cpp

 /*
  * (C) 1999 Lars Knoll (knoll@kde.org)
  * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)
  * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All
  * rights reserved.
  * Copyright (C) 2011 Motorola Mobility. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
@@ skipping 572 matching lines @@
 
   // Now add leftContents, stuff in between, and rightContents to the fragment
   // (or just delete the stuff in between)
 
   if ((action == EXTRACT_CONTENTS || action == CLONE_CONTENTS) && leftContents)
     fragment->appendChild(leftContents, exceptionState);
 
   if (processStart) {
     NodeVector nodes;
     for (Node* n = processStart; n && n != processEnd; n = n->nextSibling())
-      nodes.append(n);
+      nodes.push_back(n);
     processNodes(action, nodes, commonRoot, fragment, exceptionState);
   }
 
   if ((action == EXTRACT_CONTENTS || action == CLONE_CONTENTS) && rightContents)
     fragment->appendChild(rightContents, exceptionState);
 
   return fragment;
 }
 
 static inline void deleteCharacterData(CharacterData* data,
@@ skipping 51 matching lines @@
         else
           result = container->cloneNode(false);
       }
 
       Node* n = container->firstChild();
       HeapVector<Member<Node>> nodes;
       for (unsigned i = startOffset; n && i; i--)
         n = n->nextSibling();
       for (unsigned i = startOffset; n && i < endOffset;
            i++, n = n->nextSibling())
-        nodes.append(n);
+        nodes.push_back(n);
 
       processNodes(action, nodes, container, result, exceptionState);
       break;
   }
 
   return result;
 }
 
 void Range::processNodes(ActionType action,
                          HeapVector<Member<Node>>& nodes,
@@ skipping 22 matching lines @@
     ContentsProcessDirection direction,
     Node* clonedContainer,
     Node* commonRoot,
     ExceptionState& exceptionState) {
   typedef HeapVector<Member<Node>> NodeVector;
 
   NodeVector ancestors;
   for (Node& runner : NodeTraversal::ancestorsOf(*container)) {
     if (runner == commonRoot)
       break;
-    ancestors.append(runner);
+    ancestors.push_back(runner);
   }
 
   Node* firstChildInAncestorToProcess = direction == ProcessContentsForward
                                             ? container->nextSibling()
                                             : container->previousSibling();
   for (const auto& ancestor : ancestors) {
     if (action == EXTRACT_CONTENTS || action == CLONE_CONTENTS) {
       // Might have been removed already during mutation event.
       if (Node* clonedAncestor = ancestor->cloneNode(false)) {
         clonedAncestor->appendChild(clonedContainer, exceptionState);
         clonedContainer = clonedAncestor;
       }
     }
 
     // Copy siblings of an ancestor of start/end containers
     // FIXME: This assertion may fail if DOM is modified during mutation event
     // FIXME: Share code with Range::processNodes
     DCHECK(!firstChildInAncestorToProcess ||
            firstChildInAncestorToProcess->parentNode() == ancestor);
 
     NodeVector nodes;
     for (Node* child = firstChildInAncestorToProcess; child;
          child = (direction == ProcessContentsForward)
                      ? child->nextSibling()
                      : child->previousSibling())
-      nodes.append(child);
+      nodes.push_back(child);
 
     for (const auto& node : nodes) {
       Node* child = node.get();
       switch (action) {
         case DELETE_CONTENTS:
           // Prior call of ancestor->removeChild() may cause a tree change due
           // to DOMSubtreeModified event.  Therefore, we need to make sure
           // |ancestor| is still |child|'s parent.
           if (ancestor == child->parentNode())
             ancestor->removeChild(child, exceptionState);
@@ skipping 967 matching lines @@
                      .data()
               << "start offset: " << range->startOffset()
               << ", end offset: " << range->endOffset();
   } else {
     LOG(INFO) << "Cannot show tree if range is null, or if boundary points are "
                  "invalid.";
   }
 }
 
 #endif