Rename NodeRenderingTraversal to LayoutTreeBuilderTraversal

Source/core/layout/LayoutListItem.cpp

 /**
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  * Copyright (C) 2003, 2004, 2005, 2006, 2010 Apple Inc. All rights reserved.
  * Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net)
  *
  * 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.
@@ skipping 102 matching lines @@
 
 // Returns the next list item with respect to the DOM order.
 static LayoutListItem* nextListItem(const Node* listNode, const LayoutListItem* item = 0)
 {
     if (!listNode)
         return 0;
 
     const Node* current = item ? item->node() : listNode;
     ASSERT(current);
     ASSERT(!current->document().childNeedsDistributionRecalc());
-    current = NodeRenderingTraversal::next(*current, listNode);
+    current = LayoutTreeBuilderTraversal::next(*current, listNode);
 
     while (current) {
         if (isList(*current)) {
             // We've found a nested, independent list: nothing to do here.
-            current = NodeRenderingTraversal::nextSkippingChildren(*current, listNode);
+            current = LayoutTreeBuilderTraversal::nextSkippingChildren(*current, listNode);
             continue;
         }
 
         LayoutObject* renderer = current->layoutObject();
         if (renderer && renderer->isListItem())
             return toLayoutListItem(renderer);
 
         // FIXME: Can this be optimized to skip the children of the elements without a renderer?
-        current = NodeRenderingTraversal::next(*current, listNode);
+        current = LayoutTreeBuilderTraversal::next(*current, listNode);
     }
 
     return 0;
 }
 
 // Returns the previous list item with respect to the DOM order.
 static LayoutListItem* previousListItem(const Node* listNode, const LayoutListItem* item)
 {
     Node* current = item->node();
     ASSERT(current);
     ASSERT(!current->document().childNeedsDistributionRecalc());
-    for (current = NodeRenderingTraversal::previous(*current, listNode); current && current != listNode; current = NodeRenderingTraversal::previous(*current, listNode)) {
+    for (current = LayoutTreeBuilderTraversal::previous(*current, listNode); current && current != listNode; current = LayoutTreeBuilderTraversal::previous(*current, listNode)) {
         LayoutObject* renderer = current->layoutObject();
         if (!renderer || (renderer && !renderer->isListItem()))
             continue;
         Node* otherList = enclosingList(toLayoutListItem(renderer));
         // This item is part of our current list, so it's what we're looking for.
         if (listNode == otherList)
             return toLayoutListItem(renderer);
         // We found ourself inside another list; lets skip the rest of it.
         // Use nextIncludingPseudo() here because the other list itself may actually
         // be a list item itself. We need to examine it, so we do this to counteract
         // the previousIncludingPseudo() that will be done by the loop.
         if (otherList)
-            current = NodeRenderingTraversal::next(*otherList, listNode);
+            current = LayoutTreeBuilderTraversal::next(*otherList, listNode);
     }
     return 0;
 }
 
 void LayoutListItem::updateItemValuesForOrderedList(const HTMLOListElement* listNode)
 {
     ASSERT(listNode);
 
     for (LayoutListItem* listItem = nextListItem(listNode); listItem; listItem = nextListItem(listNode, listItem))
         listItem->updateValue();
@@ skipping 355 matching lines @@
             // assume that all the following ones have too.
             // This gives us the opportunity to stop here and avoid
             // marking the same nodes again.
             break;
         }
         item->updateValue();
     }
 }
 
 } // namespace blink