DOM: Fix an issue of reversed MutationRecoards.

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
@@ skipping 354 matching lines @@
   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* previous_child, Node* next_child, Node& old_child);
+  // Inserts the specified nodes before |next|.
+  // |next| may be nullptr.
+  // |post_insertion_notification_targets| must not be nullptr.
   template <typename Functor>
-  void InsertNodeVector(const NodeVector&, Node* next, const Functor&);
+  void InsertNodeVector(const NodeVector&,
+                        Node* next,
+                        const Functor&,
+                        NodeVector* post_insertion_notification_targets);
+  void DidInsertNodeVector(
+      const NodeVector&,
+      Node* next,
+      const NodeVector& post_insertion_notification_targets);
   class AdoptAndInsertBefore;
   class AdoptAndAppendChild;
   friend class AdoptAndInsertBefore;
   friend class AdoptAndAppendChild;
   void InsertBeforeCommon(Node& next_child, Node& new_child);
   void AppendChildCommon(Node& child);
   void WillRemoveChildren();
   void WillRemoveChild(Node& child);
   void RemoveDetachedChildrenInContainer(ContainerNode&);
   void AddChildNodesToDeletionQueue(Node*&, Node*&, ContainerNode&);
@@ skipping 103 matching lines @@
 
 inline void GetChildNodes(ContainerNode& node, NodeVector& nodes) {
   DCHECK(!nodes.size());
   for (Node* child = node.firstChild(); child; child = child->nextSibling())
     nodes.push_back(child);
 }
 
 }  // namespace blink
 
 #endif  // ContainerNode_h