Make removeChild, parserRemoveChild and removeChildren more consistent.

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 333 matching lines @@
   NodeListsNodeData& ensureNodeLists();
   void removeBetween(Node* previousChild, 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 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&);
 
   bool hasRestyleFlag(DynamicRestyleFlags mask) const {
@@ skipping 93 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