Lines Matching defs:current
35 Node* previousIncludingPseudo(const Node* current, const Node* stayWithin)
38 if (current == stayWithin)
40 if ((previous = current->pseudoAwarePreviousSibling())) {
45 return current->parentNode();
48 Node* nextIncludingPseudo(const Node* current, const Node* stayWithin)
51 if ((next = current->pseudoAwareFirstChild()))
53 if (current == stayWithin)
55 if ((next = current->pseudoAwareNextSibling()))
57 for (current = current->parentNode(); current; current = current->parentNode()) {
58 if (current == stayWithin)
60 if ((next = current->pseudoAwareNextSibling()))
66 Node* nextIncludingPseudoSkippingChildren(const Node* current, const Node* stayWithin)
69 if (current == stayWithin)
71 if ((next = current->pseudoAwareNextSibling()))
73 for (current = current->parentNode(); current; current = current->parentNode()) {
74 if (current == stayWithin)
76 if ((next = current->pseudoAwareNextSibling()))
82 Node* nextAncestorSibling(const Node* current)
84 ASSERT(!current->nextSibling());
85 for (current = current->parentNode(); current; current = current->parentNode()) {
86 if (current->nextSibling())
87 return current->nextSibling();
92 Node* nextAncestorSibling(const Node* current, const Node* stayWithin)
94 ASSERT(!current->nextSibling());
95 ASSERT(current != stayWithin);
96 for (current = current->parentNode(); current; current = current->parentNode()) {
97 if (current == stayWithin)
99 if (current->nextSibling())
100 return current->nextSibling();
105 Node* previous(const Node* current, const Node* stayWithin)
107 if (current == stayWithin)
109 if (current->previousSibling()) {
110 Node* previous = current->previousSibling();
115 return current->parentNode();
118 Node* previousSkippingChildren(const Node* current, const Node* stayWithin)
120 if (current == stayWithin)
122 if (current->previousSibling())
123 return current->previousSibling();
124 for (current = current->parentNode(); current; current = current->parentNode()) {
125 if (current == stayWithin)
127 if (current->previousSibling())
128 return current->previousSibling();
133 Node* nextPostOrder(const Node* current, const Node* stayWithin)
135 if (current == stayWithin)
137 if (!current->nextSibling())
138 return current->parentNode();
139 Node* next = current->nextSibling();
145 static Node* previousAncestorSiblingPostOrder(const Node* current, const Node* stayWithin)
147 ASSERT(!current->previousSibling());
148 for (current = current->parentNode(); current; current = current->parentNode()) {
149 if (current == stayWithin)
151 if (current->previousSibling())
152 return current->previousSibling();
157 Node* previousPostOrder(const Node* current, const Node* stayWithin)
159 if (current->lastChild())
160 return current->lastChild();
161 if (current == stayWithin)
163 if (current->previousSibling())
164 return current->previousSibling();
165 return previousAncestorSiblingPostOrder(current, stayWithin);
168 Node* previousSkippingChildrenPostOrder(const Node* current, const Node* stayWithin)
170 if (current == stayWithin)
172 if (current->previousSibling())
173 return current->previousSibling();
174 return previousAncestorSiblingPostOrder(current, stayWithin);