Lines Matching refs:node
35 * <p>Each multi-valued heap node (which might be a
37 * generates DTM node handles in document order. The class
39 * the next DTM node handle available form the heap node.</p>
40 * <p>After a DTM node is pulled from the heap node that's at the top of the
41 * heap, the heap node is advanced to the next DTM node handle it makes
43 * DTM node handle pulled is next in document order overall.
62 * Advance to the next node represented by this {@link HeapNode}
64 * @return the next DTM node.
73 * @return the cloned heap node
93 * Remembers the current node for the next call to {@link #gotoMark()}.
100 * Restores the current node remembered by {@link #setMark()}.
109 * @param heapNode the heap node against which to compare
110 * @return <code>true</code> if and only if the current node for this
111 * heap node is before the current node of the argument heap
112 * node in document order.
117 * Sets context with respect to which this heap node is evaluated.
119 * @param node The new context node
123 public abstract HeapNode setStartNode(int node);
126 * Reset the heap node back to its beginning.
141 // Last node returned by this MultiValuedNodeHeapIterator to the caller of
173 protected void addHeapNode(HeapNode node) {
180 _heap[_free++] = node;
211 public DTMAxisIterator setStartNode(int node) {
213 _startNode = node;
216 _heap[i].setStartNode(node);
217 _heap[i].step(); // to get the first node
240 /* Build a heap in document order. put the smallest node on the top.
241 * "smallest node" means the node before other nodes in document order