Merge ChildNodeInsertionNotifier and ChildNodeRemovalNotifier into ContainerNode

Source/core/dom/ContainerNodeAlgorithms.cpp

Index: Source/core/dom/ContainerNodeAlgorithms.cpp
diff --git a/Source/core/dom/ContainerNodeAlgorithms.cpp b/Source/core/dom/ContainerNodeAlgorithms.cpp
deleted file mode 100644
index 9682ff7fb02025ceedcee26db777fa64ee79128d..0000000000000000000000000000000000000000
--- a/Source/core/dom/ContainerNodeAlgorithms.cpp
+++ /dev/null
@@ -1,67 +0,0 @@
-/*
- * 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, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
- * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
- * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
- * Copyright (C) 2012 Google 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.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Library General Public License for more details.
- *
- * You should have received a copy of the GNU Library General Public License
- * along with this library; see the file COPYING.LIB.  If not, write to
- * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
- * Boston, MA 02110-1301, USA.
- */
-
-#include "config.h"
-#include "core/dom/ContainerNodeAlgorithms.h"
-
-#include "core/dom/Element.h"
-#include "core/dom/NodeTraversal.h"
-#include "core/dom/shadow/ElementShadow.h"
-#include "core/dom/shadow/ShadowRoot.h"
-
-namespace WebCore {
-
-void ChildNodeInsertionNotifier::notifyNodeInserted(Node& root)
-{
-    for (Node* node = &root; node; node = NodeTraversal::next(*node, &root)) {
-        // As an optimization we don't notify leaf nodes when when inserting
-        // into detached subtrees.
-        if (!m_insertionPoint.inDocument() && !node->isContainerNode())
-            continue;
-        if (Node::InsertionShouldCallDidNotifySubtreeInsertions == node->insertedInto(&m_insertionPoint))
-            m_postInsertionNotificationTargets.append(node);
-        for (ShadowRoot* shadowRoot = node->youngestShadowRoot(); shadowRoot; shadowRoot = shadowRoot->olderShadowRoot())
-            notifyNodeInserted(*shadowRoot);
-    }
-}
-
-void ChildNodeRemovalNotifier::notifyNodeRemoved(Node& root)
-{
-    Document& document = root.document();
-    for (Node* node = &root; node; node = NodeTraversal::next(*node, &root)) {
-        // As an optimization we skip notifying Text nodes and other leaf nodes
-        // of removal when they're not in the Document tree since the virtual
-        // call to removedFrom is not needed.
-        if (!node->inDocument() && !node->isContainerNode())
-            continue;
-        if (document.cssTarget() == node)
-            document.setCSSTarget(0);
-        node->removedFrom(&m_insertionPoint);
-        for (ShadowRoot* shadowRoot = node->youngestShadowRoot(); shadowRoot; shadowRoot = shadowRoot->olderShadowRoot())
-            notifyNodeRemoved(*shadowRoot);
-    }
-}
-
-}