Lines Matching refs:current
40 static Node* next(const Node& current) { return traverseNextTemplate(current); }
41 static Node* next(const ContainerNode& current) { return traverseNextTemplate(current); }
42 static Node* next(const Node& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
43 static Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
52 // Does a reverse pre-order traversal to find the node that comes before the current one in document order
87 inline Node* NodeTraversal::traverseNextTemplate(NodeType& current)
89 if (current.hasChildren())
90 return current.firstChild();
91 if (current.nextSibling())
92 return current.nextSibling();
93 return nextAncestorSibling(current);
97 inline Node* NodeTraversal::traverseNextTemplate(NodeType& current, const Node* stayWithin)
99 if (current.hasChildren())
100 return current.firstChild();
101 if (current == stayWithin)
103 if (current.nextSibling())
104 return current.nextSibling();
105 return nextAncestorSibling(current, stayWithin);
108 inline Node* NodeTraversal::nextSkippingChildren(const Node& current)
110 if (current.nextSibling())
111 return current.nextSibling();
112 return nextAncestorSibling(current);
115 inline Node* NodeTraversal::nextSkippingChildren(const Node& current, const Node* stayWithin)
117 if (current == stayWithin)
119 if (current.nextSibling())
120 return current.nextSibling();
121 return nextAncestorSibling(current, stayWithin);
124 inline Node& NodeTraversal::highestAncestorOrSelf(Node& current)
126 Node* highest = ¤t;