if (document.next[nextNode] <= nodeNumber) break;
	public NodeList getChildNodes() {		NodeListImpl nl = new NodeListImpl();		short level = (short)(document.treeLevel[nodeNumber] + 1);		int nextNode = nodeNumber;		while (++nextNode < document.size && document.next[nextNode] > nodeNumber) {			if(document.treeLevel[nextNode] == level) {				Node n = document.getNode(nextNode);				nl.add(n);			}		}		return nl;	}