dtm/ref/DTMDefaultBaseIterators.java

262     protected int _currentNode;
271       _markedNode = _currentNode;
281       _currentNode = _markedNode;
312         _currentNode = (node == DTM.NULL) ? DTM.NULL
329       if (_currentNode != NULL) {
330         int node = _currentNode;
331         _currentNode = _nextsib(node);
366         _currentNode = getParent(node);
400       int result = _currentNode;
403         if (_nodeType != getExpandedTypeID(_currentNode)) {
407         if (_nodeType != getNodeType(_currentNode)) {
412       _currentNode = END;
457         _currentNode = (node == DTM.NULL)
475       int node = _currentNode;
498         _currentNode = DTM.NULL;
501         _currentNode = _nextsib(node);
548         _currentNode = (node == DTM.NULL) ? DTM.NULL : NOTPROCESSED;
563       if (_currentNode != DTM.NULL) {
564         for (int node = (NOTPROCESSED == _currentNode)
566                                   : _nextsib(_currentNode);
570             _currentNode = node;
614         _currentNode = getFirstNamespaceNode(node, true);
630       int node = _currentNode;
633         _currentNode = getNextNamespaceNode(_startNode, node, true);
670       for (node = _currentNode;
676           _currentNode = node;
682       return (_currentNode =END);
717         _currentNode = NULL;
732       if(_startNode == _currentNode)
735       _currentNode = _startNode;
769         if(_startNode == _currentNode)
776       _currentNode = node;
838         _currentNode = getFirstNamespaceNode(node, false);
854       int node = _currentNode;
857         _currentNode = getNextNamespaceNode(_startNode, node, false);
885         _currentNode = makeNodeIdentity(node);
900       _currentNode = (_currentNode == DTM.NULL) ? DTM.NULL
901                                                 : _nextsib(_currentNode);
902       return returnNode(makeNodeHandle(_currentNode));
934       if (_currentNode == DTM.NULL) {
938       int node = _currentNode;
959       _currentNode = node;
961       return (_currentNode == DTM.NULL)
963                       : returnNode(makeNodeHandle(_currentNode));
991         _currentNode = getFirstAttributeIdentity(makeNodeIdentity(node));
1007       final int node = _currentNode;
1010         _currentNode = getNextAttributeIdentity(node);
1054         _currentNode = getTypedAttribute(node, _nodeType);
1070       final int node = _currentNode;
1074       _currentNode = NULL;
1121           _currentNode = node;
1129           _currentNode = node;
1134           _currentNode = _parent(node);
1135           if(NULL!=_currentNode)
1136             _currentNode = _firstch(_currentNode);
1138             _currentNode = node;
1155       if (_currentNode == _startNodeID || _currentNode == DTM.NULL)
1161         final int node = _currentNode;
1162         _currentNode = _nextsib(node);
1198       int node = _currentNode;
1225         _currentNode = NULL;
1228         _currentNode = _nextsib(node);
1256     /* _currentNode precedes candidates.  This is the identity, not the handle! */
1336         _currentNode=_stack[index]; // Last parent before root node
1356                 for(++_currentNode;
1358                         ++_currentNode)
1360                         if(_currentNode < _stack[_sp])
1362                                 if(_type(_currentNode) != ATTRIBUTE_NODE &&
1363                                         _type(_currentNode) != NAMESPACE_NODE)
1364                                         return returnNode(makeNodeHandle(_currentNode));
1390         _markedNode = _currentNode;
1396         _currentNode = _markedNode;
1429       int node = _currentNode;
1477       _currentNode = node;
1516         // _currentNode = current;
1517         _currentNode = m_traverser.first(node);
1519         // _currentNode precedes possible following(node) nodes
1534       int node = _currentNode;
1536       _currentNode = m_traverser.next(_startNode, _currentNode);
1573        node = _currentNode;
1575       _currentNode = m_traverser.next(_startNode, _currentNode);
1679         _currentNode = (m_ancestorsPos>=0)
1700       _currentNode = (m_ancestorsPos>=0) ? m_ancestors.elementAt(m_ancestorsPos)
1714       int next = _currentNode;
1718       _currentNode = (pos >= 0) ? m_ancestors.elementAt(m_ancestorsPos)
1730         _currentNode = m_ancestorsPos>=0 ? m_ancestors.elementAt(m_ancestorsPos)
1804         _currentNode = (m_ancestorsPos>=0)
1842         _currentNode = node;
1880       if (_includeSelf && (_currentNode + 1) == _startNode)
1881           return returnNode(makeNodeHandle(++_currentNode)); // | m_dtmIdent);
1883       int node = _currentNode;
1891           _currentNode = NULL;
1897       _currentNode = node;
1955       node = _currentNode;
1963           _currentNode = NULL;
1969       _currentNode = node;
2069       _currentNode = _startNode = node;
2088         _currentNode = _startNode;
2094           _currentNode = _startNode = node;
2113         _currentNode = _startNode;
2139       final int result = _currentNode;
2141       _currentNode = END;
2176       final int result = _currentNode;
2179       _currentNode = END;