nodeName[size] = qname;
nodeName[size] = (qname != null ? namePool.add(qname) : -1);
	public int addNode(short kind, short level, QName qname) {		if (size == nodeKind.length)			grow();		nodeKind[size] = kind;		treeLevel[size] = level;		nodeName[size] = qname;		alpha[size] = -1; // undefined		next[size] = -1;		return size++;	}