/** * @param parm1 * */ public short getNodeType( int parm1 ) { if (DEBUG) { DEBUG=false; System.out.print("getNodeType(" + parm1 + ") "); int exID = getExpandedTypeID(parm1); String name = getLocalNameFromExpandedNameID(exID); System.out.println( ".. Node name [" + name + "]" + "[" + getNodeType( parm1) + "]"); DEBUG=true; } return super.getNodeType( parm1); }
/** * Get the next node in the iteration. In this case, we return * only the immediate parent, _if_ it matches the requested nodeType. * * @return The next node handle in the iteration, or END. */ public int next() { int result = _currentNode; if (_nodeType >= DTM.NTYPES) { if (_nodeType != getExpandedTypeID(_currentNode)) { result = END; } } else if (_nodeType != NULL) { if (_nodeType != getNodeType(_currentNode)) { result = END; } } _currentNode = END; return returnNode(result); } } // end of ParentIterator
/** * Get the next node in the iteration. In this case, we return * only the immediate parent, _if_ it matches the requested nodeType. * * @return The next node handle in the iteration, or END. */ public int next() { int result = _currentNode; if (_nodeType >= DTM.NTYPES) { if (_nodeType != getExpandedTypeID(_currentNode)) { result = END; } } else if (_nodeType != NULL) { if (_nodeType != getNodeType(_currentNode)) { result = END; } } _currentNode = END; return returnNode(result); } } // end of ParentIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { //final int result = super.next(); final int result = _currentNode; int nodeType = _nodeType; _currentNode = END; if (nodeType >= DTM.NTYPES) { if (getExpandedTypeID(result) == nodeType) { return returnNode(result); } } else { if (getNodeType(result) == nodeType) { return returnNode(result); } } return NULL; } } // end of TypedSingletonIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { //final int result = super.next(); final int result = _currentNode; int nodeType = _nodeType; _currentNode = END; if (nodeType >= DTM.NTYPES) { if (getExpandedTypeID(result) == nodeType) { return returnNode(result); } } else { if (getNodeType(result) == nodeType) { return returnNode(result); } } return NULL; } } // end of TypedSingletonIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; for (node = _currentNode; node != END; node = getNextNamespaceNode(_startNode, node, true)) { if (getExpandedTypeID(node) == _nodeType || getNodeType(node) == _nodeType || getNamespaceType(node) == _nodeType) { _currentNode = node; return returnNode(node); } } return (_currentNode =END); } } // end of TypedNamespaceIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; for (node = _currentNode; node != END; node = getNextNamespaceNode(_startNode, node, true)) { if (getExpandedTypeID(node) == _nodeType || getNodeType(node) == _nodeType || getNamespaceType(node) == _nodeType) { _currentNode = node; return returnNode(node); } } return (_currentNode =END); } } // end of TypedNamespaceIterator
/** * Get the next node in the iteration. In this case, we return * only the immediate parent, _if_ it matches the requested nodeType. * * @return The next node handle in the iteration, or END. */ public int next() { int result = _currentNode; if (_nodeType >= DTM.NTYPES) { if (_nodeType != getExpandedTypeID(_currentNode)) { result = END; } } else if (_nodeType != NULL) { if (_nodeType != getNodeType(_currentNode)) { result = END; } } _currentNode = END; return returnNode(result); } } // end of ParentIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; do{ node = _currentNode; _currentNode = m_traverser.next(_startNode, _currentNode); } while (node != DTM.NULL && (getExpandedTypeID(node) != _nodeType && getNodeType(node) != _nodeType)); return (node == DTM.NULL ? DTM.NULL :returnNode(node)); } } // end of TypedFollowingIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; for (node = _currentNode; node != END; node = getNextNamespaceNode(_startNode, node, true)) { if (getExpandedTypeID(node) == _nodeType || getNodeType(node) == _nodeType || getNamespaceType(node) == _nodeType) { _currentNode = node; return returnNode(node); } } return (_currentNode =END); } } // end of TypedNamespaceIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; for (node = _currentNode; node != END; node = getNextNamespaceNode(_startNode, node, true)) { if (getExpandedTypeID(node) == _nodeType || getNodeType(node) == _nodeType || getNamespaceType(node) == _nodeType) { _currentNode = node; return returnNode(node); } } return (_currentNode =END); } } // end of TypedNamespaceIterator
/** * Get the next node in the iteration. * * @return The next node handle in the iteration, or END. */ public int next() { int node; for (node = _currentNode; node != END; node = getNextNamespaceNode(_startNode, node, true)) { if (getExpandedTypeID(node) == _nodeType || getNodeType(node) == _nodeType || getNamespaceType(node) == _nodeType) { _currentNode = node; return returnNode(node); } } return (_currentNode =END); } } // end of TypedNamespaceIterator