/**
* Set the currently selected Variable.
*
* @param v select this Variable, must be already in the tree.
*/
public void setSelected(VariableIF v) {
if (v == null) return;
// construct chain of variables
List<VariableIF> vchain = new ArrayList<>();
vchain.add(v);
VariableIF vp = v;
while (vp.isMemberOfStructure()) {
vp = vp.getParentStructure();
vchain.add(0, vp); // reverse
}
// construct chain of groups
List<Group> gchain = new ArrayList<>();
Group gp = vp.getParentGroup();
gchain.add(gp);
while (gp.getParentGroup() != null) {
gp = gp.getParentGroup();
gchain.add(0, gp); // reverse
}
List<Object> pathList = new ArrayList<>();
// start at root, work down through the nested groups, if any
GroupNode gnode = (GroupNode) model.getRoot();
pathList.add(gnode);
Group parentGroup = gchain.get(0); // always the root group
for (int i = 1; i < gchain.size(); i++) {
parentGroup = gchain.get(i);
gnode = gnode.findNestedGroup(parentGroup);
assert gnode != null;
pathList.add(gnode);
}
vp = vchain.get(0);
VariableNode vnode = gnode.findNestedVariable(vp);
if (vnode == null) return; // not found
pathList.add(vnode);
// now work down through the structure members, if any
for (int i = 1; i < vchain.size(); i++) {
vp = vchain.get(i);
vnode = vnode.findNestedVariable(vp);
if (vnode == null) return; // not found
pathList.add(vnode);
}
// convert to TreePath, and select it
Object[] paths = pathList.toArray();
TreePath treePath = new TreePath(paths);
tree.setSelectionPath(treePath);
tree.scrollPathToVisible(treePath);
}
public void nodeAdded(String fqn) {
MyNode n, p;
n = root.add(fqn);
if (n != null) {
p = (MyNode) n.getParent();
tree_model.reload(p);
jtree.scrollPathToVisible(new TreePath(n.getPath()));
}
}
@Override
public void selectUsages(@NotNull Usage[] usages) {
List<TreePath> paths = new LinkedList<TreePath>();
for (Usage usage : usages) {
final UsageNode node = myUsageNodes.get(usage);
if (node != NULL_NODE && node != null) {
paths.add(new TreePath(node.getPath()));
}
}
myTree.setSelectionPaths(paths.toArray(new TreePath[paths.size()]));
if (!paths.isEmpty()) myTree.scrollPathToVisible(paths.get(0));
}
/** Add child to a specified node, or the root node if no node specified. */
public DefaultMutableTreeNode addNode(
DefaultMutableTreeNode parent, Object termId, Object termName, boolean shouldBeVisible) {
DefaultMutableTreeNode childNode =
new DefaultMutableTreeNode(new TermNode(termName.toString(), termId.toString()));
if (parent == null) {
parent = rootNode;
}
treeModel.insertNodeInto(childNode, parent, parent.getChildCount());
// Make sure the user can see the lovely new node.
if (shouldBeVisible) {
tree.scrollPathToVisible(new TreePath(childNode.getPath()));
}
return childNode;
}
/**
* Processes an idChanged event. Search is different from all other navigators in that you while
* search tree is synchronized the highlighting doesn't occur unless selected from the search
* navigator.
*/
public void idChanged(HelpModelEvent e) {
ID id = e.getID();
URL url = e.getURL();
HelpModel helpModel = searchnav.getModel();
debug("idChanged(" + e + ")");
if (e.getSource() != helpModel) {
debug("Internal inconsistency!");
debug(" " + e.getSource() + " != " + helpModel);
throw new Error("Internal error");
}
TreePath s = tree.getSelectionPath();
if (s != null) {
Object o = s.getLastPathComponent();
// should require only a TreeNode
if (o instanceof DefaultMutableTreeNode) {
DefaultMutableTreeNode tn = (DefaultMutableTreeNode) o;
SearchTOCItem item = (SearchTOCItem) tn.getUserObject();
if (item != null) {
ID nId = item.getID();
if (nId != null && nId.equals(id)) {
return;
}
}
}
}
DefaultMutableTreeNode node = findIDorURL(topNode, id, url);
if (node == null) {
// node doesn't exist. Need to clear the selection.
debug("node didn't exist");
tree.clearSelection();
return;
}
TreePath path = new TreePath(node.getPath());
tree.expandPath(path);
tree.setSelectionPath(path);
tree.scrollPathToVisible(path);
}