Lines Matching refs:node
40 : node(n)
47 node.clear();
52 if (!node)
58 node = NodeTraversal::next(*node, root);
59 return node;
64 if (!node)
70 node = NodeTraversal::previous(*node, root);
71 return node;
96 // of the rejected node. Hence, FILTER_REJECT is the same as FILTER_SKIP.
97 RefPtrWillBeRawPtr<Node> provisionalResult = m_candidateNode.node;
120 // of the rejected node. Hence, FILTER_REJECT is the same as FILTER_SKIP.
121 RefPtrWillBeRawPtr<Node> provisionalResult = m_candidateNode.node;
151 // Iterator is not affected if the removed node is the reference node and is the root.
152 // or if removed node is not the reference node, or the ancestor of the reference node.
155 bool willRemoveReferenceNode = removedNode == referenceNode.node.get();
156 bool willRemoveReferenceNodeAncestor = referenceNode.node && referenceNode.node->isDescendantOf(&removedNode);
161 Node* node = NodeTraversal::next(removedNode, root());
162 if (node) {
163 // Move out from under the node being removed if the new reference
164 // node is a descendant of the node being removed.
165 while (node && node->isDescendantOf(&removedNode))
166 node = NodeTraversal::next(*node, root());
167 if (node)
168 referenceNode.node = node;
170 node = NodeTraversal::previous(removedNode, root());
171 if (node) {
172 // Move out from under the node being removed if the reference node is
173 // a descendant of the node being removed.
175 while (node && node->isDescendantOf(&removedNode))
176 node = NodeTraversal::previous(*node, root());
178 if (node) {
179 // Removing last node.
180 // Need to move the pointer after the node preceding the
181 // new reference node.
182 referenceNode.node = node;
188 Node* node = NodeTraversal::previous(removedNode, root());
189 if (node) {
190 // Move out from under the node being removed if the reference node is
191 // a descendant of the node being removed.
193 while (node && node->isDescendantOf(&removedNode))
194 node = NodeTraversal::previous(*node, root());
196 if (node)
197 referenceNode.node = node;
200 node = NodeTraversal::next(removedNode, root());
201 // Move out from under the node being removed if the reference node is
202 // a descendant of the node being removed.
204 while (node && node->isDescendantOf(&removedNode))
205 node = NodeTraversal::previous(*node, root());
207 if (node)
208 referenceNode.node = node;