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