Rename NodeRenderingTraversal to LayoutTreeBuilderTraversal

Source/core/dom/NodeRenderingTraversal.h

Index: Source/core/dom/NodeRenderingTraversal.h
diff --git a/Source/core/dom/NodeRenderingTraversal.h b/Source/core/dom/NodeRenderingTraversal.h
deleted file mode 100644
index 5df7762055af6017a1925752ea8ba905e294e1c5..0000000000000000000000000000000000000000
--- a/Source/core/dom/NodeRenderingTraversal.h
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
- * Copyright (C) 2012 Google Inc. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *     * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *     * Neither the name of Google Inc. nor the names of its
- * contributors may be used to endorse or promote products derived from
- * this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef NodeRenderingTraversal_h
-#define NodeRenderingTraversal_h
-
-#include "core/CoreExport.h"
-#include "core/dom/Element.h"
-
-namespace blink {
-
-class InsertionPoint;
-class LayoutObject;
-
-namespace NodeRenderingTraversal {
-
-class ParentDetails {
-    STACK_ALLOCATED();
-public:
-    ParentDetails()
-        : m_insertionPoint(nullptr)
-    { }
-
-    const InsertionPoint* insertionPoint() const { return m_insertionPoint; }
-
-    void didTraverseInsertionPoint(const InsertionPoint*);
-
-    bool operator==(const ParentDetails& other)
-    {
-        return m_insertionPoint == other.m_insertionPoint;
-    }
-
-private:
-    RawPtrWillBeMember<const InsertionPoint> m_insertionPoint;
-};
-
-CORE_EXPORT ContainerNode* parent(const Node&, ParentDetails* = 0);
-bool contains(const ContainerNode&, const Node&);
-CORE_EXPORT Node* firstChild(const Node&);
-CORE_EXPORT Node* nextSibling(const Node&);
-Node* previousSibling(const Node&);
-Node* previous(const Node&, const Node* stayWithin);
-Node* next(const Node&, const Node* stayWithin);
-Node* nextSkippingChildren(const Node&, const Node* stayWithin);
-LayoutObject* nextSiblingRenderer(const Node&);
-LayoutObject* previousSiblingRenderer(const Node&);
-LayoutObject* nextInTopLayer(const Element&);
-
-inline Element* parentElement(const Node& node)
-{
-    ContainerNode* found = parent(node);
-    return found && found->isElementNode() ? toElement(found) : 0;
-}
-
-}
-
-} // namespace blink
-
-#endif