if (_node == _start) { return NULL;
if (_node == NULL) return NULL;  int current = _offsetOrChild[_mom];   int last = NULL; while ((current != _node) && (current != NULL)) { last = current; current = _nextSibling[current];
	public int next() {	    if (_node == _start) {		return NULL;	    }	    else {		final int node = _node;		_node = _nextSibling[node];		return returnNode(node);	    }	}