[英]JPersistentTree (JTree, boundtree) expand path to given node
我正在尝试使用此程序包对商店的类别实施CRUD操作。 我不知道在哪里可以找到有使用此软件包的经验的人,所以我决定在这里询问。
我想添加一个快速搜索选项,用户可以在其中搜索类别而无需浏览树,并且在JTree上展开了所选的路径和节点。
到目前为止,我已经完成了以下工作:
ArrayList<FpsInventoryCategory> path;
// recursive method to find the path to the root of a selected node
private void findTreePath(FpsInventoryCategory currentNode) throws StorageException{
Object parentId = currentNode.getParentId();
FpsInventoryCategory parentNode = (FpsInventoryCategory) store.getItem(parentId);
if (parentNode.isRoot()){
path.add(0, parentNode);
} else {
path.add(0, parentNode);
findTreePath(parentNode);
}
}
FpsInventoryCategory实现HierarchialItem。 path是FpsInventoryCategory的ArrayList。 这很好用,我能够得到所需的路径。
我遇到的问题是了解软件包,以便确定如何扩展节点和/或TreePath。 我最初尝试通过TreePath进行尝试,但是后来意识到,由于JPersistentTree的整个思想是动态加载数据,因此JTree将不会有超过子项第一行的数据。 这是正确的假设吗?
如果是这样,那么我假设我必须沿路径加载子级,这是我尝试的操作,如下所示:
private void viewTreeNodeAndPath(Long id2) throws StorageException {
// TODO Auto-generated method stub
gui.getTreeInventoryCategory().getModel().getRoot();
path = new ArrayList<FpsInventoryCategory>();
store = gui.getStore();
FpsInventoryCategory startNode = (FpsInventoryCategory) store.getItem(id);
path.add(startNode);
findTreePath(startNode);
DynamicTreeNode currentTreeNode;
Iterator it = path.iterator();
int i = 0;
FpsInventoryCategory temp;
while(it.hasNext()){
temp = (FpsInventoryCategory) it.next();
System.out.println("temp cat:" + temp.getName());
currentTreeNode = new DynamicTreeNode(store, temp);
currentTreeNode.loadChildren();
gui.getTreeInventoryCategory().expandRow(i);
i++;
}
// selectedTreePath = new TreePath(dynamicNodePath);
// System.out.println(selectedTreePath);
// gui.getTreeInventoryCategory().setSelectionPath(selectedTreePath);
//
// gui.getTreeInventoryCategory().expandPath(selectedTreePath);
}
^注释了按路径进行的选择,因为它没有产生结果。 这同样是行不通的。
关于如何使树扩展的任何想法? 甚至在哪里我可以得到更多关于这件事的信息?
请随时给我建议或让我知道在哪里可以找到解决方案。
最好的祝福。
好吧...让它工作。 这是代码。 在编码之间正在做其他一些事情,因此可能遗漏一两件事。
我将首先提到关键字段(全局变量),然后指出相关方法。 这是来自控制器的MVC模式。
private FpsInventoryCategoryTreeAdapter store;
ArrayList<FpsInventoryCategory> path;
TreePath selectedTreePath;
private Long id;
// expand path and select node in JPersistentTree of category being searched
private void viewTreeNodeAndPath() throws StorageException {
// TODO Auto-generated method stub
path = new ArrayList<FpsInventoryCategory>();
store = gui.getStore(); // get store from gui (view contains HierarchicalDataStore implementation for JPersistentTree)
FpsInventoryCategory startNode = (FpsInventoryCategory) store.getItem(id); // id is the selected node as per quick search
path.add(startNode); // add selected node to path
// find path from root to selected node
findTreePath(startNode);
int pathLength = path.size();
TreeModel model = gui.getTreeInventoryCategory().getModel();
DynamicTreeNode rootNode = (DynamicTreeNode) model.getRoot();
// traverse through JPersistentTree from root to searched node, returning path to selectedTreePath
searchThroughTree(model, rootNode, pathLength, 1);
// expand selectedTreePath (from root to searched node)
gui.getTreeInventoryCategory().setSelectionPath(selectedTreePath);
gui.getTreeInventoryCategory().scrollPathToVisible(selectedTreePath);
}
// recursive method to find the path to the root of a selected node
private void findTreePath(FpsInventoryCategory currentNode) throws StorageException{
Object parentId = currentNode.getParentId();
FpsInventoryCategory parentNode = (FpsInventoryCategory) store.getItem(parentId);
if (parentNode.isRoot()){
path.add(0, parentNode);
} else {
path.add(0, parentNode);
findTreePath(parentNode);
}
}
// recusrive method to get TreePath of searched node
// pathSize: number of nodes from root to searched path
// pathPosition: index of current node in path
private void searchThroughTree(TreeModel model, DynamicTreeNode rootNode, int pathSize, int pathPosition){
int childCount = model.getChildCount(rootNode);
for (int i = 0; i < childCount; i++){
DynamicTreeNode childNode = (DynamicTreeNode) model.getChild(rootNode, i);
if (model.isLeaf(childNode)){
if (path.get(pathPosition).getId() == childNode.getUserObject().getId()){
selectedTreePath = getPath(childNode);
break;
}
} else {
if (path.get(pathPosition).getId() == childNode.getUserObject().getId()){
if (pathPosition + 1 == pathSize){
selectedTreePath = getPath(childNode);
break;
} else {
pathPosition = pathPosition + 1;
searchThroughTree(model, childNode, pathSize, pathPosition);
}
}
}
}
}
// find path from root to node
public TreePath getPath(DynamicTreeNode node){
List list = new ArrayList();
// Add all nodes to list
while (node != null){
list.add(node);
node = (DynamicTreeNode) node.getParent();
}
Collections.reverse(list);
// Convert array of DynamicTreeNodes to TreePath
return new TreePath(list.toArray());
}
在我的机器上工作正常。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.