return(_last);
return _last;
	public int getLast() {	    if (_last == -1) {		_last = 1;		int node = _offsetOrChild[_startNode];		while ((node = _nextSibling[node]) != END) _last++;	    }	    return(_last);	}