Rename NodeRenderingTraversal to LayoutTreeBuilderTraversal

Source/core/dom/shadow/ComposedTreeTraversal.h

 /*
  * 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
@@ skipping 11 matching lines @@
  * 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 ComposedTreeTraversal_h
 #define ComposedTreeTraversal_h
 
 #include "core/CoreExport.h"
 #include "core/dom/Document.h"
-#include "core/dom/NodeRenderingTraversal.h"
+#include "core/dom/LayoutTreeBuilderTraversal.h"
 #include "core/dom/shadow/InsertionPoint.h"
 #include "core/dom/shadow/ShadowRoot.h"
 
 namespace blink {
 
 class ContainerNode;
 class Node;
 
 // Composed tree version of |NodeTraversal|.
 //
 // None of member functions takes a |ShadowRoot| or an active insertion point,
 // e.g. roughly speaking <content> and <shadow> in the shadow tree, see
 // |InsertionPoint::isActive()| for details of active insertion points, since
 // they aren't appeared in the composed tree. |assertPrecondition()| and
 // |assertPostCondition()| check this condition.
 //
 // FIXME: Make some functions inline to optimise the performance.
 // https://bugs.webkit.org/show_bug.cgi?id=82702
 class CORE_EXPORT ComposedTreeTraversal {
 public:
-    typedef NodeRenderingTraversal::ParentDetails ParentTraversalDetails;
+    typedef LayoutTreeBuilderTraversal::ParentDetails ParentTraversalDetails;
 
     static Node* next(const Node&);
     static Node* next(const Node&, const Node* stayWithin);
     static Node* previous(const Node&);
 
     static Node* firstChild(const Node&);
     static Node* lastChild(const Node&);
     static bool hasChildren(const Node&);
 
     static ContainerNode* parent(const Node&, ParentTraversalDetails* = 0);
@@ skipping 235 matching lines @@
 }
 
 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node)
 {
     return traverseChild(node, TraversalDirectionBackward);
 }
 
 } // namespace
 
 #endif