Lines Matching refs:node
101 public void setCurrentNode(Node node) {
102 if (node == null) {
107 fCurrentNode = node;
110 /** Return the parent Node from the current node,
118 Node node = getParentNode(fCurrentNode);
119 if (node !=null) {
120 fCurrentNode = node;
122 return node;
126 /** Return the first child Node from the current node,
134 Node node = getFirstChild(fCurrentNode);
135 if (node !=null) {
136 fCurrentNode = node;
138 return node;
140 /** Return the last child Node from the current node,
148 Node node = getLastChild(fCurrentNode);
149 if (node !=null) {
150 fCurrentNode = node;
152 return node;
155 /** Return the previous sibling Node from the current node,
163 Node node = getPreviousSibling(fCurrentNode);
164 if (node !=null) {
165 fCurrentNode = node;
167 return node;
170 /** Return the next sibling Node from the current node,
177 Node node = getNextSibling(fCurrentNode);
178 if (node !=null) {
179 fCurrentNode = node;
181 return node;
184 /** Return the previous Node from the current node,
231 /** Return the next Node from the current node,
270 * Return the parent Node, from the input node
272 * The current node is not consulted or set.
274 Node getParentNode(Node node) {
276 if (node == null || node == fRoot) return null;
278 Node newNode = node.getParentNode();
295 * Return the nextSibling Node, from the input node
297 * The current node is not consulted or set.
299 Node getNextSibling(Node node) {
300 return getNextSibling(node, fRoot);
304 * Return the nextSibling Node, from the input node
307 * The current node is not consulted or set.
309 Node getNextSibling(Node node, Node root) {
311 if (node == null || node == root) return null;
313 Node newNode = node.getNextSibling();
316 newNode = node.getParentNode();
347 } // getNextSibling(Node node) {
350 * Return the previous sibling Node, from the input node
352 * The current node is not consulted or set.
354 Node getPreviousSibling(Node node) {
355 return getPreviousSibling(node, fRoot);
359 * Return the previousSibling Node, from the input node
362 * The current node is not consulted or set.
364 Node getPreviousSibling(Node node, Node root) {
366 if (node == null || node == root) return null;
368 Node newNode = node.getPreviousSibling();
371 newNode = node.getParentNode();
401 } // getPreviousSibling(Node node) {
404 * Return the first child Node, from the input node
406 * The current node is not consulted or set.
408 Node getFirstChild(Node node) {
409 if (node == null) return null;
412 && node.getNodeType() == Node.ENTITY_REFERENCE_NODE)
414 Node newNode = node.getFirstChild();
427 return getNextSibling(newNode, node);
434 return getNextSibling(newNode, node);
441 * Return the last child Node, from the input node
443 * The current node is not consulted or set.
445 Node getLastChild(Node node) {
447 if (node == null) return null;
450 && node.getNodeType() == Node.ENTITY_REFERENCE_NODE)
453 Node newNode = node.getLastChild();
466 return getPreviousSibling(newNode, node);
473 return getPreviousSibling(newNode, node);
480 * The node whatToShow and the filter are combined into one result. */
481 short acceptNode(Node node) {
485 Iterator and TreeWalker apply whatToShow flags before applying Filters. If a node is rejected by the
486 active whatToShow flags, a Filter will not be called to evaluate that node. When a node is rejected by
487 the active whatToShow flags, children of that node will still be considered, and Filters may be called to
492 if ( ( fWhatToShow & (1 << node.getNodeType()-1)) != 0) {
498 if ((fWhatToShow & (1 << node.getNodeType()-1)) != 0 ) {
499 return fNodeFilter.acceptNode(node);