if (gid < firstChildId + ownerDocument.getTreeLevelOrder(level))
if (gid < firstChildId + ownerDocument.getTreeLevelOrder(level) - 1)
	public Node getNextSibling() {		int level = ownerDocument.getTreeLevel(gid);		if (level == 0)			return ownerDocument.getFollowingSibling(this);		long pid =			(gid - ownerDocument.getLevelStartPoint(level))				/ ownerDocument.getTreeLevelOrder(level)				+ ownerDocument.getLevelStartPoint(level - 1);		long firstChildId =			(pid - ownerDocument.getLevelStartPoint(level - 1))				* ownerDocument.getTreeLevelOrder(level)				+ ownerDocument.getLevelStartPoint(level);		if (gid < firstChildId + ownerDocument.getTreeLevelOrder(level))			return ownerDocument.getNode(gid + 1);		return null;	}