Introduce ContainerNode::insertNodeVector() to share code in insertBefore(), appendChild(), and rep…

third_party/WebKit/Source/core/dom/ContainerNode.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
@@ skipping 224 matching lines @@
     template <typename Collection> Collection* ensureCachedCollection(CollectionType, const AtomicString& name);
     template <typename Collection> Collection* ensureCachedCollection(CollectionType, const AtomicString& namespaceURI, const AtomicString& localName);
     template <typename Collection> Collection* cachedCollection(CollectionType);
 
 private:
     bool isContainerNode() const = delete; // This will catch anyone doing an unnecessary check.
     bool isTextNode() const = delete; // This will catch anyone doing an unnecessary check.
 
     NodeListsNodeData& ensureNodeLists();
     void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);
-    void insertBeforeCommon(Node& nextChild, Node& oldChild);
+    template <typename Functor> void insertNodeVector(const NodeVector&, Node* next, const Functor&);
+    class AdoptAndInsertBefore;
+    class AdoptAndAppendChild;
+    friend class AdoptAndInsertBefore;
+    friend class AdoptAndAppendChild;
+    void insertBeforeCommon(Node& nextChild, Node& newChild);
     void appendChildCommon(Node& child);
     void updateTreeAfterInsertion(Node& child);
     void willRemoveChildren();
     void willRemoveChild(Node& child);
     void removeDetachedChildrenInContainer(ContainerNode&);
     void addChildNodesToDeletionQueue(Node*&, Node*&, ContainerNode&);
 
     void notifyNodeInserted(Node&, ChildrenChangeSource = ChildrenChangeSourceAPI);
     void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotificationTargets);
     void notifyNodeRemoved(Node&);
@@ skipping 90 matching lines @@
 inline void getChildNodes(ContainerNode& node, NodeVector& nodes)
 {
     DCHECK(!nodes.size());
     for (Node* child = node.firstChild(); child; child = child->nextSibling())
         nodes.append(child);
 }
 
 } // namespace blink
 
 #endif // ContainerNode_h