Lines Matching refs:current
51 // Does a reverse pre-order traversal to find the node that comes before the current one in document order
79 inline Node* traverseNextTemplate(NodeType* current)
81 if (current->firstChild())
82 return current->firstChild();
83 if (current->nextSibling())
84 return current->nextSibling();
85 return nextAncestorSibling(current);
87 inline Node* next(const Node* current) { return traverseNextTemplate(current); }
88 inline Node* next(const ContainerNode* current) { return traverseNextTemplate(current); }
91 inline Node* traverseNextTemplate(NodeType* current, const Node* stayWithin)
93 if (current->firstChild())
94 return current->firstChild();
95 if (current == stayWithin)
97 if (current->nextSibling())
98 return current->nextSibling();
99 return nextAncestorSibling(current, stayWithin);
101 inline Node* next(const Node* current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
102 inline Node* next(const ContainerNode* current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
105 inline Node* traverseNextSkippingChildrenTemplate(NodeType* current)
107 if (current->nextSibling())
108 return current->nextSibling();
109 return nextAncestorSibling(current);
111 inline Node* nextSkippingChildren(const Node* current) { return traverseNextSkippingChildrenTemplate(current); }
112 inline Node* nextSkippingChildren(const ContainerNode* current) { return traverseNextSkippingChildrenTemplate(current); }
115 inline Node* traverseNextSkippingChildrenTemplate(NodeType* current, const Node* stayWithin)
117 if (current == stayWithin)
119 if (current->nextSibling())
120 return current->nextSibling();
121 return nextAncestorSibling(current, stayWithin);
123 inline Node* nextSkippingChildren(const Node* current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
124 inline Node* nextSkippingChildren(const ContainerNode* current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
126 inline Node* next(const Text* current) { return traverseNextSkippingChildrenTemplate(current); }
127 inline Node* next(const Text* current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
129 inline Node* previous(const Node* current, const Node* stayWithin)
131 if (Node* previous = current->previousSibling())
133 if (current->parentNode() == stayWithin)
135 return current->parentNode();