/** * Get the next node via getFirstAttribute && getNextAttribute. */ protected int getNextNode() { return m_lastFetched = m_iterator.next(); }
public int next() { if (_source == null) { return(END); } return _source.next(); }
/** * Get the next node via getFirstAttribute && getNextAttribute. */ protected int getNextNode() { return m_lastFetched = m_iterator.next(); }
public int step() { _node = iterator.next(); return _node; }
public int next() { return _source.next(); }
/** * Get the next node in document order on the axes. * * @return the next node in document order on the axes, or null. */ protected int getNextNode() { if (m_foundLast) return DTM.NULL; int next = m_iterator.next(); if (m_isFresh) m_isFresh = false; if (DTM.NULL == next) this.m_foundLast = true; return next; }
/** * Copy a node-set to an output handler */ public void copy(DTMAxisIterator nodes, SerializationHandler handler) throws TransletException { int node; while ((node = nodes.next()) != DTM.NULL) { copy(node, handler); } }
/** * XSLT Standard function namespace-uri(node-set). */ public static String namespace_uriF(DTMAxisIterator iter, DOM dom) { return namespace_uriF(iter.next(), dom); }
public void copy(DTMAxisIterator nodes, SerializationHandler handler) throws TransletException { int node; while ((node = nodes.next()) != DTM.NULL) { _adapters[node >>> DTMManager.IDENT_DTM_NODE_BITS].copy(node, handler); } }
/** * Utility function: used with nth position filters to convert a sequence * of nodes to just one single node (the one at position n). */ public static DTMAxisIterator getSingleNode(DTMAxisIterator iterator) { int node = iterator.next(); return(new SingletonIterator(node)); }
/** * Create an org.w3c.dom.Node from a node in an iterator * The iterator most be started before this method is called */ public Node makeNode(DTMAxisIterator iter) { return makeNode(iter.next()); }
public DTMAxisIterator setStartNode(int node) { if (_isRestartable) { // iterator is not a clone _source.setStartNode(node); // Calculate the position of the node in the set _position = 1; while ((node = _source.next()) != END && node != _match) { _position++; } } return this; }
public int next() { return returnNode(_source.next()); }
public void copy(DTMAxisIterator nodes, SerializationHandler handler) throws TransletException { int node; while ((node = nodes.next()) != DTM.NULL) { copy(node, handler); } }
public int next() { int node; while ((node = _source.next()) != END) { if (_filter.acceptNode(node, DTMFilter.SHOW_ALL) == DTMIterator.FILTER_ACCEPT) { return returnNode(node); } } return END; }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
public DTMAxisIterator reset() { _source.reset(); // Special case for //* path - see ParentLocationPath _iterator.setStartNode(_includeSelf ? _startNode : _source.next()); return resetPosition(); }
public DTMAxisIterator setStartNode(int node) { if (_isRestartable) { // Set start node for left-hand iterator... _source.setStartNode(_startNode = node); // ... and get start node for right-hand iterator from left-hand, // with special case for //* path - see ParentLocationPath _iterator.setStartNode(_includeSelf ? _startNode : _source.next()); return resetPosition(); } return this; }
public int next() { int node; while ((node = _source.next()) != END) { String val = getStringValueX(node); if (_value.equals(val) == _op) { if (_returnType == RETURN_CURRENT) return returnNode(node); else return returnNode(getParent(node)); } } return END; }
public DTMAxisIterator setStartNode(int node) { if (_isRestartable) { _source.setStartNode(_startNode = node); _nodes.clear(); while ((node = _source.next()) != END) { _nodes.add(node); } _currentIndex = 0; resetPosition(); } return this; }