Index: Source/core/page/FocusController.cpp |
diff --git a/Source/core/page/FocusController.cpp b/Source/core/page/FocusController.cpp |
index 2453e2841cf533d9d69c07856e3e59f6b9e69189..099804d6a6874c75eb84676edaffb218c928aa52 100644 |
--- a/Source/core/page/FocusController.cpp |
+++ b/Source/core/page/FocusController.cpp |
@@ -545,7 +545,7 @@ 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(); |
@@ -576,7 +576,7 @@ Node* FocusController::nextFocusableNode(FocusNavigationScope scope, Node* 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; |
} |