removedPrev = true; }   if (node.hasPreviousNode() && !removedPrev) { MatrixTreeNode prevNode = (MatrixTreeNode) node.getChildAt(0); MatrixTreeModelBus.removeNodeFromParent(prevNode);    MatrixTreeModelBus.insertNodeInto((MatrixTreeNode)new ExpandingPreviousNode(getNumKids(), node.getChildCount(), getTotalKidsLoaded()), node, 0); } if (node.hasNextNode() && !removedNext) { MatrixTreeNode nextNode = (MatrixTreeNode) node.getChildAt(node.getChildCount()-1); MatrixTreeModelBus.removeNodeFromParent(nextNode); MatrixTreeModelBus.insertNodeInto((MatrixTreeNode)new ExpandingNextNode(getNumKids(), node.getChildCount(), getTotalKidsLoaded()), node, node.getChildCount());
	private void nodesChanged() {		Iterator nodeIterator = getTreeNodes();		while (nodeIterator.hasNext()) {			MatrixTreeNode node = (MatrixTreeNode) nodeIterator.next();			if (!node.hasNextNode() && node.getChildCount() >= AssetManager.getLimit()) {				MatrixTreeModelBus.insertNodeInto((MatrixTreeNode)new ExpandingNextNode(getNumKids(), node.getChildCount(),					getTotalKidsLoaded()), node, node.getChildCount());			} else if (node.hasNextNode() && (getNumKids() <= AssetManager.getLimit())) {				MatrixTreeNode nextNode = (MatrixTreeNode) node.getChildAt(node.getChildCount()-1);				MatrixTreeModelBus.removeNodeFromParent(nextNode);			}			if (node.hasPreviousNode() && (getNumKids() == 0)) {				MatrixTreeNode prevNode = (MatrixTreeNode) node.getChildAt(0);				MatrixTreeModelBus.removeNodeFromParent(prevNode);			}			MatrixTreeModelBus.nodeChanged(node);		}	}