if (hasChildren(node)) _currentChild = _offsetOrChild[node]; else _currentChild = END;
_currentChild = hasChildren(node) ? _offsetOrChild[node] : END;
	public int next() {	    int node = _currentChild;	    if (_includeSelf) {		if (node == -1) {		    node = _startNode;		    if (hasChildren(node))			_currentChild = _offsetOrChild[node];		    else			_currentChild = END;		    // IMPORTANT: The start node (parent of all children) is		    // returned, but the node position counter (_position)		    // should not be increased, so returnNode() is not called		    return node;		}	    }	    _currentChild = _nextSibling[node];	    return returnNode(node);	}