TraversalDirectionForward 55 Source/core/dom/shadow/ComposedTreeWalker.cpp return traverseSiblings(direction == TraversalDirectionForward ? node->firstChild() : node->lastChild(), direction); TraversalDirectionForward 60 Source/core/dom/shadow/ComposedTreeWalker.cpp for (const Node* sibling = node; sibling; sibling = (direction == TraversalDirectionForward ? sibling->nextSibling() : sibling->previousSibling())) { TraversalDirectionForward 73 Source/core/dom/shadow/ComposedTreeWalker.cpp if (Node* found = traverseDistributedNodes(direction == TraversalDirectionForward ? insertionPoint->first() : insertionPoint->last(), insertionPoint, direction)) TraversalDirectionForward 81 Source/core/dom/shadow/ComposedTreeWalker.cpp for (const Node* next = node; next; next = (direction == TraversalDirectionForward ? insertionPoint->nextTo(next) : insertionPoint->previousTo(next))) { TraversalDirectionForward 99 Source/core/dom/shadow/ComposedTreeWalker.cpp if (Node* found = traverseDistributedNodes(direction == TraversalDirectionForward ? insertionPoint->nextTo(node) : insertionPoint->previousTo(node), insertionPoint, direction)) TraversalDirectionForward 107 Source/core/dom/shadow/ComposedTreeWalker.cpp if (Node* found = traverseSiblings(direction == TraversalDirectionForward ? node->nextSibling() : node->previousSibling(), direction)) TraversalDirectionForward 134 Source/core/dom/shadow/ComposedTreeWalker.h m_node = traverseSiblingOrBackToInsertionPoint(m_node, TraversalDirectionForward); TraversalDirectionForward 178 Source/core/dom/shadow/ComposedTreeWalker.h m_node = traverseChild(m_node, TraversalDirectionForward); TraversalDirectionForward 192 Source/core/dom/shadow/ComposedTreeWalker.h return traverseSiblingOrBackToInsertionPoint(node, TraversalDirectionForward); TraversalDirectionForward 204 Source/core/dom/shadow/ComposedTreeWalker.h return traverseChild(node, TraversalDirectionForward);