Rename nodes/elements traversal function names.

Source/core/page/FocusController.cpp

 /*
  * Copyright (C) 2006, 2007 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Nuanti Ltd.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 527 matching lines @@
             return node;
     }
     return 0;
 }
 
 static Node* nextNodeWithGreaterTabIndex(Node* start, int tabIndex)
 {
     // Search is inclusive of start
     int winningTabIndex = std::numeric_limits<short>::max() + 1;
     Node* winner = 0;
-    for (Node& node : NodeTraversal::from(start)) {
+    for (Node& node : NodeTraversal::startsAt(start)) {
         if (shouldVisit(&node) && node.tabIndex() > tabIndex && node.tabIndex() < winningTabIndex) {
             winner = &node;
             winningTabIndex = node.tabIndex();
         }
     }
 
     return winner;
 }
 
 static Node* previousNodeWithLowerTabIndex(Node* start, int tabIndex)
@@ skipping 10 matching lines @@
     }
     return winner;
 }
 
 Node* FocusController::nextFocusableNode(FocusNavigationScope scope, Node* start)
 {
     if (start) {
         int tabIndex = adjustedTabIndex(start);
         // If a node is excluded from the normal tabbing cycle, the next focusable node is determined by tree order
         if (tabIndex < 0) {
-            for (Node& node : NodeTraversal::fromNext(*start)) {
+            for (Node& node : NodeTraversal::startsAfter(*start)) {
                 if (shouldVisit(&node) && adjustedTabIndex(&node) >= 0)
                     return &node;
             }
         } else {
             // First try to find a node with the same tabindex as start that comes after start in the scope.
             if (Node* winner = findNodeWithExactTabIndex(NodeTraversal::next(*start), tabIndex, FocusTypeForward))
                 return winner;
         }
         if (!tabIndex)
             // We've reached the last node in the document with a tabindex of 0. This is the end of the tabbing order.
@@ skipping 336 matching lines @@
     return consumed;
 }
 
 void FocusController::trace(Visitor* visitor)
 {
     visitor->trace(m_page);
     visitor->trace(m_focusedFrame);
 }
 
 } // namespace blink